A new fast method of solving the high dimensional elliptic eigenvalue problem
From MaRDI portal
Publication:2009554
DOI10.1016/J.AMC.2019.03.035zbMATH Open1429.65271OpenAlexW2925658748MaRDI QIDQ2009554FDOQ2009554
Publication date: 29 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.03.035
Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Templates for the Solution of Algebraic Eigenvalue Problems
- Ten Lectures on Wavelets
- Geometrical structure of Laplacian eigenfunctions
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- The adaptive finite element method based on multi-scale discretizations for eigenvalue problems
- Title not available (Why is that?)
- A two-grid discretization scheme for eigenvalue problems
- Two-Grid Finite Element Discretization Schemes Based on Shifted-Inverse Power Method for Elliptic Eigenvalue Problems
- Use of tensor formats in elliptic eigenvalue problems
- An adaptive wavelet method for solving high-dimensional elliptic PDEs
- A multi-level correction scheme for eigenvalue problems
- Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences
- Acceleration of a two-grid method for eigenvalue problems
- Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems
- Orthogonal Polynomials and the Construction of Piecewise Polynomial Smooth Wavelets
- Wavelet Methods for Second-Order Elliptic Problems, Preconditioning, and Adaptivity
- Title not available (Why is that?)
- Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations
- Piecewise tensor product wavelet bases by extensions and approximation rates
- Recursive integral method with Cayley transformation
Cited In (4)
- High-accuracy calculation of eigenvalues of the Laplacian in an ellipse (with Neumann boundary condition)
- A new characterization of Elfving's method for high dimensional computation
- Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers
- A new efficient DQ algorithm for the solution of elliptic problems in higher dimensions
Uses Software
This page was built for publication: A new fast method of solving the high dimensional elliptic eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009554)
