Parallel Iterative Algorithms


Book Description

Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and dr




Approximate Iterative Algorithms


Book Description

Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis and probability theory. Extensive applications to Markov decision processes are presented. This volume is intended for mathematicians, engineers and computer scientists, who work on learning processes in numerical analysis and are involved with optimization, optimal control, decision analysis and machine learning.




Iterative Algorithms for Multilayer Optimizing Control


Book Description

- Comprehensive collection of structural concepts in the field of hierarchical control - Methodologies for systematic synthesis of a multilayer structure of an optimizing control system - Optimizing control algorithms for the steady-state and dynamic processes and complete convergence analysis of the algorithms - Application of the theory of five case study examples of the industrial systems.




Iterative Methods in Combinatorial Optimization


Book Description

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.




Applied Iterative Methods


Book Description

This book is a collection of essays on iterative algorithms and their uses. It focuses on the mathematics of medical image reconstruction, with emphasis on Fourier inversion. The book discusses the problems and algorithms in the context of operators on finite-dimensional Euclidean space.




Iterative Methods for Sparse Linear Systems


Book Description

Since the first edition of this book was published in 1996, tremendous progress has been made in the scientific and engineering disciplines regarding the use of iterative methods for linear systems. The size and complexity of the new generation of linear and nonlinear systems arising in typical applications has grown. Solving the three-dimensional models of these problems using direct solvers is no longer effective. At the same time, parallel computing has penetrated these application areas as it became less expensive and standardized. Iterative methods are easier than direct solvers to implement on parallel computers but require approaches and solution algorithms that are different from classical methods. Iterative Methods for Sparse Linear Systems, Second Edition gives an in-depth, up-to-date view of practical algorithms for solving large-scale linear systems of equations. These equations can number in the millions and are sparse in the sense that each involves only a small number of unknowns. The methods described are iterative, i.e., they provide sequences of approximations that will converge to the solution.




Iterative Optimization in Inverse Problems


Book Description

Iterative Optimization in Inverse Problems brings together a number of important iterative algorithms for medical imaging, optimization, and statistical estimation. It incorporates recent work that has not appeared in other books and draws on the author’s considerable research in the field, including his recently developed class of SUMMA algorithms. Related to sequential unconstrained minimization methods, the SUMMA class includes a wide range of iterative algorithms well known to researchers in various areas, such as statistics and image processing. Organizing the topics from general to more specific, the book first gives an overview of sequential optimization, the subclasses of auxiliary-function methods, and the SUMMA algorithms. The next three chapters present particular examples in more detail, including barrier- and penalty-function methods, proximal minimization, and forward-backward splitting. The author also focuses on fixed-point algorithms for operators on Euclidean space and then extends the discussion to include distance measures other than the usual Euclidean distance. In the final chapters, specific problems illustrate the use of iterative methods previously discussed. Most chapters contain exercises that introduce new ideas and make the book suitable for self-study. Unifying a variety of seemingly disparate algorithms, the book shows how to derive new properties of algorithms by comparing known properties of other algorithms. This unifying approach also helps researchers—from statisticians working on parameter estimation to image scientists processing scanning data to mathematicians involved in theoretical and applied optimization—discover useful related algorithms in areas outside of their expertise.




Iterative Methods and Preconditioning for Large and Sparse Linear Systems with Applications


Book Description

This book describes, in a basic way, the most useful and effective iterative solvers and appropriate preconditioning techniques for some of the most important classes of large and sparse linear systems. The solution of large and sparse linear systems is the most time-consuming part for most of the scientific computing simulations. Indeed, mathematical models become more and more accurate by including a greater volume of data, but this requires the solution of larger and harder algebraic systems. In recent years, research has focused on the efficient solution of large sparse and/or structured systems generated by the discretization of numerical models by using iterative solvers.




Iterative Methods for the Solution of Equations


Book Description

From the Preface (1964): ``This book presents a general theory of iteration algorithms for the numerical solution of equations and systems of equations. The relationship between the quantity and the quality of information used by an algorithm and the efficiency of the algorithm is investigated. Iteration functions are divided into four classes depending on whether they use new information at one or at several points and whether or not they reuse old information. Known iteration functions are systematized and new classes of computationally effective iteration functions are introduced. Our interest in the efficient use of information is influenced by the widespread use of computing machines ... The mathematical foundations of our subject are treated with rigor, but rigor in itself is not the main object. Some of the material is of wider application ... Most of the material is new and unpublished. Every attempt has been made to keep the subject in proper historical perspective ... ''




Iterative Incomplete Factorization Methods


Book Description

This book is devoted to numerical methods for solving sparse linear algebra systems of very large dimension which arise in the implementation of the mesh approximations of the partial differential equations. Incomplete factorization is the basis of the wide class of preconditioning interative processes with acceleration by conjugate gradients or the Chebyshev technique. Different kinds of explicit and implicit algorithms are considered. Theoretical grounds of correctness and estimates of the convergence velocity of iterations are presented. Together with the results of experimental investigations for the typical examples, this book is the first on systematic studying of the incomplete factorization methods.