Analysis of FEAST spectral approximations using the DPG discretization
Publication:2324374
DOI10.1515/cmam-2019-0030zbMath1420.65114arXiv1901.07724OpenAlexW2913463558WikidataQ128136366 ScholiaQ128136366MaRDI QIDQ2324374
Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall, Benjamin Parker
Publication date: 11 September 2019
Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07724
eigenvalue problemsoptical fibersubspace iterationdiscontinuous Petrov-Galerkin finite element methodsFEAST method
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Spectrum, resolvent (47A10) Eigenvalue problems for linear operators (47A75) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An integral method for solving nonlinear eigenvalue problems
- Breaking spaces and forms for the DPG method and applications including Maxwell equations
- A projection method for generalized eigenvalue problems using numerical integration.
- Perturbation theory for linear operators.
- Non-oscillatory central schemes for traffic flow models with Arrhenius look-ahead dynamics
- Convergence rates of the DPG method with reduced test space degree
- An analysis of the practical DPG method
- Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
- A class of discontinuous Petrov-Galerkin methods. II. Optimal test functions
- Optimal Convergence Rates for Adaptive Lowest-Order Discontinuous Petrov--Galerkin Schemes
- FEAST for Differential Eigenvalue Problems
- Spectral discretization errors in filtered subspace iteration
- A Posteriori Error Control for DPG Methods
- Functional Analysis
This page was built for publication: Analysis of FEAST spectral approximations using the DPG discretization