A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices (Q5230648): Difference between revisions

Revision as of 07:14, 20 July 2024

scientific article; zbMATH DE number 7099341

Language	Label	Description	Also known as
English	A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices	scientific article; zbMATH DE number 7099341

Statements

instance of

scholarly article

0 references

title

A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices (English)

0 references

0 references

0 references

0 references

SIAM Journal on Scientific Computing

0 references

publication date

28 August 2019

0 references

zbMATH Keywords

singular value decomposition

0 references

Davidson

0 references

Jacobi-Davidson

0 references

preconditioning

0 references

high accuracy

0 references

iterative methods

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems

0 references

Augmented Implicitly Restarted Lanczos Bidiagonalization Methods

0 references

Restarted block Lanczos bidiagonalization methods

0 references

The university of Florida sparse matrix collection

0 references

Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse

0 references

Calculating the Singular Values and Pseudo-Inverse of a Matrix

0 references

Q5689624

0 references

A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems

0 references

A Jacobi--Davidson Type SVD Method

0 references

Iterative algorithms for Gram-Schmidt orthogonalization

0 references

On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations

0 references

Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method

0 references

Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems

0 references

An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition

0 references

Principal component analysis.

0 references

Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

0 references

Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method

0 references

Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers

0 references

Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem

0 references

Q3868672

0 references

Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications

0 references

Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue

0 references

Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method

0 references

A Block Orthogonalization Procedure with Constant Synchronization Requirements

0 references

Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems

0 references

PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations

0 references

A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices

0 references

Identifiers

zbMATH Open document ID

1420.65047

0 references

DOI

10.1137/18M1222004

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5230648

@@ Property / cites work @@
+IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
+Normal rank
@@ Property / cites work @@
+Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
+Normal rank
@@ Property / cites work @@
+Restarted block Lanczos bidiagonalization methods
@@ Property / cites work: Restarted block Lanczos bidiagonalization methods / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
+Normal rank
@@ Property / cites work @@
+Calculating the Singular Values and Pseudo-Inverse of a Matrix
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
+Normal rank
@@ Property / cites work @@
+A Jacobi--Davidson Type SVD Method
@@ Property / cites work: A Jacobi--Davidson Type SVD Method / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative algorithms for Gram-Schmidt orthogonalization
+Normal rank
@@ Property / cites work @@
+On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations
+Normal rank
@@ Property / cites work @@
+Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
+Normal rank
@@ Property / cites work @@
+Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
+Normal rank
@@ Property / cites work @@
+An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
+Normal rank
@@ Property / cites work @@
+Principal component analysis.
@@ Property / cites work: Principal component analysis. / rank @@
+Normal rank
@@ Property / cites work @@
+Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
+Normal rank
@@ Property / cites work @@
+Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
+Normal rank
@@ Property / cites work @@
+Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers
+Normal rank
@@ Property / cites work @@
+Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
+Normal rank
@@ Property / cites work @@
+Q3868672
@@ Property / cites work: Q3868672 / rank @@
+Normal rank
@@ Property / cites work @@
+Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
+Normal rank
@@ Property / cites work @@
+Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
+Normal rank
@@ Property / cites work @@
+Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
+Normal rank
@@ Property / cites work @@
+A Block Orthogonalization Procedure with Constant Synchronization Requirements
+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 / cites work @@
+A Preconditioned Hybrid SVD Method for Accurately Computing  Singular Triplets of Large Matrices
+Normal rank