Spectral collocation on triangular elements
DOI10.1006/jcph.1998.6052zbMath0909.65089OpenAlexW1998935636MaRDI QIDQ1268371
Publication date: 22 March 1999
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.1998.6052
domain decompositionpreconditioningfinite differencesingular solutionsiterative solverspectral collocation methodChebyshev collocation methodtriangular elementauxiliary mapping
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05)
Related Items (13)
Cites Work
- Unnamed Item
- The p- and h-p versions of the finite element method. An overview
- Chebyshev pseudospectral solution of second-order elliptic equations with finite element preconditioning
- Line relaxation for spectral multigrid methods
- Multigrid methods for combined finite difference and Fourier problems
- Spectral methods on triangles and other domains
- Stable spectral methods for conservation laws on triangles with unstructured grids
- The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron
- Spectral element methods for elliptic problems in nonsmooth domains
- Tetrahedral \(hp\) finite elements: Algorithms and flow simulations
- Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
- An Iterative Procedure with Interface Relaxation for Domain Decomposition Methods
- From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
This page was built for publication: Spectral collocation on triangular elements