解算子与右端数据均有扰动的半正定算子方程的动态系统方法

本文研究了求解算子与右端数据均有扰动的第一类半正定算子方程的动态系统方法．证明了相应的动态系统Cauchy问题的整体解存在且收敛于原算子方程的解．此外,给出了解Cauchy问题的迭代方法并证明了方法的收敛性．     

牛顿-正则化方法与一类差分方程反问题的求解

在用牛顿迭代法求解非线性算子方程时,总要求非线性算子的导算子是有界可逆的,即线性化方程是适定的.但在实际数值计算中.即使满足这个条件,也可能出现数值不稳定的现象.为了克服这个困难,[1]将牛顿法与求解线性不适定问题的BG方法(平均核方法)结合起来,在每一步迭代中利用BG方法稳定求解.考虑到Tikhonov的正则化方     

Operator splitting methods for pricing American options under stochastic volatility

We consider the numerical pricing of American options under Heston’s stochastic volatility model. The price is given by a linear complementarity problem with a two-dimensional parabolic partial differential operator. We propose operator splitting methods for performing time stepping after a finite difference space discretization. The idea is to decouple the treatment of the early exercise constraint and the solution of the system of linear equations into separate fractional time steps. With this approach an efficient numerical method can be chosen for solving the system of linear equations in the first fractional step before making a simple update to satisfy the early exercise constraint. Our analysis suggests that the Crank–Nicolson method and the operator splitting method based on it have the same asymptotic order of accuracy. The numerical experiments show that the operator splitting methods have comparable discretization errors. They also demonstrate the efficiency of the operator splitting methods when a multigrid method is used for solving the systems of linear equations.     

Multilevel augmentation methods for solving the sine-Gordon equation

In this paper we develop the multilevel augmentation method for solving nonlinear operator equations of the second kind and apply it to solving the one-dimensional sine-Gordon equation. We first give a general setting of the multilevel augmentation method for solving the second kind nonlinear operator equations and prove that the multilevel augmentation method preserves the optimal convergence order of the projection method while reducing computational cost significantly. Then we describe the semi-discrete scheme and the fully-discrete scheme based on multiscale methods for solving the sine-Gordon equation, and apply the multilevel augmentation method to solving the discrete equation. A complete analysis for convergence order is proposed. Finally numerical experiments are presented to confirm the theoretical results and illustrate the efficiency of the method.     

Banach空间中非光滑算子方程的光滑化拟牛顿法

研究Banach空间中非光滑算子方程的光滑化拟牛顿法.构造光滑算子逼近非光滑算子,在光滑逼近算子满足方向可微相容性的条件下,证明了光滑化拟牛顿法具有局部超线性收敛性质.应用说明了算法的有效性.     

Banach空间一类H-增生算子的混合拟变分包含的邻近算子方程

本文在Banach空间中引入一类H-增生算子的混合拟变分包含,并提出求该变分包含问题解的邻近点法.通过H-增生算子的预解算子技术,建立了混合拟变分包含问题与邻近算子方程的等价关系,由这个等价关系得到求解邻近算子方程的迭代算法,该算法收敛于上述混合拟变分包含问题的解.     

求解无限维非线性互补问题的光滑化牛顿法

研究一类无限维非线性互补问题的光滑化牛顿法.借助于非线性互补函数,将无限维非线性互补问题转化为一个非光滑算子方程.构造光滑算子逼近非光滑算子,在光滑逼近算子满足方向可微相容性的条件下,证明了光滑化牛顿法具有超线性收敛性.     

A smoothing homotopy method for variational inequality problems on polyhedral convex sets

In this paper, based on the Robinson’s normal equation and the smoothing projection operator, a smoothing homotopy method is presented for solving variational inequality problems on polyhedral convex sets. We construct a new smoothing projection operator onto the polyhedral convex set, which is feasible, twice continuously differentiable, uniformly approximate to the projection operator, and satisfies a special approximation property. It is computed by solving nonlinear equations in a neighborhood of the nonsmooth points of the projection operator, and solving linear equations with only finite coefficient matrices for other points, which makes it very efficient. Under the assumption that the variational inequality problem has no solution at infinity, which is a weaker condition than several well-known ones, the existence and global convergence of a smooth homotopy path from almost any starting point in $R^n$ are proven. The global convergence condition of the proposed homotopy method is same with that of the homotopy method based on the equivalent KKT system, but the starting point of the proposed homotopy method is not necessarily an interior point, and the efficiency is more higher. Preliminary test results show that the proposed method is practicable, effective and robust.     

在再生核空间中方程AuBu+Cu＝f的求解方法

$ 1 引言 本文研究下面一类非线性算子方程求解问题 AμBμ Cμ=f, (1.1)其中f,μ∈W(Ω),μ(O)=1,||f ||=1,A,B,C∈(W(Ω)→W(Ω)),(W(Ω)→W(Ω))是W(Ω)到W(Ω)的连续线性算子空间,W(Ω)是定义在Ω域上的(Ω是实数域R的有界域)再生核空间。 本文是在再生核空间上,通过将一维非线性算子方程(1.1)转化为二维线性算子方     

Multigrid Methods with Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems

In this paper, we propose a multigrid algorithm based on the full approximate scheme for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. A Newton-Gauss-Seidel (NGS) method is used as smoother. A Galerkin coarse grid operator is proposed for the membrane constrained obstacle problem. Comparing with standard FAS with the direct discretization coarse grid operator, the FAS with the proposed operator converges faster. A special prolongation operator is used to interpolate functions accurately from the coarse grid to the fine grid at the boundary between the active and inactive sets. We will demonstrate the fast convergence of the proposed multigrid method for solving two model obstacle problems and compare the results with other multigrid methods.     

Regularized extragradient method for solving parametric multicriteria equilibrium programming problem

A regularized extragradient method is designed for solving unstable multicriteria equilibrium programming problems. The convergence of the method is investigated, and a regularizing operator is constructed.     

A projection method based on the splitting Bregman iteration for the image denoising

By analyzing the connection between the projection operator and the shrink operator, we propose a projection method based on the splitting Bregman iteration for image denoising problem in this paper. Compared with the splitting Bregman method, the proposed method has a more compact form so that it is more fast and efficient. Following from the operator theory, the convergence of the proposed method is proved. Some numerical comparisons between the proposed method and the splitting Bregman method are arranged for solving two basic image denoising models.     

MULTILEVEL AUGMENTATION METHODS FOR SOLVING OPERATOR EQUATIONS

We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstra     

A control operator and some of its applications

The conventional function space algorithms for solving minimization of penalized cost functional for optimal control problem characterized by linear-system integral quadratic cost due to Di Pillo and others, though falling within the framework pertinent to the conjugate gradient method algorithm, is difficult to apply computationally. The difficulty arises principally because there exists in the algorithm a number of stringent requirements imposed on the minimization procedures to facilitate its convergence. Incidentally, such computations are very cumbersome to carry out numerically. To circumvent this major numerical draw back, we construct here a control operator associated with this class of problems and use our explicit knowledge of the operator to devise an extended conjugate gradient method algorithm for solving this family of problems. Furthermore, the establishment of some functional inequalities which are obtained using the knowledge of the control operator is discussed.     

On the approximation of derivatives using divided difference operators preserving the local convergence order of iterative methods

A development of an inverse first-order divided difference operator for functions of several variables is presented. Two generalized derivative-free algorithms built up from Ostrowski’s method for solving systems of nonlinear equations are written and analyzed. A direct computation of the local order of convergence for these variants of Ostrowski’s method is given. In order to preserve the local order of convergence, any divided difference operator is not valid. Two counterexamples of computation of a classical divided difference operator without preserving the order are presented. A rigorous study to know a priori if the new method will preserve the order of the original modified method is presented. The conclusion is that this fact does not depend on the method but on the systems of equations and if the associated divided difference verifies a particular condition. A new divided difference operator solving this problem is proposed. Furthermore, a computation that approximates the order of convergence is generated for the examples and it confirms in a numerical way that the order of the methods is well deduced. This study can be applied directly to other Newton’s type methods where derivatives are approximated by divided differences.     

Inexact Operator Splitting Methods with Selfadaptive Strategy for Variational Inequality Problems

The Peaceman-Rachford and Douglas-Rachford operator splitting methods are advantageous for solving variational inequality problems, since they attack the original problems via solving a sequence of systems of smooth equations, which are much easier to solve than the variational inequalities. However, solving the subproblems exactly may be prohibitively difficult or even impossible. In this paper, we propose an inexact operator splitting method, where the subproblems are solved approximately with some relative error tolerance. Another contribution is that we adjust the scalar parameter automatically at each iteration and the adjustment parameter can be a positive constant, which makes the methods more practical and efficient. We prove the convergence of the method and present some preliminary computational results, showing that the proposed method is promising. This work was supported by the NSFC grant 10501024.     

A CONTINUATION HOMOTOPY METHOD FOR THE INVERSE PROBLEM OF OPERATOR IDENTIFICATION AND ITS APPLICATION

A new widly convergent method for solving the problem of operator kientification is illustrated.Numerical simulations are carried out to test the feasibllity and to study the general characteristics of the technique without the real measurement data.This technique is a direct application of the continuation homotopy method for solving nonlinear systems of equations.It is found that this method does give excellent results in solving the inverse problem of the elliptic differential equations.     

An extraproximal method for solving equilibrium programming problems in a Hilbert space

A regularized method of the proximal type for solving equilibrium problems in a Hilbert space is proposed. The method is combined with an approximation of the original problem. The convergence of the method is analyzed, and a regularizing operator is constructed.     

The Multigrid Method of Nonconforming Finite Elements for Solving the Biharmonic Equation

1.IntroductionSeveralaspectsofthenonconfOrmingfi11iteelementmethodhavebeendiscussedin[1-51.Inthispaper,wewillintroducethemllltigridmethodandprovethatthemultigridmethodofnonconformingfiniteelementscanattainthesameoptimalconvergenceorderaJsthenonconformingflniteelementmethodinenergy-norm.Themultigridmethodofconformingfiniteelementshasbeen.t.died[7-8].Forthemultigridmethodofnonconformingfiniteele1nents,becausethefiniteelementspacesassociatedwiththenetsarenotnest(Vk-1ctVK),itisdifficulttodefinet…     

On a Class of Operator Equations in Locally Convex Spaces

We consider a general method of solving equations whose left-hand side is a series by powers of a linear continuous operator acting in a locally convex space. Obtained solutions are given by operator series by powers of the same operator as the left-hand side of the equation. The research is realized by means of characteristics (of order and type) of operator as well as operator characteristics (of operator order and operator type) of vector relatively of an operator. In research we also use a convergence of operator series on equicontinuous bornology.