油水运移聚集数值模拟和分析

油资源的运移聚集数值模拟是描述在盆地发育中油水运移聚集演化的历史,它对于油田的勘探和合理开发有着重要的价值.本文提出问题的数学模型和修正交替方向隐式迭式格式.对于着名的二次运移聚集的水动力学实验(剖面和平面问题),进行了数值模拟,模拟结果和实验结果是完全吻合的.     

Nonstandard discretizations of the generalized Nagumo reaction‐diffusion equation

A competitive nonstandard semi‐explicit finite‐difference method is constructed and used to obtain numerical solutions of the diffusion‐free generalized Nagumo equation. Qualitative stability analysis and numerical simulations show that this scheme is more robust in comparison to some standard explicit methods such as forward Euler and the fourth‐order Runge‐Kutta method (RK4). The nonstandard scheme is extended to construct a semi‐explicit and an implicit scheme to solve the full Nagumo reaction‐diffusion equation. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 363–379, 2003.     

A Finite Volume Method Preserving Maximum Principle for the Conjugate Heat Transfer Problems with General Interface Conditions

In this paper, we present a unified finite volume method preserving discrete maximum principle (DMP) for the conjugate heat transfer problems with general interface conditions. We prove the existence of the numerical solution and the DMP-preserving property. Numerical experiments show that the nonlinear iteration numbers of the scheme in [24] increase rapidly when the interfacial coefficients decrease to zero. In contrast, the nonlinear iteration numbers of the unified scheme do not increase when the interfacial coefficients decrease to zero, which reveals that the unified scheme is more robust than the scheme in [24]. The accuracy and DMP-preserving property of the scheme are also veried in the numerical experiments.     

A Crank-Nicolson scheme for the Landau-Lifshitz equation without damping

An accurate and efficient numerical approach, based on a finite difference method with Crank-Nicolson time stepping, is proposed for the Landau-Lifshitz equation without damping. The phenomenological Landau-Lifshitz equation describes the dynamics of ferromagnetism. The Crank-Nicolson method is very popular in the numerical schemes for parabolic equations since it is second-order accurate in time. Although widely used, the method does not always produce accurate results when it is applied to the Landau-Lifshitz equation. The objective of this article is to enumerate the problems and then to propose an accurate and robust numerical solution algorithm. A discrete scheme and a numerical solution algorithm for the Landau-Lifshitz equation are described. A nonlinear multigrid method is used for handling the nonlinearities of the resulting discrete system of equations at each time step. We show numerically that the proposed scheme has a second-order convergence in space and time.     

三维油资源运移聚集的模拟和应用

盆地发育的运移聚集史数值模拟,其功能是重建油气盆地的运移聚集演化史,它对于油资源的勘探,确定油藏位置和计算油藏贮量,寻找新的油田,具有极其重要的价值.本文从地质科学实际出发,研究了三维问题的地质和渗流力学特征,提出二阶修正算子分裂隐式迭代格式,对着名油水运移聚集实验进行了数值模拟,结果基本吻合,并对胜利油田东营凹陷的实际问题进行数值模拟试验,结果和实际地质情况(油田位置等)基本吻合,成功解决了这一着名问题.     

On the solution a of second order singularly-perturbed boundary value problem by the Sinc-Galerkin method

Sinc methods are now recognized as an efficient numerical method for problems whose solutions may have singularities, or infinite domains, or boundary layers. This work deals with the Sinc-Galerkin method for solving second order singularly perturbed boundary value problems. The method is then tested on linear and nonlinear examples and a comparison with spline method and finite element scheme is made. It is shown that the Sinc-Galerkin method yields better results.Received: January 3, 2003; revised: July 14, 2003     

Interior‐point methods and preconditioning for PDE‐constrained optimization problems involving sparsity terms

Partial differential equation (PDE)–constrained optimization problems with control or state constraints are challenging from an analytical and numerical perspective. The combination of these constraints with a sparsity‐promoting L¹ term within the objective function requires sophisticated optimization methods. We propose the use of an interior‐point scheme applied to a smoothed reformulation of the discretized problem and illustrate that such a scheme exhibits robust performance with respect to parameter changes. To increase the potency of this method, we introduce fast and efficient preconditioners that enable us to solve problems from a number of PDE applications in low iteration numbers and CPU times, even when the parameters involved are altered dramatically.     

Optimization via Chebyshev polynomials

This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS differentiation matrices. In addition, the method exhibits quadratic convergence rate by enforcing an adaptive Newton search iterative scheme. A rigorous error analysis of the proposed method is presented along with a detailed set of pseudocodes for the established computational algorithms. Several numerical experiments are conducted on one- and multi-dimensional optimization test problems to illustrate the advantages of the proposed strategy.     

Résolution numérique d'un problème elliptique fortement anisotrope en deux dimensions par une méthode de paramétrisation

We introduce a numerical method for solving an anisotropic elliptic problem. We address the case where the direction of the anisotropy varies, and the anisotropy is high. A finite volume scheme is implemented to solve the problem for small anisotropy ratio, then the parameterization method consists in devising an extrapolation of the solution of the anisotropic problem by combining solutions of a sequence of isotropic problems. To cite this article: P. Guillaume, V. Latocha, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

A Geometric Integration Approach to Nonsmooth,Nonconvex Optimisation

The optimisation of nonsmooth, nonconvex functions without access to gradients is a particularly challenging problem that is frequently encountered, for example in model parameter optimisation problems. Bilevel optimisation of parameters is a standard setting in areas such as variational regularisation problems and supervised machine learning. We present efficient and robust derivative-free methods called randomised Itoh–Abe methods. These are generalisations of the Itoh–Abe discrete gradient method, a well-known scheme from geometric integration, which has previously only been considered in the smooth setting. We demonstrate that the method and its favourable energy dissipation properties are well defined in the nonsmooth setting. Furthermore, we prove that whenever the objective function is locally Lipschitz continuous, the iterates almost surely converge to a connected set of Clarke stationary points. We present an implementation of the methods, and apply it to various test problems. The numerical results indicate that the randomised Itoh–Abe methods can be superior to state-of-the-art derivative-free optimisation methods in solving nonsmooth problems while still remaining competitive in terms of efficiency.

     

有限体积法与多重网格法用于提高激波捕捉质量及加速收敛

多重网格技术是一种非常有效的数值计算方法，本文采用多重网格的ＦＡＳ格式进行数值实验，计算加速效果十分明显，同时，结合矢通量分裂用有限体积法，大大提高了主激波的质量。     

Discontinuous Galerkin method for solving the black‐oil problem in porous media

We introduce a new algorithm for solving the three‐component three‐phase flow problem in two‐dimensional and three‐dimensional heterogeneous media. The oil and gas components can be found in the liquid and vapor phases, whereas the aqueous phase is only composed of water component. The numerical scheme employs a sequential implicit formulation discretized with discontinuous finite elements. Capillarity and gravity effects are included. The method is shown to be accurate and robust for several test problems. It has been carefully designed so that calculation of appearance and disappearance of phases does not require additional steps.     

Numerical analysis of singularly perturbed delay differential turning point problem

In this paper, we describe a numerical method based on fitted operator finite difference scheme for the boundary value problems for singularly perturbed delay differential equations with turning point and mixed shifts. Similar boundary value problems are encountered while simulating several real life processes for instance, first exit time problem in the modelling of neuronal variability. A rigorous analysis is carried out to obtain priori estimates on the solution and its derivatives for the considered problem. In the development of numerical methods for constructing an approximation to the solution of the problem, a special type of mesh is generated to tackle the delay term along with the turning point. Then, to develop robust numerical scheme and deal with the singularity because of the small parameter multiplying the highest order derivative term, an exponential fitting parameter is used. Several numerical examples are presented to support the theory developed in the paper.     

An unfitted interface penalty method for the numerical approximation of contrast problems

We aim to approximate contrast problems by means of a numerical scheme which does not require that the computational mesh conforms with the discontinuity between coefficients. We focus on the approximation of diffusion-reaction equations in the framework of finite elements. In order to improve the unsatisfactory behavior of Lagrangian elements for this particular problem, we resort to an enriched approximation space, which involves elements cut by the interface. Firstly, we analyze the H¹-stability of the finite element space with respect to the position of the interface. This analysis, applied to the conditioning of the discrete system of equations, shows that the scheme may be ill posed for some configurations of the interface. Secondly, we propose a stabilization strategy, based on a scaling technique, which restores the standard properties of a Lagrangian finite element space and results to be very easily implemented. We also address the behavior of the scheme with respect to large contrast problems ending up with a choice of Nitsche?s penalty terms such that the extended finite element scheme with penalty is robust for the worst case among small sub-elements and large contrast problems. The theoretical results are finally illustrated by means of numerical experiments.     

Modified Jarratt method for computing multiple roots

In this paper, we present a fourth order method for computing multiple roots of nonlinear equations. The method is based on Jarratt scheme for simple roots [P. Jarratt, Some efficient fourth order multipoint methods for solving equations, BIT 9 (1969) 119-124]. The method is optimal, since it requires three evaluations per step, namely one evaluation of function and two evaluations of first derivative. The efficacy is tested on a number of relevant numerical problems. It is observed that the present scheme is competitive with other similar robust methods.     

一种健壮的低耗散通量分裂格式

随着计算流体力学的快速发展,设计精确、高效并且健壮的数值格式变得尤为重要.通过对3种流行的通量分裂方法(AUSM、Zha-Bilgen和Toro-Vázquez)的对流通量和压力通量进行特征分析,构造了一种简单、低耗散并且健壮的通量分裂格式(命名为R-ZB格式).采用Zha-Bilgen分裂方法将Euler方程的通量分裂成对流通量和压力通量,其中对流通量采用迎风方法来计算,压力通量采用低耗散的HLL格式来计算,从而克服了原始的HLL格式不能精确分辨接触间断的缺点.数值实验表明,该文给出的R-ZB格式不仅保留了原始Zha-Bilgen格式简单高效、能够精确分辨接触间断等优点,而且具有更好的健壮性,在计算二维问题时不会出现数值激波不稳定现象.     

Robust a Simulation for Shallow Flows with Friction on Rough Topography

In this paper, we propose a robust finite volume scheme to numerically solve the shallow water equations on complex rough topography. The major difficulty of this problem is introduced by the stiff friction force term and the wet/dry interface tracking. An analytical integration method is presented for the friction force term to remove the stiffness. In the vicinity of wet/dry interface, the numerical stability can be attained by introducing an empirical parameter, the water depth tolerance, as extensively adopted in literatures. We propose a problem independent formulation for this parameter, which provides a stable scheme and preserves the overall truncation error of $\mathbb{O}$∆$x^3$. The method is applied to solve problems with complex rough topography, coupled with $h$-adaptive mesh techniques to demonstrate its robustness and efficiency.     

An Iterative Tikhonov Regularization for Solving Singularly Perturbed Elliptic PDE

In this paper, we consider a class of singularly perturbed elliptical problems with homogeneous boundary conditions. We consider a regularized iterative method for solving such problems. Convergence analysis and error estimate are derived. The regularization parameter is chosen according to an a priori strategy. We give numerical results to illustrate that the method is implementable compared with numerical methods such as Shishkin and finite element schemes. The study demonstrates that the iterated regularized scheme can be considered as an alternate method for solving singularly perturbed elliptical problems.     

Numerical analysis of processes of thermoplastic deformation of axisymmetric bodies with regard for unloading

We investigate the thermoelastoplastic state of an isotropic homogeneous medium under the action of temperature loads. A mathematical model of plastic flow is considered. We propose a method for constructing an unconditionally stable numerical scheme of the finite-element method for the solution of such problems. The process of propagation of the primary and secondary unloading zones in a body is shown. The time distribution of the intensity of plastic strain at a corner point of the body is presented. Results obtained without regard for the dependence of the yield strength on temperature and with regard for it are investigated.