olavi nevanlinna (11 Ergebnisse)

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: New. In.

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.

Hardcover. Zustand: Brand New. 136 pages. 10.00x7.00x0.50 inches. In Stock.

Zustand: 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***.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. pp. 136.

Zustand: New. Discussing the convergence of Krylov subspace methods for solving fixed point problems, this work focuses on the dynamical aspects of the iteration processes and outlines all the phases of a lifespan of an iteration. Series: Lectures in Mathematics. ETH Zurich. Num Pages: 188 pages, 15 black & white illustrations, biography. BIC Classification: PBK; PBT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 244 x 170 x 10. Weight in Grams: 316. . 1993. 1993rd Edition. paperback. . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: 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.

Hardcover. Zustand: Fine. 1st Edition. Released as a part of Fields Institute Monographs. Introduction to the basics of value distribution theroy of meromorphic scalaf functions. Then it introduces a new nonlinear tool for linear algebra, the total logarithmic size of a matrix. Text in English. 136 pp.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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.