Formal Verification of Exact Computations Using Newton’s Method
From MaRDI portal
Recommendations
- Formal proofs for theoretical properties of Newton's method
- Improved convergence theorems of Newton's method designed for the numerical verification for solutions of differential equations
- scientific article; zbMATH DE number 1263299
- Verification methods: rigorous results using floating-point arithmetic
- Formal Verification of Transcendental Fixed- and Floating-point Algorithms using an Automatic Theorem Prover
Cites work
- A proof of GMP square root
- Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
- Certified Exact Transcendental Real Number Computation in Coq
- Coinductive Formal Reasoning in Exact Real Arithmetic
- Computing with classical real numbers
- Formal verification of square root algorithms
- scientific article; zbMATH DE number 1670741 (Why is no real title available?)
- scientific article; zbMATH DE number 1259143 (Why is no real title available?)
- scientific article; zbMATH DE number 1979556 (Why is no real title available?)
- scientific article; zbMATH DE number 1746035 (Why is no real title available?)
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Mathematical Knowledge Management
- Modern computer arithmetic
- Nonstandard analysis in ACL2
- Real Number Calculations and Theorem Proving
Cited in
(3)
This page was built for publication: Formal Verification of Exact Computations Using Newton’s Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183542)
