Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1515/cmam-2019-0030 | COMPUTATIONAL METHODS IN APPLIED MATHEMATICS |
Keywords | Field | DocType |
Discontinuous Petrov-Galerkin Finite Element Methods,FEAST Method,Eigenvalue Problems,Optical Fiber,Subspace Iteration | Applied mathematics,Discretization,Galerkin method,Finite element method,Mathematics | Journal |
Volume | Issue | ISSN |
19 | SP2 | 1609-4840 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jay Gopalakrishnan | 1 | 33 | 5.35 |
| luka grubisic | 2 | 3 | 2.80 |
| Jeffrey S. Ovall | 3 | 48 | 8.39 |
| Benjamin Parker | 4 | 0 | 0.34 |