Skip to Main content Skip to Navigation
Conference papers

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving

Abstract : Real complexity theory is a resource-bounded refinement of computable analysis and provides a realistic notion of running time of computations over real numbers, sequences, and functions by relying on Turing machines to handle approximations of arbitrary but guaranteed absolute error. Classical results in real complexity show that important numerical operators can map polynomial time computable functions to functions that are hard for some higher complexity class like NP or #P. Restricted to analytic functions, however, those operators map polynomial time computable functions again to polynomial time computable functions. Recent work by Kawamura, Müller, Rösnick and Ziegler discusses how to extend this to uniform algorithms on one-dimensional analytic functions over simple compact domains using second-order and parameterized complexity. In this paper, we extend some of their results to the case of multidimensional analytic functions. We further use this to show that the operator mapping an analytic ordinary differential equations to its solution is computable in parameterized polynomial time. Finally, we discuss how the theory can be used as a basis for verified exact numerical computation with analytic functions and provide a prototypical implementation in the iRRAM C++ framework for exact real arithmetic.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-02019142
Contributor : Florian Steinberg <>
Submitted on : Thursday, February 14, 2019 - 1:08:37 PM
Last modification on : Thursday, July 8, 2021 - 3:50:18 AM

Identifiers

Citation

Akitoshi Kawamura, Florian Steinberg, Holger Thies. Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. Wollic 2018 - International Workshop on Logic, Language, Information, and Computation, Jul 2018, Bogota, Colombia. pp.223-236, ⟨10.1007/978-3-662-57669-4_13⟩. ⟨hal-02019142⟩

Share

Metrics

Record views

250