Power Search
Low Price Guarantee
We Take School POs
Domain Decomposition Methods--Algorithms and Theory 2005 Edition
Contributor(s): Toselli, Andrea (Author), Widlund, Olof (Author)

View larger image

 ISBN: 3540206965     ISBN-13: 9783540206965
Publisher: Springer
OUR PRICE: $132.99  

Binding Type: Hardcover - See All Available Formats & Editions
Published: October 2004
Qty:

Annotation:

The purpose of this text is to offer a comprehensive and self-contained presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. Strong emphasis is placed on both algorithmic and mathematical aspects. Some important methods such FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods, not treated previously in any monograph, are covered in detail.Winner of the 2005 Award for Excellence in Professional and Scholarly Publishing - Mathematics/Statistics - of the Association of American Publishers

Click for more in this series: Springer Series in Computational Mathematics
Additional Information
BISAC Categories:
- Mathematics | Finite Mathematics
- Mathematics | Number Systems
- Computers | Systems Architecture - General
Dewey: 518.64
LCCN: 2004057350
Series: Springer Series in Computational Mathematics
Physical Information: 0.8" H x 6.4" W x 9.4" L (1.72 lbs) 450 pages
Features: Bibliography, Illustrated, Index, Table of Contents
 
Descriptions, Reviews, Etc.
Publisher Description:

This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!