Excerpt from Iterative Substructuring Methods: Algorithms and Theory for Elliptic Problems in the Plane
We will not present any numerical results in this paper. It deserves to be mentioned, however, that in our experience 7-10 iteration are sufficient to decrease the error by a factor 104 for many problems.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
I tuoi diritti di garanzia legale: Ogni consumatore nell'UE beneficia di almeno 2 anni di garanzia legale per qualsiasi bene di consumo venduto nell'UE. Scopri di più
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. No Jacket. Print on Demand. The book presents fast, scalable domain decomposition methods for elliptic problems in two dimensions.This rigorous, theory?driven work explains iterative substructuring algorithms that improve convergence and reduce communication in parallel computing. It focuses on finite element formulations, Sobolev spaces, and Schur complement techniques, with a clear path from two?substructure cases to many substructures. While it emphasizes theory over numerical results, the text shows how to achieve almost optimal performance with practical preconditioners and safeguards against growing condition numbers.- Learn how two?substructure and multi?substructure problems are modeled and solved.- See how Schur complements, discrete harmonic functions, and extension theorems underpin algorithm design.- Explore several nearly optimal preconditioners and how they control convergence rates.- Understand how these methods adapt to parallel environments and higher dimensions in future work.Ideal for readers of advanced numerical analysis and computational science, the book builds a solid foundation for designing efficient domain decomposition solvers in elliptic problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Codice articolo 9781333149925_0
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333149925
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333149925
Quantità: 15 disponibili