:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autore principale:	Wilhelm, Martin
Natura:	Preprint
Pubblicazione:	2017
Soggetti:	Computational Geometry Data Structures and Algorithms Numerical Analysis
Accesso online:	https://arxiv.org/abs/1710.04576
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Restructuring expression dags for efficient parallelization
di: Wilhelm, Martin
Pubblicazione: (2018)

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

Quasi-Monte Carlo Beyond Hardy-Krause
di: Bansal, Nikhil, et al.
Pubblicazione: (2024)

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
di: Vershynin, Roman
Pubblicazione: (2007)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
di: Doney, Kyle, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Balanced TSP partitioning
di: Berendsohn, Benjamin Aram, et al.
Pubblicazione: (2025)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
di: Saak, Jens, et al.
Pubblicazione: (2023)

A Monte Carlo algorithm for efficient large matrix inversion
di: Garcia-Cortes, L. A., et al.
Pubblicazione: (2004)

Finding maximum matchings in RDV graphs efficiently
di: Biedl, Therese, et al.
Pubblicazione: (2024)

GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
di: Chen, Tyler, et al.
Pubblicazione: (2025)

On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System
di: Mackarov, Igor
Pubblicazione: (2006)

A Reexamination of the COnfLUX 2.5D LU Factorization Algorithm
di: Tang, Yuan
Pubblicazione: (2024)

A Reexamination of the Communication Bandwidth Cost Analysis of A Parallel Recursive Algorithm for Solving Triangular Systems of Linear Equations
di: Tang, Yuan
Pubblicazione: (2024)

Parallel GPU-Accelerated Randomized Construction of Approximate Cholesky Preconditioners
di: Liang, Tianyu, et al.
Pubblicazione: (2025)

On computing and the complexity of computing higher-order $U$-statistics, exactly
di: Chen, Xingyu, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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