Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910916478500864 |
|---|---|
| author | Gilbert, Alexander D. Giles, Michael B. Kuo, Frances Y. Sloan, Ian H. Srikumar, Abirami |
| author_facet | Gilbert, Alexander D. Giles, Michael B. Kuo, Frances Y. Sloan, Ian H. Srikumar, Abirami |
| contents | This paper introduces a multilevel kernel-based approximation method to estimate efficiently solutions to elliptic partial differential equations (PDEs) with periodic random coefficients. Building upon the work of Kaarnioja, Kazashi, Kuo, Nobile, Sloan (Numer. Math., 2022) on kernel interpolation with quasi-Monte Carlo (QMC) lattice point sets, we leverage multilevel techniques to enhance computational efficiency while maintaining a given level of accuracy. In the function space setting with product-type weight parameters, the single-level approximation can achieve an accuracy of $\varepsilon>0$ with cost $\mathcal{O}(\varepsilon^{-η-ν-θ})$ for positive constants $η, ν, θ$ depending on the rates of convergence associated with dimension truncation, kernel approximation, and finite element approximation, respectively. Our multilevel approximation can achieve the same $\varepsilon$ accuracy at a reduced cost $\mathcal{O}(\varepsilon^{-η-\max(ν,θ)})$. Full regularity theory and error analysis are provided, followed by numerical experiments that validate the efficacy of the proposed multilevel approximation in comparison to the single-level approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_15810 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients Gilbert, Alexander D. Giles, Michael B. Kuo, Frances Y. Sloan, Ian H. Srikumar, Abirami Numerical Analysis This paper introduces a multilevel kernel-based approximation method to estimate efficiently solutions to elliptic partial differential equations (PDEs) with periodic random coefficients. Building upon the work of Kaarnioja, Kazashi, Kuo, Nobile, Sloan (Numer. Math., 2022) on kernel interpolation with quasi-Monte Carlo (QMC) lattice point sets, we leverage multilevel techniques to enhance computational efficiency while maintaining a given level of accuracy. In the function space setting with product-type weight parameters, the single-level approximation can achieve an accuracy of $\varepsilon>0$ with cost $\mathcal{O}(\varepsilon^{-η-ν-θ})$ for positive constants $η, ν, θ$ depending on the rates of convergence associated with dimension truncation, kernel approximation, and finite element approximation, respectively. Our multilevel approximation can achieve the same $\varepsilon$ accuracy at a reduced cost $\mathcal{O}(\varepsilon^{-η-\max(ν,θ)})$. Full regularity theory and error analysis are provided, followed by numerical experiments that validate the efficacy of the proposed multilevel approximation in comparison to the single-level approach. |
| title | Multilevel lattice-based kernel approximation for elliptic PDEs with random coefficients |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2504.15810 |