Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving

DOI10.1007/978-3-662-57669-4_13MaRDI QIDQ1799286zbMATH OpenOpenAlexFDO

Authors Akitoshi Kawamura, Florian Steinberg, Holger Thies

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-662-57669-4_13

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Computation over the reals, computable analysis (03D78) Real-analytic functions (26E05) Analytical theory of ordinary differential equations: series, transformations, transforms, operational calculus, etc. (34A25) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Solving analytic differential equations in polynomial time over unbounded domains
• Complexity theory for operators in analysis
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Complexity theory for operators in analysis
• Computational complexity of solving polynomial differential equations over unbounded domains

Cited in

(13)

• Computational complexity of classical solutions of partial differential equations
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• Primitive recursive ordered fields and some applications
• Parametrised second-order complexity theory with applications to the study of interval computation
• Primitive recursive ordered fields and some applications
• Computable analysis and notions of continuity in \textsc{Coq}
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Axiomatic reals and certified efficient exact real computation
• Computability of Differential Equations
• Quantitative continuity and Computable Analysis in Coq
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Parametrized uniform complexity of computation in geometry and numerics

Describes a project that uses

Uses Software

• iRRAM

This page was built for publication: Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799286)