An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

Structural and thermodynamic properties of AlB2 compound

We employ a first-principles plane wave method with the relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter (HGH) scheme in the frame of DFT to calculate the equilibrium lattice parameters and the thermodynamic properties of AlB₂ compound with hcp structure. The obtained lattice parameters are in good agreement with the available experimental data and those calculated by others. Through the quasi-harmonic Debye model, obtained successfully are the dependences of the normalized lattice parameters a/a₀ and c/c₀ on pressure P, the normalized primitive cell volume V/V₀ on pressure P, the variation of the thermal expansion α with pressure P and temperature T, as well as the Debye temperature \Theta_D and the heat capacity C_V on pressure P and temperature T.     

A rational approximation and its applications to nonlinear partial differential equations on the whole line

An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

On completely irreducible operators

Let T be a bounded linear operator on Hilbert space H, M an invariant subspace of T. If there exists another invariant subspace N of T such that H = M + N and M ∩ N = 0, then M is said to be a completely reduced subspace of T. If T has a nontrivial completely reduced subspace, then T is said to be completely reducible; otherwise T is said to be completely irreducible. In the present paper we briefly sum up works on completely irreducible operators that have been done by the Functional Analysis Seminar of Jilin University in the past ten years and more. The paper contains four sections. In section 1 the background of completely irreducible operators is given in detail. Section 2 shows which operator in some well-known classes of operators, for example, weighted shifts, Toeplitz operators, etc., is completely irreducible. In section 3 it is proved that every bounded linear operator on the Hilbert space can be approximated by the finite direct sum of completely irreducible operators. It is clear that a completely irreducible operator is a rather suitable analogue of Jordan blocks in L(H), the set of all bounded linear operators on Hilbert space H. In section 4 several questions concerning completely irreducible operators are discussed and it is shown that some properties of completely irreducible operators are different from properties of unicellular operators. __________ Translated from Acta Sci. Nat. Univ. Jilin, 1992, (4): 20–29     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.