Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955)

scientific article; zbMATH DE number 6601536

Language	Label	Description	Also known as
English	Compressing Rank-Structured Matrices via Randomized Sampling	scientific article; zbMATH DE number 6601536

Statements

instance of

scholarly article

0 references

title

Compressing Rank-Structured Matrices via Randomized Sampling (English)

0 references

published in

SIAM Journal on Scientific Computing

0 references

publication date

7 July 2016

0 references

full work available at URL

https://arxiv.org/abs/1503.07152

0 references

zbMATH Keywords

randomized approximation of matrices

0 references

rank-structured matrices

0 references

HODLR matrix

0 references

hierarchically block separable matrix

0 references

hierarchically semiseparable matrix

0 references

fast direct solver

0 references

author

Per-Gunnar Martinsson

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

An $\mathcal O(N\log N)$ fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation

0 references

Approximation of boundary element matrices

0 references

Hierarchical matrices. A means to efficiently solve elliptic boundary value problems

0 references

Efficient numerical methods for non-local operators. $\mathcal H^2$-matrix compression, algorithms and analysis.

0 references

Hybrid cross approximation of integral operators

0 references

Rang revealing QR factorizations

0 references

A fast adaptive solver for hierarchically semiseparable representations

0 references

On the Compression of Low Rank Matrices

0 references

Algorithm 832

0 references

Direct Methods for Sparse Linear Systems

0 references

Q4692656

0 references

Solving a large dense linear system by adaptive cross approximation

0 references

Nested Dissection of a Regular Finite Element Mesh

0 references

A Direct Solver with $O(N)$ Complexity for Variable Coefficient Elliptic PDEs Discretized via a High-Order Composite Spectral Collocation Method

0 references

A direct solver with $O(N)$ complexity for integral equations on one-dimensional domains

0 references

Q5689624

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

Data-sparse approximation by adaptive ${\mathcal H}^2$-matrices

0 references

Q4513819

0 references

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

0 references

Fast construction of hierarchical matrix representation from matrix-vector multiplication

0 references

A fast direct solver for a class of elliptic partial differential equations

0 references

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

0 references

Compressing Rank-Structured Matrices via Randomized Sampling

0 references

A fast direct solver for boundary integral equations in two dimensions

0 references

An Accelerated Kernel-Independent Fast Multipole Method in One Dimension

0 references

On interpolation and integration in finite-dimensional spaces of bounded functions

0 references

A randomized algorithm for the decomposition of matrices

0 references

Randomized Sparse Direct Solvers

0 references

Superfast Multifrontal Method for Large Structured Linear Systems of Equations

0 references

Fast algorithms for hierarchically semiseparable matrices

0 references

Identifiers

zbMATH Open document ID

1342.65211

0 references

DOI

10.1137/15M1016679

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5739955