An optimal complexity spectral solver for the Poisson equation
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909507925311488 |
|---|---|
| author | Qin, Ouyuan |
| author_facet | Qin, Ouyuan |
| contents | We propose a spectral solver for the Poisson equation on a square domain, achieving optimal complexity through the ultraspherical spectral method and the alternating direction implicit (ADI) method. Compared with the state-of-the-art spectral solver for the Poisson equation \cite{for}, our method not only eliminates the need for conversions between Chebyshev and Legendre bases but also is applicable to more general boundary conditions while maintaining spectral accuracy. We prove that, for solutions with sufficient smoothness, a fixed number of ADI iterations suffices to meet a specified tolerance, yielding an optimal complexity of $\mathcal{O}(n^2)$. The solver can also be extended to other equations as long as they can be split into two one-dimensional operators with nearly real and disjoint spectra. Numerical experiments demonstrate that our algorithm can resolve solutions with millions of unknowns in under a minute, with significant speedups when leveraging low-rank approximations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_16805 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An optimal complexity spectral solver for the Poisson equation Qin, Ouyuan Numerical Analysis 65L15, 65N35 We propose a spectral solver for the Poisson equation on a square domain, achieving optimal complexity through the ultraspherical spectral method and the alternating direction implicit (ADI) method. Compared with the state-of-the-art spectral solver for the Poisson equation \cite{for}, our method not only eliminates the need for conversions between Chebyshev and Legendre bases but also is applicable to more general boundary conditions while maintaining spectral accuracy. We prove that, for solutions with sufficient smoothness, a fixed number of ADI iterations suffices to meet a specified tolerance, yielding an optimal complexity of $\mathcal{O}(n^2)$. The solver can also be extended to other equations as long as they can be split into two one-dimensional operators with nearly real and disjoint spectra. Numerical experiments demonstrate that our algorithm can resolve solutions with millions of unknowns in under a minute, with significant speedups when leveraging low-rank approximations. |
| title | An optimal complexity spectral solver for the Poisson equation |
| topic | Numerical Analysis 65L15, 65N35 |
| url | https://arxiv.org/abs/2502.16805 |