Greedy Trial Subspace Selection in Meshfree Time-Stepping Scheme with Applications in Coupled Bulk-Surface Pattern Formations
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912084373012480 |
|---|---|
| author | Su, Yichen Ling, Leevan |
| author_facet | Su, Yichen Ling, Leevan |
| contents | Combining kernel-based collocation methods with time-stepping methods to solve parabolic partial differential equations can potentially introduce challenges in balancing temporal and spatial discretization errors. Typically, using kernels with high orders of smoothness on some sufficiently dense set of trial centers provides high spatial approximation accuracy that can exceed the accuracy of finite difference methods in time. The paper proposes a greedy approach for selecting trial subspaces in the kernel-based collocation method applied to time-stepping to balance errors in both well-conditioned and ill-conditioned scenarios. The approach involves selecting trial centers using a fast block-greedy algorithm with new stopping criteria that aim to balance temporal and spatial errors. Numerical simulations of coupled bulk-surface pattern formations, a system involving two functions in the domain and two on the boundary, illustrate the effectiveness of the proposed method in reducing trial space dimensions while maintaining accuracy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09404 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Greedy Trial Subspace Selection in Meshfree Time-Stepping Scheme with Applications in Coupled Bulk-Surface Pattern Formations Su, Yichen Ling, Leevan Numerical Analysis Mathematical Physics Combining kernel-based collocation methods with time-stepping methods to solve parabolic partial differential equations can potentially introduce challenges in balancing temporal and spatial discretization errors. Typically, using kernels with high orders of smoothness on some sufficiently dense set of trial centers provides high spatial approximation accuracy that can exceed the accuracy of finite difference methods in time. The paper proposes a greedy approach for selecting trial subspaces in the kernel-based collocation method applied to time-stepping to balance errors in both well-conditioned and ill-conditioned scenarios. The approach involves selecting trial centers using a fast block-greedy algorithm with new stopping criteria that aim to balance temporal and spatial errors. Numerical simulations of coupled bulk-surface pattern formations, a system involving two functions in the domain and two on the boundary, illustrate the effectiveness of the proposed method in reducing trial space dimensions while maintaining accuracy. |
| title | Greedy Trial Subspace Selection in Meshfree Time-Stepping Scheme with Applications in Coupled Bulk-Surface Pattern Formations |
| topic | Numerical Analysis Mathematical Physics |
| url | https://arxiv.org/abs/2410.09404 |