Basis function selection and preconditioning high degree finite element and spectral methods
basis function selectionchoice of the basiscondition numberconjugate gradient methodDirichlet problemfinite element methodfinite element spacepreconditioningspectral methods
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
The article is devoted to the interesting question of the choice of the basis in a given finite element space with the purpose of diminishing the condition number. This choice for the finite element method based on square high degree \(p\geq 1\) finite elements is suggested to make on the element level. The space of each finite element is the space of polynomials of degree p in each variable \(x_ 1\), \(x_ 2\). Variants of bases are considered which are obtained as products of the next one- dimensional polynomials: 1) Chebyshev, 2) Lagrange interpolation polynomials using Lobatto points, 3) Legendre, 4) integrated Legendre, 5) Lagrange interpolation polynomials using equispaced points. A comparison of the bases is performed numerically for the Dirichlet problem \(-\Delta u+cu=f\) in the unit square on uniform square discretizations with \(p=1,2,...,8\) and \(p/h=24\), where h is the size of an element. The systems of algebraic equations are solved by a standard conjugate gradient method with Jacobi (diagonal) preconditioning. The number of iterations needed to achieve an accuracy corresponding to the accuracy of approximation, condition numbers for element matrices and condition number estimates of assembled matrices extracted from iterations are compared. The conclusion of the authors is that the choice of the basis has a significant effect on the condition number. Using the Lobatto points produces a dramatic improvement for the Lagrange basis. Other choices of orthogonal polynomials are also effective.
- Bounds on spectral condition numbers of matrices arising in the \(p\)- version of the finite element method
- Preconditioning on high-order element methods using Chebyshev-Gauss-Lobatto nodes
- Condition number and diagonal preconditioning: Comparison of the \(p\)-version and the spectral element methods
- Well-conditioned frames for high order finite element methods
- Improved Condition Number for Spectral Methods
- Bounds on the spectral and maximum norms of the finite element stiffness, flexibility and mass matrices
- Condition of finite element matrices generated from nonuniform meshes.
- scientific article; zbMATH DE number 4131533 (Why is no real title available?)
- Mesh design for the p-version of the finite element method
- Spectral element multigrid. I: Formulation and numerical results
- Thep-Version of the Finite Element Method
- Preconditioning of the \(p\)-version of the finite element method
- Domain decomposition preconditioning in the hierarchical \(p\)-version of the finite element method
- Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm
- The choice of high order coordinate functions and preconditioning in frames of the method of domain decomposition
- Parallel preconditioning based on h-hierarchical finite elements with application to acoustics
- Relationship between quality of basis for surface approximation and the effect of applying preconditioning strategies to their resulting linear systems
- H^1-parametrizations of complex planar physical domains in isogeometric analysis
- Stream function vorticity solution using high-p element-by-element techniques
- Well-conditioned frames for high order finite element methods
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Parallel-vector computation with high-pelement-by-element methods
- An eigen-based high-order expansion basis for structured spectral elements
- A survey on direct solvers for Galerkin methods
- Parallel multilevel solution of Rayleigh‐Benard‐Marangoni problems
- An implementation detail about the scaling of monomial bases in polytopal finite element methods
- The choice of spectral element basis functions in domains with an axis of symmetry
This page was built for publication: Basis function selection and preconditioning high degree finite element and spectral methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920611)
