一维气液两相漂移模型全隐式AUSMV算法研究

气液两相漂移模型显式AUSMV（advection upstream splitting method combined with flux vector splitting method）算法的时间步长受限于CFL（Courant-Friedrichs-Lewy）条件，为了提高计算效率，建立了一种全隐式AUSMV算法求解气液两相漂移模型.采用AUSM格式结合FVS（flux vector splitting）格式构造连续方程和运动方程的对流项数值通量，AUSM格式构造压力项数值通量.离散控制方程是非线性方程组，采用六阶Newton(牛顿)法结合数值Jacobi矩阵求解.计算经典算例Zuber-Findlay激波管问题和复杂漂移关系变质量流动问题，结果分析表明:全隐式AUSMV算法，色散效应小，无数值震荡，计算精度高.在压力波波速高的条件下，可以显著提高计算效率，耗散效应小.     

自适应结构频率和阻尼比的计算

本文给出状态空间法的一种新技巧,用于求解自适应结构的振动频率和阻尼比。当采用集中质量法时,状态矩阵的Cholesky分解具有解析式。从而既可提高计算精度,又可节约计算时间。最后以算例加以说明。     

LOCAL PRESSURE CORRECTION FOR THE STOKES SYSTEM

Pressure correction methods constitute the most widely used solvers for the timedependent Navier-Stokes equations.There are several different pressure correction methods,where each time step usually consists in a predictor step for a non-divergence-free velocity,followed by a Poisson problem for the pressure(or pressure update),and a final velocity correction to obtain a divergence-free vector field.In some situations,the equations for the velocities are solved explicitly,so that the numerical most expensive step is the elliptic pressure problem.We here propose to solve this Poisson problem by a domain decomposition method which does not need any communication between the sub-regions.Hence,this system is perfectly adapted for parallel computation.We show under certain assumptions that this new scheme has the same order of convergence as the original pressure correction scheme(with global projection).Numerical examples for the Stokes system show the effectivity of this new pressure correction method.The convergence order O(k^2)for resulting velocity fields can be observed in the norm l^2(0,T;L^2(Ω)).     

Numerical solution of the acoustic wave equation using Raviart–Thomas elements

In this paper we discuss the numerical approximation of the displacement form of the acoustic wave equation using mixed finite elements. The mixed formulation allows for approximation of both displacement and pressure at each time step, without the need for post-processing. Lowest-order and next-to-lowest-order Raviart–Thomas elements are used for the spatial discretization, and centered finite differences are used to advance in time. Use of these Raviart–Thomas elements results in a diagonal mass matrix for resolution of pressure, and a mass matrix for the displacement variable that is sparse with a simple structure. Convergence results for a model problem are provided, as are numerical results for a two-dimensional problem with a point source.     

A conservative parallel difference method for 2-dimension diffusion equation

In this paper, a conservative parallel difference scheme, which is based on domain decomposition method, for 2-dimension diffusion equation is proposed. In the construction of this scheme, we use the numerical solution on the previous time step to give a weighted approximation of the numerical flux. Then the sub-problems with Neumann boundary are computed by fully implicit scheme. What is more, only local message communication is needed in the program. We use the method of discrete functional analysis to give the proof of the unconditional stability and second-order convergence accuracy. Some numerical tests are given to verify the theory results.     

A new scheme for the solution of reaction diffusion and wave propagation problems

In this paper, a robust numerical scheme is presented for the reaction diffusion and wave propagation problems. The present method is rather simple and straightforward. The Houbolt method is applied so as to convert both types of partial differential equations into an equivalent system of modified Helmholtz equations. The method of fundamental solutions is then combined with the method of particular solution to solve these new systems of equations. Next, based on the exponential decay of the fundamental solution to the modified Helmholtz equation, the dense matrix is converted into an equivalent sparse matrix. Finally, verification studies on the sensitivity of the method’s accuracy on the degree of sparseness and on the time step magnitude of the Houbolt method are carried out for four benchmark problems.     

Numerical method for the simultaneous determination of the hydraulic properties of unsaturated porous media

This paper presents a numerical algorithm for solving the inverse coefficient problem for nonlinear parabolic equations. This problem arises in simultaneous determination of the hydraulic properties of unsaturated porous media from a simple outflow experiment. The novel feature of the method is that it is not based on output least squares. In this method, the unknown functions are represented as polygons (continuous and piecewise linear functions) every new linear pieces that are determined in each time step by using information based only on previous time intervals. The results of some numerical experiments are displayed.     

On the compact difference scheme for the two-dimensional coupled nonlinear Schrödinger equations

A high-order finite difference method for the two-dimensional coupled nonlinear Schrödinger equations is considered. The proposed scheme is proved to preserve the total mass and energy in a discrete sense and the solvability of the scheme is shown by using a fixed point theorem. By converting the scheme in the point-wise form into a matrix–vector form, we use the standard energy method to establish the optimal error estimate of the proposed scheme in the discrete L²-norm. The convergence order is proved to be of a fourth-order in space and a second-order in time, respectively. Finally, some numerical examples are given in order to confirm our theoretical results for the numerical method. The numerical results are compared with exact solutions and other existing method. The comparison between our numerical results and those of Sun and Wangreveals that our method improves the accuracy of space and time directions.     

Minimum time‐step criteria for the Galerkin finite element methods applied to one‐dimensional parabolic partial differential equations

The finite element method has been well established for numerically solving parabolic partial differential equations (PDEs). Also it is well known that a too large time step should not be chosen in order to obtain a stable and accurate numerical solution. In this article, accuracy analysis shows that a too small time step should not be chosen either for some time‐stepping schemes. Otherwise, the accuracy of the numerical solution cannot be improved or can even be worsened in some cases. Furthermore, the so‐called minimum time step criteria are established for the Crank‐Nicolson scheme, the Galerkin‐time scheme, and the backward‐difference scheme used in the temporal discretization. For the forward‐difference scheme, no minimum time step exists as far as the accuracy is concerned. In the accuracy analysis, no specific initial and boundary conditions are invoked so that such established criteria can be applied to the parabolic PDEs subject to any initial and boundary conditions. These minimum time step criteria are verified in a series of numerical experiments for a one‐dimensional transient field problem with a known analytical solution. The minimum time step criteria developed in this study are useful for choosing appropriate time steps in numerical simulations of practical engineering problems. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

New second derivative multistep methods for stiff systems

In this paper we present details of a new class of second derivative multistep methods. Stability analysis is discussed and an improvement in stability region is obtained. With a simple modification we take advantage of calling for the solution of algebraic equations with the same coefficient matrix in each step. Moreover, using IOM to solve the resulting linear systems, the coefficient matrix is not needed explicitly. Some numerical experiments and comparison with several popular codes are given, showing strong superiority of this new class of methods.     

Analysis of the Yosida method for the incompressible Navier–Stokes equations

The Yosida method was introduced in (Quarteroni et al., to appear) for the numerical approximation of the incompressible unsteady Navier–Stokes equations. From the algebraic viewpoint, it can be regarded as an inexact factorization of the matrix arising from the space and time discretization of the problem. However, its differential interpretation resides on an elliptic stabilization of the continuity equation through the Yosida regularization of the Laplacian (see (Brezis, 1983, Ciarlet and Lions, 1991)). The motivation of this method as well as an extensive numerical validation were given in (Quarteroni et al., to appear).In this paper we carry out the analysis of this scheme. In particular, we consider a first-order time advancing unsplit method. In the case of the Stokes problem, we prove unconditional stability and moreover that the splitting error introduced by the Yosida scheme does not affect the overall accuracy of the solution, which remains linear with respect to the time step. Some numerical experiments, for both the Stokes and Navier–Stokes equations, are presented in order to substantiate our theoretical results.     

Convergence acceleration of preconditioned conjugate gradient solver based on error vector sampling for a sequence of linear systems

In this article, we focus on solving a sequence of linear systems that have identical (or similar) coefficient matrices. For this type of problem, we investigate subspace correction (SC) and deflation methods, which use an auxiliary matrix (subspace) to accelerate the convergence of the iterative method. In practical simulations, these acceleration methods typically work well when the range of the auxiliary matrix contains eigenspaces corresponding to small eigenvalues of the coefficient matrix. We develop a new algebraic auxiliary matrix construction method based on error vector sampling in which eigenvectors with small eigenvalues are efficiently identified in the solution process. We use the generated auxiliary matrix for convergence acceleration in the following solution step. Numerical tests confirm that both SC and deflation methods with the auxiliary matrix can accelerate the solution process of the iterative solver. Furthermore, we examine the applicability of our technique to the estimation of the condition number of the coefficient matrix. We also present the algorithm of the preconditioned conjugate gradient method with condition number estimation.     

Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints

In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A Branch-and-Bound method that does not use derivatives for solving the reduced problem is proposed. The method either determines the infeasibility of the original problem or finds lower and upper bounds for the global solution. Not all the constraints are evaluated during every iteration of the algorithm, providing a significant acceleration of the search. Convergence conditions of the new method are established. Extensive numerical experiments are presented.     

The splitting finite-difference time-domain methods for Maxwell's equations in two dimensions

In this paper, we consider splitting methods for Maxwell's equations in two dimensions. A new kind of splitting finite-difference time-domain methods on a staggered grid is developed. The corresponding schemes consist of only two stages for each time step, which are very simple in computation. The rigorous analysis of the schemes is given. By the energy method, it is proved that the scheme is unconditionally stable and convergent for the problems with perfectly conducting boundary conditions. Numerical dispersion analysis and numerical experiments are presented to show the efficient performance of the proposed methods. Furthermore, the methods are also applied to solve a scattering problem successfully.     

Parallel characteristic finite element method for time‐dependent convection–diffusion problem

Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd.     

The Cayley transform in the numerical solution of unitary differential systems

In recent years some numerical methods have been developed to integrate matrix differential systems whose solutions are unitary matrices. In this paper we propose a new approach that transforms the original problem into a skew-Hermitian differential system by means of the Cayley transform. The new methods are semi-explicit, that is, no iteration is required but the solution of a certain number of linear matrix systems at each step is needed. Several numerical comparisons with known unitary integrators are reported. This revised version was published online in June 2006 with corrections to the Cover Date.     

Smoothed Particle ElectroMagnetics: A mesh-free solver for transients

In this paper an advanced mesh-free particle method for electromagnetic transient analysis, is presented. The aim is to obtain efficient simulations by avoiding the use of a mesh such as in the most popular grid-based numerical methods. The basic idea is to obtain numerical solutions for partial differential equations describing the electromagnetic problem by using a set of particles arbitrarily placed in the problem domain. The mesh-free smoothed particle hydrodynamics method has been adopted to obtain numerical solution of time domain Maxwell's curl equations. An explicit finite difference scheme has been employed for time integration. Details about the numerical treatment of electromagnetic vector fields components are discussed. Two case studies in one and in two dimensions are reported. In order to validate the new proposed methodology, named as Smoothed Particle ElectroMagnetics, a comparison with the standard finite difference time domain method results is performed. The intrinsic adaptive capability of the proposed method, has been exploited by introducing irregular particles distribution.     

Fourier spectral method with an adaptive time strategy for nonlinear fractional Schrödinger equation

In this paper, a Fourier spectral method with an adaptive time step strategy is proposed to solve the fractional nonlinear Schrödinger (FNLS) equation with periodic initial value problem. First, we prove the conservation law of the mass and the energy for the semi-discrete Fourier spectral scheme. Second, the error estimation of the semi-discrete scheme is given in the relevant fractional Sobolev space. Then, an adaptive time-step strategy is designed to reduce central processing unit (CPU) time. Finally, the numerical experiments for the one-, two- and three-dimensional FNLSs, show that the adaptive strategy, compared to the constant time step, can reduce the CPU-time by almost half.     

Optimal m-stage Runge-Kutta schemes for steady-state solutions of hyperbolic equations

A numerical scheme is developed to find optimal parameters and time step of m-stage Runge-Kutta (RK) schemes for accelerating the convergence to -steady-state solutions of hyperbolic equations. These optimal RK schemes can be applied to a spatial discretization over nonuniform grids such as Chebyshev spectral discretization. For each m given either a set of all eigenvalues or a geometric closure of all eigenvalues of the discretization matrix, a specially structured nonlinear minimax problem is formulated to find the optimal parameters and time step. It will be shown that each local solution of the minimax problem is also a global solution and therefore the obtained m-stage RK scheme is optimal. A numerical scheme based on a modified version of the projected Lagrangian method is designed to solve the nonlinear minimax problem. The scheme is generally applicable to any stage number m. Applications in solving nonsymmetric systems of linear equations are also discussed. © 1993 John Wiley & Sons, Inc.     

Numerical solutions of random mean square Fisher-KPP models with advection

This paper deals with the construction of numerical stable solutions of random mean square Fisher-Kolmogorov-Petrosky-Piskunov (Fisher-KPP) models with advection. The construction of the numerical scheme is performed in two stages. Firstly, a semidiscretization technique transforms the original continuous problem into a nonlinear inhomogeneous system of random differential equations. Then, by extending to the random framework, the ideas of the exponential time differencing method, a full vector discretization of the problem addresses to a random vector difference scheme. A sample approach of the random vector difference scheme, the use of properties of Metzler matrices and the logarithmic norm allow the proof of stability of the numerical solutions in the mean square sense. In spite of the computational complexity, the results are illustrated by comparing the results with a test problem where the exact solution is known.