skip to main content

Title: Connections between finite difference and finite element approximations
We present useful connections between the finite difference and the finite element methods for a model boundary value problem. We start from the observation that, in the finite element context, the interpolant of the solution in one dimension coincides with the finite element approximation of the solution. This result can be viewed as an extension of the Green function formula for the solution at the continuous level. We write the finite difference and the finite element systems such that the two corresponding linear systems have the same stiffness matrices and compare the right hand side load vectors for the two methods. Using evaluation of the Green function, a formula for the inverse of the stiffness matrix is extended to the case of non-uniformly distributed mesh points. We provide an error analysis based on the connection between the two methods and estimate the energy norm of the difference of the two solutions. Interesting extensions to the 2D case are provided.
Authors:
;
Editors:
Taylor And Francis Online
Award ID(s):
2011615
Publication Date:
NSF-PAR ID:
10347006
Journal Name:
Applicable analysis
ISSN:
0003-6811
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    As the use of spectral/hpelement methods, and high-order finite element methods in general, continues to spread, community efforts to create efficient, optimized algorithms associated with fundamental high-order operations have grown. Core tasks such as solution expansion evaluation at quadrature points, stiffness and mass matrix generation, and matrix assembly have received tremendous attention. With the expansion of the types of problems to which high-order methods are applied, and correspondingly the growth in types of numerical tasks accomplished through high-order methods, the number and types of these core operations broaden. This work focuses on solution expansion evaluation at arbitrary points within an element. This operation is core to many postprocessing applications such as evaluation of streamlines and pathlines, as well as to field projection techniques such as mortaring. We expand barycentric interpolation techniques developed on an interval to 2D (triangles and quadrilaterals) and 3D (tetrahedra, prisms, pyramids, and hexahedra) spectral/hpelement methods. We provide efficient algorithms for their implementations, and demonstrate their effectiveness using the spectral/hpelement libraryNektar++by running a series of baseline evaluations against the ‘standard’ Lagrangian method, where an interpolation matrix is generated and matrix-multiplication applied to evaluate a point at a given location. We present results from a rigorous seriesmore »of benchmarking tests for a variety of element shapes, polynomial orders and dimensions. We show that when the point of interest is to be repeatedly evaluated, the barycentric method performs at worst$$50\%$$50%slower, when compared to a cached matrix evaluation. However, when the point of interest changes repeatedly so that the interpolation matrix must be regenerated in the ‘standard’ approach, the barycentric method yields far greater performance, with a minimum speedup factor of$$7\times $$7×. Furthermore, when derivatives of the solution evaluation are also required, the barycentric method in general slightly outperforms the cached interpolation matrix method across all elements and orders, with an up to$$30\%$$30%speedup. Finally we investigate a real-world example of scalar transport using a non-conformal discontinuous Galerkin simulation, in which we observe around$$6\times $$6×speedup in computational time for the barycentric method compared to the matrix-based approach. We also explore the complexity of both interpolation methods and show that the barycentric interpolation method requires$${\mathcal {O}}(k)$$O(k)storage compared to a best case space complexity of$${\mathcal {O}}(k^2)$$O(k2)for the Lagrangian interpolation matrix method.

    « less
  2. We consider the mathematical analysis and numerical approximation of a system of nonlinear partial differential equations that arises in models that have relevance to steady isochoric flows of colloidal suspensions. The symmetric velocity gradient is assumed to be a monotone nonlinear function of the deviatoric part of the Cauchy stress tensor. We prove the existence of a weak solution to the problem, and under the additional assumption that the nonlinearity involved in the constitutive relation is Lipschitz continuous we also prove uniqueness of the weak solution. We then construct mixed finite element approximations of the system using both conforming and nonconforming finite element spaces. For both of these we prove the convergence of the method to the unique weak solution of the problem, and in the case of the conforming method we provide a bound on the error between the analytical solution and its finite element approximation in terms of the best approximation error from the finite element spaces. We propose first a Lions–Mercier type iterative method and next a classical fixed-point algorithm to solve the finite-dimensional problems resulting from the finite element discretisation of the system of nonlinear partial differential equations under consideration and present numerical experiments that illustratemore »the practical performance of the proposed numerical method.« less
  3. In order to achieve a more accurate finite element (FE) model for an as-built structure, experimental data collected from the actual structure can be used to update selected parameters of the FE model. The process is known as FE model updating. This research compares the performance of two frequency-domain model updating approaches. The first approach minimizes the difference between experimental and simulated modal properties, such as natural frequencies and mode shapes. The second approach minimizes modal dynamic residuals from the generalized eigenvalue equation involving stiffness and mass matrices. Both model updating approaches are formulated as an optimization problem with selected updating parameters as optimization variables. This research also compares the performance of different optimization procedures, including a nonlinear least-square, an interior-point and an iterative linearization procedure. The comparison is conducted using a numerical example of a space frame structure. The modal dynamic residual approach shows better performance than the modal property difference approach in updating model parameters of the space frame structure.
  4. The classical continuous finite element method with Lagrangian Q^k basis reduces to a finite difference scheme when all the integrals are replaced by the (𝑘+1)×(𝑘+1) Gauss–Lobatto quadrature. We prove that this finite difference scheme is (𝑘+2)-th order accurate in the discrete 2-norm for an elliptic equation with Dirichlet boundary conditions, which is a superconvergence result of function values. We also give a convenient implementation for the case 𝑘=2, which is a simple fourth order accurate elliptic solver on a rectangular domain.
  5. Abstract

    The scalability and efficiency of numerical methods on parallel computer architectures is of prime importance as we march towards exascale computing. Classical methods like finite difference schemes and finite volume methods have inherent roadblocks in their mathematical construction to achieve good scalability. These methods are popularly used to solve the Navier-Stokes equations for fluid flow simulations. The discontinuous Galerkin family of methods for solving continuum partial differential equations has shown promise in realizing parallel efficiency and scalability when approaching petascale computations. In this paper an explicit modal discontinuous Galerkin (DG) method utilizing Implicit Large Eddy Simulation (ILES) is proposed for unsteady turbulent flow simulations involving the three-dimensional Navier-Stokes equations. A study of the method was performed for the Taylor-Green vortex case at a Reynolds number ranging from 100 to 1600. The polynomial orderP = 2 (third order accurate) was found to closely match the Direct Navier-Stokes (DNS) results for all Reynolds numbers tested outside of Re = 1600, which had a normalized RMS error of 3.43 × 10−4in the dissipation rate for a 603element mesh. The scalability and performance study of the method was then conducted for a Reynolds number of 1600 for polynomials orders fromP = 2 toP = 6. The highest order polynomial that was tested (P = 6)more »was found to have the most efficient scalability using both the MPI and OpenMP implementations.

    « less