Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem

DOI10.1137/S0895479894273900zbMath0872.65035OpenAlexW2028194144MaRDI QIDQ4337383

No author found.

Publication date: 19 October 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479894273900

zbMATH Keywords

stabilitynumerical resultseigenvalueseigenvectorshomotopy methodlarge, sparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (12)

Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators ⋮ Complexity of path-following methods for the eigenvalue problem ⋮ An adaptive homotopy approach for non-selfadjoint eigenvalue problems ⋮ Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems ⋮ A novel method for computation of higher order singular points in nonlinear problems with single parameter ⋮ Path-following methods for calculating linear surface wave dispersion relations on vertical shear flows ⋮ Coalescing Eigenvalues and Crossing Eigencurves of 1-Parameter Matrix Flows ⋮ Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy ⋮ Uncertainty quantification for Maxwell's eigenproblem based on isogeometric analysis and mode tracking ⋮ Parallelization of eigenvalue-based dimensional reductions via homotopy continuation ⋮ Multiple bifurcation from ``simple eigenvalues ⋮ Eigenvalue computation in the 20th century

This page was built for publication: Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem