Fast and accurate randomized algorithms for linear systems and eigenvalue problems
From MaRDI portal
Publication:6561643
Recommendations
- Randomized algorithms in numerical linear algebra
- A fast randomized algorithm for computing an approximate null space
- Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations
- Randomized Gram-Schmidt process with application to GMRES
- A fast randomized algorithm for the approximation of matrices
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Krylov--Schur algorithm for large eigenproblems
- A fast randomized algorithm for overdetermined linear least-squares regression
- A fast randomized algorithm for the approximation of matrices
- A generalization of Saad's theorem on Rayleigh-Ritz approximations
- A randomized algorithm for principal component analysis
- Accuracy and Stability of Numerical Algorithms
- Algorithm 873
- An algorithm for the generalized eigenvalue problem for nonsquare matrix pencils by minimal perturbation approach
- An algorithm for the principal component analysis of large data sets
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Condition numbers and equilibration of matrices
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Faster least squares approximation
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- From Potential Theory to Matrix Iterations in Six Steps
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- IFISS3D: a computational laboratory for investigating finite element approximation in three dimensions
- IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
- Improved analysis of the subsampled randomized Hadamard transform
- Krylov subspace methods. Principles and analysis.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Matrix algorithms. Vol. 2: Eigensystems
- Minimizing communication in numerical linear algebra
- Nearly tight oblivious subspace embeddings by trace inequalities
- Numerical methods for large eigenvalue problems
- On the generation of Krylov subspace bases
- Practical sketching algorithms for low-rank matrix approximation
- Randomized Gram-Schmidt process with application to GMRES
- Randomized block Krylov methods for approximating extreme eigenvalues
- Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Randomized numerical linear algebra: Foundations and algorithms
- Scalable semidefinite programming
- Sharp error bounds for Ritz vectors and approximate singular vectors
- Sketching as a tool for numerical linear algebra
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Spectra of Nearly Hermitian Matrices
- Streaming low-rank matrix approximation with an application to scientific simulation
- The Condition of Orthogonal Polynomials
- The Condition of Polynomials in Power Form
- The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
- The Lanczos Algorithm With Partial Reorthogonalization
- The Tchebychev iteration for nonsymmetric linear systems
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trace optimization and eigenproblems in dimension reduction methods.
- Trust Region Methods
Cited in
(5)- A robust randomized indicator method for accurate symmetric eigenvalue detection
- The sparse-grid-based adaptive spectral Koopman method
- Fast and forward stable randomized algorithms for linear least-squares problems
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Krylov subspace recycling with randomized sketching for matrix functions
This page was built for publication: Fast and accurate randomized algorithms for linear systems and eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561643)
