Discretization Methods and Iterative Solvers Based on Domain Decomposition
1 edition
Our rough guess is there are 49,250 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 17 minutes to read. With a half hour per day, this will take 7 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
49,250 words, Guess
Page Count
197 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL9510424M
- ISBN-139783540410836
- ISBN-10354041083X
- OCLC Control Number45862109
- Library of Congress Control Number2001020166
and 1 more
- Goodreads6127006
Classifications
- LCCQA297-299.4QA299.6-4
Description
Domain decomposition methods provide powerful and flexible tools for the numerical approximation of partial differential equations arising in the modeling of many interesting applications in science and engineering. This book deals with discretization techniques on non-matching triangulations and iterative solvers with particular emphasis on mortar finite elements, Schwarz methods and multigrid techniques. New results on non-standard situations as mortar methods based on dual basis functions and vector field discretizations are analyzed and illustrated by numerical results. The role of trace theorems, harmonic extensions, dual norms and weak interface conditions is emphasized. Although the original idea was used successfully more than a hundred years ago, these methods are relatively new for the numerical approximation. The possibilites of high performance computations and the interest in large- scale problems have led to an increased research activity.
Subjects
Topics
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!