A computational strategy for multiscale systems with applications to Lorenz 96 model

Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model.     

溃坝问题的间断有限元方法

本文研究90年代初提出的Runge-Kutta间断Galerkin有限元方法，给出该方法的精度分析，通过经典算例验证该方法处理间断问题、捕捉锐利波形的能力，并将其推广到求解浅水问题．针对坝底无摩擦，无坡度的理想情形进行讨论，给出方溃坝和圆溃坝问题的数值模拟结果．     

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm.     

多排叶片内部流动以及叶片排与排气系统相互作用研究

本文采用高分辨率格式和多块多网格方法求解雷诺平均Navier-Stokes方程,数值模拟多排叶片内的三维粘性流动;使用数值激盘模拟叶片排的存在,研究叶片排与非轴对称排气部件之间的相互作用以及复杂的内部流动。文中描述了数值方法,给出了NASA透平导叶和单级透平内部流场的数值结果及其与相应实验结果的对比,也给出了多级透平内部流场的数值结果,以及透平与排气部件之间的耦合流场的结果。     

Asymptotic Methods Applied to Contact Problems

Asymptotic methods for contact problems are expounded. Some typical integral equations are considered     

An implicit characteristic-flux-averaging method for the euler equations for real gases

A formulation of an implicit characteristic-flux-averaging method for the unsteady Euler equations with real gas effects is presented. Incorporation of a real gas into a general equation of state is achieved by considering the pressure as a function of density and specific internal energy. The Ricmann solver as well as the flux-split algorithm are modified by introducing the pressure derivatives with respect to density and internal energy. Expressions for calculating the values of the flow variables for a real gas at the cell faces are derived. The Jacobian matrices and the eigenvectors are defined for a general equation of state. The solution of the system of equations is obtained by using a mesh-sequencing method for acceleration of the convergence. Finally, a test case for a simple form of equation of state displays the differences from the corresponding solution for an ideal gas.     

Ultrathin Fe film on Cu(0 0 1): Exchange splitting of image states from first principles

The theoretical investigation of the image states in front of an ultrathin iron film grown on copper has been performed by means of the embedding method and a recently developed procedure for the inclusion of the image potential tail in a first principle calculation. From the electronic response to an applied electric field, the image plane position has been evaluated. This also allows one to obtain useful information about the spin dependent screening properties of the system. Exchange splitting, effective mass, and lifetime of such surface states result in good agreement with recently performed two-photon photoemission experiments [see A.B. Schmidt, M. Pickel, M. Wiemhöfer, M. Donath, M. Weinelt, Phys. Rev. Lett. 95 (2005) 107402].     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems

Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular, the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners which constitute popular preconditioning strategies for such problems. Received May 3, 1996