Runge–Kutta interpolants for high precision computations

Runge–Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these methods with continuous approximations have been proposed. Here we construct C ¹ continuous, eighth and ninth order interpolation methods for a recently appeared RK pair of orders 9(8). These interpolants share a very small leading truncation error making them suitable for use at quadruple precision, i.e. 32–33 decimal digits of accuracy. Extended numerical results justify our effort.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

无穷区间上二阶微分方程的边值问题

利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性，部分改进了郭大钧教授最近得到的结果。     

On the Solvability of the Multidimensional Version of the First Darboux Problem for a Model Second-Order Degenerating Hyperbolic Equation

A multidimensional version of the first Darboux problem is considered for a model second-order degenerating hyperbolic equation. Using the technique of functional spaces with a negative norm, the correct formulation of this problem in the Sobolev weighted space is proved.     

The solution of orthogonal Procrustes problems for a family of orthogonally invariant norms

The orthogonal Procrustes problem involves finding an orthogonal matrix which transforms one given matrix into another in the least-squares sense, and thus it requires the minimization of the Frobenius matrix norm. We consider, the solution of this problem for a family of orthogonally invariant norms which includes the Frobenius norm as a special case.     

Classical limit of relativistic quantal system with attractive Coulomb interaction

Using the appropriate harmonic oscillator states and reasonable approximations, we construct coherent wavepackets corresponding to the solutions of the Klein-Gordon equation for the attractive potentialV(r)=−k/r, k>0, in two and three space dimensions. We deduce the corresponding classical limit in two dimension by requiring that the expectation value 〈r〉 of the radial variable is large. In the case of three dimensions, besides the condition of large 〈r〉, we make the uncertainty Δr=[〈r ²〉 − 〈r〉²]^1/2 a minimum with respect to certain parameter of the wavepacket. We then investigate the trajectory traversed by the wavepacket in the classical limit. We find that the classical limit of this relativistic quantal problem gives, in the leading order, the same expression for the rate of motion of the perihelion as that given by the solution of the corresponding special relativistic classical dynamical problem. We also briefly discuss some of the subtle aspects of the classical limit of the relativistic quantal system, in general.     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

求解P0函数互补问题的一种微分方程方法

本针对P0函数互补问题，给出了一种微方程方法，并且证明了P0函数互补问题的解是微分方程系统的渐进稳定平衡点。在适当的假设条件下，证明了所给出的算法具有二次收敛速度。几个数值例子表明了该算法的有效性。     

Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison

Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.

The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.