Photo from wikipedia
Fast direct and inverse algorithms for expansion in terms of eigenvectors of one-dimensional eigenvalue problems for a high-order finite element method (FEM) are proposed based on the fast discrete Fourier… Click to show full abstract
Fast direct and inverse algorithms for expansion in terms of eigenvectors of one-dimensional eigenvalue problems for a high-order finite element method (FEM) are proposed based on the fast discrete Fourier transform. They generalize logarithmically optimal Fourier algorithms for solving boundary value problems for Poisson-type equations on rectangular meshes to high-order FEM. The algorithms can be extended to the multidimensional case and can be applied to nonstationary problems.
Keywords:
finite element;
order;
element method;
high order;
fast direct;
order finite
Journal Title: Doklady Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Doklady Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!