Image de couverture de livre

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kao, Ming-Yang, Wang, Jie
Format:	Preprint
Publié:	1999
Sujets:	Data Structures and Algorithms Numerical Analysis G.1; F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
par: Spielman, Daniel A., et autres
Publié: (2006)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
par: Farfan, Angelo, et autres
Publié: (2025)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
par: Spielman, Daniel A., et autres
Publié: (2003)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
par: Dunagan, John, et autres
Publié: (2003)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
par: Bhattacharjee, Rajarshi, et autres
Publié: (2023)

Stable Iterative Solvers for Ill-conditioned Linear Systems
par: Kalantzis, Vasileios, et autres
Publié: (2025)

Fast Approximate Determinants Using Rational Functions
par: Colthurst, Thomas, et autres
Publié: (2024)

Entrywise Approximation for Matrix Inversion and Linear Systems
par: Ghadiri, Mehrdad, et autres
Publié: (2025)

Debiasing Polynomial and Fourier Regression
par: Camaño, Chris, et autres
Publié: (2025)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
par: Bhattacharjee, Rajarshi, et autres
Publié: (2024)

Faster Linear Algebra Algorithms with Structured Random Matrices
par: Camaño, Chris, et autres
Publié: (2025)

Does block size matter in randomized block Krylov low-rank approximation?
par: Chen, Tyler, et autres
Publié: (2025)

Deterministic complexity analysis of Hermitian eigenproblems
par: Sobczyk, Aleksandros
Publié: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
par: Sobczyk, Aleksandros, et autres
Publié: (2023)

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
par: Hofman, Radoslaw
Publié: (2006)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
par: Shao, Xuancheng, et autres
Publié: (2007)

Model-Based Learning of Whittle indices
par: Charles-Rebuffé, Joël, et autres
Publié: (2025)

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
par: Sankar, Arvind, et autres
Publié: (2003)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
par: Koiran, Pascal, et autres
Publié: (2022)

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
par: Dreier, Jan, et autres
Publié: (2026)

Approximation Algorithms for Correlated Knapsack Orienteering
par: Espinosa, David Aleman, et autres
Publié: (2024)

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

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

Sequential Diversification with Provable Guarantees
par: Wang, Honglian, et autres
Publié: (2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra
par: Meyer, Raphael A., et autres
Publié: (2025)

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
par: Marot-Lassauzaie, Marc, et autres
Publié: (2025)

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

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
par: Koiran, Pascal, et autres
Publié: (2024)

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

Better Approximation for Weighted $k$-Matroid Intersection
par: Singer, Neta, et autres
Publié: (2024)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Oblivious Subspace Injection Is Not Enough for Relative Error
par: Townsend, Alex, et autres
Publié: (2026)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
par: Gillman, David, et autres
Publié: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
par: Bläsius, Thomas, et autres
Publié: (2024)

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

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