Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures

DOI10.1007/978-3-642-32621-9_17zbMath1362.03039OpenAlexW27283509MaRDI QIDQ2915030

Amin Farjudian

Publication date: 21 September 2012

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32621-9_17

zbMATH Keywords

computational complexityinitial value problemapproximation theoryChebyshev seriesPicard's methodcomputable analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Constructive and recursive analysis (03F60) Computation over the reals, computable analysis (03D78)

Related Items (1)

Computability of Differential Equations

Uses Software

• Chebfun

This page was built for publication: Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures