 Award ID(s):
 2011615
 NSFPAR ID:
 10347006
 Editor(s):
 Taylor And Francis Online
 Date Published:
 Journal Name:
 Applicable analysis
 ISSN:
 00036811
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

We provide a short introduction to the devising of a special type of methods for numerically approximating the solution of Hamiltonian partial differential equations. These methods use Galerkin spacediscretizations which result in a system of ODEs displaying a discrete version of the Hamiltonian structure of the original system. The resulting system of ODEs is then discretized by a symplectic timemarching method. This combination results in highorder accurate, fully discrete methods which can preserve the invariants of the Hamiltonian defining the ODE system. We restrict our attention to linear Hamiltonian systems, as the main results can be obtained easily and directly, and are applicable to many Hamiltonian systems of practical interest including acoustics, elastodynamics, and electromagnetism. After a brief description of the Hamiltonian systems of our interest, we provide a brief introduction to symplectic timemarching methods for linear systems of ODEs which does not require any background on the subject. We describe then the case in which finitedifference spacediscretizations are used and focus on the popular Yee scheme (1966) for electromagnetism. Finally, we consider the case of finiteelement space discretizations. The emphasis is placed on the conservation properties of the fully discrete schemes. We end by describing ongoing work.more » « less

Abstract As the use of spectral/
hp element methods, and highorder finite element methods in general, continues to spread, community efforts to create efficient, optimized algorithms associated with fundamental highorder 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 highorder methods are applied, and correspondingly the growth in types of numerical tasks accomplished through highorder 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/hp element methods. We provide efficient algorithms for their implementations, and demonstrate their effectiveness using the spectral/hp element libraryNektar++ by running a series of baseline evaluations against the ‘standard’ Lagrangian method, where an interpolation matrix is generated and matrixmultiplication applied to evaluate a point at a given location. We present results from a rigorous series 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 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$$50\%$$ $50\%$ . 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$$7\times $$ $7\times $ speedup. Finally we investigate a realworld example of scalar transport using a nonconformal discontinuous Galerkin simulation, in which we observe around$$30\%$$ $30\%$ speedup in computational time for the barycentric method compared to the matrixbased approach. We also explore the complexity of both interpolation methods and show that the barycentric interpolation method requires$$6\times $$ $6\times $ storage compared to a best case space complexity of$${\mathcal {O}}(k)$$ $O\left(k\right)$ for the Lagrangian interpolation matrix method.$${\mathcal {O}}(k^2)$$ $O\left({k}^{2}\right)$ 
In recent years, there has been significant interest in the development of finite element methods defined on meshes that include rather general polytopes and curvilinear polygons. In the present work, we provide tools necessary to employ multiply connected mesh cells in planar domains, i.e., cells with holes, in finite element computations. Our focus is efficient evaluation of the \(H^1\) semiinner product and \(L^2\) inner product of implicitly defined finite element functions of the types arising in boundary element based finite element methods and virtual element methods. Such functions are defined as solutions of Poisson problems having a polynomial source term and continuous boundary data. We show that the integrals of interest can be reduced to integrals along the boundaries of mesh cells, thereby avoiding the need to perform any computations in cell interiors. The dominating cost of this reduction is solving a relatively small Nyström system to obtain a DirichlettoNeumann map, as well as the solution of two more Nyström systems to obtain an “antiLaplacian” of a harmonic function, which is used for computing the \(L^2\) inner product. Several numerical examples demonstrate the highorder accuracy of this approach. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at both https://github.com/samreynoldsmath/PuncturedFEM and the supplementary materials (PuncturedFEM\_v0\_2\_5.zip [1.75MB]).more » « less

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 fixedpoint algorithm to solve the finitedimensional problems resulting from the finite element discretisation of the system of nonlinear partial differential equations under consideration and present numerical experiments that illustrate the practical performance of the proposed numerical method.more » « less

In order to achieve a more accurate finite element (FE) model for an asbuilt 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 frequencydomain 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 leastsquare, an interiorpoint 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.more » « less