AbstractIn this paper, a fully parallel method for finding some or all finite eigenvalues of a real symmetric matrix pencil (A, B) is presented, where A is a symmetric tridiagonal matrix and B is a diagonal matrix with b1 > 0 and bi ≥ 0, i = 2,3,…,n. The method is based on the homotopy continuation with rank 2 perturbation. It is shown that there are exactly m disjoint, smooth homotopy paths connecting the trivial eigenvalues to the desired eigenvalues, where m is the number of finite eigenvalues of (A, B). It is also shown that the homotopy curves are monotonic and easy to follow
A method for determining all eigenvalues of large real symmetric tridiagonal matrices on multiproces...
This paper proposes a numerical algorithm based on spectral Schur complements to compute a few eigen...
AbstractWe introduce the quadratic two-parameter eigenvalue problem and linearize it as a singular t...
In this paper, a fully parallel method for finding all eigenvalues of a real matrix pencil (A,B) is ...
[[abstract]]We consider a generalised symmetric eigenvalue problem Ax = lambda-Mx, where A and M are...
AbstractThe homotopy method is used to find all eigenpairs of symmetric matrices. A special homotopy...
A dense symmetric matrix can be reduced into a similar diagonal-plus-semiseparable one by means of o...
\u3cp\u3eGeneralized eigenvalue problems involving a singular pencil are very challenging to solve, ...
AbstractIn this paper, the homotopy continuation method is applied to solve the eigenproblem Ax = λx...
AbstractA new method for finding eigenpairs of any symmetric definite matrix pencil is proposed. It ...
A homotopy method to compute the eigenpairs, i.e.,the eigenvectors and eigenvalues, of a given real ...
AbstractSolving dense symmetric eigenvalue problems and computing singular value decompositions cont...
An efficient parallel algorithm, farmzeroinNR, for the eigenvalue problem of a symmetric tridiagonal...
AbstractRecently the homotopy method has been applied to solve linear algebraic eigenvalue problems....
[[abstract]]Given k pairs of complex numbers and vectors (closed under conjugation), we consider the...
A method for determining all eigenvalues of large real symmetric tridiagonal matrices on multiproces...
This paper proposes a numerical algorithm based on spectral Schur complements to compute a few eigen...
AbstractWe introduce the quadratic two-parameter eigenvalue problem and linearize it as a singular t...
In this paper, a fully parallel method for finding all eigenvalues of a real matrix pencil (A,B) is ...
[[abstract]]We consider a generalised symmetric eigenvalue problem Ax = lambda-Mx, where A and M are...
AbstractThe homotopy method is used to find all eigenpairs of symmetric matrices. A special homotopy...
A dense symmetric matrix can be reduced into a similar diagonal-plus-semiseparable one by means of o...
\u3cp\u3eGeneralized eigenvalue problems involving a singular pencil are very challenging to solve, ...
AbstractIn this paper, the homotopy continuation method is applied to solve the eigenproblem Ax = λx...
AbstractA new method for finding eigenpairs of any symmetric definite matrix pencil is proposed. It ...
A homotopy method to compute the eigenpairs, i.e.,the eigenvectors and eigenvalues, of a given real ...
AbstractSolving dense symmetric eigenvalue problems and computing singular value decompositions cont...
An efficient parallel algorithm, farmzeroinNR, for the eigenvalue problem of a symmetric tridiagonal...
AbstractRecently the homotopy method has been applied to solve linear algebraic eigenvalue problems....
[[abstract]]Given k pairs of complex numbers and vectors (closed under conjugation), we consider the...
A method for determining all eigenvalues of large real symmetric tridiagonal matrices on multiproces...
This paper proposes a numerical algorithm based on spectral Schur complements to compute a few eigen...
AbstractWe introduce the quadratic two-parameter eigenvalue problem and linearize it as a singular t...