A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix

DOI10.1137/23m1553029zbMath1545.65158MaRDI QIDQ6561641

Unnamed Author, Zhongxiao Jia

Publication date: 25 June 2024

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

zbMATH Keywords

eigenvaluesingular value decompositioneigenvectorspectral decompositionskew-symmetric matrixsingular valuesingular vectorpartial reorthogonalizationskew-symmetric Lanczos bidiagonalization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Krylov-Schur approach to the truncated SVD
• An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
• Exponentials of skew-symmetric matrices and logarithms of orthogonal matrices
• On the spectra of periodic waves for infinite-dimensional Hamiltonian systems
• Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
• The autonomous linear quadratic control problem. Theory and numerical solution
• Polynomial eigenvalue problems with Hamiltonian structure
• Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
• Using cross-product matrices to compute the SVD
• An eigenvalue algorithm for skew-symmetric matrices
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Matrix Algorithms
• Numerical Equivalences among Krylov Subspace Algorithms for Skew-Symmetric Matrices
• The university of Florida sparse matrix collection
• Algorithm 923
• A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
• Iterative Solution of Skew-Symmetric Linear Systems
• A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
• Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices
• ARPACK Users' Guide
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• An approximate approach to H/sup 2/ optimal model reduction
• Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Computation of the Exponential of Large Sparse Skew-Symmetric Matrices

This page was built for publication: A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix