Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn unfitted radial basis function generated finite difference method applied to thoracic diaphragm simulations
76
0
0.0
(
0
)
Added by
Igor Tominec
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The thoracic diaphragm is the muscle that drives the respiratory cycle of a human being. Using a system of partial differential equations (PDEs) that models linear elasticity we compute displacements and stresses in a two-dimensional cross section of the diaphragm in its contracted state. The boundary data consists of a mix of displacement and traction conditions. If these are imposed as they are, and the conditions are not compatible, this leads to reduced smoothness of the solution. Therefore, the boundary data is first smoothed using the least-squares radial basis function generated finite difference (RBF-FD) framework. Then the boundary conditions are reformulated as a Robin boundary condition with smooth coefficients. The same framework is also used to approximate the boundary curve of the diaphragm cross section based on data obtained from a slice of a computed tomography (CT) scan. To solve the PDE we employ the unfitted least-squares RBF-FD method. This makes it easier to handle the geometry of the diaphragm, which is thin and non-convex. We show numerically that our solution converges with high-order towards a finite element solution evaluated on a fine grid. Through this simplified numerical model we also gain an insight into the challenges associated with the diaphragm geometry and the boundary conditions before approaching a more complex three-dimensional model.
rate research
Read More
Localized collocation methods based on radial basis functions (RBFs) for elliptic problems appear to be non-robust in the presence of Neumann boundary conditions. In this paper we overcome this issue by formulating the RBF-generated finite difference method in a discrete least-squares setting instead. This allows us to prove high-order convergence under node refinement and to numerically verify that the least-squares formulation is more accurate and robust than the collocation formulation. The implementation effort for the modified algorithm is comparable to that for the collocation method.
We design an adaptive unfitted finite element method on the Cartesian mesh with hanging nodes. We derive an hp-reliable and efficient residual type a posteriori error estimate on K-meshes. A key ingredient is a novel hp-domain inverse estimate which allows us to prove the stability of the finite element method under practical interface resolving mesh conditions and also prove the lower bound of the hp a posteriori error estimate. Numerical examples are included.
In this work, we investigate (energy) stability of global radial basis function (RBF) methods for linear advection problems. Classically, boundary conditions (BC) are enforced strongly in RBF methods. By now it is well-known that this can lead to stability problems, however. Here, we follow a different path and propose two novel RBF approaches which are based on a weak enforcement of BCs. By using the concept of flux reconstruction and simultaneous approximation terms (SATs), respectively, we are able to prove that both new RBF schemes are strongly (energy) stable. Numerical results in one and two spatial dimensions for both scalar equations and systems are presented, supporting our theoretical analysis.
We make the split of the integral fractional Laplacian as $(-Delta)^s u=(-Delta)(-Delta)^{s-1}u$, where $sin(0,frac{1}{2})cup(frac{1}{2},1)$. Based on this splitting, we respectively discretize the one- and two-dimensional integral fractional Laplacian with the inhomogeneous Dirichlet boundary condition and give the corresponding truncation errors with the help of the interpolation estimate. Moreover, the suitable corrections are proposed to guarantee the convergence in solving the inhomogeneous fractional Dirichlet problem and an $mathcal{O}(h^{1+alpha-2s})$ convergence rate is obtained when the solution $uin C^{1,alpha}(bar{Omega}^{delta}_{n})$, where $n$ is the dimension of the space, $alphain(max(0,2s-1),1]$, $delta$ is a fixed positive constant, and $h$ denotes mesh size. Finally, the performed numerical experiments confirm the theoretical results.
This research was mainly conducted to explore the possibility of formulating an efficient algorithm to find roots of nonlinear equations without using the derivative of the function. The Weerakoon-Fernando method had been taken as the base in this project to find a new method without the derivative since Weerakoon-Fernando method gives 3rd order convergence. After several unsuccessful attempts we were able to formulate the Finite Difference Weerakoon-Fernando Method (FDWFM) presented here. We noticed that the FDWFM approaches the root faster than any other existing method in the absence of the derivatives as an example, the popular nonlinear equation solver such as secant method (order of convergence is 1.618) in the absence of the derivative. And the FDWFM had three function evaluations and secant method had two function evaluations. By implementing FDWFM on nonlinear equations with complex roots and also on systems of nonlinear equations, we received very encouraging results. When applying the FDWFM to systems of nonlinear equations, we resolved the involvement of the Jacobian problem by following the procedure in the Broydens method. The computational order of convergence of the FDWFM was close to 2.5 for all these cases. This will undoubtedly provide scientists the efficient numerical algorithm, that doesnt need the derivative of the function to solve nonlinear equations, that they were searching for over centuries.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
