On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

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.     

Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

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.     

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].     

四种多变量校准方法在FTIR多组分分析中的性能比较

本文对四种多变量校准方法－－经典最小二乘法（CLS），偏最小二乘法（PLS），卡尔曼滤波法（KFM）以及人工神经网络法（ANN）－－在多组分浓度分析方面的性能进行了比较。选择五种红外谱图严重混叠的大气有机毒物－－1，3－丁二烯，苯，邻二甲苯，氯苯和丙烯醛－－作为分析对象。分别计算各种方法对该5组分体系的平均预测误差MPE和平均相对误差MRE进行比较。结果表明，偏最小二乘法在处理这类问题中是最稳健的方法。     

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.