Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 11.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Interative Methods for Solving Linear Systems

Name: Interative Methods for Solving Linear Systems
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02050064
Price: 100.56 EUR
Availability: InStock
Author: Anne Greenbaum
ISBN: 9780898713961

Anne Greenbaum

Language

English

Book Paperback

Libristo code: 02050064

Publishers Society for Industrial & Applied Mathematics,U.S., September 1997

Much recent research has concentrated on the efficient solution of large sparse or structured linear... Full description

Libristo code: 02050064

244 b

100.56 €

50 % chance We search the world When will I receive my book?

30-day return policy

Customers also purchased

Английский язык. Руководство по составлению юридических документов. Legal Writing guidelines and assignments М.А. Голубцова

Paperback

32.91 €

BLOGGERS 6E - CAHIER D'ACTIVITES

Paperback

13.12 €

Assises internationales du roman 2007 roman et réalité VILLA GILLET / LE MONDE

Paperback

15.74 €

de la Comedie Francaise Depuis 1830, Ou Resume Des Evenemens Survenus A Ce Theatre Laugier

Paperback

22.10 €

Krach Tijan Sila

Hardback

17.96 €

Sri Venkatesa Kavya Kalpaha Dt Tatacharya

Paperback

24.02 €

Mythologie Aspekte: Mythen, Macht und Monster Wolfgang Schwerdt

Paperback

8.57 €

Actes et Paroles, Volume 3 Victor Hugo

Paperback

17.86 €

Staatsvertrag und immerwährende Neutralität Österreichs Waldemar Hummer

Paperback

82.08 €

Much recent research has concentrated on the efficient solution of large sparse or structured linear systems using iterative methods. A language loaded with acronyms for a thousand different algorithms has developed, and it is often difficult even for specialists to identify the basic principles involved. Here is a book that focuses on the analysis of iterative methods. The author includes the most useful algorithms from a practical point of view and discusses the mathematical principles behind their derivation and analysis. Several questions are emphasized throughout: Does the method converge? If so, how fast? Is it optimal, among a certain class? If not, can it be shown to be near-optimal? The answers are presented clearly, when they are known, and remaining important open questions are laid out for further study.