Image de couverture de livre

Algorithms and data structures for numerical computations with automatic precision estimation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Netay, Igor V.
Format:	Preprint
Publié:	2024
Sujets:	Numerical Analysis Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algorithms and data structures for automatic precision estimation of neural networks
par: Netay, Igor V.
Publié: (2025)

Hashing geographical point data using the space-filling H-curve
par: Netay, Igor V.
Publié: (2024)

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

On the Robustness of the Successive Projection Algorithm
par: Barbarino, Giovanni, et autres
Publié: (2024)

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)

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

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

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)

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

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)

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

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)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
par: Watanabe, Kazuki, et autres
Publié: (2024)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
par: Cai, Xufeng, et autres
Publié: (2025)

A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
par: Sanjoyo, B. A., et autres
Publié: (2025)

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

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

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

Algorithmic warm starts for Hamiltonian Monte Carlo
par: Zhang, Matthew S., et autres
Publié: (2026)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
par: Garg, Sachin, et autres
Publié: (2024)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
par: Jambulapati, Arun, et autres
Publié: (2024)

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

Quantum Realization of the Finite Element Method
par: Deiml, Matthias, et autres
Publié: (2024)

Quantum linear system algorithm with optimal queries to initial state preparation
par: Low, Guang Hao, et autres
Publié: (2024)

The matrix-vector complexity of $Ax=b$
par: Dereziński, Michał, et autres
Publié: (2026)

Internal versus external balancing in the evaluation of graph-based number types
par: Geppert, Hanna, et autres
Publié: (2019)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
par: Boahen, Edem, et autres
Publié: (2025)

Permutation-Avoiding FFT-Based Convolution
par: Venkovic, Nicolas, et autres
Publié: (2025)

Optimal Embedding Dimension for Sparse Subspace Embeddings
par: Chenakkod, Shabarish, et autres
Publié: (2023)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
par: Chenakkod, Shabarish, et autres
Publié: (2026)

Block Encoding of Sparse Matrices via Coherent Permutation
par: Setty, Abhishek
Publié: (2025)

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
par: Linares, Deijany Rodriguez, et autres
Publié: (2025)