Rigorous error analysis of numerical algorithms via symbolic computations

DOI10.1006/JSCO.1996.0061MaRDI QIDQ674759zbMATH OpenOpenAlexFDO

Authors Marian Mrozek

Publication date 26 August 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/03b10df2e9d24c400e3eec14fa1b63c30cb29bcd

zbMATH Keywords

error boundsinterval arithmeticsymbolic calculusRunge-Kutta methodchaos in the Lorenz equationMATHEMATICA

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Roundoff error (65G50)

Recommendations

• Tight Error Analysis in Fixed-Point Arithmetic
• Tight Error Analysis in Fixed-point Arithmetic
• scientific article; zbMATH DE number 177898
• scientific article; zbMATH DE number 3885200
• Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions
• USING NONSTANDARD ANALYSIS TO ENSURE THE CORRECTNESS OF SYMBOLIC COMPUTATIONS
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 503391
• scientific article; zbMATH DE number 2068203

Cited in

(6)

• A Priori Error Analysis and Spring Arithmetic
• Tight Error Analysis in Fixed-point Arithmetic
• Semantics of roundoff error propagation in finite precision calculations
• Runge-Kutta methods for quadratic ordinary differential equations
• scientific article; zbMATH DE number 3858303 (Why is no real title available?)
• Rigorous error bounds for RK methods in the proof of chaotic behaviour

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Rigorous error analysis of numerical algorithms via symbolic computations

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