Partial Relaxation of 𝐶0 Vertex Continuity of Stresses of Conforming Mixed Finite Elements for the Elasticity Problem

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jun Hu ◽  
Rui Ma

AbstractA conforming triangular mixed element recently proposed by Hu and Zhang for linear elasticity is extended by rearranging the global degrees of freedom. More precisely, adaptive meshes {\mathcal{T}_{1},\ldots,\mathcal{T}_{N}} which are successively refined from an initial mesh {\mathcal{T}_{0}} through a newest vertex bisection strategy, admit a crucial hierarchical structure, namely, a newly added vertex {\boldsymbol{x}_{e}} of the mesh {\mathcal{T}_{\ell}} is the midpoint of an edge e of the coarse mesh {\mathcal{T}_{\ell-1}}. Such a hierarchical structure is explored to partially relax the {C^{0}} vertex continuity of symmetric matrix-valued functions in the discrete stress space of the original element on {\mathcal{T}_{\ell}} and results in an extended discrete stress space: for such an internal vertex {\boldsymbol{x}_{e}} located at the coarse edge e with the unit tangential vector {t_{e}} and the unit normal vector {n_{e}=t_{e}^{\perp}}, the pure tangential component basis function {\varphi_{\boldsymbol{x}_{e}}(\boldsymbol{x})t_{e}t_{e}^{T}} of the original discrete stress space associated to vertex {\boldsymbol{x}_{e}} is split into two basis functions {\varphi_{\boldsymbol{x}_{e}}^{+}(\boldsymbol{x})t_{e}t_{e}^{T}} and {\varphi_{\boldsymbol{x}_{e}}^{-}(\boldsymbol{x})t_{e}t_{e}^{T}} along edge e, where {\varphi_{\boldsymbol{x}_{e}}(\boldsymbol{x})} is the nodal basis function of the scalar-valued Lagrange element of order k (k is equal to the polynomial degree of the discrete stress) on {\mathcal{T}_{\ell}} with {\varphi_{\boldsymbol{x}_{e}}^{+}(\boldsymbol{x})} and {\varphi_{\boldsymbol{x}_{e}}^{-}(\boldsymbol{x})} denoted its two restrictions on two sides of e, respectively. Since the remaining two basis functions {\varphi_{\boldsymbol{x}_{e}}(\boldsymbol{x})n_{e}n_{e}^{T}}, {\varphi_{\boldsymbol{x}_{e}}(\boldsymbol{x})(n_{e}t_{e}^{T}+t_{e}n_{e}^{T})} are the same as those associated to {\boldsymbol{x}_{e}} of the original discrete stress space, the number of the global basis functions associated to {\boldsymbol{x}_{e}} of the extended discrete stress space becomes four rather than three (for the original discrete stress space). As a result, though the extended discrete stress space on {\mathcal{T}_{\ell}} is still a {H(\operatorname{div})} subspace, the pure tangential component along the coarse edge e of discrete stresses in it is not necessarily continuous at such vertices like {\boldsymbol{x}_{e}}. A feature of this extended discrete stress space is its nestedness in the sense that a space on a coarse mesh {\mathcal{T}} is a subspace of a space on any refinement {\hat{\mathcal{T}}} of {\mathcal{T}}, which allows a proof of convergence of a standard adaptive algorithm. The idea is extended to impose a general traction boundary condition on the discrete level. Numerical experiments are provided to illustrate performance on both uniform and adaptive meshes.

2014 ◽  
Vol 986-987 ◽  
pp. 1418-1421
Author(s):  
Jun Shan Li

In this paper, we propose a meshless method for solving the mathematical model concerning the leakage problem when the pressure is tested in the gas pipeline. The method of radial basis function (RBF) can be used for solving partial differential equation by writing the solution in the form of linear combination of radius basis functions, that is, when integrating the definite conditions, one can find the combination coefficients and then the numerical solution. The leak problem is a kind of inverse problem that is focused by many engineers or mathematical researchers. The strength of the leak can find easily by the additional conditions and the numerical solutions.


2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Guohua Wang ◽  
Yufa Sun

A broadband radar cross section (RCS) calculation approach is proposed based on the characteristic basis function method (CBFM). In the proposed approach, the desired arbitrary frequency band is adaptively divided into multiple subband in consideration of the characteristic basis functions (CBFs) number, which can reduce the universal characteristic basis functions (UCBFs) numbers after singular value decomposition (SVD) procedure at lower subfrequency band. Then, the desired RCS data can be obtained by splicing the RCS data in each subfrequency band. Numerical results demonstrate that the proposed method achieve a high accuracy and efficiency over a wide frequency range.


2020 ◽  
Vol 20 (4) ◽  
pp. 60-83
Author(s):  
Vinícius Magalhães Pinto Marques ◽  
Gisele Tessari Santos ◽  
Mauri Fortes

ABSTRACTObjective: This article aims to solve the non-linear Black Scholes (BS) equation for European call options using Radial Basis Function (RBF) Multi-Quadratic (MQ) Method.Methodology / Approach: This work uses the MQ RBF method applied to the solution of two complex models of nonlinear BS equation for prices of European call options with modified volatility. Linear BS models are also solved to visualize the effects of modified volatility.  Additionally, an adaptive scheme is implemented in time based on the Runge-Kutta-Fehlberg (RKF) method.


Author(s):  
Takuji Watanabe ◽  
◽  
Kazuteru Miyazaki ◽  
Hiroaki Kobayashi ◽  
◽  
...  

The penalty avoiding rational policy making algorithm (PARP) [1] previously improved to save memory and cope with uncertainty, i.e., IPARP [2], requires that states be discretized in real environments with continuous state spaces, using function approximation or some other method. Especially, in PARP, a method that discretizes state using a basis functions is known [3]. Because this creates a new basis function based on the current input and its next observation, however, an unsuitable basis function may be generated in some asynchronous multiagent environments. We therefore propose a uniform basis function and range extent of the basis function is estimated before learning. We show the effectiveness of our proposal using a soccer game task called “Keepaway.”


2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
J. Zhang ◽  
F. Z. Wang ◽  
E. R. Hou

The performance of the parameter-free conical radial basis functions accompanied with the Chebyshev node generation is investigated for the solution of boundary value problems. In contrast to the traditional conical radial basis function method, where the collocation points are placed uniformly or quasi-uniformly in the physical domain of the boundary value problems in question, we consider three different Chebyshev-type schemes to generate the collocation points. This simple scheme improves accuracy of the method with no additional computational cost. Several numerical experiments are given to show the validity of the newly proposed method.


2013 ◽  
Vol 4 (1) ◽  
pp. 56-80 ◽  
Author(s):  
Ch. Sanjeev Kumar Dash ◽  
Ajit Kumar Behera ◽  
Satchidananda Dehuri ◽  
Sung-Bae Cho

In this paper a two phases learning algorithm with a modified kernel for radial basis function neural networks is proposed for classification. In phase one a new meta-heuristic approach differential evolution is used to reveal the parameters of the modified kernel. The second phase focuses on optimization of weights for learning the networks. Further, a predefined set of basis functions is taken for empirical analysis of which basis function is better for which kind of domain. The simulation result shows that the proposed learning mechanism is evidently producing better classification accuracy vis-à-vis radial basis function neural networks (RBFNs) and genetic algorithm-radial basis function (GA-RBF) neural networks.


2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Nebiye Korkmaz ◽  
Zekeriya Güney

As an approach to approximate solutions of Fredholm integral equations of the second kind, adaptive hp-refinement is used firstly together with Galerkin method and with Sloan iteration method which is applied to Galerkin method solution. The linear hat functions and modified integrated Legendre polynomials are used as basis functions for the approximations. The most appropriate refinement is determined by an optimization problem given by Demkowicz, 2007. During the calculationsL2-projections of approximate solutions on four different meshes which could occur between coarse mesh and fine mesh are calculated. Depending on the error values, these procedures could be repeated consecutively or different meshes could be used in order to decrease the error values.


Author(s):  
Lanling Ding ◽  
Zhiyong Liu ◽  
Qiuyan Xu

The radial basis functions meshfree method is a research method for thin plate problem which has gradually developed into a more mature meshfree method. It includes finite element, radial basis functions meshfree collocation method, etc. In this paper, we introduce the multilevel radial basis function collocation method for the fourth-order thin plate problem. We use nonsymmetric Kansa multilevel radial basis function collocation method to solve the fourth-order thin plate problem. Two numerical examples based on Wendland’s [Formula: see text] and [Formula: see text] functions are given to examine that the convergence of the multilevel radial basis function collocation method which is good for solving the fourth-order thin plate problem.


Author(s):  
Zhong-Gen Wang ◽  
Jun-Wen Mu ◽  
Wen-Yan Nie

In this paper, a merged ultra-wideband characteristic basis function method (MUCBFM) is presented for high-precision analysis of wideband scattering problems. Unlike existing singular value decomposition (SVD) enhanced improved ultra-wideband characteristic basis function method (SVD-IUCBFM), the MUCBFM reduces the number of characteristic basis functions (CBFs) necessary to express a current distribution. This reduction is achieved by combining primary CBFs (PCBFs) with the secondary level CBFs (SCBFs) to form a single merged ultra-wideband characteristic basis function (MUCBF). As the MUCBF incorporates the effects of PCBFs and SCBFs, the accuracy does not change significantly compared to that obtained by the SVD-IUCBFM. Furthermore, the efficiencies of constructing the CBFs and filling the reduced matrix are improved. Numerical examples verify and demonstrate that the proposed method is credible both in terms of accuracy and efficiency.


2000 ◽  
Vol 10 (02) ◽  
pp. 481-492 ◽  
Author(s):  
A. I. FEDOSEYEV ◽  
M. J. FRIEDMAN ◽  
E. J. KANSA

The Multiquadric Radial Basis Function (MQ) Method is a meshless collocation method with global basis functions. It is known to have exponentional convergence for interpolation problems. We descretize nonlinear elliptic PDEs by the MQ method. This results in modest-size systems of nonlinear algebraic equations which can be efficiently continued by standard continuation software such as AUTO and CONTENT. Examples are given of detection of bifurcations in 1D and 2D PDEs. These examples show high accuracy with small number of unknowns, as compared with known results from the literature.


Sign in / Sign up

Export Citation Format

Share Document