Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
From MaRDI portal
Publication:5693185
DOI10.1137/04060593XzbMATH Open1087.65039OpenAlexW1977361006MaRDI QIDQ5693185FDOQ5693185
Authors: James Baglama, Lothar Reichel 
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
Recommendations
- Restarted block Lanczos bidiagonalization methods
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- An implicitly restarted Lanczos bidiagonalization method with refined vector
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)
Cited In (74)
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix
- Tensor Golub-Kahan method based on Einstein product
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Block discrete empirical interpolation methods
- A compact heart iteration for low-rank approximations of large matrices
- A practical guide to text mining with topic extraction
- Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems
- Statistical embedding: beyond principal components
- Explicit deflation in Golub-Kahan-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
- Hybrid projection methods with recycling for inverse problems
- A Matrix-Free Likelihood Method for Exploratory Factor Analysis of High-Dimensional Gaussian Data
- Feedback control of chaotic systems using multiple shooting shadowing and application to Kuramoto-Sivashinsky equation
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- Spike-and-slab priors for function selection in structured additive regression models
- Hybrid Projection Methods with Recycling for Inverse Problems
- Low-dimensional tracking of association structures in categorical data
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- On the regularization of convolutional kernel tensors in neural networks
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- The minimal-norm Gauss-Newton method and some of its regularized variants
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A preconditioned multiple shooting shadowing algorithm for the sensitivity analysis of chaotic systems
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Title not available (Why is that?)
- A Krylov-Schur approach to the truncated SVD
- Regularization parameter determination for discrete ill-posed problems
- A domain decomposition model reduction method for linear convection-diffusion equations with random coefficients
- Some properties of LSQR for large sparse linear least squares problems
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Modulus-based iterative methods for constrained \(\ell_p\)-\(\ell_q\) minimization
- Fast dimension-reduced climate model calibration and the effect of data aggregation
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Computing the smallest singular triplets of a large matrix
- Reduced multidimensional scaling
- Mathematics of magic angles in a model of twisted bilayer graphene
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- An efficient, memory-saving approach for the Loewner framework
- A literature survey of matrix methods for data science
- Split-and-combine singular value decomposition for large-scale matrix
- Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem
- A survey of subspace recycling iterative methods
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- A cross-product approach for low-rank approximations of large matrices
- Augmented block Householder Arnoldi method
- Lanczos method for large-scale quaternion singular value decomposition
- Fast ESPRIT algorithms based on partial singular value decompositions
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- Inverse subspace problems with applications.
- Restarted block Lanczos bidiagonalization methods
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- On the convergence of Krylov methods with low-rank truncations
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- An augmented LSQR method
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- Probabilistic upper bounds for the matrix two-norm
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- Low-rank solution of unsteady diffusion equations with stochastic coefficients
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Modulus-based iterative methods for constrained Tikhonov regularization
Uses Software
This page was built for publication: Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693185)
