Analysis of FEAST spectral approximations using the DPG discretization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910753250869248 |
|---|---|
| author | Gopalakrishnan, Jay Grubišić, Luka Ovall, Jeffrey Parker, Benjamin Q. |
| author_facet | Gopalakrishnan, Jay Grubišić, Luka Ovall, Jeffrey Parker, Benjamin Q. |
| contents | A filtered subspace iteration for computing a cluster of eigenvalues and its accompanying eigenspace, known as "FEAST", has gained considerable attention in recent years. This work studies issues that arise when FEAST is applied to compute part of the spectrum of an unbounded partial differential operator. Specifically, when the resolvent of the partial differential operator is approximated by the discontinuous Petrov Galerkin (DPG) method, it is shown that there is no spectral pollution. The theory also provides bounds on the discretization errors in the spectral approximations. Numerical experiments for simple operators illustrate the theory and also indicate the value of the algorithm beyond the confines of the theoretical assumptions. The utility of the algorithm is illustrated by applying it to compute guided transverse core modes of a realistic optical fiber. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1901_07724 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Analysis of FEAST spectral approximations using the DPG discretization Gopalakrishnan, Jay Grubišić, Luka Ovall, Jeffrey Parker, Benjamin Q. Numerical Analysis A filtered subspace iteration for computing a cluster of eigenvalues and its accompanying eigenspace, known as "FEAST", has gained considerable attention in recent years. This work studies issues that arise when FEAST is applied to compute part of the spectrum of an unbounded partial differential operator. Specifically, when the resolvent of the partial differential operator is approximated by the discontinuous Petrov Galerkin (DPG) method, it is shown that there is no spectral pollution. The theory also provides bounds on the discretization errors in the spectral approximations. Numerical experiments for simple operators illustrate the theory and also indicate the value of the algorithm beyond the confines of the theoretical assumptions. The utility of the algorithm is illustrated by applying it to compute guided transverse core modes of a realistic optical fiber. |
| title | Analysis of FEAST spectral approximations using the DPG discretization |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/1901.07724 |