A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix
DOI10.1137/23M1553029zbMATH Open1545.65158MaRDI QIDQ6561641FDOQ6561641
Authors: Zhongxiao Jia
Publication date: 25 June 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
singular value decompositioneigenvalueeigenvectorsingular valuespectral decompositionskew-symmetric matrixsingular vectorpartial reorthogonalizationskew-symmetric Lanczos bidiagonalization
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The university of Florida sparse matrix collection
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- The autonomous linear quadratic control problem. Theory and numerical solution
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Title not available (Why is that?)
- An approximate approach to H/sup 2/ optimal model reduction
- Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
- Algorithm 923
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- Iterative solution of skew-symmetric linear systems
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Polynomial eigenvalue problems with Hamiltonian structure
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- A Krylov-Schur approach to the truncated SVD
- On the spectra of periodic waves for infinite-dimensional Hamiltonian systems
- Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
- Title not available (Why is that?)
- Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices
- An eigenvalue algorithm for skew-symmetric matrices
- A Lanczos Algorithm for Computing Singular Values and Vectors of Large Matrices
- Exponentials of skew-symmetric matrices and logarithms of orthogonal matrices
- Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
- Using cross-product matrices to compute the SVD
- 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
- Numerical equivalences among Krylov subspace algorithms for 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561641)