A second-order difference scheme for a parameterized singular perturbation problem

In this paper we consider a singularly perturbed quasilinear boundary value problem depending on a parameter. The problem is discretized using a hybrid difference scheme on Shishkin-type meshes. We show that the scheme is second-order convergent, in the discrete maximum norm, independent of singular perturbation parameter. Numerical experiments support these theoretical results.     

Ramification of a finite flat group scheme over a local field

In this paper, we analyze ramification in the sense of Abbes-Saito of a finite flat group scheme over the ring of integers of a complete discrete valuation field of mixed characteristic (0,p). We deduce that its Galois representation depends only on its reduction modulo explicitly computed p-power. We also give a new proof of a theorem of Fontaine on ramification of a finite flat Galois representation, and extend it to the case where the residue field may be imperfect.     

A uniformly convergent difference scheme for a semilinear singular perturbation problem

Summary We present a difference scheme for solving a semilinear singular perturbation problem with any number of turning points of arbitrary orders. It is shown that a solution of the scheme converges, uniformly in a perturbation parameter, to that of the continuous problem.     

A finite volume scheme for nonlinear parabolic equations derived from one-dimensional local dirichlet problems

In this paper, we propose a new method to compute the numerical flux of a finite volume scheme, used for the approximation of the solution of the nonlinear partial differential equation u_t+div(qf(u))−ΔΦ(u)=0 in a 1D, 2D or 3D domain. The function Φ is supposed to be strictly increasing, but some values s such that Φ′(s)=0 can exist. The method is based on the solution, at each interface between two control volumes, of the nonlinear elliptic two point boundary value problem (qf(υ)+(Φ(υ))′)′=0 with Dirichlet boundary conditions given by the values of the discrete approximation in both control volumes. We prove the existence of a solution to this two point boundary value problem. We show that the expression for the numerical flux can be yielded without referring to this solution. Furthermore, we prove that the so designed finite volume scheme has the expected stability properties and that its solution converges to the weak solution of the continuous problem. Numerical results show the increase of accuracy due to the use of this scheme, compared to some other schemes.     

Fourth order algorithms for a semilinear singular perturbation problem

Fourth order finite-difference algorithms for a semilinear singularly perturbed reaction–diffusion problem are discussed and compared both theoretically and numerically. One of them is the method of Sun and Stynes (1995) which uses a piecewise equidistant discretization mesh of Shishkin type. Another one is a simplified version of Vulanović's method (1993), based on a discretization mesh of Bakhvalov type. It is shown that the Bakhvalov mesh produces much better numerical results. This revised version was published online in June 2006 with corrections to the Cover Date.     

A hypercyclic finite rank perturbation of a unitary operator

A unitary operator V and a rank 2 operator R acting on a Hilbert space H{mathcal{H}} are constructed such that V + R is hypercyclic. This answers affirmatively a question of Salas whether a finite rank perturbation of a hyponormal operator can be supercyclic.     

A non-standard finite difference scheme for convection in a porous cavity

In this paper, a non-standard finite difference scheme is proposed for solving a steady finite Rayleigh number convection in a porous cavity with an inclined magnetic field and non-uniform internal heating. Numerical results are compared with the classical finite difference scheme.     

Error and erasure correcting algorithms for rank codes

In this paper, transmitted signals are considered as square matrices of the Maximum rank distance (MRD) (n, k, d)-codes. A new composed decoding algorithm is proposed to correct simultaneously rank errors and rank erasures. If the rank of errors and erasures is not greater than the Singleton bound, then the algorithm gives always the correct decision. If it is not a case, then the algorithm gives still the correct solution in many cases but some times the unique solution may not exist.     

Adaptive finite element algorithms for eigenvalue problems based on local averaging type a posteriori error estimates

The local averaging technique has become a popular tool in adaptive finite element methods for solving partial differential boundary value problems since it provides efficient a posteriori error estimates by a simple postprocessing. In this paper, the technique is introduced to solve a class of symmetric eigenvalue problems. Its efficiency and reliability are proved by both the theory and numerical experiments structured meshes as well as irregular meshes. Dedicated to Charles A. Micchelli on his 60th birthday Mathematics subject classifications (2000) 65N15, 65N25, 65N30, 65N50. Subsidized by the Special Funds for Major State Basic Research Projects, and also supported in part by the Chinese National Natural Science Foundation and the Knowledge Innovation Program of the Chinese Academy of Sciences.     

多孔介质中两相不可压缩流体的时间局部网格加密有限差分格式

引入Charent压力变量,对于多孔介质中两相不可压缩流体的非混溶驱动问题,其模型表现为耦合的非线性偏微分方程组,一个是压力方程,另一个为饱和度方程．文中考虑一维问题且假定达西速度“已知,建立了在时间上进行局部加密的有限差分格式,给出了饱和度的最大模误差估计．最后给出了数值算例．     

Uniform fourth order difference scheme for a singular perturbation problem

Summary The numerical solution of a nonlinear singularly perturbed two-point boundary value problem is studied. The developed method is based on Hermitian approximation of the second derivative on special discretization mesh. Numerical examples which demonstrate the effectiveness of the method are presented.This research was partly supported by NSF and SIZ for Science of SAP Vojvodina through funds made available to the U.S.-Yugoslav Joint Board on Scientific and Technological Cooperation (grants JF 544, JF 799)     

A finite difference scheme for nonlinear ultra-parabolic equations

In this paper, our aim is to study a numerical method for an ultraparabolic equation with nonlinear source function. Mathematically, the bibliography on initial–boundary value problems for ultraparabolic equations is not extensive although the problems have many applications related to option pricing, multi-parameter Brownian motion, population dynamics and so forth. In this work, we present the approximate solution by virtue of finite difference scheme and Fourier series. For the nonlinear case, we use an iterative scheme by linear approximation to get the approximate solution and obtain error estimates. A numerical example is given to justify the theoretical analysis.     

A finite element scheme for domains with corners

This paper is concerned with the rate of convergence of the finite element method on polygonal domains in weighted Sobolev spaces. It is shown that the use of different spaces of trial and test functions will restrict the usual low rate of convergence to a neighborhood of each vertex of the polygonal domain.L ₂-convergence and lower bounds on the error are also studied.This research was supported in part by the Atomic Energy Commission under contract no. AEC AT-(40-1)-3443/4.This research was supported in part by the U.S. Naval Academy Research Council.     

Approximation algorithms for constructing some required structures in digraphs

We consider a new problem of constructing some required structures in digraphs, where all arcs installed in such required structures are supposed to be cut from some pieces of a specific material of length L. Formally, we consider the model: a digraph D = (V, A; w), a structure S and a specific material of length L, where w: A → R⁺, we are asked to construct a subdigraph D′ from D, having the structure S, such that each arc in D′ is constructed by a part of a piece or/and some whole pieces of such a specific material, the objective is to minimize the number of pieces of such a specific material to construct all arcs in D′.     

A monotone finite element scheme for convection-diffusion equations

A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.

     

A finite difference scheme for computing inertial manifolds

A fully discrete method is presented for computing inertial manifolds of dissipative partial differential equations. In particular, only an approximate spectral decomposition of the dominant differential operator needs to be known. The first few of the smallest eigenvalues and eigenvectors of the discretized operator are approximated using the Lanczos algorithm. Numerical experiments are performed for an equation in one space dimension by discretizing the space variable on a sufficiently fine grid. The basic ideas and techniques are exemplified for selected bifurcation diagrams of an integrated form of the Kuramoto-Sivashinsky equation.This research was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant OGP0036901, NSERC and Schweizerischer Nationalfonds zur Förderung der Wissenschaften BEF 0150297, and Forschungsinstitut für Mathematik, ETH Zürich.     

A finite volume scheme for anisotropic diffusion problems

A new finite volume for the discretization of anisotropic diffusion problems on general unstructured meshes in any space dimension is presented. The convergence of the approximate solution and its discrete gradient is proven. The efficiency of the scheme is illustrated by numerical results. To cite this article: R. Eymard et al., C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

An algorithm for constructing a variety of arbitrary finite dimension

The dimension of a variety V of algebras is the greatest length of a basis (i.e., of an independent generating set) for an SC-theory SC(V), consisting of strong Mal'tsev conditions satisfied in V. The variety V is assumed infinite-dimensional if the lengths of the bases in SC(V) are not bounded. A simple algorithm is found for constructing a variety of any finite dimension r≥1. Using the sieve of Eratosthenes, r distinct primes p₁, p₂,…, p_r are written and their product n=p₁p₂…p_r computed. The variety G_n of algebras (A, f) with one n-ary operation satisfying the identity f(x₁, x₂,…,x_n)=f(x₂,…,x_n, x₁) has, then, dimension r. Translated fromAlgebra i Logika, Vol. 37, No. 2, pp. 167–180, March–April, 1998.