:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Geppert, Hanna, Wilhelm, Martin
Format:	Preprint
Publié:	2019
Sujets:	Computational Geometry Data Structures and Algorithms Numerical Analysis
Accès en ligne:	https://arxiv.org/abs/1904.02034
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Balancing expression dags for more efficient lazy adaptive evaluation
par: Wilhelm, Martin
Publié: (2017)

Quasi-Monte Carlo Beyond Hardy-Krause
par: Bansal, Nikhil, et autres
Publié: (2024)

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

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
par: Doney, Kyle, et autres
Publié: (2025)

A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
par: Romano, Fabio
Publié: (2024)

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

Stochastic Rounding 2.0, with a View towards Complexity Analysis
par: Drineas, Petros, et autres
Publié: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
par: Chen, Tyler
Publié: (2024)

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

Near-optimal hierarchical matrix approximation from matrix-vector products
par: Chen, Tyler, et autres
Publié: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
par: Musco, Cameron, et autres
Publié: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
par: Amsel, Noah, et autres
Publié: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
par: Chen, Tyler, et autres
Publié: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
par: Bentert, Matthias, et autres
Publié: (2025)

Fixed-sparsity matrix approximation from matrix-vector products
par: Amsel, Noah, et autres
Publié: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
par: Balabanov, Oleg, et autres
Publié: (2022)

Analysis of Different Algorithmic Design Techniques for Seam Carving
par: Aijaz, Owais, et autres
Publié: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
par: Kapralov, Michael, et autres
Publié: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
par: Larsen, Brett W., et autres
Publié: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
par: Malik, Osman Asif, et autres
Publié: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
par: Mango, John M., et autres
Publié: (2025)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
par: Musco, Cameron, et autres
Publié: (2024)

Finer-Grained Hardness of Kernel Density Estimation
par: Alman, Josh, et autres
Publié: (2024)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
par: Jennings, David, et autres
Publié: (2025)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
par: Saak, Jens, et autres
Publié: (2023)

Restructuring expression dags for efficient parallelization
par: Wilhelm, Martin
Publié: (2018)

Computing crossing numbers with topological and geometric restrictions
par: Hamm, Thekla, et autres
Publié: (2024)

GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
par: Chen, Tyler, et autres
Publié: (2025)

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

A Reexamination of the COnfLUX 2.5D LU Factorization Algorithm
par: Tang, Yuan
Publié: (2024)

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

Parallel GPU-Accelerated Randomized Construction of Approximate Cholesky Preconditioners
par: Liang, Tianyu, et autres
Publié: (2025)

On computing and the complexity of computing higher-order $U$-statistics, exactly
par: Chen, Xingyu, et autres
Publié: (2025)

On error representation in exact-decisions number types
par: Wilhelm, Martin
Publié: (2018)

Local Routing on Ordered $Θ$-graphs
par: van Renssen, André, et autres
Publié: (2025)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Dynamic parameterized problems on unit disk graphs
par: An, Shinwoo, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

A face cover perspective to $\ell_1$ embeddings of planar graphs
par: Filtser, Arnold
Publié: (2019)