Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
From MaRDI portal
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
Cited in
(91)- Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Reduced multidimensional scaling
- Mathematics of magic angles in a model of twisted bilayer graphene
- An efficient, memory-saving approach for the Loewner framework
- The minimal-norm Gauss-Newton method and some of its regularized variants
- Computing the smallest singular triplets of a large matrix
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- A preconditioned multiple shooting shadowing algorithm for the sensitivity analysis of chaotic systems
- On the convergence of Krylov methods with low-rank truncations
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Lanczos method for large-scale quaternion singular value decomposition
- A cross-product approach for low-rank approximations of large matrices
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- Split-and-combine singular value decomposition for large-scale matrix
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Probabilistic upper bounds for the matrix two-norm
- Regularization parameter determination for discrete ill-posed problems
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Low-dimensional tracking of association structures in categorical data
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Low-rank solution of unsteady diffusion equations with stochastic coefficients
- Inverse subspace problems with applications.
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- An augmented LSQR method
- Fast dimension-reduced climate model calibration and the effect of data aggregation
- A Krylov-Schur approach to the truncated SVD
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Fast ESPRIT algorithms based on partial singular value decompositions
- Spike-and-slab priors for function selection in structured additive regression models
- Hybrid projection methods with recycling for inverse problems
- Approximate Generalized Inverses with Iterative Refinement for \epsilon-Accurate Preconditioning of Singular Systems
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- A Matrix-Free Likelihood Method for Exploratory Factor Analysis of High-Dimensional Gaussian Data
- On the regularization of convolutional kernel tensors in neural networks
- Modulus-based iterative methods for constrained \(\ell_p\)-\(\ell_q\) minimization
- Modulus-based iterative methods for constrained Tikhonov regularization
- Feedback control of chaotic systems using multiple shooting shadowing and application to Kuramoto-Sivashinsky equation
- Hybrid Projection Methods with Recycling for Inverse Problems
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- 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
- scientific article; zbMATH DE number 6452806 (Why is no real title available?)
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- A compact heart iteration for low-rank approximations of large matrices
- A literature survey of matrix methods for data science
- 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
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- 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
- Some properties of LSQR for large sparse linear least squares problems
- 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
- Block discrete empirical interpolation methods
- A practical guide to text mining with topic extraction
- Bayesian transfer learning
- Randomized spectral clustering for large-scale multi-layer networks
- Computing a few extreme singular triplets of a third-order tensor using the t-product
- A hybrid algorithm for computing a partial singular value decomposition satisfying a given threshold
- A New Basis for Sparse Principal Component Analysis
- Co-Factor Analysis of Citation Networks
- Inferring Covariance Structure from Multiple Data Sources via Subspace Factor Analysis
- Algorithm 1043: faster randomized SVD with dynamic shifts
- Krylov subspace methods for large multidimensional eigenvalue computation
- Scalable Bayesian inference for heat kernel Gaussian processes on manifolds
- Low-rank regularized convex-non-convex problems for image segmentation and completion
- A power method for computing singular value decomposition
- Bayesian scalable precision factor analysis for Gaussian graphical models
- Harmonic, refined and refined harmonic skew-symmetric Lanczos bidiagonalization methods for computing several extreme eigenpairs of a large skew-symmetric matrix
- Deep-QLP and spline based quadrature rules for Fredholm integral equations of the first kind
- A tutorial on Bayesian multi-study factor analysis with applications in nutrition and genomics
- lazymatrix
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- Restarted block Lanczos bidiagonalization methods
- Augmented block Householder Arnoldi method
Describes a project that uses
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)
