Self-verified extension of affine arithmetic to arbitrary order

MaRDI QIDQ3645583zbMATH OpenFDO

Authors Giuseppe Bilotta

Publication date 18 November 2009

Full work available at URL http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/47

zbMATH Keywords

computational complexitylinear systemsinterval arithmeticquadratic formsself-verificationaffine arithmeticpolynomial arithmeticdependency problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Linear equations (linear algebraic aspects) (15A06) Quadratic and bilinear forms, inner products (15A63) Interval and finite arithmetic (65G30) Algorithms with automatic result verification (65G20)

Recommendations

• An Introduction to Affine Arithmetic
• Affine arithmetic: concepts and applications
• scientific article; zbMATH DE number 1408651
• Modified affine arithmetic is more accurate than centered interval arithmetic or affine arithmetic
• Affine arithmetic and applications to real-number proving

Cited in

(7)

• Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
• Polar affine arithmetic: optimal affine approximation and operation development for computation in polar form under uncertainty
• Reducing the truncation error in Taylor model multiplication
• A generalization of \(p\)-boxes to affine arithmetic
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Affine arithmetic: concepts and applications
• scientific article; zbMATH DE number 5693751 (Why is no real title available?)

This page was built for publication: Self-verified extension of affine arithmetic to arbitrary order

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