Several old and new finite-element preconditioners for nodal-based spectral discretizations of -Delta u = f in the domain Omega = (-1, 1)(d) (d = 2 or 3), with Dirichlet or Neumann boundary conditions, are considered and compared in terms of both condition number and computational efficiency. The computational domain covers the case of classical single-domain spectral approximations (see [C. Canuto et al., Spectral Methods. Fundamentals in Single Domains, Springer, Heidelberg, 2006]), as well as that of more general spectral-element methods in which the preconditioners are expressed in terms of local (upon every element) algebraic solvers. The primal spectral approximation is based on the Galerkin approach with numerical integration (G-NI) ...
Abstract. For the iterative solution of the Schur complement system associated with the discretizati...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...
Discontinuous Galerkin (DG) methods offer a very powerful discretization tool because they not only ...
Several old and new finite-element preconditioners for nodal-based spectral discretizations of −Δu =...
Spectral collocation approximations based on Legendre-Gauss-Lobatto (LGL) points for Helmholtz equat...
The discrete systems generated by spectral or hp-version finite elements are much more ill-condition...
Locally adapted meshes and polynomial degrees can greatly improve spectral element accuracy and appl...
High-order spectral element methods (SEM) while very accurate for computational fluid dynamics (CFD)...
Two of the most recent and important nonoverlapping domain decomposition methods, the BDDC method (B...
This paper is concerned with the design, analysis and implementation of preconditioning concepts for...
This work addresses the algorithmical aspects of spectral methods for elliptic equations. We focus o...
The spectral element method is used to discretize self-adjoint elliptic equations in three-dimension...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
Abstract This paper is concerned with the design, analysis and implementation of preconditioning con...
Domain decomposition preconditioners fur high-order Galerkin methods in two dimensions are often bui...
Abstract. For the iterative solution of the Schur complement system associated with the discretizati...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...
Discontinuous Galerkin (DG) methods offer a very powerful discretization tool because they not only ...
Several old and new finite-element preconditioners for nodal-based spectral discretizations of −Δu =...
Spectral collocation approximations based on Legendre-Gauss-Lobatto (LGL) points for Helmholtz equat...
The discrete systems generated by spectral or hp-version finite elements are much more ill-condition...
Locally adapted meshes and polynomial degrees can greatly improve spectral element accuracy and appl...
High-order spectral element methods (SEM) while very accurate for computational fluid dynamics (CFD)...
Two of the most recent and important nonoverlapping domain decomposition methods, the BDDC method (B...
This paper is concerned with the design, analysis and implementation of preconditioning concepts for...
This work addresses the algorithmical aspects of spectral methods for elliptic equations. We focus o...
The spectral element method is used to discretize self-adjoint elliptic equations in three-dimension...
AbstractIterative substructuring methods form an important family of domain decomposition algorithms...
Abstract This paper is concerned with the design, analysis and implementation of preconditioning con...
Domain decomposition preconditioners fur high-order Galerkin methods in two dimensions are often bui...
Abstract. For the iterative solution of the Schur complement system associated with the discretizati...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...
Discontinuous Galerkin (DG) methods offer a very powerful discretization tool because they not only ...