discrete iterations metric study (6 Ergebnisse)

LEINEN, 195 Seiten, dies ist ein regulär ausgesondertes Bibliotheksexemplar aus einer wissenschaftlichen Bibliothek, keine Markierungen/Anmerkungen, das Buch ist sehr gut erhalten --- LINEN BINDING, Lib. Ex. no marks, 195 pages, the book is in a very good condition. Shipping to abroad insured with tracking number.

Zustand: Good. Volume 6. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:3540136231.

Zustand: Very Good. A few marks to both sides. Showing light wear. Inscriptions at the front of the book. Content fine throughout.

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - a c 9 h In presenting this monograph, I would like to indicate both its orientation as well as my personal reasons for being interested in discrete iterations (that is, iterations on a generally very large,jinite set). While working in numerical analysis I have been interested in two main aspects: - the algorithmic aspect: an iterative algorithm is a mathematical entity which behaves in a dynamic fashion. Even if it is started far from a solution, it will often tend to get closer and closer. - the mathematical aspect: this consists of a coherent and rigorous analy sis of convergence, with the aid of mathematical tools (these tools are mainly the use of norms for convergence proofs, the use of matrix algebra and so on). One may for example refer to the algorithmic and mathematical aspects of Newton's method in JRn as well as to the QR algorithm for eigenvalues of matrices. These two algorithms seem to me to be the most fascinating algorithms in numerical analysis, since both show a remarkable practical efficiency even though there exist relatively few global convergence results for them.