Self-validating Numerics for Function Space Problems: Computation with Guarantees for Differential and Integral EquationsMathematics of Computing -- Numerical Analysis. |
Contents
Suggestions to the Reader | 8 |
Ultraarithmetic and Roundings | 28 |
4 | 38 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
a₁ accuracy algebraic analogous ansatz approximation arithmetic b₁ Banach space Bernstein polynomials boundary conditions boundary-value problem Chapter Chebyshev rounding coefficient space column components constraints correct digits corresponding cx² data types defined denote directed rounding employ error example finite fixed point theorem floating-point floating-point numbers function space functional equation Hilbert space implementation inclusion integral equation interval functoid IRC process IRN(PM isomorphic isomorphic representation isotonic m₁ mantissa mantissa length mapping matrix mean value theorem methodology methods monomials nonlinear number of correct numerical analysis obtained particular Polynomial Basis polynomials relative rounding replaced resp RN(M rounding operator S₂ screen self-validating semimorphism sequence SN(M solution solve spline spline basis subspace Table Taylor rounding tion ultra-arithmetic v₁ validation values vector Vi+1 X₁ Y₁ Zk+1
References to this book
Scientific Computing with Automatic Result Verification Ernst Adams,Ulrich Kulisch No preview available - 1993 |