Sinossi
Excerpt from Domain Decomposition Algorithms With Small Overlap
Abstract. Numerical experiments have shown that two-level Schwarz methods often perform very well even if the overlap between neighboring subregions is quite small. This is true to an even greater extent for a related algorithm, due to Barry Smith, where a Schwarz algorithm is applied to the reduced linear system of equations that remains after that the variables interior to the subregions have been eliminated. In this paper, a supporting theory is developed.
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.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Domain Decomposition Algorithms With Small Overlap...
Immagini fornite dal venditore
Domain Decomposition Algorithms With Small Overlap (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Print on Demand. This book delves into Schwarz methods, a class of domain decomposition algorithms used to solve partial differential equations. The author provides a theoretical framework for these methods, focusing on the case of small overlap between neighboring subdomains. By establishing bounds on the condition number of the preconditioned operator, the book demonstrates the effectiveness of Schwarz methods even with minimal overlap. The author also analyzes a vertex space algorithm, showing that it converges rapidly despite a modest overlap. The significance of this work lies in its potential to enhance the efficiency of domain decomposition methods, making them more viable for solving complex problems in parallel computing environments. 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 9781332871230_0
Compra nuovo
EUR 15,18
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Domain Decomposition Algorithms with Small Overlap (Classic Reprint)
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332871230
Compra nuovo
EUR 21,39
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Domain Decomposition Algorithms with Small Overlap (Classic Reprint)
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332871230
Compra nuovo
EUR 20,36
Spedizione EUR 3,80
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili