Boundary-value problem for the nonlinear Schrödinger equation

A mixed boundary-value problem for the nonlinear Schrödinger equation and its generalization is studied by the method used for the inverse scattering problem. A connection is established between conservation laws and boundary conditions in integrable boundary-value problems for higher nonlinear Schrödinger equations. It is shown that the generalized boundary-value problem requires a joint consideration of regular and singular solutions for the nonlinear Schrödinger equation with repulsion.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 169, pp. 151–165, 1988.     

Numerical algorithm for the Mayer problem for nonlinear dynamic systems

An algorithm is proposed for numerical construction of optimal programmed controls in the Mayer problem for a nonlinear dynamic system. In each step of the optimization process, the algorithm uses the method of successive linearization with subsequent projection of the objective functional gradient on the constraints and recovery of violated boundary conditions and constraints. Solutions of some test problems are reported.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 107–114, 1985.     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

Diffeomorphism finiteness for manifolds with ricci curvature andL n/2-norm of curvature bounded

Partially supported by NSF Grants.     

Flatness in analytic mappings I. On an announcement of Hironaka

We present a stratification by “normal flatness” associated to an analytic mapping, analogous to Hironaka's classical result for analytic spaces. Our construction is based on a generic normal flatness theorem for mappings, proved using techniques concerning the variation of modules of meromorphically parametrized formal power series [1]. The existence of such a stratification was announced by Hironaka [13], but the other claims made in [13] are false. Counterexamples are also presented here.     

Grating coatings with gain

Using an integral theory of grating diffraction we calculate efficiencies greater than 100% if a coating with gain is taken into account. A connection with guided modes is conjectured. The application in optical computing seems to be possible.     

Distribution of magnetization in an easy-plane ferromagnet

Physics and Mathematics Division with Computational Center of the Bashkir Branch of the USSR Academy of Sciences. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 80, No. 3, pp. 470–473, September, 1989.     

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.