na26

swMATH11493MaRDI QIDQ23435FDOQ23435

Author name not available (Why is that?)

Described by source

• Restarted block Lanczos bidiagonalization methods

Cited In (24)

• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature
• Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
• Eigenvalue Characterization and Computation for the Laplacian on General 2-D Domains
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• GCV for Tikhonov regularization by partial SVD
• Computing the smallest singular triplets of a large matrix
• On the computation of a truncated SVD of a large linear discrete ill-posed problem
• Restarting the Nonsymmetric Lanczos Algorithm for Eigenvalues and Linear Equations Including Multiple Right-Hand Sides
• A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
• A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
• Split-and-combine singular value decomposition for large-scale matrix
• A cross-product approach for low-rank approximations of large matrices
• PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
• Augmented block Householder Arnoldi method
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
• Title not available (Why is that?)
• Projected Tikhonov regularization of large-scale discrete ill-posed problems
• An augmented LSQR method
• Fast computation of convolution operations via low-rank approximation
• Probabilistic upper bounds for the matrix two-norm
• Stable Computation of Generalized Matrix Functions via Polynomial Interpolation

This page was built for software: na26