虚拟解法分析浸入边界法的精度

浸入边界法是对流固耦合系统进行建模和模拟的有效工具,在生物力学领域的应用尤为广泛．该文的工作主要包含两个部分:程序验证和精度分析．前者证明了程序的正确性,后者给出了浸入边界法的精度．两部分工作均使用虚拟解法作为研究工具．在程序验证部分,使用二阶空间离散格式进行数值计算,通过分析各种变量的离散误差,得到的程序计算精度阶是二阶,与理论精度阶一致,证明了数值计算所使用程序的正确性．精度分析部分工作在此基础上展开．引入压强跳跃,在动量方程中加入相应源项,通过分析带有源项的控制方程中各物理量的离散误差,证明浸入边界法只具有一阶精度．同时可以得出以下结论:粗网格无法敏感地捕捉浸入边界的影响;当Euler网格固定时,增加Lagrange标志点的数目并不会改善计算误差．     

三维弹性问题无网格分析的奇异杂交边界点方法

提出了一种求解三维线弹性问题的奇异杂交边界点方法．将修正变分原理与移动最小二乘法结合起来,利用了前者的降维优势和后者的无网格特性．使用刚体位移法处理方法中的强奇异积分,提出了一种自适应的积分方案,解决了原有的杂交边界点方法中存在的“边界层效应”．在该方法中,将基本解的源点直接布在边界上,避免了在正则化杂交边界点法中不确定参数的选取．三维弹性力学问题算例体现了这些特点．结果表明该方法与已知的精确解符合较好,同时研究了影响该方法精度的一些参数．     

在有限差分法下一类抛物型方程的离散化

本文对于一类带有狄拉克函数δ０初值的抛物型方程，在有限差分法下进行离散化，证明了其数值解的存在性、唯一性，尤其是它的稳定性．     

重调和椭圆边值问题的正则积分方程

我们熟知,利用位势理论或由Green公式及基本解出发区域内调和及重调和边值问题可归化为边界上的积分方程。近年来冯康又提出一种更自然而直接的归化,即从Green公式及Green函数出发将微分方程边值问题化为边界上的含有广义函数意义下发散积分有限部分的奇异积分方程,这种归化在各种边界归化中占有特殊地位,被称为正则边界归化,本文将这一理论应用于重调和椭圆边值问题,研究了其正则归化的性质,并通过利用Green函数、Fourier分析及复变函数论方法等不同途径求出了在上半平面、单位圆内部、单位圆外部三种区域的Poisson积分公式及正则积分方程,其离散化可用于实际计算。 本文是在导师冯康教授指导下完成的,作者谨在此对他表示衷心的感谢。     

求解一维侧边热传导方程反问题的正则化方法

研究了一维侧边热传导方程反问题.在求解一维侧边热传导方程的基础上,利用数值积分法进行离散化处理,然后引入正则化方法,采用偏差原理确定正则化参数,从而得到一维侧边热传导方程反问题的数值解.数值模拟结果表明,给出的正则化方法对于求解一维侧边热传导方程反问题是可行有效的.     

Pasternak地基上简支板振动问题的准格林函数方法

提出一种新的数值方法——准格林函数方法．以Pasternak地基上简支多边形薄板的振动问题为例,详细阐明了准格林函数方法的思想．即利用问题的基本解和边界方程构造一个准格林函数,这个函数满足了问题的齐次边界条件,采用格林公式将Pasternak地基上薄板自由振动问题的振型控制微分方程化为两个耦合的第二类Fredholm积分方程．边界方程有多种选择,在选定一种边界方程的基础上,可以通过建立一个新的边界方程来表示问题的边界,以克服积分核的奇异性,最后由积分方程的离散化方程组有非平凡解的条件,求得固有频率．数值方法表明,该方法具有较高的精度．     

一种带噪声的周期函数数值微分方法

本文利用Thkhonov正则化方法讨论了带有噪声离散数据的周期函数的数值微分问题,证明了该方法存在唯一的三次周期样条函数解,并给出了其误差估计,而且从理论和数值例子说明了此方法的有效性．     

非线性不适定问题正则解的最优收敛率

用带闭线性算子的Ｔｉｋｈｏｎｏｖ正则化方程研究非线性不适定问题,得到了正则解的最优收敛率Ｏ（δ＾２／３）。     

二维Monge-Ampère型方程的Neumann问题

该文通过构造闸函数将整体约化到边界,证明了二维Monge-Ampère型方程Neumann边值问题解的二阶导数估计,进而得到该方程Neumann边值问题经典解的存在性以及正则性.     

求解病态线性方程组的误差转移法和增广方程组法的机理及算法改进

为获得病态线性方程组的高精度解,建立了一种优化模型,其最优解等价于早先提出的误差转移法和增广方程组法;指出后两者的本质机理是通过极小化解的模来近似极小化解的误差.为使算法适用于数据有污染的情况,进行了正则化改造.证明了新算法理论上与Tikhonov正则化等价.但当正则化参数趋于0时,目标函数的不同使得两者性能迥异,新算法可直接用于数据无污染的情况,而后者仍需选取合适的正则参数.数值算例验证了算法的有效性.     

Analysis of the immersed boundary method for a finite element Stokes problem

Convergence results are presented for the immersed boundary (IB) method applied to a model Stokes problem. As a discretization method, we use the finite element method. First, the immersed force field is approximated using a regularized delta function. Its error in the W^{?1, p} norm is examined for 1 ≤ p < n/(n ? 1), with n representing the space dimension. Subsequently, we consider IB discretization of the Stokes problem and examine the regularization and discretization errors separately. Consequently, error estimate of order h^{1 ? α} in the W^{1, 1} × L¹ norm for the velocity and pressure is derived, where α is an arbitrary small positive number. The validity of those theoretical results is confirmed from numerical examples.     

The comparison between the DRBEM and DQM solution of nonlinear reaction–diffusion equation

In this study, both the dual reciprocity boundary element method and the differential quadrature method are used to discretize spatially, initial and boundary value problems defined by single and system of nonlinear reaction–diffusion equations. The aim is to compare boundary only and a domain discretization method in terms of accuracy of solutions and computational cost. As the time integration scheme, the finite element method is used achieving solution in terms of time block with considerably large time steps. The comparison between the dual reciprocity boundary element method and the differential quadrature method solutions are made on some test problems. The results show that both methods achieve almost the same accuracy when they are combined with finite element method time discretization. However, as a method providing very good accuracy with considerably small number of grid points differential quadrature method is preferrable.     

Numerical discretization-based kernel type estimation methods for ordinary differential equation models

We consider the problem of parameter estimation in both linear and nonlinear ordinary differential equation(ODE) models. Nonlinear ODE models are widely used in applications. But their analytic solutions are usually not available. Thus regular methods usually depend on repetitive use of numerical solutions which bring huge computational cost. We proposed a new two-stage approach which includes a smoothing method(kernel smoothing or local polynomial fitting) in the first stage, and a numerical discretization method(Eulers discretization method, the trapezoidal discretization method,or the Runge–Kutta discretization method) in the second stage. Through numerical simulations, we find the proposed method gains a proper balance between estimation accuracy and computational cost.Asymptotic properties are also presented, which show the consistency and asymptotic normality of estimators under some mild conditions. The proposed method is compared to existing methods in term of accuracy and computational cost. The simulation results show that the estimators with local linear smoothing in the first stage and trapezoidal discretization in the second stage have the lowest average relative errors. We apply the proposed method to HIV dynamics data to illustrate the practicability of the estimator.     

On regularization and discretization control for the numerical solution of inverse problems in parabolic equations

In this paper, the influence of modelling, a priori information, discretization and measurement error to the numerical solution of inverse problems is investigated. Given an a priori approximation of the unknown parameter function in a parabolic problem, we propose a strategy for the regularized determination of a skeleton solution to the inverse problem. This strategy is based on a discretization control of the forward problem in order to find a trade-off between accuracy and computational efficiency. Numerical results with regard to a nonlinear inverse heat conduction problem illustrate the study.     

Convergence of the Swartztrauber-Sweet Method for Parabolic Problems on a Disk with Singularities

In this article, we study the convergence analysis for the initial and boundary value problem of parabolic equations on a disk with singular solutions. It is assumed that the exact solution performs singular properties that its derivatives go to infinity at the boundary of the disk. We propose a fully implicit time-stepping numerical scheme. A stretching polynomial-like function with a parameter is used to construct a local grid refinement. Over the nonuniform partition, we combine the Swartztrauber-Sweet scheme and the backward Euler method in spatial and temporal discretization, respectively. We carry out convergence analysis and analyze the effects of the parameter. It is shown that our numerical scheme is of first order accuracy for temporal discretization and of almost second order accuracy for spatial discretization. Numerical experiments are performed to illustrate our analysis results and show that there exists an optimal value for the parameter to obtain a best approximate solution.     

Adaptive optimal control of Signorini’s problem

In this article, we present a-posteriori error estimations in context of optimal control of contact problems; in particular of Signorini’s problem. Due to the contact side-condition, the solution operator of the underlying variational inequality is not differentiable, yet we want to apply Newton’s method. Therefore, the non-smooth problem is regularized by penalization and afterwards discretized by finite elements. We derive optimality systems for the regularized formulation in the continuous as well as in the discrete case. This is done explicitly for Signorini’s contact problem, which covers linear elasticity and linearized surface contact conditions. The latter creates the need for treating trace-operations carefully, especially in contrast to obstacle contact conditions, which exert in the domain. Based on the dual weighted residual method and these optimality systems, we deduce error representations for the regularization, discretization and numerical errors. Those representations are further developed into error estimators. The resulting error estimator for regularization error is defined only in the contact area. Therefore its computational cost is especially low for Signorini’s contact problem. Finally, we utilize the estimators in an adaptive refinement strategy balancing regularization and discretization errors. Numerical results substantiate the theoretical findings. We present different examples concerning Signorini’s problem in two and three dimensions.     

Goal-oriented error estimates including algebraic errors in discontinuous Galerkin discretizations of linear boundary value problems

We deal with a posteriori error control of discontinuous Galerkin approximations for linear boundary value problems. The computational error is estimated in the framework of the Dual Weighted Residual method (DWR) for goal-oriented error estimation which requires to solve an additional (adjoint) problem. We focus on the control of the algebraic errors arising from iterative solutions of algebraic systems corresponding to both the primal and adjoint problems. Moreover, we present two different reconstruction techniques allowing an efficient evaluation of the error estimators. Finally, we propose a complex algorithm which controls discretization and algebraic errors and drives the adaptation of the mesh in the close to optimal manner with respect to the given quantity of interest.     

Some new analysis results for a class of interface problems

Interface problems modeled by differential equations have many applications in mathematical biology, fluid mechanics, material sciences, and many other areas. Typically, interface problems are characterized by discontinuities in the coefficients and/or the Dirac delta function singularities in the source term. Because of these irregularities, solutions to the differential equations are not smooth or discontinuous. In this paper, some new results on the jump conditions of the solution across the interface are derived using the distribution theory and the theory of weak solutions. Some theoretical results on the boundary singularity in which the singular delta function is at the boundary are obtained. Finally, the proof of the convergency of the immersed boundary (IB) method is presented. The IB method is shown to be first‐order convergent in L ^∞ norm. Copyright © 2013 John Wiley & Sons, Ltd.     

An immersed boundary–lattice Boltzmann approach to study the dynamics of elastic membranes in viscous shear flows

A combined immersed boundary–lattice Boltzmann approach is used to simulate the dynamics of elastic membrane immersed in a viscous incompressible flow. The lattice Boltzmann method is utilized to solve the flow field on a regular Eulerian grid, while the immersed boundary method is employed to incorporate the fluid–membrane interaction with a Lagrangian representation of the deformable immersed boundary. The distinct feature of the method used here is to employ the combination of simple Peskin's IBM and standard LBM. In order to obtain more accurate and truthful solutions, however, a non-uniform distribution of Lagrangian points and a modified Dirac delta function are used. Two test cases are presented. In the first case, we consider a vesicle suspended in a simple shear flow commonly known as tank-treading motion. The computed results were compared with experiments, which showed reasonably good agreement. For the second test case, we consider individual healthy (soft) and sick (stiff) RBCs suspended in a shear flow. The simulation results demonstrated that elastic deformation plays an important role in overall RBC motions characterized as tank-treading and tumbling motions, in which the natural state of the elastic membrane is an essential consideration. In addition, the results confirm that the combination of the immersed boundary and lattice Boltzmann methods permits the simulation of the complex biological phenomena.     

Simulation of Premixed Turbulent Combustion in a Gas Engine using the Immersed Boundary Method and a Level Set Flame Model

An efficient simulation approach for turbulent flame brush propagation is a level set formulation closed by the turbulent flame speed. A formulation of the level set equation with the corresponding treatment of the turbulent mass burning rate that is compatible with standard Finite Volume discretization schemes available in computational fluid dynamics codes is employed. In order to simplify and to speed up the meshing process in complicated geometries (here in gas engines) the immersed boundary method in a continuous formulation, where the forces replacing the boundaries are introduced in the momentum conservation equations before discretization, is employed. In our contribution, aspects of the numerical implementation of the level set flame model combined with the immersed boundary formulation in OpenFOAM are presented. First representative simulation results of a homogeneous methane/air mixture combustion in a simplified engine geometry are shown. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)