Copertina

Smoothed Analysis of Interior-Point Algorithms: Condition Number

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dunagan, John, Spielman, Daniel A., Teng, Shang-Hua
Natura:	Preprint
Pubblicazione:	2003
Soggetti:	Data Structures and Algorithms Numerical Analysis F.2.1; G.1.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
di: Spielman, Daniel A., et al.
Pubblicazione: (2003)

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

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

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

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

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

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

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

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

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

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

Deterministic complexity analysis of Hermitian eigenproblems
di: Sobczyk, Aleksandros
Pubblicazione: (2024)

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

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

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

Approximation Algorithms for Correlated Knapsack Orienteering
di: Espinosa, David Aleman, et al.
Pubblicazione: (2024)

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

Better Approximation for Weighted $k$-Matroid Intersection
di: Singer, Neta, et al.
Pubblicazione: (2024)

Flexible Quaternion Generalized Minimal Residual Method for Ill-Posed Quaternion Inverse Problems
di: Liu, Xuan, et al.
Pubblicazione: (2024)

Exact Computation of the Catalan Number $C(2,050,572,903)$
di: Ramani, Mahesh
Pubblicazione: (2026)

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

Column-generation for a two-dimensional multi-criteria bin-packing problem
di: Groschke, Christof, et al.
Pubblicazione: (2025)

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

Succinct QUBO formulations for permutation problems by sorting networks
di: Friedl, Katalin, et al.
Pubblicazione: (2026)

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

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

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

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
di: Marot-Lassauzaie, Marc, et al.
Pubblicazione: (2025)

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

A Hardware Accelerator for the Goemans-Williamson Algorithm
di: Herrera-Martí, D. A., et al.
Pubblicazione: (2025)

Selective algorithm processing of subset sum distributions
di: Dawes, Nick
Pubblicazione: (2024)

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

An O(nlogn) approximate knapsack algorithm
di: Dawes, Nick
Pubblicazione: (2025)

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

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

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

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

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
di: Hartman, Samuel, et al.
Pubblicazione: (2024)

Two Iterative Algorithms for Solving Systems of Simultaneous Linear Algebraic Equations with Real Matrices of Coefficients
di: Kondratiev, A. S., et al.
Pubblicazione: (2005)