An adaptive choice of primal constrains for BDDC domain decomposition algorithms
Guardado en:
| Autores: | , |
|---|---|
| Formato: | artículo original |
| Fecha de Publicación: | 2016 |
| Descripción: | An adaptive choice for primal spaces based on parallel sums is developed for BDDC deluxe methods and elliptic problems in three dimensions. The primal space, which forms the global, coarse part of the domain decomposition algorithm and which is always required for any competitive algorithm, is defined in terms of generalized eigenvalue problems related to subdomain edges and faces; selected eigenvectors associated to the smallest eigenvalues are used to enhance the primal spaces. This selection can be made automatic by using tolerance parameters specified for the subdomain faces and edges. Numerical results verify the results and provide a comparison with primal spaces commonly used. They include results for cubic subdomains as well as subdomains obtained by a mesh partitioner. Different distributions for the coefficients are also considered with constant coefficients, highly random values, and channel distributions. |
| País: | Kérwá |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Kérwá |
| OAI Identifier: | oai:kerwa.ucr.ac.cr:10669/74618 |
| Acceso en línea: | http://etna.math.kent.edu/volumes/2011-2020/vol45/abstract.php?vol=45&pages=524-544 https://hdl.handle.net/10669/74618 |
| Palabra clave: | elliptic problems domain decomposition BDDC deluxe preconditioners adaptive primal constraints 65F08 65N30 65N35 65N55 |