Homotopy algorithm for symmetric eigenvalue problems
From MaRDI portal
Publication:1107947
DOI10.1007/BF01390054zbMath0653.65025MaRDI QIDQ1107947
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133355
eigenvalue; eigenvector; parallel algorithm; homotopy continuation method; symmetric tridiagonal matrices; graded matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65Y05: Parallel numerical computation
Related Items
Computing zeros and orders of Bessel functions, Some computational methods for systems of nonlinear equations and systems of polynomial equations, A homotopy algorithm for a symmetric generalized eigenproblem, Homotopies for solving polynomial systems within a bounded domain, Generic movement of eigenvalues for equivariant self-adjoint matrices, Parallel homotopy algorithm for symmetric large sparse eigenproblems, Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators, Continuation methods for the computation of zeros of Szegő polynomials, Real matrix homotopies based on Householder reflections, Matrix differential equations: a continuous realization process for linear algebra problems, Homotopy-Determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
Uses Software
