Abstract
This article studies the effective convergence of numerical solutions of initial value problems (IVPs) for ordinary differential equations (ODEs). A convergent sequence {Ym} of numerical solutions is said to be effectively convergent to the exact solution if there is an algorithm that computes an N ∈ ℕ, given an arbitrary n ∈ ℕ as input, such that the error between Ym and the exact solution is less than 2-n for all m ≥ N. It is proved that there are convergent numerical solutions generated from Euler’s method which are not effectively convergent. It is also shown that a theoretically-proved-computable solution using Picard’s iteration method might not be computable by classical numerical methods, which suggests that sometimes there is a gap between theoretical computability and practical numerical computations concerning solutions of ODEs. Moreover, it is noted that the main theorem (Theorem 4.1) provides an example of an IVP with a nonuniform Lipschitz function for which the numerical solutions generated by Euler’s method are still convergent.
- O. Aberth. 1970. Computable analysis and differential equations. In Intuitionism and Proof Theory, A. Kino, J. Myhill, and R. E. Vesley Eds., Studies in Logic and the Foundations of Mathematics, North-Holland, 47--52.Google Scholar
- K. E. Atkinson, W. Han, and D. E. Stewart. 2009. Numerical Solutions of Ordinary Differential Equations. John Wiley & Sons, Inc., Hoboken, NJ.Google Scholar
- D. S. Graça, N. Zhong, and J. Buescu. 2009. Computability, noncomputability and undecidability of maximal intervals of IVPs. Trans. Amer. Math. Soc. 361, 6 (2009), 2913--2927.Google Scholar
Cross Ref
- A. Kawamura. 2010. Lipschitz continuous ordinary differential equations are polynomial-space complete. Comput. Complex. 19, 2, 305--332. Google Scholar
Digital Library
- A. Kawamura, H. Ota, C. Rösnick, and M. Ziegler. 2012. Computational complexity of smooth differential equations. In Proceedings of the 37th International Symposium on Mathematical Foundations on Computer Science. Lecture Notes in Computer Science, vol. 7464. Springer-Verlag, Berlin Heidelberg, 578--589. Google Scholar
Digital Library
- K.-I. Ko. 1983. On the computational complexity of ordinary differential equations. Inform. Control 58, 1--3, 157--194. Google Scholar
Digital Library
- K.-I. Ko. 1991. Computational Complexity of Real Functions. Birkhauser Boston, MA. Google Scholar
Digital Library
- Adam M. Oberman. 2008. An explicit solution of the Lipschitz extension problem. Proc. Amer. Math. Soc. 136, 12, 4329--4338.Google Scholar
Cross Ref
- M. B. Pour-El and J. I. Richards. 1979. A computable ordinary differential equation which possesses no computable solution. Ann. Math. Logic 17, 1--2, 61--90.Google Scholar
Cross Ref
- M. B. Pour-El and J. I. Richards. 1989. Computability in Analysis and Physics. Springer-Verlag, Berlin.Google Scholar
- R. Rettinger, K. Weihrauch, and N. Zhong. 2009. Topological complexity of blowup problems. J. Univ. Comput. Sci. 15, 6, 1301--1316.Google Scholar
- K. Ruohonen. 1996. An effective Cauchy-Peano existence theorem for unique solutions. Int. J. Found. Comput. Sci. 7, 2 (1996), 151--160.Google Scholar
Cross Ref
- M. Sipser. 1997. Introduction to the Theory of Computation. PWS Publishing Company. Google Scholar
Digital Library
- K. Weihrauch. 2000. Computable Analysis. Springer-Verlag, Berlin. Google Scholar
Digital Library
Index Terms
On Effective Convergence of Numerical Solutions for Differential Equations
Recommendations
Numerical solution of distributed order fractional differential equations
In this paper a method for the numerical solution of distributed order FDEs (fractional differential equations) of a general form is presented. The method applies to both linear and nonlinear equations. The Caputo type fractional derivative is employed. ...
An approximate method for numerical solution of fractional differential equations
Fractional calculus applications in signals and systemsThis paper presents a numerical solution scheme for a class of fractional differential equations (FDEs). In this approach, the FDEs are expressed in terms of Caputo type fractional derivative. Properties of the Caputo derivative allow one to reduce the ...
Sylvester Equations and the numerical solution of partial fractional differential equations
We develop a new matrix-based approach to the numerical solution of partial differential equations (PDE) and apply it to the numerical solution of partial fractional differential equations (PFDE). The proposed method is to discretize a given PFDE as a ...






Comments