convergence iterations linear equations (14 resultados)

Softcover. VII, 177 S. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-03513 3764328657 Sprache: Englisch Gewicht in Gramm: 550.

Condición: New.

Condición: New. SUPER FAST SHIPPING.

Condición: New. In.

Condición: New.

Paperback. Condición: New.

Condición: Fine. Basel 1993 1st Birkhauser. ISBN 3-7643-2865-7 / 0-8176 2865-7. Lectures in Mathematics ETH Zurich. Octavo, 177pp., original wraps. Fine. ***Brand New***.

Taschenbuch. Condición: Neu. Neuware -Assume that after preconditioning we are given a fixed point problem x = Lx + f (\*) where L is a bounded linear operator which is not assumed to be symmetric and f is a given vector. The book discusses the convergence of Krylov subspace methods for solving fixed point problems (\*), and focuses on the dynamical aspects of the iteration processes. For example, there are many similarities between the evolution of a Krylov subspace process and that of linear operator semigroups, in particular in the beginning of the iteration. A lifespan of an iteration might typically start with a fast but slowing phase. Such a behavior is sublinear in nature, and is essentially independent of whether the problem is singular or not. Then, for nonsingular problems, the iteration might run with a linear speed before a possible superlinear phase. All these phases are based on different mathematical mechanisms which the book outlines. The goal is to know how to precondition effectively, both in the case of 'numerical linear algebra' (where one usually thinks of first fixing a finite dimensional problem to be solved) and in function spaces where the 'preconditioning' corresponds to software which approximately solves the original problem.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 192 pp. Englisch.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Assume that after preconditioning we are given a fixed point problem x = Lx + f (\*) where L is a bounded linear operator which is not assumed to be symmetric and f is a given vector. The book discusses the convergence of Krylov subspace methods for solving fixed point problems (\*), and focuses on the dynamical aspects of the iteration processes. For example, there are many similarities between the evolution of a Krylov subspace process and that of linear operator semigroups, in particular in the beginning of the iteration. A lifespan of an iteration might typically start with a fast but slowing phase. Such a behavior is sublinear in nature, and is essentially independent of whether the problem is singular or not. Then, for nonsingular problems, the iteration might run with a linear speed before a possible superlinear phase. All these phases are based on different mathematical mechanisms which the book outlines. The goal is to know how to precondition effectively, both in the case of 'numerical linear algebra' (where one usually thinks of first fixing a finite dimensional problem to be solved) and in function spaces where the 'preconditioning' corresponds to software which approximately solves the original problem.

Paperback. Condición: Like New. Like New. book.

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Paperback. Condición: Like New. Like New. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Assume that after preconditioning we are given a fixed point problem x = Lx + f (\*) where L is a bounded linear operator which is not assumed to be symmetric and f is a given vector. The book discusses the convergence of Krylov subspace methods for solving fixed point problems (\*), and focuses on the dynamical aspects of the iteration processes. For example, there are many similarities between the evolution of a Krylov subspace process and that of linear operator semigroups, in particular in the beginning of the iteration. A lifespan of an iteration might typically start with a fast but slowing phase. Such a behavior is sublinear in nature, and is essentially independent of whether the problem is singular or not. Then, for nonsingular problems, the iteration might run with a linear speed before a possible superlinear phase. All these phases are based on different mathematical mechanisms which the book outlines. The goal is to know how to precondition effectively, both in the case of 'numerical linear algebra' (where one usually thinks of first fixing a finite dimensional problem to be solved) and in function spaces where the 'preconditioning' corresponds to software which approximately solves the original problem. 180 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Assume that after preconditioning we are given a fixed point problem x = Lx + f (*) where L is a bounded linear operator which is not assumed to be symmetric and f is a given vector. The book discusses the convergence of Krylov subspace methods for solving .