Assessment of some iterative methods for non-symmetric linear systems arising in computational fluid dynamics

Various tests have been carried out in order to compare the performances of several methods used to solve the non-symmetric linear systems of equations arising from implicit discretizations of CFD problems, namely the scalar advection-diffusion equation and the compressible Euler equations. The iterative schemes under consideration belong to three families of algorithms: relaxation (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient methods have been selected: a Krylov subspace iteration method (GMRES) and a non-symmetric extension of the conjugate gradient method (CGS). Finally, a quasi-Newton method has also been considered (Broyden). The aim of this paper is to provide indications of which appears to be the most adequate method according to the particular circumstances as well as to discuss the implementation aspects of each scheme.     

Incremental unknowns preconditioning for solving the Helmholtz equation

An efficient preconditioner is developed for solving the Helmholtz problem in both high and low frequency (wavenumber) regimes. The preconditioner is based on hierarchical unknowns on nested grids, known as incremental unknowns (IU). The motivation for the IU preconditioner is provided by an eigenvalue analysis of a simplified Helmholtz problem. The performance of our preconditioner is tested on the iterative solution of two‐dimensional electromagnetic scattering problems. When compared with other well‐known methods, our technique is shown to often provide a better numerical efficacy and, most importantly, to be more robust. Moreover, for the best performance, the number of IU levels used in the preconditioner should be designed for the coarsest grid to have roughly two points per linear wavelength. This result is consistent with the conventional sampling criteria for wave phenomena in contrast with existing IU applications for solving the Laplace/Poisson problem, where the coarsest grid comprises just one interior point. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

On the convergence rate and optimization of a numerical method with splitting of boundary conditions for the stokes system in a spherical layer in the axisymmetric case: Modification for thick layers

The convergence rate of a fast-converging second-order accurate iterative method with splitting of boundary conditions constructed by the authors for solving an axisymmetric Dirichlet boundary value problem for the Stokes system in a spherical gap is studied numerically. For R/r exceeding about 30, where r and R are the radii of the inner and outer boundary spheres, it is established that the convergence rate of the method is lower (and considerably lower for large R/r) than the convergence rate of its differential version. For this reason, a really simpler, more slowly converging modification of the original method is constructed on the differential level and a finite-element implementation of this modification is built. Numerical experiments have revealed that this modification has the same convergence rate as its differential counterpart for R/r of up to 5 × 10³. When the multigrid method is used to solve the split and auxiliary boundary value problems arising at iterations, the modification is more efficient than the original method starting from R/r ～ 30 and is considerably more efficient for large values of R/r. It is also established that the convergence rates of both methods depend little on the stretching coefficient η of circularly rectangular mesh cells in a range of η that is well sufficient for effective use of the multigrid method for arbitrary values of R/r smaller than ～ 5 × 10³.     

�ɲ����˶�����ά��������������һ�������ڵ����Զ������������������

??We study the linear quadratic optimal stochastic control problem which is jointly driven by Brownian motion and L\'{e}vy processes. We prove that the new affine stochastic differential adjoint equation exists an inverse process by applying the profound section theorem. Applying for the Bellman's principle of quasilinearization and a monotone iterative convergence method, we prove the existence and uniqueness of the solution of the backward Riccati differential equation. Finally, we prove that the optimal feedback control exists, and the value function is composed of the initial value of the solution of the related backward Riccati differential equation and the related adjoint equation.     

Iterative solutions for low lying excited states of a class of SchrSdinger equation

The convergent iterative procedure for solving the groundstate Schr?dinger equation is extended to derive the excitation energy and the wavefunction of the low-lying excited states. The method is applied to the one-dimensional quartic potential problem. The results show that the iterative solution converges rapidly when the coupling g is not too small.     

一类二阶两点边值问题的单调迭代方法

通过改进经典的单调迭代方法对于一类二阶两点边值的问题的正解建立了单调迭代程序。这些迭代程序都是从常值函数开始的，因而是可行并且有效的。     

分析非轴对称腔的复光线数值迭代法

将像散光束的复光线表示法用于分析非轴对称腔，并对有复杂像散的折迭腔作了数值迭代计算以说明方法的应用．     

PERIODIC BOUNDARY VALUE PROBLEM FOR SECOND ORDER FUNCTIONAL DIFFERENTIAL EQUATIONS

This paper investigates the periodic boundary value problems for a class of second order functional differential equations. The monotone iterative technique and the maximum principle are applied to obtain the existence of maximal and minimal solutions.     

含k-次增生算子的Ishikawa迭代的收敛性问题

主要研究了非线性方程x Tx=f的Ishikawa迭代解．其中T为k-次增生的或增生的，并在一致光滑和任意的实Banach空间分别研究了上述方程的带误差的Ishikawa迭代解，从而推广了已知的一些结果。     

求解线性方程组的超几何球法

由解析几何观点知道,线性方程组解的几何意义是方程组中各个方程所代表的超平面的交点.根据直径对应的圆周角是直角以及直角三角形中短边对小角的原理进一步知道,当将初始点向线性方程组中各个方程所代表的超平面上投影得到投影点时,初始点和其任何一个投影点及方程组的解点都将位于一个相应的超球面上,其中必定存在一个投影点离问题解点的距离最短,即把该点作为下一次迭代的初始点,从而可将线性方程组求解的问题变成球面上逼近解点的迭代问题.利用此方法通过计算几个良(病)态线性方程组算例,说明该方法不仅具有一定的抗病态性,而且简单实用.