Composite orthogonal projection methods for large matrix eigenproblems

DOI10.1007/BF02880075zbMATH Open0958.65040OpenAlexW2024312641MaRDI QIDQ1585577FDOQ1585577

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

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

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)

Cites Work

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

Cited In (15)

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

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)