A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.

     

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.     

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

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

轴流泵端壁区域流动三维粘性数值计算

本文采用通用流场分析软件FLUENT,基于N-S方程,选用RNG κ—ε湍流模型与SIMPLEC算法,对轴流泵叶轮内部(及端壁间隙)流动进行了三维粘性数值计算。通过实验验证,表明数值计算结果和实测数据吻合较好。详细分析了叶顶附近流场形态以及叶轮出口轴向、周向速度分布,进行了性能预估。并给出了实验装置图。     

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.     

相对论二极管电子枪设计的分析解与实验的比较

本文对轴对称场二极管区电子运动所遵循的近似轨迹方程进行数值求解,以此做为设计相对论二极管电子枪的依据,与实验结果相比较,符合较好。     

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

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