Computational algorithms for ordinary differential equations (ResearchIndex)

Computational algorithms for ordinary differential equations (1999) (Make Corrections)
Warwick Tucker

View or download:
math.uu.se/~warwick/papers/iv1.ps
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  math.uu.se/~warwick/papers (more)
Homepages:  W.Tucker  HPSearch  (Update Links)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: We present an algorithm for computing rigorous solutions to a large class of ordinary dierential equations. The main algorithm is based on a partitioning process and the use of interval arithmetic. We illustrate the presented method by computing solution sets for two explicit systems. 1 Introduction In this paper, we will consider a general initial value problem: _ x = f(x); x(0) = x 0 ; (1) where f 2 C 1 (D; R n ), and D R n . We will sometimes denote the solution of (1) by '(x;... (Update)

Active bibliography (related documents): More All
0.5: The design and implementation of an object-oriented.. - Nedialko Nedialkov.. (Correct)
0.0: Interpolation That Leads To The Narrowest Intervals, And.. - Hung Nguyen Vladik (1992) (Correct)
0.0: Solving Algebraic Systems using Matrix Computations - Manocha, Krishnan (1996) (Correct)

Similar documents based on text: More All
0.2: On The Relation Between Bundle Methods For Maximal.. - Sagastizábal.. (Correct)
0.2: A Comparison of Rates of Convergence of Two Inexact Proximal .. - Solodov, Svaiter (2000) (Correct)
0.1: A Truly Globally Convergent Newton-Type Method For The.. - Solodov, Svaiter (2000) (Correct)

BibTeX entry: (Update)

@misc{ tucker-computational,
  author = "Warwick Tucker",
  title = "Computational algorithms for ordinary differential equations",
  url = "citeseer.nj.nec.com/tucker99computational.html" }

Citations (may not include all citations):
23 SIAM Studies in Applied Mathematics (context) - Moore, Applications et al. - 1979
2 ODE Software that Computes Guaranteed Bounds on the Solution - Nedialkov, Jackson - 1999
1 ericos auto-validados e aplicac~oes (context) - de Figueiredo, Stol et al. - 1997
1 Prentice-Hall Series in Automatic Computation (context) - Moore, Analysis - 1966

Documents on the same site (http://www.math.uu.se/~warwick/papers.html): More
Non-Uniformly Expanding Dynamics in Maps With Singularities.. - Luzzatto, Tucker (Correct)
Transitivity of Lorenz-like Maps and the Tired Baker's Map - Warwick Tucker September (Correct)
Rigorous Models for the Lorenz Equations - Tucker (1996) (Correct)

Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback