A low-rank solver for conforming multipatch Isogeometric Analysis
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917869258801152 |
|---|---|
| author | Montardini, Monica Sangalli, Giancarlo Tani, Mattia |
| author_facet | Montardini, Monica Sangalli, Giancarlo Tani, Mattia |
| contents | In this paper, we propose an innovative isogeometric low-rank solver for the linear elasticity model problem, specifically designed to allow multipatch domains. Our approach splits the domain into subdomains, each formed by the union of neighboring patches. Within each subdomain, we employ Tucker low-rank matrices and vectors to approximate the system matrices and right-hand side vectors, respectively. This enables the construction of local approximate fast solvers. These local solvers are then combined into an overlapping Schwarz preconditioner, which is utilized in a truncated preconditioned conjugate gradient method. Numerical experiments demonstrate the significant memory storage benefits and a uniformly bounded number of iterations with respect to both mesh size and spline degree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_08736 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A low-rank solver for conforming multipatch Isogeometric Analysis Montardini, Monica Sangalli, Giancarlo Tani, Mattia Numerical Analysis In this paper, we propose an innovative isogeometric low-rank solver for the linear elasticity model problem, specifically designed to allow multipatch domains. Our approach splits the domain into subdomains, each formed by the union of neighboring patches. Within each subdomain, we employ Tucker low-rank matrices and vectors to approximate the system matrices and right-hand side vectors, respectively. This enables the construction of local approximate fast solvers. These local solvers are then combined into an overlapping Schwarz preconditioner, which is utilized in a truncated preconditioned conjugate gradient method. Numerical experiments demonstrate the significant memory storage benefits and a uniformly bounded number of iterations with respect to both mesh size and spline degree. |
| title | A low-rank solver for conforming multipatch Isogeometric Analysis |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2312.08736 |