Matrix-Free Iterative Methods for Parallel Finite Element Computations in Acoustics

Author(s):  
Manish Malhotra ◽  
Peter M. Pinsky

Abstract In this paper we consider the iterative solution of non-Hermitian, indefinite and complex-valued matrix problems arising from finite element discretization of time-harmonic acoustics problems in exterior domains. The computational model is based on using Galerkin least squares finite element methods for the acoustic fluid, combined with the non-local Dirichlet-to-Neumann map as the radiation boundary condition. The emphasis here is to develop efficient computational procedures that are suitable for parallel iterative solution of large-scale problems. In this context, we develop a low-storage implementation of the non-local DtN map which allows the use of this exact boundary condition without any storage penalties related to its non-local nature. In order to accelerate iterative convergence, we consider a multilevel preconditioning approach based on the h-version of the hierarchical finite element method. Finite element formulations that employ hierarchical shape functions yield better conditioned matrices than formulations based on the usual Lagrange functions. This improved conditioning translates into a faster rate of convergence if projections between nodal and hierarchical basis functions are used to construct the preconditioning operator. We present numerical results for the solution of two-dimensional scattering problems to examine convergence rates that are realized on practical discretizations.

2014 ◽  
Vol 24 (08) ◽  
pp. 1495-1539 ◽  
Author(s):  
Francesco Bassi ◽  
Lorenzo Botti ◽  
Alessandro Colombo

In this work we consider agglomeration-based physical frame discontinuous Galerkin (dG) discretization as an effective way to increase the flexibility of high-order finite element methods. The mesh free concept is pursued in the following (broad) sense: the computational domain is still discretized using a mesh but the computational grid should not be a constraint for the finite element discretization. In particular the discrete space choice, its convergence properties, and even the complexity of solving the global system of equations resulting from the dG discretization should not be influenced by the grid choice. Physical frame dG discretization allows to obtain mesh-independent h-convergence rates. Thanks to mesh agglomeration, high-order accurate discretizations can be performed on arbitrarily coarse grids, without resorting to very high-order approximations of domain boundaries. Agglomeration-based h-multigrid techniques are the obvious choice to obtain fast and grid-independent solvers. These features (attractive for any mesh free discretization) are demonstrated in practice with numerical test cases.


Sign in / Sign up

Export Citation Format

Share Document