Application of an implicit iterative difference scheme for the solution of nonstationary Navier-Stokes equations

An implicit iterative difference scheme of second-order accuracy in space and in time is proposed for numerical solution of nonstationary Navier—Stokes equations. The scheme has been applied to model a nonstationary axisymmetric flow in the near wake produced by injection through an annular nozzle from the tail of a supersonic body.Translated from Vychislitel'naya Matematika i Matematicheskoe Obespechenie EVM, pp. 216–231, 1985.     

Convergence of Nonstationary Iterative Methods for Solving Singular Linear Equations with Index One

In this paper, we investigate the nonstationary iterative scheme for solving consistent singular linear system with index one. We utilize the group inverse to present a sufficient condition for the convergence of the nonstationary iterative method. Our result extends the known results of the stationary iterative scheme. Finally, we present a sufficient condition for the multisplitting algorithm and provide numerical examples to illustrate the advantages of nonstationary method.     

On numerical implementations of a new iterative method with boundary condition splitting for solving the nonstationary stokes problem in a strip with periodicity condition

Based on finite-difference approximations in time and a bilinear finite-element approximation in spatial variables, numerical implementations of a new iterative method with boundary condition splitting are constructed for solving the Dirichlet initial-boundary value problem for the nonstationary Stokes system. The problem is considered in a strip with a periodicity condition along it. At each iteration step of the method, the original problem splits into two much simpler boundary value problems that can be stably numerically approximated. As a result, this approach can be used to construct new effective and stable numerical methods for solving the nonstationary Stokes problem. The velocity and pressure are approximated by identical bilinear finite elements, and there is no need to satisfy the well-known difficult-to-verify Ladyzhenskaya-Brezzi-Babuska condition, as is usually required when the problem is discretized as a whole. Numerical iterative methods are constructed that are first- and second-order accurate in time and second-order accurate in space in the max norm for both velocity and pressure. The numerical methods have fairly high convergence rates corresponding to those of the original iterative method at the differential level (the error decreases approximately 7 times per iteration step). Numerical results are presented that illustrate the capabilities of the methods developed.     

First‐order system least squares for the Oseen equations

Following earlier work for Stokes equations, a least squares functional is developed for two‐ and three‐dimensional Oseen equations. By introducing a velocity flux variable and associated curl and trace equations, ellipticity is established in an appropriate product norm. The form of Oseen equations examined here is obtained by linearizing the incompressible Navier–Stokes equations. An algorithm is presented for approximately solving steady‐state, incompressible Navier–Stokes equations with a nested iteration‐Newton‐FOSLS‐AMG iterative scheme, which involves solving a sequence of Oseen equations. Some numerical results for Kovasznay flow are provided. Copyright © 2006 John Wiley & Sons, Ltd.     

Fast homogenization algorithm based on asymptotic theory and multiscale schemes

A time-frequency interpretation of the classical asymptotic theory of homogenization for elliptic PDE with periodic coefficients is presented and the relations with known multilevel/multiscale numerical schemes are investigated. We formulate a new fast iterative algorithm for the approximation of homogenized solutions based on the combination of these two apparently different approaches. The asymptotic homogenization process is interpreted as a migration to infinity of the frequencies related to microscale contributions and the discovering of those related to the homogenized solution. At different scale/frequency of the periodic coefficients of the operator, band-pass filters select only the contributions of the homogenized solution which is then composed as the limit of an iterative procedure. This novel method can be interpreted in case of finite difference discretizations as a generalized nonstationary subdivision scheme and its convergence and stability are discussed. In particular, stable compositions of the homogenized solution are investigated in relation with the contracting behavior of specific operators generated by reduction processes and Schur's complements of suitable matrices produced by discretizations via wavelets and multiscale bases. AMS subject classification 35B27, 35J25, 65N55, 65M99, 65T60, 78M25, 78M30 Maria Morandi Cecchi: The support of the italian MIUR under project “Numerical Modeling for Scientific Computing and Advanced Applications” (COFIN 2003) is gratefully acknowledged. Massimo Fornasier: The author acknowledges the financial support provided through the Intra-European Individual Marie Curie Fellowship, project FTFDORF-FP6-501018, and the hospitality of NuHAG (Numerical Harmonic Analysis Group), Facutly of Mathematics, University of Vienna, Austria.     

On Two Iterative Least-Squares Finite Element Schemes for the Incompressible Navier–Stokes Problem

This paper is mainly devoted to a comparative study of two iterative least-squares finite element schemes for solving the stationary incompressible Navier–Stokes equations with velocity boundary condition. Introducing vorticity as an additional unknown variable, we recast the Navier–Stokes problem into a first-order quasilinear velocity–vorticity–pressure system. Two Picard-type iterative least-squares finite element schemes are proposed to approximate the solution to the nonlinear first-order problem. In each iteration, we adopt the usual L ² least-squares scheme or a weighted L ² least-squares scheme to solve the corresponding Oseen problem and provide error estimates. We concentrate on two-dimensional model problems using continuous piecewise polynomial finite elements on uniform meshes for both iterative least-squares schemes. Numerical evidences show that the iterative L ² least-squares scheme is somewhat suitable for low Reynolds number flow problems, whereas for flows with relatively higher Reynolds numbers the iterative weighted L ² least-squares scheme seems to be better than the iterative L ² least-squares scheme. Numerical simulations of the two-dimensional driven cavity flow are presented to demonstrate the effectiveness of the iterative least-squares finite element approach.     

Stokes方程的投影／方向分裂谱方法

我们提出和分析了一种求解Stokes方程的数值方法．新方法基于空间上的Legendre谱离散,时间上则采用投影／方向分裂格式．更确切地说,时间离散的出发点是旋度形式的压力校正投影法,在此基础上进一步应用方向分裂法,把速度和压力方程分裂为一系列一维的椭圆型子问题．然后生成的这些一维子问题用Legendre谱方法进行空间离散．另外,我们证明了全离散格式的稳定性．一些数值实验验证了收敛性和方法的有效性．     

Weighted iterative solutions of linear differential equations and heat conduction of ideal gases in moment theory

An iterative method is proposed to find a particular solution of a system of linear differential equations, in the form of a fixed-point problem, with no boundary conditions. To circumvent the unboundedness of differential operators, iterative approximation with gradually decreasing weight is used. Conditions for convergence that can easily be checked in numerical iterations are established. Furthermore, for the numerical iterative scheme, uniqueness and stability theorems are proved. These results are applied to heat conduction of ideal gases in moment theory.     

Weighted iterative solutions of linear differential equations and heat conduction of ideal gases in moment theory

An iterative method is proposed to find a particular solution of a system of linear differential equations, in the form of a fixed-point problem, with no boundary conditions. To circumvent the unboundedness of differential operators, iterative approximation with gradually decreasing weight is used. Conditions for convergence that can easily be checked in numerical iterations are established. Furthermore, for the numerical iterative scheme, uniqueness and stability theorems are proved. These results are applied to heat conduction of ideal gases in moment theory.     

Numerical implementations of an iterative method with boundary condition splitting as applied to the nonstationary stokes problem in the gap between coaxial cylinders

Numerical implementations of a new fast-converging iterative method with boundary condition splitting are constructed for solving the Dirichlet initial-boundary value problem for the nonstationary Stokes system in the gap between two coaxial cylinders. The problem is assumed to be axially symmetric and periodic along the cylinders. The construction is based on finite-difference approximations in time and bilinear finite-element approximations in a cylindrical coordinate system. A numerical study has revealed that the iterative methods constructed have fairly high convergence rates that do not degrade with decreasing viscosity (the error is reduced by approximately 7 times per iteration step). Moreover, the methods are second-order accurate with respect to the mesh size in the max norm for both velocity and pressure.     

Nonstationary analysis of the loss queue and of queueing networks of loss queues

We present an iterative scheme based on the fixed-point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multi-class, and multi-rate nonstationary loss queue. Subsequently, the proposed method is extended to the analysis of a nonstationary queueing network of multi-rate loss queues. Comparisons with exact and simulation results showed that the results are consistently close to the exact results and they are always within simulation confidence intervals.     

An iterative method for the reconstruction of a stationary flow

In this article, an iterative algorithm based on the Landweber‐Fridman method in combination with the boundary element method is developed for solving a Cauchy problem in linear hydrostatics Stokes flow of a slow viscous fluid. This is an iteration scheme where mixed well‐posed problems for the stationary generalized Stokes system and its adjoint are solved in an alternating way. A convergence proof of this procedure is included and an efficient stopping criterion is employed. The numerical results confirm that the iterative method produces a convergent and stable numerical solution. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

Two‐level Newton iterative method for the 2D/3D steady Navier‐Stokes equations

A combination method of the Newton iteration and two‐level finite element algorithm is applied for solving numerically the steady Navier‐Stokes equations under the strong uniqueness condition. This algorithm is motivated by applying the m Newton iterations for solving the Navier‐Stokes problem on a coarse grid and computing the Stokes problem on a fine grid. Then, the uniform stability and convergence with respect to ν of the two‐level Newton iterative solution are analyzed for the large m and small H and h << H. Finally, some numerical tests are made to demonstrate the effectiveness of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Error correction iterative method for the stationary incompressible MHD flow

A new iterative finite element method for solving the stationary incompressible magnetohydrodynamics (MHD) equations is derived in this paper. The method consists of two steps at each iteration step, we need first to solve the MHD equations by the Oseen-type iterative scheme, and then an error correction strategy is applied to control the error arising from the linearization of the nonlinear MHD equations. The new method not only maintains the advantage of the standard Oseen-type scheme but also possesses a rapid rate of convergence. It is proved that the convergence rate of the proposed method is increased greatly under the uniqueness condition. The uniform stability and convergence of the new scheme are analyzed. Ample numerical experiments are performed to validate the accuracy and the efficiency of the new numerical scheme.     

非定常 N-S 方程的非线性 Galerkin 算法及其误差估计

本文给出了二维非定常N-S方程的三种数值格式,其中空间变量用谱非线性Galerkin算法进行离散,时间变量用有限差分离散,并研究了这些格式数值解的逼近精度．最后,给出了部分数值计算结果．     

Improving the pressure accuracy in a projection scheme for incompressible fluids with variable viscosity

The incremental projection scheme and its enhanced version, the rotational projection scheme are powerful and commonly used approaches producing efficient numerical algorithms for solving the Navier–Stokes equations. However, the much improved rotational projection scheme cannot be used on models with non-homogeneous viscosity, imposing the use of the less accurate incremental projection. This paper presents a projection method for the Navier–Stokes equations for fluids having variable viscosity, giving a consistent pressure and increased accuracy in pressure when compared to the incremental projection. The accuracy of the method will be illustrated using a manufactured solution.     

Efficient parallel shock-capturing method for aerodynamics simulations on body-unfitted cartesian grids

For problems with complex geometry, a numerical method is proposed for solving the three-dimensional nonstationary Euler equations on Cartesian grids with the use of hybrid computing systems. The baseline numerical scheme, a method for implementing internal boundary conditions on body-unfitted grids, and an iterative matrix-free LU-SGS method for solving the discretized equations are described. An efficient software implementation of the numerical algorithm on a multiprocessor hybrid CPU/GPU computing system is considered. Results of test computations are presented.     

Iterative methods in penalty finite element discretizations for the Steady Navier–Stokes equations

Three penalty finite element methods are designed to solve numerically the steady Navier–Stokes equations, where the Stokes, Newton, and Oseen iteration methods are used, respectively. Moreover, the stability analysis and error estimate for these nine algorithms are provided. Finally, the numerical tests confirm the theoretical results of the presented algorithms. Meanwhile, the numerical investigations are provided to show that the proposed methods are efficient for solving the steady Navier–Stokes equations with the different viscosity. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 74‐94, 2014     

Numerical methods for fourth‐order nonlinear elliptic boundary value problems

The aim of this article is to present several computational algorithms for numerical solutions of a nonlinear finite difference system that represents a finite difference approximation of a class of fourth‐order elliptic boundary value problems. The numerical algorithms are based on the method of upper and lower solutions and its associated monotone iterations. Three linear monotone iterative schemes are given, and each iterative scheme yields two sequences, which converge monotonically from above and below, respectively, to a maximal solution and a minimal solution of the finite difference system. This monotone convergence property leads to upper and lower bounds of the solution in each iteration as well as an existence‐comparison theorem for the finite difference system. Sufficient conditions for the uniqueness of the solution and some techniques for the construction of upper and lower solutions are obtained, and numerical results for a two‐point boundary‐value problem with known analytical solution are given. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17:347–368, 2001     

Domain imbedding methods for the Stokes equations

Summary We study direct and iterative domain imbedding methods for the Stokes equations on certain non-rectangular domains in two space dimensions. We analyze a continuous analog of numerical domain imbedding for bounded, smooth domains, and give an example of a simple numerical algorithm suggested by the continuous analysis. This algorithms is applicable for simply connected domains which can be covered by rectangular grids, with uniformly spaced grid lines in at least one coordinate direction. We also discuss a related FFT-based fast solver for Stokes problems with physical boundary conditions on rectangles, and present some numerical results.