Symbolic Algebraic Methods and Verification Methods
Published on 12. February 2001
Book
Paperback/Softback
IX, 266 pages
978-3-211-83593-7 (ISBN)
Description
The usual usual "implementation" "implementation" ofreal numbers as floating point numbers on exist- iing ng computers computers has the well-known disadvantage that most of the real numbers are not exactly representable in floating point. Also the four basic arithmetic operations can usually not be performed exactly. For numerical algorithms there are frequently error bounds for the computed approximation available. Traditionally a bound for the infinity norm is estima- ted using ttheoretical heoretical ccoonncceeppttss llike ike the the condition condition number number of of a a matrix matrix for for example. example. Therefore Therefore the error bounds are not really available in practice since their com- putation requires more or less the exact solution of the original problem. During the last years research in different areas has been intensified in or- der to overcome these problems. As a result applications to different concrete problems were obtained. The LEDA-library (K. Mehlhorn et al.) offers a collection of data types for combinatorical problems. In a series of applications, where floating point arith- metic fails, reliable results are delivered.
Interesting examples can be found in classical geometric problems. At the Imperial College in London was introduced a simple principle for "exact arithmetic with real numbers" (A. Edalat et al.), which uses certain nonlinear transformations. Among others a library for the effective computation of the elementary functions already has been implemented.
Interesting examples can be found in classical geometric problems. At the Imperial College in London was introduced a simple principle for "exact arithmetic with real numbers" (A. Edalat et al.), which uses certain nonlinear transformations. Among others a library for the effective computation of the elementary functions already has been implemented.
More details
Edition
Softcover reprint of the original 1st ed. 2001
Language
English
Place of publication
Vienna
Austria
Publishing group
Springer Wien
Target group
College/higher education
Professional and scholarly
Research
Illustrations
16 s/w Abbildungen
IX, 266 p. 16 illus.
Dimensions
Height: 244 mm
Width: 170 mm
Thickness: 16 mm
Weight
488 gr
ISBN-13
978-3-211-83593-7 (9783211835937)
DOI
10.1007/978-3-7091-6280-4
Schweitzer Classification
Content
Topological Concepts for Hierarchies of Variables, Types and Controls.- Modifications of the Oettli-Prager Theorem with Application to the Eigenvalue Problem.- Symbolic-Numeric Algorithms for Polynomials: Some Recent Results.- Symbolic-Numeric QD-Algorithms with Applications in Function Theory and Linear Algebra.- On the Isoefficiency of the Parallel Descartes Method.- Matrix Methods for Solving Algebraic Systems.- A Feasibility Result for Interval Gaussian Elimination Relying on Graph Structure.- Solution of Systems of Polynomial Equations by Using Bernstein Expansion.- Symbolic-Algebraic Computations in Modeling Language for Mathematical Programming.- Translation of Taylor Series into LFT Expansions.- Quasi Convex-Concave Extensions.- Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic.- Derivative-Based Sub division in Multi-dimensional Verified Gaussian Quadrature.- On the Shape of the Fixed Points of [f]([x]) = [A][x] + [b].- Exact Computation with leda_real - Theory and Geometrie Applications.- Numerical Verification Method for Solutions of Nonlinear Hyperbolic Equations.- Geometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th-Order ODEs.- Safe Numerical Error Bounds for Solutions of Nonlinear Elliptic Boundary Value Problems.- Fast Verification Algorithms in MATLAB.- The Linear Complementarity Problem with Interval Data.- Some Numerical Methods for Nonlinear Least Squares Problems.- A New Insight of the Shortley-Weller Approximation for Diriehlet Problems.- How Orthogonality is Lost in Krylov Methods.