Exact Real Arithmetic with Automatic Error

نویسندگان

  • Patrik Andersson
  • Erik Palmgren
چکیده

The common approach to real arithmetic on computers is floating point arithmetic, which can produce erroneous results due to roundoff errors. An alternative is exact real arithmetic and in this project such arithmetic is implemented in the well-known computer system Mathematica by the use of constructive real numbers. All basic operations are implemented as well as the common elementary functions and limits of general convergent sequences of real numbers. Also, as an application to ordinary differential equations, Euler’s method for solving initial value problems is implemented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preservation of Lyapunov-Theoretic Proofs: From Real to Floating-Point Arithmetic

In a paper, Feron presents how Lyapunovtheoretic proofs of stability can be migrated toward computer-readable and verifiable certificates of control software behavior by relying of Floyd’s and Hoare’s proof system. However, Lyapunov-theoretic proofs are addressed towards exact, real arithmetic and do not accurately represent the behavior of realistic programs run with machine arithmetic. We add...

متن کامل

Exact real arithmetic using centred intervals and bounded error terms

Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternativ...

متن کامل

Automatic differentiation as nonarchimedean analysis

It is shown how the techniques of automatic differentiation can be viewed in a broader context as an application of analysis on a nonarchimedean field. The rings used in automatic differentiation can be ordered in a natural way and form finite dimensional real algebras which contain infinitesimals. Some of these algebras can be extended to become a Cauchy-complete real-closed nonarchimedean fie...

متن کامل

Rigorous Error Analysis of Numerical Algorithms via Symbolic Computations

1. Introduction. Like the goal of combinatorial algorithms is to construct certain combinatorial objects by means of some elementary operations, the goal of numerical algorithms is to construct some real numbers by means of the four elementary arithmetic operations: addition, subtraction, multiplication and division. The diierence is that the set of real numbers is uncountable and as a conseque...

متن کامل

CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications

Many scientific computing applications demand massive numerical computations on parallel architectures such as Graphics Processing Units (GPUs). Usually, either floating-point single or double precision arithmetic is used. Higher precision is generally not available in hardware, and software extended precision libraries are much slower and rarely supported on GPUs. We develop CAMPARY: a multipl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001