A Bitangential Interpolation Problem on the Closed Unit Ball for Multipliers of the Arveson Space

We solve a bitangential interpolation problem for contractive multipliers on the Arveson space with an arbitrary interpolating set in the closed unit ball . The solvability criterion is established in terms of positive kernels. The set of all solutions is parametrized by a Redheffer transform. Submitted: February 2, 2002.     

Plastic multipliers as driving variables of numerical simulation in elastoplasticity

Statics of elasto-plastic media is stated in terms of eigenstrains acting upon a background elastic problem with fixed (initial) stiffness. In order to minimize the number of unknowns and to provide computationally cheap algorithms plastic multipliers are used as main driving variables. Fixed-point type iterations are suggested for computing plastic multipliers within the load increment. Numerical experiments results are shown to be in good correlation with other software results. A range of problems is outlined where the usage of the proposed algorithms can be advantageous.     

Multipliers of convergence in norm of series with respect to multiplicative systems

We prove analogs of the Telyakovskii-Pochuev criteria for multipliers of uniform convergence and of convergence in the integral metric for multiplicative systems with bounded generating sequence.     

旋转输液管动力稳定性理论分析北大核心CSCD

基于Lagrange原理和假设模态法建立了旋转输液管的动力学模型.通过降阶升维的方法求解系统的特征值问题,并分析了旋转输液管自由振动特性.得到了不同端部集中质量和转速下,系统特征值随流速升高的演变轨迹.揭示了临界流速随系统参数的变化规律.研究发现,内部流体的流动对旋转输液管动力学特性存在显著影响.在某些参数组合下,系统低阶模态能够形成不同形式的内共振关系.预示了旋转输液管模型蕴含丰富的动力学现象.     

Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints

An augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints is proposed based on a Löwner operator associated with a potential function for the optimization problems with inequality constraints. The favorable properties of both the Löwner operator and the corresponding augmented Lagrangian are discussed. And under some mild assumptions, the rate of convergence of the augmented Lagrange algorithm is studied in detail.     

The Newton modified barrier method for QP problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues, to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a hot start. Starting at such a hot start, at mostO(In In ^-1) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, >0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that onlyO(In ^-1)O(In In ^-1) Newton steps are required to reach an -approximation to the solution from any hot start. In order to reach the hot start, one has to perform Newton steps, wherem characterizes the size of the problem andC>0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.Partially supported by NASA Grant NAG3-1397 and National Science Foundation Grant DMS-9403218.     

C 1 surface interpolation with constraints

Givenn pairwise distinct and arbitrarily spaced pointsP _i in a domainD of thex–y plane andn real numbersf _i, consider the problem of computing a bivariate functionf(x, y) of classC ¹ inD whose values inP _i are exactlyf _i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ _l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy.     

Use of Local Lagrange Interpolation for calculation of retention indices in linear temperature-programmed gas chromatrography

Summary The influence of the isothermal temperature, program rate, initial temperature and flow rate on retention indices was studied. The methods of Kováts, Van Den Dool and Local Lagrange Interpolation are compared. Ten experimental measurements were carried out on a capillary column coated with OV-101 stationary phase.     

含中介值ξ-η-ζ等式的证明方法

介绍含三个中介值ξ-η-ζ等式的几种证明方法,并结合实例加以说明.     

A thermodynamic and dynamic subgrid closure model for two‐material cells

A general and robust subgrid closure model for two‐material cells is proposed. The conservative quantities of the entire cell are apportioned between two materials, and then, pressure and velocity are fully or partially equilibrated by modeling subgrid wave interactions. An unconditionally stable and entropy‐satisfying solution of the processes has been successfully found. The solution is valid for arbitrary level of relaxation. The model is numerically designed with care for general materials and is computationally efficient without recourse to subgrid iterations or subcycling in time. The model is implemented and tested in the Lagrange‐remap framework. Two interesting results are observed in 1D tests. First, on the basis of the closure model without any pressure and velocity relaxation, a material interface can be resolved without creating numerical oscillations and/or large nonphysical jumps in the problem of the modified Sod shock tube. Second, the overheating problem seen near the wall surface can be solved by the present entropy‐satisfying closure model. The generality, robustness, and efficiency of the model make it useful in principle in algorithms, such as ALE methods, volume of fluid methods, and even some mixture models, for compressible two‐phase flow computations. Copyright © 2013 John Wiley & Sons, Ltd.