Studies in Computational Mathematics – serie

The Haifa 2000 Workshop on "Inherently Parallel Algorithms for Feasibility and Optimization and their Applications" brought together top scientists in this area. The objective of the Workshop was to discuss, analyze and compare the latest developments in this fast growing field of applied mathematics and to identify topics of research which are of special interest for industrial applications and for further theoretical study.

Inherently parallel algorithms, that is, computational methods which are, by their mathematical nature, parallel, have been studied in various contexts for more than fifty years. However, it was only during the last decade that they have mostly proved their practical usefulness because new generations of computers made their implementation possible in order to solve complex feasibility and optimization problems involving huge amounts of data via parallel processing. These led to an accumulation of computational experience and theoretical information and opened new and challenging questions concerning the behavior of inherently parallel algorithms for feasibility and optimization, their convergence in new environments and in circumstances in which they were not considered before their stability and reliability. Several research groups all over the world focused on these questions and it was the general feeling among scientists involved in this effort that the time has come to survey the latest progress and convey a perspective for further development and concerted scientific investigations. Thus, the editors of this volume, with the support of the Israeli Academy for Sciences and Humanities, took the initiative of organizing a Workshop intended to bring together the leading scientists in the field. The current volume is the Proceedings of the Workshop representing the discussions, debates and communications that took place. Having all that information collected in a single book will provide mathematicians and engineers interested in the theoretical and practical aspects of the inherently parallel algorithms for feasibility and optimization with a tool for determining when, where and which algorithms in this class are fit for solving specific problems, how reliable they are, how they behave and how efficient they were in previous applications. Such a tool will allow software creators to choose ways of better implementing these methods by learning from existing experience.

The book is devoted to the perturbation analysis of matrix equations. The importance of perturbation analysis is that it gives a way to estimate the influence of measurement and/or parametric errors in mathematical models together with the rounding errors done in the computational process. The perturbation bounds may further be incorporated in accuracy estimates for the solution computed in finite arithmetic. This is necessary for the development of reliable computational methods, algorithms and software from the viewpoint of modern numerical analysis.

In this book a general perturbation theory for matrix algebraic equations is presented. Local and non-local perturbation bounds are derived for general types of matrix equations as well as for the most important equations arising in linear algebra and control theory. A large number of examples, tables and figures is included in order to illustrate the perturbation techniques and bounds.

Key features:

. The first book in this field. Can be used by a variety of specialists. Material is self-contained. Results can be used in the development of reliable computational algorithms. A large number of examples and graphical illustrations are given. Written by prominent specialists in the field

This book is a collection of eleven articles, written by leading experts and dealing with special topics in Multivariate Approximation and Interpolation. The material discussed here has far-reaching applications in many areas of Applied Mathematics, such as in Computer Aided Geometric Design, in Mathematical Modelling, in Signal and Image Processing and in Machine Learning, to mention a few. The book aims at giving a comprehensive information leading the reader from the fundamental notions and results of each field to the forefront of research. It is an ideal and up-to-date introduction for graduate students specializing in these topics, and for researchers in universities and in industry.

A collection of articles of highest scientific standard An excellent introduction and overview of recent topics from multivariate approximation A valuable source of references for specialists in the field A representation of the state-of-the-art in selected areas of multivariate approximation A rigorous mathematical introduction to special topics of interdisciplinary research

Many large mathematical models, not only models arising and used in environmental studies, are described by systems of partial differential equations. The discretization of the spatial derivatives in such models leads to the solution of very large systems of ordinary differential equations. These systems contain many millions of equations and have to be handled over large time intervals by applying many time-steps (up to several hundred thousand time-steps). Furthermore, many scenarios are as a rule to be run. This explains the fact that the computational tasks in this situation are enormous. Therefore, it is necessary to select fast numerical methods; to develop parallel codes and, what is most important when the problems solved are very large to organize the computational process in a proper way.The last item (which is very often underestimated but, let us re-iterate, which is very important) is the major topic of this book. In fact, the proper organization of the computational process can be viewed as a preparation of templates which can be used with different numerical methods and different parallel devices. The development of such templates is described in the book. It is also demonstrated that many comprehensive environmental studies can successfully be carried out when the computations are correctly organized. Thus, this book will help the reader to understand better that, while (a) it is very important to select fast numerical methods as well as (b) it is very important to develop parallel codes, this will not be sufficient when the problems solved are really very large. In the latter case, it is also crucial to exploit better the computer architecture by organizing properly the computational process. Use of templates in connection with the treatment of very large models Performance of comprehensive environmental studies Obtaining reliable and robust information about pollution levels Studying the impact of future climatic changes on high pollution levels Investigating trends related to critical levels of pollution

Numerical Methods for Roots of Polynomials - Part I (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton's, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent's method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled "A Handbook of Methods for Polynomial Root-finding�. This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic. First comprehensive treatment of Root-Finding in several decades Gives description of high-grade software and where it can be down-loaded Very up-to-date in mid-2006; long chapter on matrix methods Includes Parallel methods, errors where appropriate Invaluable for research or graduate course

The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory.- Latest convergence results for the iterative methods - Iterative methods with the least computational cost- Iterative methods with the weakest convergence conditions- Open problems on iterative methods