利普希茨伪紧缩映射下的利普希茨摄动迭代的Bruck公式

在非线性分析中,处理伪紧缩算子及其变形的解(不动点)存在性和近似性,从而使演化方程的求解已经发展成为一个独立的理论.使用近似不动点技术,采用摄动迭代方法,目的是证明利普希茨伪紧缩映射序列的收敛性.该迭代方法适用于比利普希茨伪紧缩算子更一般的非线性算子以及Bruck迭代法无法证明其收敛性的情况.推广了Chidume和Zegeye的结果.     

一般非线性渗流方程正性的扩展

本文研究一般非线性渗流方程解的一种性态.利用De Giorgi方法与BCP估计相结合,得到了一般非线性渗流方程正性的扩展性质,推广了非线性渗流方程的结果.     

一种求解三维热辐射输运方程的整体预处理迭代方法及并行计算

为三维灰体热辐射输运方程的隐式离散纵标方法发展一个整体预处理迭代方法并研制并行程序。该方法采用组装线性代数方程组策略,同时求出所有离散方向上的辐射强度。借助预处理的Krylov子空间迭代法,避免复杂网格上扫描算法可能遇到的死锁问题,能够提高健壮性和计算效率。空间离散上采用一阶迎风有限体积格式。数值实验测试变形六面体网格上的收敛率、评估预处理迭代方法的性能并计算辐射和物质的耦合问题,给出三维弯管和黑腔问题的模拟结果,验证程序的正确性和方法的适应性。     

REMARK ON STABILITY OF ISHIKAWA ITERATIVE PROCEDURES

1　ＩｎｔｒｏｄｕｃｔｉｏｎａｎｄＰｒｅｌｉｍｉｎａｒｉｅｓＳｕｐｐｏｓｅＥｉｓａｒｅａｌＢａｎａｃｈｓｐａｃｅａｎｄＴｉｓａｓｅｌｆｍａｐｏｆＥ .Ｓｕｐｐｏｓｅｘ0 ∈Ｅａｎｄｘｎ+1=ｆ(Ｔ ,ｘｎ)ｄｅｆｉｎｅｓａｎｉｔｅｒａｔｉｏｎｐｒｏｃｅｄｕｒｅｗｈｉｃｈｙｉｅｌｄｓａｓｅｑｕｅｎｃｅｏｆｐｏｉｎｔｓ ｘｎ ∞ｎ=0 ｉｎＥ .Ｆｏｒａｎｅｘａｍｐｌｅ ,ｔｈｅｆｕｎｃｔｉｏｎｉｔｅｒａｔｉｏｎｘｎ+1=ｆ(Ｔ ,ｘｎ) =Ｔｘ0 .ＳｕｐｐｏｓｅＦ(Ｔ) =ｘ∈Ｅ :Ｔｘ=ｘ ≠ ａｎｄｔｈａｔ ｘｎ ｃｏｎｖｅｒｇｅｓｓ…     

The BEM for solving the nonhomogeneous Helmholtz equation with variable coefficients

Considering the fundamental solution of the Laplace equation as the weight function, we give the iterative format for solving the nonhomogeneous Helmholtz equation with variable coefficients. Furthermore, the iteration method of BEM for solving the equation mentioned above is obtained. The numerical example is given in this paper. Finally, the iteration method of BEM mentioned above is compared with the coupled method of BEM that was presented before then by authors.     

幂集上的线性空间

将线性空间的概念提升到线性空间的幂集上进行讨论,给出了线性空间的幂空间的定义,并研究了一种特殊幂空间的基本性质.     

投影的约化极小模和空间的夹角

Let M and N be nonzero subspaces of a Hilbert space H, and PM and PN denote the orthogonal projections on M and N, respectively. In this note, an exact representation of the angle and the minimum gap of M and N is obtained. In addition, we study relations between the angle, the minimum gap of two subspaces M and N, and the reduced minimum modulus of （I - PN）PM,     

Sub-iteration leads to accuracy and stability enhancements of semi-implicit schemes for the Navier–Stokes equations

We present an iterative semi-implicit scheme for the incompressible Navier–Stokes equations, which is stable at CFL numbers well above the nominal limit. We have implemented this scheme in conjunction with spectral discretizations, which suffer from serious time step limitations at very high resolution. However, the approach we present is general and can be adopted with finite element and finite difference discretizations as well. Specifically, at each time level, the nonlinear convective term and the pressure boundary condition – both of which are treated explicitly in time – are updated using fixed-point iteration and Aitken relaxation. Eigenvalue analysis shows that this scheme is unconditionally stable for Stokes flows while numerical results suggest that the same is true for steady Navier–Stokes flows as well. This finding is also supported by error analysis that leads to the proper value of the relaxation parameter as a function of the flow parameters. In unsteady flows, second- and third-order temporal accuracy is obtained for the velocity field at CFL number 5–14 using analytical solutions. Systematic accuracy, stability, and cost comparisons are presented against the standard semi-implicit method and a recently proposed fully-implicit scheme that does not require Newton’s iterations. In addition to its enhanced accuracy and stability, the proposed method requires the solution of symmetric only linear systems for which very effective preconditioners exist unlike the fully-implicit schemes.     

Improvement of the recursive projection method for linear iterative scheme stabilization based on an approximate eigenvalue problem

An algorithm for stabilizing linear iterative schemes is developed in this study. The recursive projection method is applied in order to stabilize divergent numerical algorithms. A criterion for selecting the divergent subspace of the iteration matrix with an approximate eigenvalue problem is introduced. The performance of the present algorithm is investigated in terms of storage requirements and CPU costs and is compared to the original Krylov criterion. Theoretical results on the divergent subspace selection accuracy are established. The method is then applied to the resolution of the linear advection–diffusion equation and to a sensitivity analysis for a turbulent transonic flow in the context of aerodynamic shape optimization. Numerical experiments demonstrate better robustness and faster convergence properties of the stabilization algorithm with the new criterion based on the approximate eigenvalue problem. This criterion requires only slight additional operations and memory which vanish in the limit of large linear systems.     

First-order system least squares and the energetic variational approach for two-phase flow

This paper develops a first-order system least-squares (FOSLS) formulation for equations of two-phase flow. The main goal is to show that this discretization, along with numerical techniques such as nested iteration, algebraic multigrid, and adaptive local refinement, can be used to solve these types of complex fluid flow problems. In addition, from an energetic variational approach, it can be shown that an important quantity to preserve in a given simulation is the energy law. We discuss the energy law and inherent structure for two-phase flow using the Allen–Cahn interface model and indicate how it is related to other complex fluid models, such as magnetohydrodynamics. Finally, we show that, using the FOSLS framework, one can still satisfy the appropriate energy law globally while using well-known numerical techniques.