A short note on the entrainment and exit boundary conditions

An attempt is made to find out the suitable entrainment and exit boundary conditions in laminar flow situations. Streamfunction vorticity formulation of the Navier–Stokes equations are solved by ADI method. Two‐dimensional laminar plane wall jet flow is used to test different forms of the boundary conditions. Results are compared with the experimental and similarity solution and the proper boundary condition is suggested. The Kind 1 boundary condition is recommended. It consists of zero first derivative condition for velocity variable and for streamfunction equation, mixed derivative at the entrainment and exit boundaries. Copyright © 2005 John Wiley & Sons, Ltd.     

On the Local Uniqueness of Solutions of Variational Inequalities Under H-Differentiability

In this paper, we give some sufficient conditions for the local uniqueness of solutions to nonsmooth variational inequalities where the underlying functions are H-differentiable and the underlying set is a closed convex set/polyhedral set/box/polyhedral cone. We show how the solution of a linearized variational inequality is related to the solution of the variational inequality. These results extend/unify various similar results proved for C ¹ and locally Lipschitzian variational inequality problems. When specialized to the nonlinear complementarity problem, our results extend/unify those of C ² and C ¹ nonlinear complementarity problems.     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

ESTIMATING EXTREME-VALUE INDEX FROM RECORDS

1.IntroductionLet{X.,n21}beasequenceoflidry'swithanondegeneratedistributionfunctionF(x).Supposethereexistsomeconstantsan>0,b.6RandsomeacERsuchthatwhereG.standsforoneoftheextremevaluedistributions:Heretheindex7ERisarealparameter(interpret(1 box)--'/ryase--"for7~0).Theestimationoftheextreme-valueindex7isveryimportantbothintheextremevaluetheoryandinpractice.Manystatistics,suchasHillestimator(forcaseac>0),PickandsestimatorandDekkers-EinmahLdeHaan'smomentestimatorwhicharebasedonafinitesample,…     

ON A PAIR OF NON-ISOMETRIC ISOSPECTRAL DOMAINS WITH FRACTAL BOUNDARIES AND THE WEYL-BERRY CONJECTURE

ＯＮＡＰＡＩＲＯＦＮＯＮＩＳＯＭＥＴＲＩＣＩＳＯＳＰＥＣＴＲＡＬＤＯＭＡＩＮＳＷＩＴＨＦＲＡＣＴＡＬＢＯＵＮＤＡＲＩＥＳＡＮＤＴＨＥＷＥＹＬＢＥＲＲＹＣＯＮＪＥＣＴＵＲＥＳＬＥＥＭＡＮ，Ｂ．Ｄ．ＣＨＥＮＨＵＡＭａｎｕｓｃｒｉｐｔｒｅｃ...     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.