On certain two-sided analogues of Newton’s method for solving nonlinear eigenvalue problems

Iterative algorithms for finding two-sided approximations to the eigenvalues of nonlinear algebraic eigenvalue problems are examined. These algorithms use an efficient numerical procedure for calculating the first and second derivatives of the determinant of the problem. Computational aspects of this procedure as applied to finding all the eigenvalues from a given complex-plane domain in a nonlinear eigenvalue problem are analyzed. The efficiency of the algorithms is demonstrated using some model problems.     

Variational approach to the solution of linear multiparameter eigenvalue problems

We associate a multiparameter spectral problem in a real Euclidean space with a variational problem of finding a minimum of a certain functional. We establish the equivalence of the spectralproblem and the variational problem. On the basis of the gradient procedure, we propose a numerical algorithm for the determination of its eigenvalues and eigenvectors. The local convergence of the algorithm is proved.     

Determination of the number of an eigenvalue of a singular nonlinear self-adjoint spectral problem for a linear Hamiltonian system of differential equations

We suggest a method for determining the number of an eigenvalue of a self-adjoint spectral problem nonlinear with respect to the spectral parameter, for some class of Hamiltonian systems of ordinary differential equations on the half-line. The standard boundary conditions are posed at zero, and the solution boundedness condition is posed at infinity. We assume that the matrix of the system is monotone with respect to the spectral parameter. The number of an eigenvalue is determined by the properties of the corresponding nontrivially solvable homogeneous boundary value problem. For the considered class of systems, it becomes possible to compute the numbers of eigenvalues lying in a given range of the spectral parameter without finding the eigenvalues themselves.     

Nonlinear spectral problem for a singular system of ordinary differential equations with a nonlocal condition

We consider a nonlinear spectral problem for a system of ordinary differential equations defined on an unbounded half-line and supplemented with a nonlocal condition specified by a Stieltjes integral. We suggest a numerically stable method for finding the number of eigenvalues lying in a given bounded domain of the complex plane and for the computation of these eigenvalues and the corresponding eigenfunctions. Our approach uses a simpler (with uncoupled boundary conditions) auxiliary boundary value problem for the same equation.     

On the number of an eigenvalue of a general nonlinear self-adjoint spectral problem for systems of ordinary differential equations

In the case of a general nonlinear self-adjoint spectral problem for systems of ordinary differential equations with boundary conditions independent of the spectral parameter, we introduce the notion of the number of an eigenvalue. Methods for the computation of the numbers of eigenvalues lying in a given range of the spectral parameter and for finding the eigenvalue with a given number, which were earlier suggested by the author for Hamiltonian systems, are generalized to the considered problem. We introduce the notion of an index of a problem for a general nontrivially solvable linear homogeneous self-adjoint boundary value problem.     

On one approach to finding eigenvalue curves of linear two-parameter spectral problems

We consider an iteration algorithm for calculating eigenvalue curves of the linear algebraic twoparameter spectral problem, which uses an algorithm for calculating all eigenvalues in a given domain of variation in spectral parameters based on an efficient numerical technique for calculating derivatives of the determinant of a matrix. Numerical examples are presented.     

Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian

We consider the spectral and algorithmic aspects of the problem of finding a Hamiltonian cycle in a graph. We show that a sufficient condition for a graph being Hamiltonian is that the nontrivial eigenvalues of the combinatorial Laplacian are sufficiently close to the average degree of the graph. An algorithm is given for the problem of finding a Hamiltonian cycle in graphs with bounded spectral gaps which has complexity of order n ^{cln n} .     

Numerical solution of some two-parameter eigenvalue problems

We consider an iteration algorithm for determining the eigenvalues of an algebraic two-parameter spectral problem with the use of Newton’s method and a new efficient numerical procedure for calculation of the derivative of a determinant. Numerical examples are given.     

An efficient spectral‐Galerkin method based on a dimension reduction scheme for eigenvalue problems of Schrödinger equations

In this paper, we propose an efficient spectral‐Galerkin method based on a dimension reduction scheme for eigenvalue problems of Schrödinger equations. Firstly, we carry out a truncation from a three‐dimensional unbounded domain to a bounded spherical domain. By using spherical coordinate transformation and spherical harmonic expansion, we transform the original problem into a series of one‐dimensional eigenvalue problem that can be solved effectively. Secondly, we introduce a weighted Sobolev space to treat the singularity in the effective potential. Using the property of orthogonal polynomials in weighted Sobolev space, the error estimate for the approximate eigenvalues and corresponding eigenfunctions are proved. Error estimates show that our numerical method can achieve spectral accuracy for approximate eigenvalues and eigenfunctions. Finally, we give some numerical examples to demonstrate the efficiency of our algorithms and the correctness of the theoretical results.     

Eigenvibrations of a bar with elastically attached load

We study the problem on the eigenvibrations of a bar with an elastically attached load. The problem is reduced to finding the eigenvalues and eigenfunctions of an ordinary secondorder differential problem with a spectral parameter nonlinearly occurring in the boundary condition at the load attachment point. We prove the existence of countably many simple positive eigenvalues of the differential problem. The problem is approximated by a grid scheme of the finite element method. We study the convergence and accuracy of the approximate solutions.     

Newton’s method as a tool for finding the eigenvalues of certain two-parameter (multiparameter) spectral problems

An iterative algorithm is examined for finding the eigenvalues of the two-parameter (multiparameter) algebraic eigenvalue problem. This algorithm uses Newton’s method and an efficient numerical procedure for differentiating determinants. Some numerical examples are given.     

Associated functions of a nonlinear spectral problem for a system of ordinary differential equations

We study the notion of associated functions of a nonlinear spectral problem for a linear system of ordinary differential equations supplemented with nonlocal conditions given by a Stieltjes integral. We establish the relationship of this problem with the corresponding problem in a finite-dimensional linear space. We consider a numerical method for finding associated functions and justify its stability.     

An eigenvalue problem arising in a patch formation model

A simple numerical scheme has been developed for the solution of the eigenvalue problem arising in a patch formation model given by Del Grosso et al. [1]. The scheme is based on finding bounds which separate the eigenvalues. The exact eigenvalues are obtained by solving an algebraic equation given by the corresponding regular Frobenius series solution. At the same time eigenfunctions may also be obtained from this series solution.     

A projective method for the construction of solutions of the problem of normal symmetric oscillations of viscous liquid

We propose a variational formulation of the spectral problem of normal symmetric oscillations of viscous liquid. On the basis of this formulation, we construct a projective method for the determination of real eigenvalues of the problem. We present the numerical realization of this method in the case of a spherical cavity.     

带比例关系的实带状矩阵特征值反问题

研究了通过矩阵A的顺序主子矩阵A_((k))=(aij)_(i,j=1)^(n-k+1)的特征值{λ_i(n-k+1)的特征值{λ_i^((k)))}_(i=1)((k)))}_(i=1)^(n-k+1)k=1,2,…,r+1来构造一个带比例关系的实带状矩阵的特征值反问题.对当特征值{λ_i(n-k+1)k=1,2,…,r+1来构造一个带比例关系的实带状矩阵的特征值反问题.对当特征值{λ_i^((k))}_(i=1)((k))}_(i=1)^(n-k+1)中有多重特征值出现时,应当如何来构造这类矩阵进行了讨论,并给出了问题的具体算法及数值例子.     

Computing the generalized eigenvalues of weakly symmetric tensors

Tensor is a hot topic in the past decade and eigenvalue problems of higher order tensors become more and more important in the numerical multilinear algebra. Several methods for finding the Z-eigenvalues and generalized eigenvalues of symmetric tensors have been given. However, the convergence of these methods when the tensor is not symmetric but weakly symmetric is not assured. In this paper, we give two convergent gradient projection methods for computing some generalized eigenvalues of weakly symmetric tensors. The gradient projection method with Armijo step-size rule (AGP) can be viewed as a modification of the GEAP method. The spectral gradient projection method which is born from the combination of the BB method with the gradient projection method is superior to the GEAP, AG and AGP methods. We also make comparisons among the four methods. Some competitive numerical results are reported at the end of this paper.     

Nonlinear spectral problem for a self-adjoint vector differential equation

We consider a spectral problem that is nonlinear in the spectral parameter for a self-adjoint vector differential equation of order 2n. The boundary conditions depend on the spectral parameter and are self-adjoint as well. Under some conditions of monotonicity of the input data with respect to the spectral parameter, we present a method for counting the eigenvalues of the problem in a given interval. If the boundary conditions are independent of the spectral parameter, then we define the notion of number of an eigenvalue and give a method for computing this number as well as the set of numbers of all eigenvalues in a given interval. For an equation considered on an unbounded interval, under some additional assumptions, we present a method for approximating the original singular problem by a problem on a finite interval.     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

A numerical algorithm for solving the generalized eigenvalue problem for completely continuous self-adjoint operators with nonlinear spectral parameter

We construct and justify a numerical algorithm for finding the generalized eigenvalues and eigenfunctions for self-adjoint positive semidefinite linear operators with nonlinear spectral parameter. We give an example of its application to finding the branch points of solutions of a class of nonlinear integral equations of Hammerstein type. Translated fromMatematichni Metodi i Fiziko-mekhanichni Polya, Vol. 40, No. 1, 1997, pp. 146–150.     

The recovery of even polynomial potentials

We consider the problem of reconstructing an even polynomial potential from one set of spectral data of a Sturm-Liouville problem. We show that we can recover an even polynomial of degree 2m from m+1 given Taylor coefficients of the characteristic function whose zeros are the eigenvalues of one spectrum. The idea here is to represent the solution as a power series and identify the unknown coefficients from the characteristic function. We then compute these coefficients by solving a nonlinear algebraic system, and provide numerical examples at the end. Because of its algebraic nature, the method applies also to non self-adjoint problems.