Domain Decomposition Methods for Distributed Computing

Buy Domain Decomposition Methods for Distributed Computing here, one of many Distributed Computing books offered for sale at discount prices here at Rbookshop.com. We greatly appreciate your patronage at Rbookshop and look forward to offering you great products and prices now and in the future.

You Are Here: Home > Computer Books > Distributed Computing > Item 150

	Domain Decomposition Methods for Distributed Computing
	by J. Kruis Sales Rank: 2304465	$155.00 At Amazon on 10-10-2008.

*Features* Cover Type: Hard Cover with 180 pages Published by: Saxe-Coburg Publications April 1, 2007 Written in: English ISBN 10 Number: 1874672237 ISBN 13 Number: 978-1874672234 Book Dimensions: 9.2 x 6.1 x 0.7 inches Weighs: 1.2 pounds *Product Description* The three most important nonoverlapping domain-decomposition methods are outlined in this guide to solving mechanical and transport problems. Each method is described with extensive details of the implementation of algorithms and is applied to real engineering examples. Intended for researchers and postgraduate students, this advanced material covers the Schur complement, the FETI, and the DP-FETI decomposition models, and it shows how to run them on clusters of PCs and other parallel computers. *About The Author* J. Kruis is an assistant professor in the department of structural mechanics at Czech Technical University in Prague. He was awarded the Babuska prize in 1994 for work on the p-version of the finite element method. Back To Top
Domain Decomposition Methods for Distributed Computing ~~List Price: $155.00~~ Available from Amazon Price: $155.00 Updated on 10-10-2008.

NOTICE: All prices, availability, and specifications
are subject to verification by their respective retailers.

We offer Domain Decomposition Methods for Distributed Computing and other related Distributed Computing Books here at Rbookshop.com. To view more books about Distributed Computing please use the previous and next buttons near the top of this page.