A BDDC Algorithm with Deluxe Scaling for Three-Dimensional H (curl) Problems
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Courant Inst., New York, NY (United States)
In our paper, we present and analyze a BDDC algorithm for a class of elliptic problems in the three-dimensional H(curl) space. Compared with existing results, our condition number estimate requires fewer assumptions and also involves two fewer powers of log(H/h), making it consistent with optimal estimates for other elliptic problems. Here, H/his the maximum of Hi/hi over all subdomains, where Hi and hi are the diameter and the smallest element diameter for the subdomain Ωi. The analysis makes use of two recent developments. The first is our new approach to averaging across the subdomain interfaces, while the second is a new technical tool that allows arguments involving trace classes to be avoided. Furthermore, numerical examples are presented to confirm the theory and demonstrate the importance of the new averaging approach in certain cases.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- Grant/Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1141113
- Report Number(s):
- SAND2014-2170J; 505383
- Journal Information:
- Communications on Pure and Applied Mathematics, Vol. 69, Issue 4; Related Information: Proposed for publication in Communications in Pure and Applied Mathematics.; ISSN 0010-3640
- Country of Publication:
- United States
- Language:
- English
Web of Science
A new coarse space for overlapping Schwarz algorithms for H(curl) problems in three dimensions with irregular subdomains
|
journal | April 2019 |
Similar Records
A three-level BDDC algorithm for Mortar discretizations
Domain decomposition solvers for PDEs : some basics, practical tools, and new developments.