Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Mukundan, K. Ko, T. Maekawa, T. Sakkalis, N. Patrikalakis (2004)
Tracing surface intersections with validated ODE system solver
石井 大輔 (2010)
Simulation and verification of hybrid systems based on interval analysis and constraint programming
(2006)
Gaol: Not just another interval library (version 2.0.2)
N. Nedialkov (2006)
Interval Tools for ODEs and DAEs12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)
N. Nedialkov, K. Jackson, G. Corliss (1999)
Validated solutions of initial value problems for ordinary differential equationsAppl. Math. Comput., 105
Daisuke Ishii (2010)
Simulation and Verication of Hybrid Systems Based on Interval Analysis and Constraint Programming
R. Barnhill, G. Farin, Michael Jordan, Bruce Piper (1987)
Surface/surface intersectionComput. Aided Geom. Des., 4
W. Hayes, K. Jackson (2003)
Rigorous Shadowing of Numerical Solutions of Ordinary Differential Equations by ContainmentSIAM J. Numer. Anal., 41
N. Nedialkov, K. Jackson (1999)
An Interval Hermite-Obreschkoff Method for Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential EquationReliable Computing, 5
Ole Stauning, K. Madsen (1997)
Automatic Validation of Numerical Solutions
D. Achlioptas (1999)
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
A. Moore, C. Payne (1996)
Increasing assurance with literate programming techniquesProceedings of 11th Annual Conference on Computer Assurance. COMPASS '96
D. Knuth (1983)
The WEB system of structured documentation
N. Ramdani, N. Meslem, T. Raïssi, Y. Candau (2006)
Set-Membership Identification of Continuous-Time SystemsIFAC Proceedings Volumes, 39
M. Lerch, German Tischler, J. Gudenberg, Werner Hofschuster, W. Krämer (2006)
FILIB++, a fast interval library supporting containment computationsACM Trans. Math. Softw., 32
(1997)
COSY INFINITY version 8 reference manual
M. Kieffer, E. Walter (2003)
Nonlinear Parameter and State Estimation for Cooperative Systems in a Bounded-Error Context
Joachim Schrod (1995)
The cweb Class
D. Parnas (2001)
Inspection of Safety-Critical Software Using Program-Function Tables
B. Brown, M. Langer, M. Marletta, C. Tretter, Markus Wagenhofer (2003)
Eigenvalue bounds for the singular Sturm–Liouville problem with a complex potentialJournal of Physics A: Mathematical and General, 36
E. Auer, A. Kecskeméthy, M. Tändl, H. Traczinski (2003)
Interval Algorithms in Modeling of Multibody Systems
A. Neumaier (1990)
Interval methods for systems of equations
Robin Cohen, Martha E~ens (1987)
The Finite String Newsletter: Calendar of Meetings
S. Rump (2010)
Verification methods: rigorous results using floating-point arithmeticActa Numerica, 19
M. Pharr, G. Humphreys (2004)
Physically Based Rendering: From Theory to Implementation
N. Nedialkov (1999)
Computing rigorous bounds on the solution of an initial value problem for an ordinary differential equation
D. Knuth (1984)
Literate Programming, 27
K. Jackson, N. Nedialkov (2002)
Some recent advances in validated methods for IVPs for ODEsApplied Numerical Mathematics, 42
(2002)
The design and implementation of a validated objectoriented solver for IVPs for ODEs
Chih-Kuo Lee (2005)
Robust evaluation of differential geometry properties using interval arithmetic techniques
O. Knüppel (1994)
PROFIL/BIAS—A fast interval libraryComputing, 53
Lisa Smith, M. Samadzadeh (1991)
An annotated bibliography of literate programmingACM SIGPLAN Notices, 26
Youdong Lin, M. Stadtherr (2006)
Validated Solution of Initial Value Problems for ODEs with Interval Parameters
(2006)
Gaol: Not just another interval library (version 2.0.2). http://sourceforge.net/projects
N. Patrikalakis, T. Maekawa, K. Ko, H. Mukundan (2004)
Surface to Surface IntersectionsComputer-aided Design and Applications, 1
R. Lohner (1988)
Einschliessung der Lösung gewöhnlicher Anfangs- und Randwertaufgaben und Anwendungen
(2003)
FADBAD++ web page
Andrew Johnson, Brad Johnson (1997)
Literate Programming Using NowebLinux Journal, 1997
[Interval numerical methods produce results that can have the power of a mathematical proof. Although there is a substantial amount of theoretical work on these methods, little has been done to ensure that an implementation of an interval method can be readily verified. However, when claiming rigorous numerical results, it is crucial to ensure that there are no errors in their computation. Furthermore, when such a method is used in a computer assisted proof, it would be desirable to have its implementation published in a form that is convenient for verification by human experts. We have applied Literate Programming (LP) to produce VNODE-LP, a C++ solver for computing rigorous bounds on the solution of an initial-value problem (IVP) for an ordinary differential equation (ODE).We have found LP well suited for ensuring that an implementation of a numerical algorithm is a correct translation of its underlying theory into a programming language: we can split the theory into small pieces, translate each of them, and keep mathematical expressions and the corresponding code close together in a unified document. Then it can be reviewed and checked for correctness by human experts, similarly to how a scientific work is examined in a peer-review process.]
Published: May 13, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.