Imagen de Portada

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Spielman, Daniel A., Teng, Shang-Hua
Formato:	Preprint
Publicado:	2003
Materias:	Data Structures and Algorithms Numerical Analysis F.2.1; G.1.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Smoothed Analysis of Interior-Point Algorithms: Condition Number
por: Dunagan, John, et al.
Publicado: (2003)

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
por: Sankar, Arvind, et al.
Publicado: (2003)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
por: Farfan, Angelo, et al.
Publicado: (2025)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
por: Bhattacharjee, Rajarshi, et al.
Publicado: (2023)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
por: Koiran, Pascal, et al.
Publicado: (2022)

Does block size matter in randomized block Krylov low-rank approximation?
por: Chen, Tyler, et al.
Publicado: (2025)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
por: Bhattacharjee, Rajarshi, et al.
Publicado: (2024)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
por: Koiran, Pascal, et al.
Publicado: (2024)

Stable Iterative Solvers for Ill-conditioned Linear Systems
por: Kalantzis, Vasileios, et al.
Publicado: (2025)

Entrywise Approximation for Matrix Inversion and Linear Systems
por: Ghadiri, Mehrdad, et al.
Publicado: (2025)

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
por: Kao, Ming-Yang, et al.
Publicado: (1999)

Debiasing Polynomial and Fourier Regression
por: Camaño, Chris, et al.
Publicado: (2025)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
por: Khoruzhii, Kirill, et al.
Publicado: (2025)

Fast Approximate Determinants Using Rational Functions
por: Colthurst, Thomas, et al.
Publicado: (2024)

Deterministic complexity analysis of Hermitian eigenproblems
por: Sobczyk, Aleksandros
Publicado: (2024)

Invariant subspaces and PCA in nearly matrix multiplication time
por: Sobczyk, Aleksandros, et al.
Publicado: (2023)

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
por: Shao, Xuancheng, et al.
Publicado: (2007)

Faster Linear Algebra Algorithms with Structured Random Matrices
por: Camaño, Chris, et al.
Publicado: (2025)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
por: Gillman, David, et al.
Publicado: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
por: Bläsius, Thomas, et al.
Publicado: (2024)

Unsplittable Multicommodity Flows in Outerplanar Graphs
por: Alemán-Espinosa, David, et al.
Publicado: (2025)

Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra
por: Meyer, Raphael A., et al.
Publicado: (2025)

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

Model-Based Learning of Whittle indices
por: Charles-Rebuffé, Joël, et al.
Publicado: (2025)

Selective algorithm processing of subset sum distributions
por: Dawes, Nick
Publicado: (2024)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
por: Andersson, Joel, et al.
Publicado: (2026)

An O(nlogn) approximate knapsack algorithm
por: Dawes, Nick
Publicado: (2025)

When Votes Change and Committees Should (Not)
por: Bredereck, Robert, et al.
Publicado: (2020)

Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation
por: Meyer, Raphael A., et al.
Publicado: (2023)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
por: Li, Yifei
Publicado: (2024)

Beating Meet-in-the-Middle for Subset Balancing Problems
por: Randolph, Tim, et al.
Publicado: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
por: Randolph, Tim, et al.
Publicado: (2024)

Generating Signed Permutations by Twisting Two-Sided Ribbons
por: Yuan, et al.
Publicado: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

Reserve Matching with Thresholds
por: Evren, Suat
Publicado: (2023)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
por: Kwok, Tsz Chiu, et al.
Publicado: (2025)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
por: Salas, Jesus
Publicado: (2025)

Pop Stacks with a Bypass
por: Cioni, Lapo, et al.
Publicado: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
por: Bushnell, Brian
Publicado: (2026)