Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

Oscillation, Rotation, and Wandering of Solutions to Linear Differential Systems

For solutions of a linear system on the semi-axis, we introduce a series of Lyapunov exponents that describe the oscillation, rotation, and wandering properties of these solutions. In the case of systems with constant matrices, these exponents are closely related to the imaginary parts of the eigenvalues. We examine the problem on the existence of a similar relationship in the case of piecewise constant of arbitrary systems.

97 MATHEMATICS AND COMPUTING↗

A Cliffed Cape Does Not Trap Water Waves in the Sea of Constant Depth

The water wave problem is considered for a class of semi-infinite domains each having its shore shaped as a cliffed cape. In particular, the free surface of a water domain is supposed to be an infinite sector whose vertex angle is greater than π, whereas the water layer lying under the free surface is of constant depth. Under these assumptions it is shown that there are no trapped mode solutions of the problem for all values of a non-dimensional spectral parameter; in other words, no point eigenvalues are embedded in the continuous spectrum of the problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Determinantal Range of Matrix Products

Let matrices A,C ∈ M{sub n} have eigenvalues α{sub 1}, . . ., α{sub n} and γ{sub 1}, . . . , γ{sub n}, respectively. The set of complex numbers D{sub C}(A) = {det(A−UCU*) : U ∈ M_n, U*U = I_n} is called the C-determinantal range of A. The paper studies various conditions under which the relation D{sub C}(R S) = D{sub C}(S R) holds for some matrices R and S.

97 MATHEMATICS AND COMPUTING↗

On Some Degenerate Elliptic Equations Arising in Geometric Problems

We consider some fully nonlinear degenerate elliptic operators and we investigate the validity of certain properties related to the maximum principle. In particular, we establish the equivalence between the sign propagation property and the strict positivity of a suitably defined generalized principal eigenvalue. Furthermore, we show that even in the degenerate case considered in the present paper, the well-known condition introduced by Keller–Osserman on the zero-order term is necessary and sufficient for the existence of entire weak subsolutions.

97 MATHEMATICS AND COMPUTING↗

Localized Pisot Matrices and Joint Approximations of Algebraic Numbers

A development of the simplex-module algorithm for expansion of algebraic numbers in multidimensional continued fractions is proposed. To this end, localized Pisot matrices are constructed, whose eigenvalues with moduli less than one are contained in an interval of small length. Such Pisot matrices generate continued fractions whose convergents are arbitrarily close to the best approximations.

97 MATHEMATICS AND COMPUTING↗

Asymptotics of the Resonant Tunneling of High-Energy Electrons in Two-Dimensional Quantum Waveguides of Variable Cross-Section

A waveguide occupies a strip in ℝ{sup 2} having two identical narrows of small diameter ε. An electron wave function satisfies the Helmholtz equation with the homogeneous Dirichlet boundary condition. The energy of electrons may be rather high, i.e., any (fixed) number of waves can propagate in the strip far from the narrows. As ε → 0, a neighborhood of a narrow is assumed to transform into a neighborhood of the common vertex of two vertical angles. The part of the waveguide between the narrows as ε = 0 is called the resonator. An asymptotics of the transmission coefficient is obtained in the waveguide as ε → 0. Near a degenerate eigenvalue of the resonator, the leading term of the asymptotics has two sharp peaks. Positions and shapes of the resonant peaks are described.

97 MATHEMATICS AND COMPUTING↗

Analyzing honeycomb photonic crystal waveguides by Dirichlet-to-Neumann maps

As an analog to graphene, honeycomb photonic crystals (PhCs) have attracted a great deal of interest in recent years. The additional degrees of freedom in a honeycomb PhC are useful in designing and optimizing waveguides, can be used to control the symmetry of the system and to realize novel optical devices. In this paper, we present an efficient numerical method for analyzing two-dimensional honeycomb PhC waveguides. Our method is based on a special supercell that covers one period of the honeycomb PhC waveguide and the so-called Dirichlet-to-Neumann map of the supercell. The method gives rise to a linear eigenvalue value problem with relatively small matrices, and it is validated by comparing with previous works. As an application of the method, we calculate edge modes for a few different PhCs. For a honeycomb PhC with dielectric rods in air, we found an edge mode at the zigzag edge, without using special modified rods at the edge. For a honeycomb PhC with air holes, we found a new edge mode when the PhC is bounded by a perfectly electric conductor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Alternative trajectories of electron density to plot the atomic connectivity graph in the region of nondirectional interactions

Model supramolecular associates possessing nondirectional intermolecular interactions were investigated in order to demonstrate the opportunity of plotting of an atomic connectivity graph based on trajectories of Hessian eigenvector of electron density corresponding to the largest eigenvalue. Such trajectories are a reasonable alternative to the gradient bond paths in the case of proximity of the latter to the T-shaped form upon the presence of parallel surface of the zero-flux of electron density in the neighborhood of gradient-based trajectory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Universal Method of Modeling Linear Stationary Physical Fields

The aim of this paper is to develop a method, described earlier, of solving quantum-mechanical problems into a universal numerical method of modeling fields of various physical nature. This method is based on reducing the initial equation of mathematical physics describing a given physical field to a simpler inhomogeneous equation with a known fundamental solution. This equation is then transformed into an inhomogeneous integral equation with a kernel expressed in terms of the known fundamental solution. The obtained integral equation with boundary conditions is solved numerically. To confirm the efficiency of the proposed numerical method, a two-dimensional and a three-dimensional boundary value problem with known solutions have been solved. Another important illustration of the efficiency of the proposed method is the solution of quantum-mechanical problems for one-dimensional and two-dimensional quantum oscillators. It is shown that the considered method allows one to find the energy eigenvalues and the eigenfunctions with acceptable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new relaxed splitting preconditioner for the generalized saddle point problems from the incompressible Navier–Stokes equations

Based on the modified relaxed splitting (MRS) preconditioner proposed by Fan and Zhu (Appl Math Lett 55:18–26, 2016), a new relaxed splitting preconditioner is proposed for the generalized saddle point problems arising from the incompressible Navier–Stokes equations. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are analyzed. Numerical results show that the proposed preconditioner is superior to the MRS preconditioner when they are used as preconditioners to accelerate the convergence rate of the Krylov subspace methods, such as GMRES.

97 MATHEMATICS AND COMPUTING↗

On semi-convergence and inexact iteration of the GSS iteration method for nonsymmetric singular saddle point problems

In this paper, the generalized shift-splitting (GSS) iteration method is used to solve nonsymmetric singular saddle point systems with the positive real (1, 1)-block sub-matrix. By a careful analysis of the spectral properties of the corresponding iteration matrix, we investigate the semi-convergence property of the GSS iteration method, give the sharper bounds of the eigenvalues for the GSS iteration method and propose the inexact GSS iteration method, also. Numerical experiments are given to show the correctness of the theoretical analysis and the feasibility of the GSS preconditioner with appropriate parameters.

97 MATHEMATICS AND COMPUTING↗

A low-order block preconditioner for saddle point linear systems

A preconditioner is proposed for the large and sparse linear saddle point problems, which is based on a low-order three-by-three block saddle point form. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial for the preconditioned matrix are discussed. Numerical results show that the optimal convergence behavior can be achieved when the new preconditioner is used to accelerate the convergence rate of Krylov subspace methods such as GMRES.

97 MATHEMATICS AND COMPUTING↗

On nonlinear inexact Uzawa algorithms for stabilized saddle point problems

In this paper, the nonlinear inexact Uzawa (NIU) methods for saddle point problems are studied. A further improved convergence result of the NIU algorithm for stabilized saddle point problems is presented, which results in much smaller convergence factor. This result can also be viewed as a generalization of some previous work for classical saddle point problems. Based on this result, we generalize some adaptive versions of the NIU algorithm with variable iteration parameters for classical saddle point problems to solve stabilized saddle point problems. Convergence analyses of these algorithms are presented. It shows that they converge under similar conditions as those in classical cases, which are more practical and without estimates on the extreme eigenvalues of the involved preconditioned systems. Numerical experiments are given to demonstrate the effectiveness of these algorithms over some original NIU algorithms.

97 MATHEMATICS AND COMPUTING↗

The parameterized preconditioner for the generalized saddle point problems from the incompressible Navier–Stokes equations

A parameterized preconditioner is proposed for the generalized saddle point problems arising from the incompressible Navier–Stokes equations. The eigenvalues and eigenvectors of the preconditioned matrix are analyzed. Numerical results show that the proposed preconditioner is efficient to accelerate the convergence rate of Krylov subspace methods, such as GMRES method.

97 MATHEMATICS AND COMPUTING↗

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Diagonal and circulant or skew-circulant splitting preconditioners for spatial fractional diffusion equations

We propose three new preconditioners: diagonal and optimal-circulant splitting preconditioner, diagonal and skew-circulant splitting preconditioner, and diagonal and optimal-skew-circulant splitting preconditioner for solving the diagonal-plus-Toeplitz linear system discretized from the spatial fractional diffusion equations. Theoretical analysis shows that these three preconditioners can make the eigenvalues of the preconditioned matrices be clustered around 1, especially when the grids of the discretizations are refined. These results coincide with the one about the diagonal and circulant splitting preconditioner constructed recently by Bai et al. (Numer Linear Algebra Appl 24:e2093, 2017). Numerical experiments exhibit that the proposed preconditioners can significantly improve the convergence of the Krylov subspace iteration methods like GMRES and BiCGSTAB, and they outperform the diagonal and circulant splitting preconditioner as well.

97 MATHEMATICS AND COMPUTING↗

Franck-Condon factors for molecule-ion reactions of H{sub 2} and its isotopomers

An existing, systematic, fundamental database of Franck-Condon factors and transition probabilities for all isotopomers of the hydrogen molecule (H{sub 2}, D{sub 2}, T{sub 2}, HD, HT, and DT) has been extended for reactions which connect the molecule with its ion H{sub 2}{sup +}(v) (or the corresponding ion of the specific isotopomer). The most recent Born-Oppenheimer potential curves were used to calculate the vibrational eigenvalues and eigenfunctions, from which the Franck-Condon factors were obtained by convolution. The accuracy of the results has been assessed and a comparison with results available in the literature was performed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗