na26

swMATH11493MaRDI QIDQ23435FDOQ23435

Author name not available (Why is that?)

Described by source

• Restarted block Lanczos bidiagonalization methods

Cited In (24)

• Restarting the nonsymmetric Lanczos algorithm for eigenvalues and linear equations including multiple right-hand sides
• 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
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• 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 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
• Split-and-combine singular value decomposition for large-scale matrix
• A cross-product approach for low-rank approximations of large matrices
• 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
• A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
• Probabilistic upper bounds for the matrix two-norm
• Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
• 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

This page was built for software: na26