Reducing systems of linear differential equations to a passive form

In this paper, an application of the Riquer-Thomas-Janet theory is described for the problem of transforming a system of partial differential equations into a passive form, i.e., to a special form which contains explicitly both the equations of the initial system and all their nontrivial differential consequences. This special representation of a system markedly facilitates the subsequent integration of the corresponding differential equations. In this paper, the modern approach to the indicated problem is presented. This is the approach adopted in the Knuth-Bendix procedure [13] for critical-pair/completion and then Buchberger's algorithm for completion of polynomial ideal bases [13] (or, alternatively, for the construction of Groebner bases for ideals in a differential operator ring [14]). The algorithm of reduction to the passive form for linear system of partial differential equations and its implementation in the algorithmic language REFAL, as well as the capabilities of the corresponding program, are outlined. Examples illustrating the power and efficiency of the system are presented.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Estimation of multivariate binary density using orthogonal functions

In this paper, the authors studied certain properties of the estimate of Liang and Krishnaiah (1985, J. Multivariate Anal. 16, 162–172) for multivariate binary density. An alternative shrinkage estimate is also obtained. The above results are generalized to general orthonormal systems.     

Principe d'Oka-Grauert dansA ∞

Sans résumé     

An algebraic characterization ofB-convergent Runge-Kutta methods

Summary In the analysis of discretization methods for stiff intial value problems, stability questions have received most part of the attention in the past.B-stability and the equivalent criterion algebraic stability are well known concepts for Runge-Kutta methods applied to dissipative problems. However, for the derivation ofB-convergence results — error bounds which are not affected by stiffness — it is not sufficient in many cases to requireB-stability alone. In this paper, necessary and sufficient conditions forB-convergence are determined.This paper was written while J. Schneid was visiting the Centre for Mathematics and Computer Science with an Erwin-Schrödinger stipend from the Fonds zur Förderung der wissenschaftlichen Forschung