Subspace Iteration Randomization and Singular Value Problems (Q5254699)

scientific article; zbMATH DE number 6444342

Language	Label	Description	Also known as
English	Subspace Iteration Randomization and Singular Value Problems	scientific article; zbMATH DE number 6444342

Statements

instance of

scholarly article

0 references

title

Subspace Iteration Randomization and Singular Value Problems (English)

0 references

author

Ming Gu

0 references

published in

SIAM Journal on Scientific Computing

0 references

publication date

10 June 2015

0 references

full work available at URL

https://arxiv.org/abs/1408.2208

0 references

zbMATH Keywords

low-rank approximation

0 references

randomized algorithms

0 references

singular values

0 references

standard Gaussian matrix

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

MaRDI publication profile

0 references

cites work

Q4841244

0 references

Preconditioned conjugate gradient methods. Proceedings of a conference held in Nijmegen, The Netherlands, June 19-21, 1989

0 references

Templates for the Solution of Algebraic Eigenvalue Problems

0 references

Q4168022

0 references

Using Linear Algebra for Intelligent Information Retrieval

0 references

Q4393474

0 references

Q4633910

0 references

An implicit restarted Lanczos method for large symmetric eigenvalue problems

0 references

Rang revealing QR factorizations

0 references

Some Applications of the Rank Revealing QR Factorization

0 references

On Rank-Revealing Factorisations

0 references

Condition Numbers of Gaussian Random Matrices

0 references

On the Compression of Low Rank Matrices

0 references

Lanczos Algorithms for Large Symmetric Eigenvalue Computations

0 references

The university of Florida sparse matrix collection

0 references

Q4348513

0 references

On the complexity of computing error bounds

0 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

0 references

Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods

0 references

Relative-Error $CUR$ Matrix Decompositions

0 references

Low-rank revealing $UTV$ decompositions

0 references

Fast monte-carlo algorithms for finding low-rank approximations

0 references

The Evolution of the Minimum Degree Ordering Algorithm

0 references

Q5689624

0 references

A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems

0 references

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

0 references

A sparse matrix arithmetic based on ${\mathfrak H}$-matrices. I: Introduction to ${\mathfrak H}$-matrices

0 references

Condition Estimates

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Methods of conjugate gradients for solving linear systems

0 references

A Survey of Condition Number Estimation for Triangular Matrices

0 references

Experience with a Matrix Norm Estimator

0 references

Estimating the matrix $p$-norm

0 references

Q4864704

0 references

The variation of the spectrum of a normal matrix

0 references

Rank-Revealing QR Factorizations and the Singular Value Decomposition

0 references

Q4040931

0 references

Principal component analysis.

0 references

Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization

0 references

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 references

Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm

0 references

Applications of statistical condition estimation to the solution of linear systems

0 references

ARPACK Users' Guide

0 references

New Efficient and Robust HSS Cholesky Factorization of SPD Matrices

0 references

Dense Fast Random Projections and Lean Walsh Transforms

0 references

Randomized algorithms for the low-rank approximation of matrices

0 references

Randomized Algorithms for Matrices and Data

0 references

A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix

0 references

Strong rank revealing LU factorizations

0 references

Singular Value Decomposition, Eigenfaces, and 3D Reconstructions

0 references

A fast and efficient algorithm for low-rank approximation of a matrix

0 references

On the existence and computation of rank-revealing LU factorizations

0 references

A Randomized Algorithm for Principal Component Analysis

0 references

A fast randomized algorithm for overdetermined linear least-squares regression

0 references

Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices

0 references

Numerical Methods for Large Eigenvalue Problems

0 references

A fast direct solver for elliptic problems on general meshes in 2D

0 references

A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices

0 references

Updating a Rank-Revealing ULV Decomposition

0 references

An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition

0 references

A fast randomized algorithm for the approximation of matrices

0 references

Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems

0 references

Superfast Multifrontal Method for Large Structured Linear Systems of Equations

0 references

Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices

0 references

Regularization with randomized SVD for large-scale discrete inverse problems

0 references

Identifiers

zbMATH Open document ID

1328.65088

0 references

DOI

10.1137/130938700

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5254699