Pages that link to "Item:Q2376857"

The following pages link to An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857):

Displaying 20 items.

• Adaptive cross approximation for ill-posed problems (Q269387) (← links)
• Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
• An augmented LSQR method (Q372851) (← links)
• An implicit filter for rational Krylov using core transformations (Q1630055) (← links)
• GCV for Tikhonov regularization by partial SVD (Q1689313) (← links)
• The minimal-norm Gauss-Newton method and some of its regularized variants (Q2203382) (← links)
• Computing the smallest singular triplets of a large matrix (Q2211056) (← links)
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature (Q2249727) (← links)
• A cross-product approach for low-rank approximations of large matrices (Q2293619) (← links)
• On computing the minimum singular value of a tensor sum (Q2302867) (← links)
• On the computation of a truncated SVD of a large linear discrete ill-posed problem (Q2360674) (← links)
• Fast computation of convolution operations via low-rank approximation (Q2448383) (← links)
• Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
• A DEIM Induced CUR Factorization (Q2810324) (← links)
• Inverse subspace problems with applications (Q2948071) (← links)
• A new framework for implicit restarting of the Krylov-Schur algorithm (Q2948097) (← links)
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
• On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems (Q5739757) (← links)
• A compact heart iteration for low-rank approximations of large matrices (Q6049289) (← links)
• A survey of subspace recycling iterative methods (Q6144044) (← links)