or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Iterative Solution Methods
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Iterative Solution Methods [Paperback]

Owe Axelsson (Author)
4.0 out of 5 stars  See all reviews (1 customer review)

Price: $79.00 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Friday, February 3? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $79.00  

Book Description

0521555698 978-0521555692 March 29, 1996
Large linear systems of equations arise in most scientific problems where mathematical models are used. The most efficient methods for solving these equations are iterative methods. The first part of this book contains basic and classical material from the study of linear algebra and numerical linear algebra. The second half of the book is unique among books on this topic, because it is devoted to the construction of preconditioners and iterative acceleration methods of the conjugate gradient type. This book is for graduate students and researchers in numerical analysis and applied mathematics.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Editorial Reviews

Review

"...the book is the most complete and interesting study of iterative methods for systems of linear equations to date. I strongly recommend it to any researcher in the field or in any other area in which the solution of large systems of linear equations plays an important role...it will become a standard reference in numerical linear algebra..." Joaquim J. Judice, Mathematical Reviews

"The author has done a fine job of collecting the plethora of work in this area into an up-to-date, coherent entity....I am sure that this volume is destined to be the bible of iterative methods for many years to come." T. Hopkins, Computing Reviews

"...contains a wealth of relevant mathematical theory which underpins much of the development of this specific but important area of Numerical Linear Algebra. It is likely to be an important reference for theoreticians interested in the development and analysis of iterative solution methods for years to come." A. Wathen, The Bulletin of the Institute of Mathematics and its Applications

Book Description

The first part of this text contains basic and classical material from the study of linear algebra and numerical linear algebra. The second half is unique among texts on this topic, because it is devoted to the construction of preconditioners and iterative acceleration methods of the conjugate gradient type.

Product Details

  • Paperback: 672 pages
  • Publisher: Cambridge University Press (March 29, 1996)
  • Language: English
  • ISBN-10: 0521555698
  • ISBN-13: 978-0521555692
  • Product Dimensions: 9 x 6 x 1.4 inches
  • Shipping Weight: 2.2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #358,128 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:    (0)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

1 of 1 people found the following review helpful:
4.0 out of 5 stars fast convergence for some problems, December 21, 2004
This review is from: Iterative Solution Methods (Paperback)
The book may be attractive to researchers dealing with large linear systems of equations, and hoping to solve these in some quick fashion. Axelsson discusses iterative methods that he claims can converge rapidly. While this may not be generally true, the pragmatic researcher might keep Axelsson's ideas in mind, and consider applying them to her problems.

The first section of the book is somewhat mundane. Totally standard descriptions that can be found in many texts on linear algebra. But the value of the book is in the second section. Where the author offers neat suggestions on how to pick the initial conditions for starting the iterations. As well as a type of steepest gradient descent to speed up the convergence.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
The need to solve large linear systems of algebraic equations arises in almost any mathematical model, as illustrated in the instances below. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
incomplete factorization method, inverse free form, average convergence factor, convergent splittings, offdiagonal entries, weak regular splitting, diagonal compensation, block matrix entries, generalized conjugate gradient method, preconditioning methods, elliptic difference equations, complement matrices, basic iterative methods, numerical radius, reordering method, eigenvector space, block tridiagonal form, annihilating polynomial, pivot entries, superlinear rate, preconditioning matrix, extreme eigenvalues, spectral condition number, preconditioned matrix, sparsity pattern
Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Proof Let, Englewood Cliffs, Matrix Anal, Proof Note, Prentice Hall, Technical Report, Chalmers University of Technology, Numer Anal, Proof Lemma, Research Report, Department of Computer Sciences, Mathematical Sciences, The Netherlands, Data Handling Division, Its Applic, Numer Math, Proof Theorem, The Theory of Matrices
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:

Citations (learn more)
This book cites 29 books:
See all 29 books this book cites
 
81 books cite this book:
See all 81 books citing this book



What Other Items Do Customers Buy After Viewing This Item?


Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject