9780243091607 - domain decomposition and iterative refinement methods for mixed finite element discretisations of elliptic problems (classic reprint) de mathew, tarek p. (3 resultados)
- Tapa blanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 26,55
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 25,52
Envío por EUR 3,81Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Más imágenes- Tapa blanda
- Impresión bajo demanda
Librería: Forgotten Books, London, Reino UnidoForgotten Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 16,98
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Paperback. Condición: New. Print on Demand. This book explores iterative methods to solve saddle point linear systems, focusing on those derived from mixed finite element discretizations of elliptic Neumann problems using Raviart-Thomas elements. The book begins by establishing a theoretical framework. It then provides a proof o…f convergence of the iterative methods when applied to the mixed finite element case, showing that the rate of convergence is independent of the mesh parameter h. The book goes on to study algorithms involving subdomains with overlap, such as the classical Schwarz alternating method and the additive Schwarz method. It offers proofs of convergence for these iterative methods when applied to the mixed finite element case, again demonstrating that the rate of convergence is independent of h. Finally, the book examines a Dirichlet-Neumann algorithm for the mixed finite element case, providing a proof of convergence showing independence from h. The book concludes by discussing quantitative bounds for some many-level FAC algorithms. The author's insights are significant because they establish the convergence of iterative methods for solving saddle point linear systems arising from mixed finite element discretizations of elliptic Neumann problems, and they show that the rate of convergence is independent of the mesh parameter h. 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.
