Composite orthogonal projection methods for large matrix eigenproblems

DOI10.1007/BF02880075MaRDI QIDQ1585577zbMATH OpenOpenAlexFDO

Authors Zhongxiao Jia

Publication date 16 November 2000

Published in Science in China. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02880075

zbMATH Keywords

convergenceerror boundseigenvectorseigenvalue problemorthogonal basesRitz methodArnoldi algorithmrefined projection

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Recommendations

• scientific article; zbMATH DE number 2152273
• scientific article; zbMATH DE number 805080
• Numerical solution of large nonsymmetric eigenvalue problems
• Residuals of refined projection methods for large matrix eigenproblems
• scientific article; zbMATH DE number 991429

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Computing interior eigenvalues of large matrices
• Generalized block Lanczos methods for large unsymmetric eigenproblems
• Numerical methods for large eigenvalue problems
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

Cited in

(15)

• On the perturbation of an \(L^2\)-orthogonal projection
• Residuals of refined projection methods for large matrix eigenproblems
• The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• New multiplicative perturbation bounds on orthogonal projection
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
• A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
• A refined Jacobi-Davidson method and its correction equation
• Orthogonal projection method for eigenpair derivatives of large symmetric matrices
• On perturbation bounds for orthogonal projections
• Inexact methods for the solution of large scale Hermitian eigenvalue problems
• A numerical projection technique for large-scale eigenvalue problems
• Using cross-product matrices to compute the SVD

Describes a project that uses

Uses Software

• JDQZ

This page was built for publication: Composite orthogonal projection methods for large matrix eigenproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585577)