A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
From MaRDI portal
Publication:3918995
DOI10.1145/355945.355946zbMath0466.65022OpenAlexW2158495995WikidataQ128587432 ScholiaQ128587432MaRDI QIDQ3918995
Michael L. Overton, Gene H. Golub, Franklin T. Luk
Publication date: 1981
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355945.355946
singular valuessingular vectorsblock Lanczos algorithmreorthogonalizationKaniel-Paige boundslarge rectangular matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25)
Related Items
Randomized numerical linear algebra: Foundations and algorithms, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, An implicit shift bidiagonalization algorithm for ill-posed systems, Computation of the fundamental singular subspace of a large matrix, Nonequivalence deflation for the solution of matrix latent value problems, A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations, Matrix-free iterative solution strategies for large dense linear systems, Restarted block Lanczos bidiagonalization methods, The block Lanczos algorithm for linear ill-posed problems, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, On equivalence of fractional factorial designs based on singular value decomposition, A GCV based Arnoldi-Tikhonov regularization method, GCV for Tikhonov regularization by partial SVD, A CCBM-based generalized GKB iterative regularization algorithm for inverse Cauchy problems, Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, Matrices with Hierarchical Low-Rank Structures, Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems, A characterization of optimal scaling for structured singular value computation, Block Krylov-Schur method for large symmetric eigenvalue problems, Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values, Adaptive Lanczos methods for recursive condition estimation, Estimating the largest singular values of large sparse matrices via modified moments, Sparse matrices, Deflated block Krylov subspace methods for large scale eigenvalue problems, Lanczos based preconditioner for discrete ill-posed problems, Solution methods for linear discrete ill-posed problems for color image restoration, Large-Scale Inverse Problems in Imaging, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, Matrix-free Krylov iteration for implicit convolution of numerically low-rank data, Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices, Approximating dominant singular triplets of large sparse matrices via modified moments, Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation, The ubiquitous Kronecker product, A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation, The stability robustness determination of state space models with real unstructured perturbations
