Applications of matrix functions

A, ()=0, c(z)- T - TY=AY. A y(t)=y(, t) Ty=y Y(t). - c(T)y=0.     

A and the vanishing topology of discriminants

Summary Suppose thatf: ⁿ , 0 ^p , 0 is finitely -determined withnp. We define a Milnor fiber for the discriminant off; it is the discriminant of a stabilization off. We prove that this discriminant Milnor fiber has the homotopy type of a wedge of spheres of dimensionp–1, whose number we denote byµ (f). One of the main theorems of the paper is a = type result: if (n, p) is in the range of nice dimensions in the sense of Mather, then -codium,with equality iff is weighted homogeneous. Outside the nice dimensions we obtain analogous formulae with correction terms measuring the presence of unstable but topologically stable germs in the stabilization. These results are further extended to nonlinear sections of free divisors.Oblatum 15-VIII-1990Partially supported by a grant from the National Science Foundation and a Fullbright Fellowship     

On the zetafunction of an arithmetical semigroup

The Zetafunction Z of an additive, multiplicative arithmetical semigroup is a power series with radius of convergence (01), a Dirichlet series with abscissa of convergence (0), respectively.Conditions are given which ensure that >0 and Z()=,< and Z()= hold true, respectively. Jürgen Neukirch zum Gedächtnis Mathematics Subject Classification (2000):11N45, 05A16.     

О Сходимости Лагранжева Интерполирования В Некоторых Множествах Функций

.      

Hermitian K-theory on a Theorem of Giffen

Let be an exact category with duality. In [1] a category () was introduced and the authors asserted that the loop space of the topological realization of () is homotopy equivalent to Karoubis U-theory space of when = (R), the category of finitely generated projective modules over a ring R with an involution if 2 is invertible in R. Unfortunately, their proof contains a mistake. We present a different proof which avoids their argument.Mathematics Subject Classifications (1991): 19DO6, 19G38, 11E70.     

Sequential gradient-restoration algorithm for the minimization of constrained functions—Ordinary and conjugate gradient versions

The problem of minimizing a functionf(x) subject to the constraint (x)=0 is considered. Here,f is a scalar,x ann-vector, and aq-vector. Asequential algorithm is presented, composed of the alternate succession of gradient phases and restoration phases.In thegradient phase, a nominal pointx satisfying the constraint is assumed; a displacement x leading from pointx to a varied pointy is determined such that the value of the function is reduced. The determination of the displacement x incorporates information at only pointx for theordinary gradient version of the method (Part 1) and information at both pointsx and for theconjugate gradient version of the method (Part 2).In therestoration phase, a nominal pointy not satisfying the constraint is assumed; a displacement y leading from pointy to a varied point is determined such that the constraint is restored to a prescribed degree of accuracy. The restoration is done by requiring the least-square change of the coordinates.If the stepsize of the gradient phase is ofO(), then x=O() and y=O(²). For sufficiently small, the restoration phase preserves the descent property of the gradient phase: the functionf decreases between any two successive restoration phases.This research, supported by the NASA Manned Spacecraft Center, Grant No. NGR-44-006-089, and by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensation of the investigations reported in Refs. 1 and 2.     

Das Zeitverhalten von einfachen offenen exponentiellen Warteschlangensystemen mit unendlich vielen Warteplätzen

Zusammenfassung Die zeitabhängige (instationäre) Lösung für die Zustandswahrscheinlichkeiten und für einige Kenngrößen von Warteschlangensystemen mit einer Bedienungsstation, unendlich vielen Warteplätzen, exponentiellem Zu- und Abgang und beliebigem Anfangszustand wird bestimmt. Die ZustandswahrscheinlichkeitenP _v (), d. h. die Wahrscheinlichkeiten für Einheiten im System zur Zeit, ergeben sich als Integrale, in denen modifizierteSessel-Funktionen 1. Art auftreten. Der ErwartungswertL () und die VarianzV() der Zahl von Einheiten im System lassen sich als Integrale darstellen, in denen nur die ZustandswahrscheinlichkeitP ₀() auftritt.Für<1 und erreichen die Systeme einen stationären Zustand (für den die Lösung bekannt ist); für1 und giltP _v ()0 für alle, L(),V().Ist>1, dann wachsenL() undV() für große linear mit; ihre Asymptoten werden berechnet. Ist=1, dann wachsenL() und die Standardabweichung() für große mit ; einfache Näherungsformeln werden gefunden.

---

Summary The time dependent solution is determined for the state probabilities and for some characteristic values of queuing systems with a single server, an infinite number of waiting places, exponentially distributed inter-arrival and service times, and any initial state. The state probabilitiesP _v (), i.e. the probabilities for units in the system at time, are given in the form of integrals in which modifiedBessel functions of the first kind occur. Integrating the state probalityP ₀() over leads to the meanL() and the varianceV() of the number of units in the system.For<1 and the systems tend to a steady state (for which the solution is known); for1 and we haveP _v ()0 for all, L(),V().If>1 asymptotic expansions for large are found givingL() andV() proportional to. If=1 simple approximate formulas for large are obtained givingL() and the standard deviation() proportional to .

---

---

Vorgel. v.:J. Nitsche.     

On acceleration methods for coupled nonlinear elliptic systems

Summary We compare both numerically and theoretically three techniques for accelerating the convergence of a nonlinear fixed point iterationuT(u), arising from a coupled elliptic system: Chebyshev acceleration, a second order stationary method, and a nonlinear version of the Generalized Minimal Residual Algorithm (GMRES) which we call NLGMR. All three approaches are implemented in Jacobian-free mode, i.e., only a subroutine which returnsT(u) as a function ofu is required.We present a set of numerical comparisons for the drift-diffusion semiconductor model. For the mappingT which corresponds to the nonlinear block Gauß-Seidel algorithm for the solution of this nonlinear elliptic system, NLGMR is found to be superior to the second order stationary method and the Chebychev acceleration. We analyze the local convergence of the nonlinear iterations in terms of the spectrum [T _u (u ^(*))] of the derivativeT _u at the solutionu ^(*). The convergence of the original iteration is governed by the spectral radius [T _U (u ^(*))]. In contrast, the convergence of the two second order accelerations are related to the convex hull of [T _u (u ^(*))], while the convergence of the GMRES-based approach is related to the local clustering in [I–T _u (u ^(*))]. The spectrum [I–T _u (u ^(*))] clusters only at 1 due to the successive inversions of elliptic partial differential equations inT. We explain the observed superiority of GMRES over the second order acceleration by its ability to take advantage of this clustering feature, which is shared by similar coupled nonlinear elliptic systems.     

Estimates for the -Neumann problem and nonexistence of C 2 Levi-flat hypersurfaces in

Let be a pseudoconvex domain with C² boundary in , n 2. We prove that the -Neumann operator N exists for square-integrable forms on . Furthermore, there exists a number ₀>0 such that the operators and the Bergman projection are regular in the Sobolev space W ( ) for <₀. The -Neumann operator is used to construct -closed extension on for forms on the boundary b. This gives solvability for the tangential Cauchy-Riemann operators on the boundary. Using these results, we show that there exist no non-zero L²-holomorphic (p, 0)-forms on any domain with C² pseudoconcave boundary in with p > 0 and n 2. As a consequence, we prove the nonexistence of C² Levi-flat hypersurfaces in .This paper is a revision of our preprint (May 2003) formerly titled Estimates for the -Neumann problem and nonexistence of Levi-flat hypersurfaces in where the nonexistence of C², Levi-flat hypersurfaces is proved for >0.All three authors are partially supported by NSF grants.An erratum to this article can be found at     

On Universal Representation of Random Graphs

It is shown that every probability measure on the interval [0, 1] gives rise to a unique infinite random graph g on vertices {v₁, v₂, . . .} and a sequence of random graphs gn on vertices {v₁, . . . , v_n} such that . In particular, for Bernoulli graphs with stable property Q, can be strengthened to: probability space (, F, P), set of infinite graphs G(Q) , F with property Q such that .AMS Subject Classification: 05C80, 05C62.     

A note on extensions of infinitary logic

We show that a strong form of the so called Lindströms Theorem [4] fails to generalize to extensions of L and L : For weakly compact there is no strongest extension of L with the (,)-compactness property and the Löwenheim-Skolem theorem down to . With an additional set-theoretic assumption, there is no strongest extension of L with the (,)-compactness property and the Löwenheim-Skolem theorem down to <.We are indebted to Lauri Hella, Tapani Hyttinen and Kerkko Luosto for useful suggestions.Research partially supported by the United States-Israel Binational Science Foundation. Publication number [ShVa:726]Research partially supported by grant 40734 of the Academy of Finland.     

On the optimality of a characterization theorem for the gamma function using the multiplication formula

Summary The following Artin type characterization of : _{+ +} is proved: Assume thatf: _{+ +} satisfies the Gauss multiplication formula for some fixedp 2,f is absolutely continuous on [l/p, 1 + ] for some > 0 and lim _{x 0} xf(x) = 1. Thenf(x) = (x) forx > 0.The optimality of this result is checked by means of counterexamples. For instance, it is shown that the result is no longer true, if f is absolutely continuous is replaced by f is continuous and of finite variation.     

Outlines for the computation of the multiplicities of the spectra of orthogonal sums

If A and B are operators in the spaces X and Y, respectively, and if the operator B has many sets , , such that the manifolds p is a polynomial are dense in the space Y, then Here a=(the multiplicity of the spectrum of the operator A)=mindimL: span (AⁿL:n0)}=X. For example, if B=T^–g is a Toeplitz operator in the space H² with antianalytic symbol) and if g (the polynomial convex hull of the spectrum (A)) , then. Conversely, if and, then (under some assumptions on the regularity of the function f we have. One also gives examples of univalent and essentially univalent functions f (f H), for which Tf>1.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 126, pp. 150–158, 1983.     

The Lê varieties,I

Summary For a complex polynomial,f:( ⁿ⁺¹ ,0) (, 0), with a singular set of complex, dimensions at the origin, we define a sequence of varieties—the Lê varieties, _f ^(k) , off at 0. The multiplicities of these varieties, _f ^(k) , generalize the Milnor number for an isolated singularity. In particular, we show that ifsn-2, the Milnor, fibre off is obtained fromB ²ⁿ by successively attaching _f ^{(n – k)} k-handles, wheren-skn Ifs=n-1, the Milnor fibre off is obtained from a2n-manifold with the homotopy type of a bouquet of _f ^{(n – 1)} circles by successively attaching _f ^{(n – k)} k-handles, where 2kn.The author is a National Science Foundation, Postdoctoral Research Fellow supported by grant # DMS-8807216     

On the Space of Sequences of p-Bounded Variation and Related Matrix Mappings

The difference sequence spaces (), c(), and c ₀() were studied by Kzmaz. The main purpose of the present paper is to introduce the space bv _p consisting of all sequences whose differences are in the space _p , and to fill up the gap in the existing literature. Moreover, it is proved that the space bv _p is the BK-space including the space _p . We also show that the spaces bv _p and _p are linearly isomorphic for 1 p . Furthermore, the basis and the -, -, and -duals of the space bv _p are determined and some inclusion relations are given. The last section of the paper is devoted to theorems on the characterization of the matrix classes (bv _p : ), (bv : _p ), and (bv _p : ₁), and the characterizations of some other matrix classes are obtained by means of a suitable relation.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Existence and regularity of solutions for a semilinear first-order equation on the torus

The problem is considered on the N-dimensional torus with a_i and g a continuous function satisfying a growth condition as ¦u¦. We show the existence of bounded solutions that are continuous if g is strictly increasing in u.     

On the Approximation of Denotational Mu-Semantics

A signature gives rise to a language L(Var) by extending with variables x Var and binding constructs x and x, corresponding to least and greatest fixed points respectively. The natural denotational models for such languages are bicomplete dcpos as monotone -algebras. We prove that several approximating denotational semantics have the usual compositional semantics as their limit. These results provide techniques for relating syntactic and semantic concepts such as in full abstraction or completeness proofs. In the presence of an involutive antitone map on a bicomplete dcpo D we may translate the language L(Var) into one with least fixed points only such that meanings are preserved. This allows an approximative semantics where least and greatest fixed points are simultaneously approximated by unwindings in the syntax, provided that the limit semantics is substitutive. We discuss the principal difficulties of simultaneous unwindings in the absence of such semantic negations.     

Critical points of essential norms of singular integral operators in weighted spaces

We show that for any simple piecewise Ljapunov contour there exists a power weight such that the essential norm |S | in the spaceL ₂(, ) does not depend on the angles of the contour and it is given by formula (2). All such weights are described. For the union =₁₂ of two simple piecewise Lyapunov curves we prove that the essential norm |S | inL ₂() is minimal if both ₁ and ₂ are smooth in some neighborhoods of the common points. It is the case when the norm |S | in the spaceL ₂() as well as inL ₂(, ) does not depend on the values of the angles and it can be calculated by formula (5).     

Converse theorems for multidimensional Kantorovich operators

L _p [0, l]. . . - .

---

---

Supported by National Science Foundation, Zhejiang Provincial Science Foundation of China, and Alexander von Humboldt Foundation of Germany.