WEAK REGULARIZATION FOR A CLASS OF ILL-POSED CAUCHY PROBLEMS

This article is concerned with the ill-posed Cauchy problem associated with a densely defined linear operator A in a Banach space. A family of weak regularizing operators is introduced. If the spectrum of A is contained in a sector of right-half complex plane and its resolvent is polynomially bounded, the weak regularization for such ill-posed Cauchy problem can be shown by using the quasi-reversibility method and regularized semigroups. Finally, an example is given.     

椭圆型方程Cauchy问题的条件稳定性

众所周知,椭圆型偏微分方程Cauchy问题在Hadamard意义下严重不适应,尤其表现在Cauchy数据的微小扰动可导致Ｃauchy问题的解巨大误差^[1],来源于科学和工程中的许多理论和应用问题可归结为椭圆型方程Ｃauchy问题,如工程无损探测,地球物理甚查,卫星一遥感测等^[2]Cauchy问题的不适定性给上述问题的研究带来了很大困难,表现在难以构造稳定,高效的算法,一航来说,椭圆型方程Ｃauchy问题不具有稳定性,但若对该问题的解作先验有界的假设,则可获得稳定必,而往往得不到稳定性阶数（如Ｈolder稳定性,对数稳定性等）,如果我们进而改善解空间的拓扑结构,则可获得稳定性阶数^[3,4]仅获得了对数稳定性和加权Holder稳定性,但它们不能直接用来做数值计算,最近[5]提出了小波正则化方法,有多尺度分析中讨论抛物型方程Ｃauchy问题的解的条件稳定性,本文利用[5]的方法讨论一类椭圆型方程Ｃauchy问题,为讨论方便,我们仅讨论平面上的最常见的Ｌaplace方程Ｃauchy问题,获得了该问题解的条件稳定性和稳定化算法,所获得的Ｈolder收敛阶大大改善了已有的结果^[2-4],为一类不适定问题和反问题的数值求解了一种新的可行方法。     

图像恢复的一种快速迭代正则化方法

本文研究了将图像恢复问题转化为大型的线性不适定问题的求解.利用由Landweber迭代正则化方法改进所得到的快速收敛的迭代正则化方法,处理具有可分离点扩散函数的图像恢复问题.图像恢复实验表明该方法可大大提高收敛速度,且在计算中只需要较少的存储量.     

A PARALLEL ITERATIVE DOMAIN DECOMPOSITION ALGORITHM FOR ELLIPTIC PROBLEMS

1.IntroductionNolloverlappillgdomaindecolllpositionnletllodshavereceivedalotofattentionlenlsilllldallowefficielltparallelisnl.F'Orarecentdevelopmelltofthesemethods,werefertot…     

约束Fractional Tikhonov正则化的模迭代方法

反问题是现在数学物理研究中的一个热点问题,而反问题求解面临的一个本质性困难是不适定性。求解不适定问题的普遍方法是:用与原不适定问题相“邻近”的适定问题的解去逼近原问题的解,这种方法称为正则化方法.如何建立有效的正则化方法是反问题领域中不适定问题研究的重要内容.当前,最为流行的正则化方法有基于变分原理的Tikhonov正则化及其改进方法,此类方法是求解不适定问题的较为有效的方法,在各类反问题的研究中被广泛采用,并得到深入研究.     

A REGULARIZATION NEWTON METHOD FOR MIXED COMPLEMENTARITY PROBLEMS

In this paper, a regularization Newton method for mixed complementarity problem(MCP) based on the reformulation of MCP in [1] is proposed. Its global conver-gence is proved under the assumption that F is a Po-function. The main feature of our algorithm is that a priori of the existence of an accumulation point for convergence need not to be assumed.     

A MODIFIED TIKHONOV REGULARIZATION METHOD FOR THE CAUCHY PROBLEM OF LAPLACE EQUATION

In this paper,we consider the Cauchy problem for the Laplace equation,which is severely ill-posed in the sense that the solution does not depend continuously on the data.A modified Tikhonov regularization method is proposed to solve this problem.An error estimate for the a priori parameter choice between the exact solution and its regularized approximation is obtained.Moreover,an a posteriori parameter choice rule is proposed and a stable error estimate is also obtained.Numerical examples illustrate the validity and effectiveness of this method.     

一类非线性椭圆问题的瀑布型多重网格法

本对二阶非线性椭圆问题提出一种瀑布型多重网格法，数值实验表明该算法非常有效，当d＝1时，给出了理论结果。     

AN ITERATIVE HYBRIDIZED MIXED FINITE ELEMENT METHOD FOR ELLIPTIC INTERFACE PROBLEMS WITH STRONGLY DISCONTINUOUS COEFFICIENTS

An iterative algorithm is proposed and analyzed based on a hybridized mized finite element method for numerically solving two-phase generalized Stefan interface problems with strongly discontinuous solutions,conormal derivatives,and coefficients.This algorithm iteratively solves small problems for each single phase with good accuracy and exchange information at the interface to advance the iteration until convergence ,following the idea of Schwarz Alternating Methods,Error estimates are derived to show that this algorithm always converges provided that relaxation parameters are suitably chosen,Numeric exper-iments with matching and non-matching grids at the interface from different phases are performed to show the accuracy of the method for capturing discontinuities in the solutions and coefficients.In contrast to standard numerical methods,the accuracy of our method does not seem to deteriorate as the coefficient discontinuity increases.     

非线性不适定问题一种双循环的牛顿型迭代格式

本文研究非线性算子方程F(x)=y的解,结合最速下降法,Newton-Landweber迭代格式及正则化思想,在F满足适当的条件下,构造出新的双循环迭代格式。本文对格式的收敛性进行了严格论证,并估计出迭代格式的收敛精度。     

非线性不适定问题一种双循环的牛顿型迭代格式

本文研究非线性算子方程F(x)=y的解,结合最速下降法,Newton-Landweber迭代格式及正则化思想,在F满足适当的条件下,构造出新的双循环迭代格式.本文对格式的收敛性进行了严格论证,并估计出迭代格式的收敛精度.     

求解单调变分不等式问题的一个连续型迭代方法

本文给出一个求解单调变分不等式问题的连续型迭代方法,对任意单调趋于零的正数序列和任意初始点,方法产生的迭代点列均收敛到所求变分不等式问题的一个解,且在适当条件下方法具有Q-超线性收敛率.数值试验结果进一步表明了所给方法的稳定性和有效性.     

二阶椭圆问题的一类广义有限元法

本文提出了求解二阶椭圆问题的一类广义有限元方法,分析了广义有限元方法的优越性,证明了二阶椭圆问题的广义有限元方法具有比标准的Galerkin有限元方法更高阶的收敛速度,根据插值算子的性质,进一步证明了有限元解的亏量迭代校正收敛到广义有限元解,并用数值例子说明广义有限元方法是有效的.     

求解间断系数椭圆型问题的一种改进的DG方法

本文考虑对间断系数椭圆型问题的普通DG方法进行改进,提出了一种综合了DG方法及区域分解方法的优点的新方法.对此法进行了先验误差分析并给出其残量型后验误差估计,且通过数值实验验证了该方法及其自适应方法的有效性.     

LOCAL DISCONTINUOUS GALERKIN METHOD FOR ELLIPTIC INTERFACE PROBLEMS

In this paper,the minimal dissipation local discontinuous Galerkin method is studied to solve the elliptic interface problems in two-dimensional domains.The interface may be arbitrary smooth curves.It is shown that the error estimates in L~2-norm for the solution and the flux are O(h~2|log h|)and O(h|log h|~(1/2)),respectively.In numerical experiments,the successive substitution iterative methods are used to solve the LDG schemes.Numerical results verify the efficiency and accuracy of the method.     

PRECONDITIONED HSS-LIKE ITERATIVE METHOD FOR SADDLE POINT PROBLEMS

A new HSS-like iterative method is first proposed based on HSS-like splitting of non- Hermitian （1,1） block for solving saddle point problems. The convergence analysis for the new method is given. Meanwhile, we consider the solution of saddle point systems by preconditioned Krylov subspaee method and discuss some spectral properties of the preconditioned saddle point matrices. Numerical experiments are given to validate the performances of the preconditioners.     

REDUCED BASIS METHOD FOR PARAMETRIZED ELLIPTIC ADVECTION-REACTION PROBLEMS

In this work we consider the Reduced Basis method for the solution of parametrized advection-reaction partial differential equations. For the generation of the basis we adopt a stabilized finite element method and we define the Reduced Basis method in the ＂primal- dual＂ formulation for this stabilized problem. We provide a priori Reduced Basis error estimates and we discuss the effects of the finite element approximation on the Reduced Basis error. We propose an adaptive algorithm, based on the a posteriori Reduced Basis error estimate, for the selection of the sample sets upon which the basis are built; the idea leading this algorithm is the minimization of the computational costs associated with the solution of the Reduced Basis problem. Numerical tests demonstrate the efficiency, in terms of computational costs, of the ＂primal-dual＂ Reduced Basis approach with respect to an ＂only primal＂ one. Parametrized advection-reaction partial differential equations, Reduced Basis method, ＂primal-dual＂ reduced basis approach, Stabilized finite element method, a posteriori error estimation.     

非线性椭圆边值问题的牛顿型迭代法

§1.引言 牛顿迭代法是解非线性方程最著名的方法之一.用牛顿法求解非线性方程,事实上就是通过一系列线性方程的解来逼近原来非线性方程的解.简而言之,就是一种线性化方法.而经典的牛顿法虽有(在一定条件下)平方收敛的性质,但却是局部收敛的.就是说,初始近似要选得足够接近原问题的解,否则可能导致不收敛.后来,人们利用牛顿法     

拟线性椭圆型问题有限元近似解的迭代加速分析

一、问题的提出 我们考察二阶拟线性椭圆型第一边值问题: -?(α(x,u)?u)=f(x,u),在Ω内, u(x)=0,在?Ω上,其中Ω是R~n(n=2,3)中有界开区域,?Ω是Ω的光滑边界。若u(x),α(x,u(x))和f(x,u(x))有足够正规性,则问题(1)的等价弱形式方程是:对于u∈H_0~1(Ω), (α(x,u)?u,?v)=(f(x,u),v),?v∈H_0~1(Ω)。 (2)这里假设α(x,u)在Ω×R中为正的且有界,内积