Remarks on the perturbation of analytic matrix functions III

As in [N], [LN] the Newton diagram is used in order to get information about the first terms of the Puiseux expansions of the eigenvalues () of the perturbed matrix pencilT(, )=A()+B(, ) in the neighbourhood of an unperturbed eigenvalue () ofA(). In fact sufficient conditions are given which assure that the orders of these first terms correspond to the partial multiplicities of the eigenvalue ₀ ofA().     

Nonlinear eigenvalue approximation

Summary For each in some domainD in the complex plane, letF() be a linear, compact operator on a Banach spaceX and letF be holomorphic in . Assuming that there is a so thatI–F() is not one-to-one, we examine two local methods for approximating the nonlinear eigenvalue . In the Newton method the smallest eigenvalue of the operator pencil [I–F(),F()] is used as increment. We show that under suitable hypotheses the sequence of Newton iterates is locally, quadratically convergent. Second, suppose 0 is an eigenvalue of the operator pencil [I–F(),I] with algebraic multiplicitym. For fixed leth() denote the arithmetic mean of them eigenvalues of the pencil [I–F(),I] which are closest to 0. Thenh is holomorphic in a neighborhood of andh()=0. Under suitable hypotheses the classical Muller's method applied toh converges locally with order approximately 1.84.     

Conditions for eigenvectors of a selfadjoint operator-function to form a basis

Consider a functionL() defined on an interval of the real axis whose values are linear bounded selfadjoint operators in a Hilbert spaceH. A point ₀ and a vector ₀ H( ₀ 0) are called eigenvalue and eigenvector ofL() ifL() ifL(₀) ₀ = 0. Supposing that the functionL() can be represented as an absolutely convergent Fourier integral, the interval is sufficiently small and the derivative will be positive at some point, it has been proved that all the eigenvectors of the operator-functionL() corresponding to the eigenvalues from the interval form an unconditional basis in the subspace spanned by them.     

Eigenvalue problem for an irregular λ-matrix

The solution of the eigenvalue problem is examined for the polyomial matrixD()=A_o^s+A₁^s–1+...+A_s when the matricesA ₀ andA ₂ (or one of them) are singular. A normalized process is used for solving the problem, permitting the determination of linearly independent eigenvectors corresponding to the zero eigenvalue of matrixD() and to the zero eigenvalue of matrixA ₀. The computation of the other eigenvalues ofD() is reduced to the same problem for a constant matrix of lower dimension. An ALGOL program and test examples are presented.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 58, pp. 80–92, 1976.     

Quasi-symmetric 3-designs with triangle-free graph

The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0x<y<k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, ) where v=(+2)(²+4+2)+1, k=²+3+2 and =1,2,..., or D is a complement of one of these designs.     

Backward perturbation analysis of certain characteristic subspaces

Summary This paper gives optimal backward perturbation bounds and the accuracy of approximate solutions for subspaces associated with certain eigenvalue problems such as the eigenvalue problemAx=x, the generalized eigenvalue problem Ax=Bx, and the singular value decomposition of a matrixA. This paper also gives residual bounds for certain eigenvalues, generalized eigenvalues and singular values.This subject was supported by the Swedish Natural Science Research Council and the Institute of Information Processing of the University of Umeå.     

Some linear stability results for iterative schemes for implicit Runge-Kutta methods

This article examines stability properties of some linear iterative schemes that have been proposed for the solution of the nonlinear algebraic equations arising in the use of implicit Runge-Kutta methods to solve a differential systemx =f(x). Each iteration step requires the solution of a set of linear equations, with constant matrixI –hJ, whereJ is the Jacobian off evaluated at some fixed point. It is shown that the stability properties of a Runge-Kutta method can be preserved only if is an eigenvalue of the coefficient matrixA. SupposeA has minimal polynomial (x – ) ^m p(x),p() 0. Then stability can be preserved only if the order of the method is at mostm + 2 (at mostm + 1 except for one case).This work was partially supported by a grant from the Science and Engineering Research Council.     

An Arnoldi Method for Nonlinear Eigenvalue Problems

For the nonlinear eigenvalue problem T()x=0 we propose an iterative projection method for computing a few eigenvalues close to a given parameter. The current search space is expanded by a generalization of the shift-and-invert Arnoldi method. The resulting projected eigenproblems of small dimension are solved by inverse iteration. The method is applied to a rational eigenvalue problem governing damped vibrations of a structure.     

A Result on Ext Over Kac–Moody Algebras

We prove the following result for a not necessarily symmetrizable Kac–Moody algebra: Let x,y W with x y, and let P⁺. If n=l(x)-l(y), then Ext _C() ⁿ (M(x·),L(y·))=1.     

A shift-invariant algebra of singular integral operators with oscillating coefficients

LetB be the Banach algebra of all bounded linear operators on the weighted Lebesgue spaceL ^p (T, ) with an arbitrary Muckenhoupt weight on the unit circleT, and the Banach subalgebra ofB generated by the operators of multiplication by piecewise continuous coefficients and the operatorse _h,S _T e _h, ^–1 I (hR, T) whereS _T is the Cauchy singular integral operator ande _h,(t)=exp(h(t+)/(t–)),tT. The paper is devoted to a symbol calculus, Fredholm criteria and an index formula for the operators in the algebra and its matrix analogue . These shift-invariant algebras arise naturally in studying the algebras of singular integral operators with coefficients admitting semi-almost periodic discontinuities and shifts being diffeomorphisms ofT onto itself with second Taylor derivatives.Partially supported by CONACYT grant, Cátedra Patrimonial, No. 990017-EX and by CONACYT project 32726-E, México.     

Limit theorems for multitype continuous time Markov branching processes

Summary Let X(t)=(X ₁ (t), X ₂ (t), , X _t (t)) be a k-type (2k<) continuous time, supercritical, nonsingular, positively regular Markov branching process. Let M(t)=((m _ij (t))) be the mean matrix where m _ij (t)=E(X _j (t)¦X _r (0)= _ir for r=1, 2, , k) and write M(t)=exp(At). Let be an eigenvector of A corresponding to an eigenvalue . Assuming second moments this paper studies the limit behavior as t of the stochastic process . It is shown that i) if 2 Re >₁, then · X(t)e{–t¦ converges a.s. and in mean square to a random variable. ii) if 2 Re ₁ then [ · X(t)] f(v · X(t)) converges in law to a normal distribution where f(x)=(x) ^–1 if 2 Re <₁ and f(x)=(x log x)^–1 if 2 Re =₁, ₁ the largest real eigenvalue of A and v the corresponding right eigenvector.Research supported in part under contracts N0014-67-A-0112-0015 and NIH USPHS 10452 at Stanford University.     

Eigenvalues of convex processes and convergence properties of differential inclusions

In this paper, we study (real) eigenvalues and eigenvectors of convex processes, and provide conditions for the existence of eigenvectors in a given convex coneK ⁿ . It is established that the maximal eigenvalue ofG(·) inK is expressed by (whereK ⁰ is the polar cone ofK) provided that the minimum is attained in intK ⁰. This result is applied to study the asymptotic behaviour of certain differential inclusions{G(x(t)). We extend some known results for the von Neumann-Gale model to our more general framework. We prove that ifx ₀ is the unique eigenvector corresponding to the maximal eigenvalue ₀ ofG(·) inK, then the nonexistence of solutions of a certain special trigonometric form is necessary and sufficient for every viable solutionx(·) to satisfy^- ₀ ^t x(t)cx ₀ ast for somec0. Our method is to study the family of convex conesW =cl{v–x :xK,vG(x) where is any real number. We characterize the maximal eigenvalue ₀ as the minimal for whichW can be separated fromK.The research was supported in part by a grant from the ministry of science and the Maagara special project for the absorption of new immigrants in the Department of Mathematics at Technion.     

Approximate Identities, Almost-Periodic Functions and Toeplitz Operators

A sequence {A } of linear bounded operators is called stable if, for all sufficiently large , the inverses of A exist and their norms are uniformly bounded. We consider the stability problem for sequences of Toeplitz operators {T(k a)}, where a(t) is an almost-periodic function on unit circle and k a is an approximate identity. A stability criterion is established in terms of the invertibility of a family of almost-periodic functions. This family of functions depends on the approximate identity used in a very subtle way, and the stability condition is, in general, stronger than the invertibility condition of the Toeplitz operator T(a).     

A property of the finite-difference second-derivative operator

We consider the finite-difference eigenvalue problem u _xx ^– + u=0, u₀= u_n+1=0 on a nonuniform grid =x_ii=0,1,...,n+1, x₀=0, x_n+1=1. In connection with the issue of existence of exact-spectrum schemes for second-derivative operators, we examine the extremal properties of functions f_n(v, h)=₁ ^v(h)+ ...+_{n v}(h), v R. We prove that the maximum of f_n(–1, h) is attained only on a uniform grid. We establish a necessary condition for given numbers 0 <₁ <... < _n to be the eigenvalues of the above problem for at least one grid .Translated from Vychislitel'naya i Prikladnaya Matematika, No. 62, pp. 3–8, 1987.     

An Improvement of an Inequality of Fiedler Leading to a New Conjecture on Nonnegative Matrices

Suppose that A is an n × n nonnegative matrix whose eigenvalues are = (A), ₂, ..., _n. Fiedler and others have shown that \det( I -A) ⁿ - ⁿ, for all > with equality for any such if and only if A is the simple cycle matrix. Let a _i be the signed sum of the determinants of the principal submatrices of A of order i × i, i=1, ..., n - 1. We use similar techniques to Fiedler to show that Fiedler's inequality can be strengthened to: for all . We use this inequality to derive the inequality that: . In the spirit of a celebrated conjecture due to Boyle-Handelman, this inequality inspires us to conjecture the following inequality on the nonzero eigenvalues of A: If ₁ = (A), ₂,...,_k are (all) the nonzero eigenvalues of A, then . We prove this conjecture for the case when the spectrum of A is real.     

On the lowest eigenvalue of the Laplacian for the intersection of two domains

IfA andB are two bounded domains in _n and (A), (B) are the lowest eigenvalues of – with Dirichlet boundary conditions then there is some translate,B _x, ofB such that (AB _x)<(A)+(B). A similar inequality holds for .There are two corollaries of this theorem: (i) A lower bound for sup _x {volume (AB _x)} in terms of (A), whenB is a ball; (ii) A compactness lemma for certain sequences inW ^1,p ( _n ).Work partially supported by U.S. National Science Foundation grant PHY-8116101 A01. AMS(MOS) Classification: 35P15     

Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Onp-hyponormal operators for 0<p<1

The distance formula Tt-I)^–1=[Dist(, (T)]^–1, (T), for hyponormal operators, is generalized top-hyponormal operators for 0<p<1. Several other results involving eigenspaces ofU and |T|, the joint point spectrum, and the spectral radius are also otained, where |T|=(T ^* T)^1/2 andU is the unitary operator in the polar decomposition of thep-hyponormal operatorT=U|T|.     

Eine Anwendung der Jordanschen Normalform

Zusammenfassung Es wird bewiesen, dass die Raumkurvex(), gegeben durch den AusdruckAx+b=x (A konstante Matrix,b konstanter Vektor, variabler Skalar) unter gewissen einfachen Bedingungen fürn verschiedene Werte von n linear unabhängige Werte annimmt. Der Satz findet in der ökonomischen Theorie der Produktionspreise eine Anwendung.

---

Summary It is proved that the curvex() defined by the expressionAx+b=x (A constant matrix,b constant vector, variable scalar) assumesn linearly independent values atn different values of under certain simple conditions. There is an application for the theorem in the economic theory of prices of production.

---

---

Ich danke Herrn W. Habicht für freundliche Hinweise.     

On a problem of A. Pleijel

In 1955, Arne Pleijel proposed the following problem which remains unsolved to this day: Given a closed plane convex curve C and a point x() at a fixed distance above the plane, as the point x() varies, characterize the point for which the conical surface with vertex x() and base C attains its minimum, and determine the limits as 0 and of this minimum point. The purpose of this paper is to solve the cases where approach its extremities and in the course of the solution, we obtain an interesting characterization of the limit points, which we shall call the Pleijel points of C. A consequence is that the inner Pleijel point provides an upper bound for the isoperimetric defect of C. We also generalize the problem to higher dimensional spaces, and obtain the corresponding characterizations of the limiting points for convex surfaces.