Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Calculated elastic constants of dilute alloys based on bcc metals

The elastic constants of dilute alloys based on bcc metals have been calculated using the Green’s function method obtaining explicit expressions for change in elastic constants in terms oft-matrix. The crystal impurity problem is discussed within an impurity model containing central and non-central force constant changes extended up to second neighbours of the impurity. The effect of volume change on elastic constants and a contribution from electron pressure term are considered. Numerical results for changes in three elastic moduli have been presented for a number of dilute alloys based on Mo, Nb, W, Ta and V.     

电子直线加速器束流均方根发射度变化方程

本文导出了考虑外场和束流效应后束流均方根发射度平方变化方程的一般表达式,并就仅考虑外场,仅考虑空间电荷场和仅考虑尾场等三种特殊情况进行了分析。     

用13CNMR研究聚甲基丙烯酸锡酯的立构序列分布

本文测定了自由基型溶液聚合的聚甲基丙烯酸三甲基锡酯(PTMTM),聚甲基丙烯酸三乙基锡酯(PTETM)和聚甲基丙烯酸三丁基锡酯(PTBTM)的¹³C-NMR谱,对其C-2谱扩展分峰,计算立构序列,从定量数据表明,聚合物样品的空间立构富于或稍富于间规立构,随取代基的体积增大而趋于无规分布,作者认为受空间位阻效应和分子内或分子间形成配位键的影响。     

On the univalence of derivatives of functions which are univalent in angular domains

We consider functions f that are univalent in a plane angular domain of angle απ, 0 < α ≤ 2. It is proved that there exists a natural number k depending only on α such that the kth derivatives f ^(k) of these functions cannot be univalent in this angle. We find the least of the possible values of for k. As a consequence, we obtain an answer to the question posed by Kir’yatskii: if f is univalent in the half-plane, then its fourth derivative cannot be univalent in this half-plane.     

Matrices that preserve vectors of fixed sign variation

For each k≥ 0, those nonsingular matrices that transform the set of totally nonzero vectors with k sign variations into (respectively, onto) itself are studied. Necessary and sufficient conditions are provided. The cases k=0,1,2,n-3,n-2,n-1 are completely characterized.     

A note about the Gaussian property of the Brownian bridge

The Gaussian property of the Brownian bridge is characterized as an application of Ramachandran's theorem in terms of the independence of the random variables that appear in the Karhunen-Loéve expansion of the process. A reference about the construction of the Brownian bridge by means of functional transformations is also included.     

Partially finite convex programming,Part I: Quasi relative interiors and duality theory

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.     

Symmetry classification of quasi-linear PDE’s containing arbitrary functions

We consider the problem of performing the preliminary “symmetry classification” of a class of quasi-linear PDE’s containing one or more arbitrary functions: we provide an easy condition involving these functions in order that nontrivial Lie point symmetries be admitted, and a “geometrical” characterization of the relevant system of equations determining these symmetries. Two detailed examples will elucidate the idea and the procedure: the first one concerns a nonlinear Laplace-type equation, the second a generalization of an equation (the Grad–Schlüter–Shafranov equation) which is used in magnetohydrodynamics.