A method of indefinite Krylov subspace for eigenvalue problem
From MaRDI portal
Summary: We describe an indefinite state of Arnoldi's method for solving the eigenvalues problems. In the following, we scrutinize the indefinite state of Lanczos' method for solving the eigenvalue problems and we show that this method for the \(J\)-Hermitian matrices works much better than Arnoldi's method.
Recommendations
Cites work
- J-Orthogonal Matrices: Properties and Generation
- A note on the hyperbolic singular value decomposition
- scientific article; zbMATH DE number 16399 (Why is no real title available?)
- scientific article; zbMATH DE number 2237400 (Why is no real title available?)
- Moore-Penrose inverses of Gram matrices leaving a cone invariant in an indefinite inner product space
- Numerical methods for large eigenvalue problems
- Parallel iterative methods for sparse linear systems
- The representation and approximation for the weighted Minkowski inverse in Minkowski space
Cited in
(5)- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
- Indefinite Ruhe's variant of the block Lanczos method for solving the systems of linear equations
- Some hyperbolic iterative methods for linear systems
- The indefinite Lanczos J-biothogonalization algorithm for solving large non-J-symmetric linear systems
- Krylov subspace method for fuzzy eigenvalue problem
This page was built for publication: A method of indefinite Krylov subspace for eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1720693)