Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
From MaRDI portal
Publication:5693185
DOI10.1137/04060593XzbMath1087.65039OpenAlexW1977361006MaRDI QIDQ5693185
Publication date: 22 September 2005
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/04060593x
numerical examplesiterative methodKrylov subspace methodpartial singular value decompositionlarge-scale computationlarge sparse matrixharmonic Ritz vectorssingular value computationrestarted Lanczos bidiagonalization methods
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem, Efficient alternating least squares algorithms for low multilinear rank approximation of tensors, On obtaining sparse semantic solutions for inverse problems, control, and neural network training, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Reduced multidimensional scaling, Mathematics of magic angles in a model of twisted bilayer graphene, Split-and-combine singular value decomposition for large-scale matrix, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem, Randomized Spectral Clustering in Large-Scale Stochastic Block Models, An efficient, memory-saving approach for the Loewner framework, Restarted block Lanczos bidiagonalization methods, Projected Tikhonov regularization of large-scale discrete ill-posed problems, An augmented LSQR method, Low-Rank Solution of Unsteady Diffusion Equations with Stochastic Coefficients, On the regularization of convolutional kernel tensors in neural networks, Inverse subspace problems with applications, Fast dimension-reduced climate model calibration and the effect of data aggregation, A compact heart iteration for low-rank approximations of large matrices, A literature survey of matrix methods for data science, Hybrid iterative refined restarted Lanczos bidiagonalization methods, A non‐intrusive domain‐decomposition model reduction method for linear steady‐state partial differential equations with random coefficients, Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets, A Krylov-Schur approach to the truncated SVD, Thick-restarted joint Lanczos bidiagonalization for the GSVD, Some properties of LSQR for large sparse linear least squares problems, A survey of subspace recycling iterative methods, Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods, Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems, Statistical embedding: beyond principal components, Modulus-based iterative methods for constrained ℓ p – ℓ q minimization, The minimal-norm Gauss-Newton method and some of its regularized variants, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition, Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces, Computing the smallest singular triplets of a large matrix, Probabilistic upper bounds for the matrix two-norm, Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach, A preconditioned multiple shooting shadowing algorithm for the sensitivity analysis of chaotic systems, Fast ESPRIT algorithms based on partial singular value decompositions, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, On the convergence of Krylov methods with low-rank truncations, Spike-and-Slab Priors for Function Selection in Structured Additive Regression Models, Hybrid Projection Methods with Recycling for Inverse Problems, Augmented block Householder Arnoldi method, Modulus-based iterative methods for constrained Tikhonov regularization, Feedback control of chaotic systems using multiple shooting shadowing and application to Kuramoto–Sivashinsky equation, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, A Matrix-Free Likelihood Method for Exploratory Factor Analysis of High-Dimensional Gaussian Data, On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems, Lanczos method for large-scale quaternion singular value decomposition, Regularization parameter determination for discrete ill-posed problems, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, A cross-product approach for low-rank approximations of large matrices, PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations, Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem, Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, A Domain Decomposition Model Reduction Method for Linear Convection-Diffusion Equations with Random Coefficients, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Hybrid Projection Methods with Recycling for Inverse Problems, Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems, Low-dimensional tracking of association structures in categorical data
Uses Software
