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.     

The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.     

Numerical analysis for stochastic age-dependent population equations with Poisson jumps

In this paper, stochastic age-dependent population equations with Poisson jumps are considered. In general, most of stochastic age-dependent population equations with jumps do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical Euler scheme and show the convergence of the numerical approximation solution to the true solution.     

Lp[0,1]空间Müntz有理逼近的Jackson型估计

设Λ={λn}n∞=1为正的实数数列,且当n→∞时,有λn↘0.本文给出了当λn≤Mn-1/2,n=1,2,…,(其中M＞0为一正常数)时Müntz系统{xλn}的有理函数在Lp[0,1]空间的逼近速度,主要结论为Rn(f,Λ) Lp≤CMω(f,n-1/2)Lp,1≤p≤∞.     

Runge–Kutta Methods for Itô Stochastic Differential Equations with Scalar Noise

A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance.     

Simultaneous approximation for the Bézier variant of Baskakov-Beta operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.     

On Basic Constraint Qualifications for Infinite System of Convex Inequalities in Banach Spaces

The BCQ and the Abadie CQ for infinite systems of convex inequalities in Banach spaces are characterized in terms of the upper semi-continuity of the convex cones generated by the subdifferentials of active convex functions. Some relationships with other constraint qualifications such as the CPLV and the Slate condition are also studied. Applications in best approximation theory are provided.     

Non-linear approximations for natural convection in a horizontal annulus

Two different problems are proposed as approximations of the usual system modelling natural convection under the Oberbeck-Boussinesq assumptions. The error is evaluated by means of the norm of its gradient in the Hilbert space. The average Nusselt number is also estimated.     

Second order Runge–Kutta methods for Stratonovich stochastic differential equations

The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly. AMS subject classification (2000)  65C30, 65L06, 60H35, 60H10     

Numerical solution of differential equations using Sinc method based on the interpolation of the highest derivatives

In general, we will use the numerical differentiation when dealing with the differential equations. Thus the differential equations can be transformed into algebraic equations and then we can get the numerical solutions. But as we all have known, the numerical differentiation process is very sensitive to even a small level of errors. In contrast it is expected that on average the numerical integration process is much less sensitive to errors. In this paper, based on the Sinc method we provide a new method using Sinc method incorporated with the double exponential transformation based on the interpolation of the highest derivatives (SIHD) for the differential equations. The error in the approximation of the solution is shown to converge at an exponential rate. The numerical results show that compared with the exiting results, our method is of high accuracy, of good convergence with little computational efforts. It is easy to treat nonhomogeneous mixed boundary condition for our method, which is unlike the traditional Sinc method.