Scientists concerned with the interaction between computer arithmetic, programming languages and scientific computing will be particularly interested in this book. It focuses on papers presented at the conference and highlights the increasing impact of SCAN-91 in this area. The volume contains original research and expository articles on the field of interaction between computer arithmetic and its realization in programming languages and the construction and investigation of numerical algorithms for computing guaranteed error-bounds for the solution of various problems in applied mathematics and engineering. Main subjects are: software tools for enclosure algorithms and inclusion methods with the help of interval arithmetic, in particular for the numerical solution of differential equations.
Notes and Reports in Mathematics in Science and Engineering, Volume VII: Computer Arithmetic and Self-Validating Numerical Methods compiles papers presented at the first international conference on "Computer Arithmetic and Self-Validating Numerical Methods, held in Basel from October 2 to 6, 1989. This book begins by providing a tutorial introduction to computer arithmetic with operations of maximum accuracy, differentiation arithmetic and enclosure methods, and programming languages for self-validating numerical methods. The rest of the chapters discuss the determination of guaranteed bounds for eigenvalues by variational methods and guaranteed inclusion of solutions of differential equations. An appendix covering the IMACS-GAMM resolution on computer arithmetic is provided at the end of this publication. This volume is recommended for researchers and professionals working on computer arithmetic and self-validating numerical methods.
This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic and mathematical capability of the digital computer can be enhanced in a quite natural way. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties of these models are extracted into an axiomatic approach which leads to a general theory of computer arithmetic. Detailed methods and circuits for the implementation of this advanced computer arithmetic on digital computers are developed in part two of the book. Part three then illustrates by a number of sample applications how this extended computer arithmetic can be used to compute highly accurate and mathematically verified results. The book can be used as a high-level undergraduate textbook but also as reference work for research in computer arithmetic and applied mathematics.
Enclosure methods and their applications have been developed to a high standard during the last decades. These methods guarantee the validity of the computed results. This means they are of the same standard as the rest of mathematics. The book deals with a wide variety of aspects of enclosure methods. All contributions follow the common goal to push the limits of enclosure methods forward. Topics that are treated include basic questions of arithmetic, proving conjectures, bounds for Krylow type linear system solvers, bounds for eigenvalues, the wrapping effect, algorithmic differencing, differential equations, finite element methods, application in robotics, and nonsmooth global optimization.
The aim of this book is to present formulas and methods developed using complex interval arithmetic. While most of numerical methods described in the literature deal with real intervals and real vectors, there is no systematic study of methods in complex interval arithmetic. The book fills this gap. Several main subjects are considered: outer estimates for the range of complex functions, especially complex centered forms, the best approximations of elementary complex functions by disks, iterative methods for the inclusion by polynomial zeros including their implementation on parallel computers, the analysis of numerical stability of iterative methods by using complex interval arithmetic and numerical computation of curvilinear integrals with error bounds. Mainly new methods are presented developed over the last years, including a lot of very recent results by the authors some of which have not been published before.
This book constitutes the refereed post proceedings of the 16th International Symposium, SCAN 2014, held in Würzburg, Germany, in September 2014. The 22 full papers presented were carefully reviewed and selected from 60 submissions. The main concerns of research addressed by SCAN conferences are validation, verification or reliable assertions of numerical computations. Interval arithmetic and other treatments of uncertainty are developed as appropriate tools.
This volume is dedicated to the late Professor Dragoslav S. Mitrinovic(1908-1995), one of the most accomplished masters in the domain of inequalities. Inequalities are to be found everywhere and play an important and significant role in almost all subjects of mathematics as well as in other areas of sciences. Professor Mitrinovic used to say: `There are no equalities, even in human life inequalities are always encountered.' This volume provides an extensive survey of the most current topics in almost all subjects in the field of inequalities, written by 85 outstanding scientists from twenty countries. Some of the papers were presented at the International Memorial Conference dedicated to Professor D.S. Mitrinovic, which was held at the University of Nis, June 20-22, 1996. Audience: This book will be of great interest to researchers in real, complex and functional analysis, special functions, approximation theory, numerical analysis and computation, and other fields, as well as to graduate students requiring the most up-to-date results.
The SCAN conference, the International Symposium on Scientific Com puting, Computer Arithmetic and Validated Numerics, takes place bian nually under the joint auspices of GAMM (Gesellschaft fiir Angewandte Mathematik und Mechanik) and IMACS (International Association for Mathematics and Computers in Simulation). SCAN-98 attracted more than 100 participants from 21 countries all over the world. During the four days from September 22 to 25, nine highlighted, plenary lectures and over 70 contributed talks were given. These figures indicate a large participation, which was partly caused by the attraction of the organizing country, Hungary, but also the effec tive support system have contributed to the success. The conference was substantially supported by the Hungarian Research Fund OTKA, GAMM, the National Technology Development Board OMFB and by the J6zsef Attila University. Due to this funding, it was possible to subsidize the participation of over 20 scientists, mainly from Eastern European countries. It is important that the possibly first participation of 6 young researchers was made possible due to the obtained support. The number of East-European participants was relatively high. These results are especially valuable, since in contrast to the usual 2 years period, the present meeting was organized just one year after the last SCAN-xx conference.
This book provides a friendly introduction to the paradigm and proposes a broad panorama of killing applications of the Infinity Computer in optimization: radically new numerical algorithms, great theoretical insights, efficient software implementations, and interesting practical case studies. This is the first book presenting to the readers interested in optimization the advantages of a recently introduced supercomputing paradigm that allows to numerically work with different infinities and infinitesimals on the Infinity Computer patented in several countries. One of the editors of the book is the creator of the Infinity Computer, and another editor was the first who has started to use it in optimization. Their results were awarded by numerous scientific prizes. This engaging book opens new horizons for researchers, engineers, professors, and students with interests in supercomputing paradigms, optimization, decision making, game theory, and foundations of mathematics and computer science. “Mathematicians have never been comfortable handling infinities... But an entirely new type of mathematics looks set to by-pass the problem... Today, Yaroslav Sergeyev, a mathematician at the University of Calabria in Italy solves this problem... ” MIT Technology Review “These ideas and future hardware prototypes may be productive in all fields of science where infinite and infinitesimal numbers (derivatives, integrals, series, fractals) are used.” A. Adamatzky, Editor-in-Chief of the International Journal of Unconventional Computing. “I am sure that the new approach ... will have a very deep impact both on Mathematics and Computer Science.” D. Trigiante, Computational Management Science. “Within the grossone framework, it becomes feasible to deal computationally with infinite quantities, in a way that is both new (in the sense that previously intractable problems become amenable to computation) and natural”. R. Gangle, G. Caterina, F. Tohmé, Soft Computing. “The computational features offered by the Infinity Computer allow us to dynamically change the accuracy of representation and floating-point operations during the flow of a computation. When suitably implemented, this possibility turns out to be particularly advantageous when solving ill-conditioned problems. In fact, compared with a standard multi-precision arithmetic, here the accuracy is improved only when needed, thus not affecting that much the overall computational effort.” P. Amodio, L. Brugnano, F. Iavernaro & F. Mazzia, Soft Computing
This self-contained text is a step-by-step introduction and a complete overview of interval computation and result verification, a subject whose importance has steadily increased over the past many years. The author, an expert in the field, gently presents the theory of interval analysis through many examples and exercises, and guides the reader from the basics of the theory to current research topics in the mathematics of computation. Contents Preliminaries Real intervals Interval vectors, interval matrices Expressions, P-contraction, ε-inflation Linear systems of equations Nonlinear systems of equations Eigenvalue problems Automatic differentiation Complex intervals
