Isogeometric analysis with piece-wise constant test functions

10/16/2019
by   Maciej Paszynski, et al.
0

We focus on finite element method computations. We show that systems of linear equations resulting from Galerkin discretizations with C1 test functions are algebraically equivalent to systems of linear equations resulting from discretizations with piece-wise constant test functions. We show that test functions that fulfill the partition of unity can be eliminated from the system of linear equations. The rows of the system matrix can be combined, and the test functions can be sum up to 1 using the partition of unity property at the quadrature points. The test functions in higher continuity IGA can be set to piece-wise constants without losing any accuracy. It is equivalent to testing with piece-wise constant basis functions, with supports span over some parts of the domain. This observation has the following consequences. The numerical integration cost can be reduced because we do not need to evaluate the test functions since they are equal to 1. This reduction of test functions can be performed for an arbitrary linear differential operator resulting from the Galerkin method applied to a PDE where we use C^1 continuity basis functions. This observation is valid for any basis functions preserving the partition of unity property. It is independent of the problem dimension and geometry of the computational domain. It also can be used in time-dependent problems, e.g., in the explicit dynamics computations, where we can reduce the cost of generation of the right-hand side. In particular, this observation works for any computational problem that can be solved using the Galerkin method with isogeometric analysis with higher continuity test functions. The Galerkin approximation with C1 continuity is equivalent to linear combinations of the collocations at points and with weights resulting from applied quadrature, over the spans defined by supports of test functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2019

A new Fragile Points Method (FPM) in computational mechanics, based on the concepts of Point Stiffnesses and Numerical Flux Corrections

In this paper, a new method, named the Fragile Points Method (FPM), is d...
research
09/25/2022

Reduced basis stochastic Galerkin methods for partial differential equations with random inputs

We present a reduced basis stochastic Galerkin method for partial differ...
research
12/24/2022

Automatic stabilization of finite-element simulations using neural networks and hierarchical matrices

Petrov-Galerkin formulations with optimal test functions allow for the s...
research
09/11/2023

A Locking-Free Weak Galerkin Finite Element Method for Linear Elasticity Problems

In this paper, we introduce and analyze a lowest-order locking-free weak...
research
08/16/2019

Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations

Galerkin and Petrov-Galerkin methods are some of the most successful sol...
research
02/20/2020

A matrix-free Discontinuous Galerkin method for the time dependent Maxwell equations in unbounded domains

A Discontinuous Galerkin (DG) Finite Element Method (FEM) approach for t...
research
06/21/2023

An efficient mass lumping scheme for isogeometric analysis based on approximate dual basis functions

In this contribution, we provide a new mass lumping scheme for explicit ...

Please sign up or login with your details

Forgot password? Click here to reset