Pages that link to "Item:Q4443811"

The following pages link to An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition (Q4443811):

Displaying 32 items.

• Adaptive cross approximation for ill-posed problems (Q269387) (← links)
• On the condition number of the total least squares problem (Q368579) (← links)
• An augmented LSQR method (Q372851) (← links)
• A Krylov-Schur approach to the truncated SVD (Q413526) (← links)
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices (Q433291) (← links)
• Some properties of LSQR for large sparse linear least squares problems (Q625665) (← links)
• Restarted block Lanczos bidiagonalization methods (Q870765) (← links)
• Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem (Q1637988) (← links)
• GCV for Tikhonov regularization by partial SVD (Q1689313) (← links)
• Some results on the regularization of LSQR for large-scale discrete ill-posed problems (Q1708059) (← links)
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization (Q1826601) (← links)
• On choices of formulations of computing the generalized singular value decomposition of a large matrix pair (Q2028035) (← links)
• Computing the smallest singular triplets of a large matrix (Q2211056) (← links)
• Lanczos method for large-scale quaternion singular value decomposition (Q2274168) (← links)
• A cross-product approach for low-rank approximations of large matrices (Q2293619) (← links)
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems (Q2306411) (← links)
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857) (← links)
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets (Q2511197) (← links)
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems (Q2566637) (← links)
• Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors (Q4671846) (← links)
• On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations (Q5230610) (← links)
• A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices (Q5230648) (← links)
• (Q5257357) (← links)
• PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations (Q5372627) (← links)
• The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision (Q5885819) (← links)
• A compact heart iteration for low-rank approximations of large matrices (Q6049289) (← links)
• A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices (Q6077289) (← links)
• Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets (Q6098127) (← links)
• An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval (Q6180351) (← links)
• A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix (Q6561641) (← links)