:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Saak, Jens, Schulze, Jonas
Format:	Preprint
Published:	2023
Subjects:	Numerical Analysis Data Structures and Algorithms Performance
Online Access:	https://arxiv.org/abs/2307.06305
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)

Query Efficient Structured Matrix Learning
by: Amsel, Noah, et al.
Published: (2025)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Finer-Grained Hardness of Kernel Density Estimation
by: Alman, Josh, et al.
Published: (2024)

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
by: Lai, Peiyao, et al.
Published: (2024)

RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
by: Dehghankar, Mohsen, et al.
Published: (2026)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
by: Dereziński, Michał, et al.
Published: (2024)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026)

FRSZ2 for In-Register Block Compression Inside GMRES on GPUs
by: Grützmacher, Thomas, et al.
Published: (2024)

Virtual-Memory Powersort
by: Moltmann, Finn, et al.
Published: (2026)

Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)

Less is More: Faster Maximum Clique Search by Work-Avoidance
by: Vandierendonck, Hans
Published: (2025)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)

Optimal Embedding Dimension for Sparse Subspace Embeddings
by: Chenakkod, Shabarish, et al.
Published: (2023)

The matrix-vector complexity of $Ax=b$
by: Dereziński, Michał, et al.
Published: (2026)

Internal versus external balancing in the evaluation of graph-based number types
by: Geppert, Hanna, et al.
Published: (2019)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
by: Boahen, Edem, et al.
Published: (2025)

Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
by: Watanabe, Kazuki, et al.
Published: (2024)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
by: Chenakkod, Shabarish, et al.
Published: (2026)

On the Robustness of the Successive Projection Algorithm
by: Barbarino, Giovanni, et al.
Published: (2024)