Skip to Main content Skip to Navigation
Journal articles

Ultimate complexity for numerical algorithms

Abstract : Most numerical algorithms are designed for single or double precision oating point arithmetic, and their complexity is measured in terms of the total number of oating point operations. The resolution of problems with high condition numbers (e.g. when approaching a singularity or degeneracy) may require higher working precisions, in which case it is important to take the precision into account when doing complexity analyses. In this paper, we propose a new \ultimate complexity" model, which focuses on analyzing the cost of numerical algorithms for \suciently large" precisions. As an example application we will present an ultimately softly linear time algorithm for modular composition of univariate polynomials.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-03013416
Contributor : Joris van der Hoeven <>
Submitted on : Monday, November 23, 2020 - 11:03:56 AM
Last modification on : Saturday, November 28, 2020 - 7:02:50 PM

File

ucomplexity-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Joris van der Hoeven, Grégoire Lecerf. Ultimate complexity for numerical algorithms. ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2020, 54 (1), pp.1-13. ⟨10.1145/3419048.3419049⟩. ⟨hal-03013416⟩

Share

Metrics

Record views

24

Files downloads

107