Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823): Difference between revisions

@@ Property / DOI @@
-.1007/s11075-022-01336-5
@@ Property / DOI: 10.1007/s11075-022-01336-5 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+SparseMatrix
@@ Property / describes a project that uses: SparseMatrix / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Matlab
@@ Property / describes a project that uses: Matlab / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11075-022-01336-5
+Normal rank
@@ Property / OpenAlex ID @@
+W4283829366
@@ Property / OpenAlex ID: W4283829366 / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
+Normal rank
@@ Property / cites work @@
+Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
+Normal rank
@@ Property / cites work @@
+An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
+Normal rank
@@ Property / cites work @@
+Implicitly restarting the LSQR algorithm
@@ Property / cites work: Implicitly restarting the LSQR algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Q3444931
@@ Property / cites work: Q3444931 / rank @@
+Normal rank
@@ Property / cites work @@
+A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
+Normal rank
@@ Property / cites work @@
+Calculating the Singular Values and Pseudo-Inverse of a Matrix
+Normal rank
@@ Property / cites work @@
+Q4917542
@@ Property / cites work: Q4917542 / rank @@
+Normal rank
@@ Property / cites work @@
+Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
+Normal rank
@@ Property / cites work @@
+Generalizations of harmonic and refined Rayleigh-Ritz
+Normal rank
@@ Property / cites work @@
+Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem
+Normal rank
@@ Property / cites work @@
+Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
+Normal rank
@@ Property / cites work @@
+Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
+Normal rank
@@ Property / cites work @@
+The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
+Normal rank
@@ Property / cites work @@
+Some theoretical comparisons of refined Ritz vectors and Ritz vectors
+Normal rank
@@ Property / cites work @@
+The convergence of harmonic Ritz values,   harmonic Ritz vectors    and refined harmonic Ritz vectors
+Normal rank
@@ Property / cites work @@
+An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
+Normal rank
@@ Property / cites work @@
+A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
+Normal rank
@@ Property / cites work @@
+An analysis of the Rayleigh--Ritz method  for approximating eigenspaces
+Normal rank
@@ Property / cites work @@
+A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
+Normal rank
@@ Property / cites work @@
+Principal component analysis.
@@ Property / cites work: Principal component analysis. / rank @@
+Normal rank
@@ Property / cites work @@
+Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
+Normal rank
@@ Property / cites work @@
+ARPACK Users' Guide
@@ Property / cites work: ARPACK Users' Guide / rank @@
+Normal rank
@@ Property / cites work @@
+Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
+Normal rank
@@ Property / cites work @@
+On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
+Normal rank
@@ Property / cites work @@
+An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
+Normal rank
@@ Property / cites work @@
+LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
+Normal rank
@@ Property / cites work @@
+Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
+Normal rank
@@ Property / cites work @@
+Numerical Methods for Large Eigenvalue Problems
@@ Property / cites work: Numerical Methods for Large Eigenvalue Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method
+Normal rank
@@ Property / cites work @@
+Matrix Algorithms
@@ Property / cites work: Matrix Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Krylov-Schur approach to the truncated SVD
@@ Property / cites work: A Krylov-Schur approach to the truncated SVD / rank @@
+Normal rank
@@ Property / cites work @@
+Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
+Normal rank
@@ Property / cites work @@
+PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
+Normal rank
@@ Property / DOI @@
+.1007/S11075-022-01336-5
@@ Property / DOI: 10.1007/S11075-022-01336-5 / rank @@
+Normal rank