Computational Theory of Iterative Methods
Computational Theory of Iterative Methods

Author: Ioannis Argyros

Publisher: Elsevier

Published: 2007-09-04

Total Pages: 505

ISBN-13: 0080560709

DOWNLOAD EBOOK

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

Numerical Methods for Equations and its Applications
Numerical Methods for Equations and its Applications

Author: Ioannis K. Argyros

Publisher: CRC Press

Published: 2012-06-05

Total Pages: 474

ISBN-13: 1466517115

DOWNLOAD EBOOK

This book introduces advanced numerical-functional analysis to beginning computer science researchers. The reader is assumed to have had basic courses in numerical analysis, computer programming, computational linear algebra, and an introduction to real, complex, and functional analysis. Although the book is of a theoretical nature, each chapter co

Elements of the General Theory of Optimal Algorithms
Elements of the General Theory of Optimal Algorithms

Author: Ivan V. Sergienko

Publisher: Springer Nature

Published: 2022-01-11

Total Pages: 387

ISBN-13: 3030909085

DOWNLOAD EBOOK

In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developing algorithmic and software support for the solution of problems of computational and applied mathematics.

Iterative Methods for Linear Systems
Iterative Methods for Linear Systems

Author: Maxim A. Olshanskii

Publisher: SIAM

Published: 2014-07-21

Total Pages: 257

ISBN-13: 1611973465

DOWNLOAD EBOOK

Iterative Methods for Linear Systems?offers a mathematically rigorous introduction to fundamental iterative methods for systems of linear algebraic equations. The book distinguishes itself from other texts on the topic by providing a straightforward yet comprehensive analysis of the Krylov subspace methods, approaching the development and analysis of algorithms from various algorithmic and mathematical perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning.??

Computational Complexity
Computational Complexity

Author: Sanjeev Arora

Publisher: Cambridge University Press

Published: 2009-04-20

Total Pages: 609

ISBN-13: 0521424267

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.