Randomized block low-rank matrix compression by tagging (Q7293003)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Randomized block low-rank matrix compression by tagging

scientific article; zbMATH DE number 8220982

Language	Label	Description	Also known as
default for all languages	No label defined
English	Randomized block low-rank matrix compression by tagging	scientific article; zbMATH DE number 8220982

Statements

instance of

scholarly article

0 references

title

Randomized block low-rank matrix compression by tagging (English)

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Matrix Analysis and Applications

0 references

publication date

9 July 2026

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Improving multifrontal methods by means of block low-rank representations

0 references

Mixed precision low-rank approximations and their application to block low-rank LU factorization

0 references

Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides

0 references

On the complexity of the block low-rank multifrontal factorization

0 references

Performance and scalability of the block low-rank multifrontal factorization on multicore architectures

0 references

Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format

0 references

Parallel QR Factorization of Block Low-rank Matrices

0 references

Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR$^2$ Format

0 references

Mirror symmetry and toric degenerations of partial flag manifolds

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

A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations

0 references

On the Compression of Low Rank Matrices

0 references

Gravitational quantum cohomology.

0 references

Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation

0 references

Nested Dissection of a Regular Finite Element Mesh

0 references

Multilevel approximation of boundary integral operators

0 references

The analysis of a nested dissection algorithm

0 references

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

0 references

Stationary Phase Integrals, Quantum Toda Lattices, Flag Manifolds and the Mirror Conjecture

0 references

Q4917542

0 references

Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction

0 references

A fast algorithm for particle simulations

0 references

Q4356574

0 references

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

0 references

Hierarchical matrices: algorithms and analysis

0 references

Q4513819

0 references

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

0 references

Tau Functions and their Applications

0 references

Functions of Matrices

0 references

Solving block low-rank linear systems by LU factorization is numerically stable

0 references

A fast direct solver for structured linear systems by recursive skeletonization

0 references

Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic

0 references

Extensions of Lipschitz mappings into a Hilbert space

0 references

Moment curves and cyclic symmetry for positive Grassmannians

0 references

Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices

0 references

Randomized compression of rank-structured matrices accelerated with graph coloring

0 references

Fast construction of hierarchical matrix representation from matrix-vector multiplication

0 references

The $B$-model connection and mirror symmetry for Grassmannians

0 references

A fast direct solver for boundary integral equations in two dimensions

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

Randomized numerical linear algebra: Foundations and algorithms

0 references

A recursive skeletonization factorization based on strong admissibility

0 references

DetGB: a software package for computing Gröbner bases of determinantal ideals

0 references

GRASSMANNIANS AND CLUSTER ALGEBRAS

0 references

Practical sketching algorithms for low-rank matrix approximation

0 references

Superfast Multifrontal Method for Large Structured Linear Systems of Equations

0 references

Interpolative decomposition via proxy points for kernel matrices

0 references

A simplified fast multipole method based on strong recursive skeletonization

0 references

Randomized strong recursive skeletonization: simultaneous compression and Lu factorization of hierarchical matrices using matrix-vector products

0 references

SlabLU: a two-level sparse direct solver for elliptic PDEs

0 references

Identifiers

DOI

10.1137/25M175857X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Randomized block low-rank matrix compression by tagging