矩阵的满秩正交分解

旨在给出矩阵一种新分解(满秩正交分解).分解简单易求,且与矩阵的奇异值分解有类似的性质和应用.     

二次Lagrangian有限元方程的几何多重网格法

为了构造快速求解二次Lagrangian有限元方程的几何多重网格法,在选择二次Lagrangian有限元空间和一系列线性Lagrangian有限元空间分别作为最细网格层和其余粗网格层以及构造一种新限制算子的基础上,提出了一种新的几何多重网格法,并对它的计算量进行了估计.数值实验结果,与通常的几何多重网格法和AMG01法相比,表明了新算法计算量少且稳健性强.     

A multigrid approach for steady state laminar viscous flows

In this paper, we use the laminar viscous flow in a lid‐driven cavity as an example to describe and verify a numerical scheme for non‐linear partial differential equations. The proposed scheme combines a new analytical method for strongly non‐linear problems, namely the homotopy analysis method, with the multigrid techniques. A family of formulas at different orders is given. At the lowest order, the current approach is the same as the traditional multigrid methods. However, our high‐order scheme needs a fewer number of iterations and less CPU time than the classical ones. Copyright © 2001 John Wiley & Sons, Ltd.     

Investigation and application of point implicit Runge–Kutta methods to inviscid flow problems

We derive and investigate point implicit Runge–Kutta methods to significantly improve the convergence rate to approximate steady‐state solutions of inviscid flows. It turns out that the point implicit Runge–Kutta can be interpreted as a preconditioned explicit Runge–Kutta method, where the preconditioner arises naturally as local derivative of the residual function. Moreover, many preconditioners suggested in the literature so far are identified as special case of our general ansatz. Conditions will be formulated such that explicit Runge–Kutta methods with local time stepping are equivalent to point implicit methods. In numerical examples, we will demonstrate the improved convergence rates. Copyright © 2011 John Wiley & Sons, Ltd.     

Multigrid convergence acceleration for implicit and explicit solution of Euler equations on unstructured grids

The multigrid method is one of the most efficient techniques for convergence acceleration of iterative methods. In this method, a grid coarsening algorithm is required. Here, an agglomeration scheme is introduced, which is applicable in both cell‐center and cell‐vertex 2 and 3D discretizations. A new implicit formulation is presented, which results in better computation efficiency, when added to the multigrid scheme. A few simple procedures are also proposed and applied to provide even higher convergence acceleration. The Euler equations are solved on an unstructured grid around standard transonic configurations to validate the algorithm and to assess its superiority to conventional explicit agglomeration schemes. The scheme is applied to 2 and 3D test cases using both cell‐center and cell‐vertex discretizations. Copyright © 2009 John Wiley & Sons, Ltd.     

Finite volume multigrid method of the planar contraction flow of a viscoelastic fluid

This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first‐order upwind approximation for the viscoelastic stress. A non‐uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non‐linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss–Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd‐B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright © 2001 John Wiley & Sons, Ltd.     

门式架在现浇箱梁中的应用

由于门式架具有加工简便、拆装灵活、搬运方便、通用性强等特点,所以应用非常广泛。详细介绍了门式架在现浇箱梁中作为满堂脚手架的应用。     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

全文检索系统的数据库设计

应用软件工程的方法对全文检索系统的数据库进行规范化设计，给出了系统数据库组织结构图。     

排水管道流量比,流速比的解析表达

在圆形断面的排水管道设计中，有时需要计算不满流条件下一定充满度时的流量及流速，针对有不同满注的流量，流速与对应的满流的流量，流速的比值，现推荐的解析表达式，便于从充满度直接计算流量比，流速比。