Generalizations of the projection method with applications to SOR theory for hermitian positive semidefinite linear systems

Summary Ann×n complex matrixB is calledparacontracting if B₂1 and 0x[N(I-B)]Bx₂<x₂. We show that a productB=B _k B _k–1 ...B ₁ ofk paracontracting matrices is semiconvergent and give upper bounds on the subdominant eigenvalue ofB in terms of the subdominant singular values of theB _i 's and in terms of the angles between certain subspaces. Our results here extend earlier results due to Halperin and due to Smith, Solomon and Wagner. We also determine necessary and sufficient conditions forn numbers in the interval [0, 1] to form the spectrum of a product of two orthogonal projections and hence characterize the subdominant eigenvalue of such a product. In the final part of the paper we apply the upper bounds mentioned earlier to provide an estimate on the subdominant eigenvalue of the SOR iteration matrix associated with ann×n hermitian positive semidefinite matrixA none of whose diagonal entries vanish.The work of this author was supported in part by NSF Research Grant No. MCS-8400879     

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.     

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.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

On polynomial EkP matrices

In this paper the relation betweenEP--matrices andE ^k P--matrices over an arbitrary filedF is studied. Further, conditions for the product ofE ^k P--matrices to be anE ^k P--matrix and for the reverse order law to hold for the polynomial Moore-Penrose inverse of the product ofE ^k P--matrices are determined     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

L ∞ stability of finite element approximations to elliptic gradient equations

Summary We examine theL stability of piecewise linear finite element approximationsU to the solutionu to elliptic gradient equations of the form –·[a(x)u]+f(x, u)=g(x) wheref is monotonically increasing inu. We identify a prioriL bounds for the finite element solutionU, which we call reduced bounds, and which are marginally weaker than those for the original differential equations. For the general,N-dimensionai, case we identify new conditions on the mesh, such that under the assumption thatf is Lipschitz continuous on a finite interval,U satisfies the reducedL bounds mentioned above. The new,N-dimensional regularity conditions preclude quasi-rectangular meshes.Moreover, we show thatU is stable inL in two dimensions for a discretization mesh on which –·[a(x)u] gives rise to anM-matrix, whileU is stable for any mesh in one dimension. The condition that the discretization of –·[a(x)u] has to be anM-matrix, still allows the inclusion of the important case of triangulating in a quasi-rectangular fashion.The results are valid for either the pure Neumann problem or the general mixed Dirichlet-Neumann boundary value problem, while interfaces may be present. The boundary conditions forU are obtained by use of (nonexpansive) pointwise projection operators.The first author is supported by the National Science Foundation under grant EET-8719100Research of the second author supported by National Science Foundation grant DMS.8420192     

Algorithms for proportional matrices in reals and integers

LetR be the set of nonnegative matrices whose row and column sums fall between specific limits and whose entries sum to some fixedh > 0. Closely related axiomatic approaches have been developed to ascribe meanings to the statements: the real matrixf R and the integer matrixa R are proportional to a given matrixp 0.These approaches are described, conditions under which proportional solutions exist are characterized, and algorithms are given for finding proportional solutions in each case.     

Updating the singular value decomposition

Summary LetA be anm×n matrix with known singular value decomposition. The computation of the singular value decomposition of a matrixà is considered, whereà is obtained by appending a row or a column toA whenmn or by deleting a row or a column fromA whenm>n. An algorithm is also presented for solving the updated least squares problemà y–b, obtained from the least squares problemAx–b by appending an equation, deleting an equation, appending an unknown, or deleting an unknown.This research was supported by NSF grants MCS 75-06510 and MCS 76-03139     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Schatten class composition operators on weighted Bergman spaces of bounded symmetric domains

Summary We obtain trace ideal criteria for 0A ² () of a Bounded symmetric diomain in _n.     

On equivalence of rearrangements of the Haar system in dyadic Hardy and BMO spaces

H={h ₁,I } — , . : , I ¦(I)¦=¦I¦, ¦I¦ — I. H H ={h _(I),I} . , , . L ^p .

---

---

Dedicated to Professor B. Szökefalvi-Nagy on his 75th birthday

---

This research was supported in part by MTA-NSF Grants INT-8400708 and 8620153.     

On spectral variations under bounded real matrix perturbations

Summary In this paper we investigate the set of eigenvalues of a perturbed matrix {ie509-1} whereA is given and ^{n × n}, ||< is arbitrary. We determine a lower bound for thisspectral value set which is exact for normal matricesA with well separated eigenvalues. We also investigate the behaviour of the spectral value set under similarity transformations. The results are then applied tostability radii which measure the distance of a matrixA from the set of matrices having at least one eigenvalue in a given closed instability domain _b.     

Construction d'une paramétrixe pour des opérateurs différentiels hypoelliptiques marimaux sur un espace homogéne d'un groupe de Lie nilpotent gradué de rang 2

Soient G une alébre de Lie nilpotente stratifée de rang 2, une sous-algébre de G, _0, la représentation de G dans l'espace L ²( \ G) indiute par le caractére trivial C, P un opérateur homogène appartenant à l'algébre universelle enveloppante (complexifiée) U(G) tel que l'opérateur _0, (P) soit hypoelliptique maximal. Cet opérateur peut s'exprimer par une intégrale dépendant de la restriction du symbole p de P au sousensemble = G · décrit par les orbites des éléments de dans la représentation contragrédiente de G dans G ^*.Une algèbre de symboles définis sur est construite et permet de déterminer une paramétrixe de _0, (P); des résultats de réguralité de cet opérateur dans des espaces de Sobolev adaptés sont ensuite obtenus.     

Perturbation of the poles of the scattering matrix under variation of the boundary condition

The behavior of the poles z_n(), n=1,2,... of the scattering matrix of the operatorl u=–u(x), x , (u/n)+(x)u|=0 as 0 is considered. It is proved that |z_n()–z_n|=0(^(1/2)qn), where q_n is the order of the pole of the scattering matrix for the operator ₀u=–u, u/=0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 117, pp. 183–191, 1981.     

Numerical computation of least constants for the Sobolev inequality

Summary Least constantsc for the well-known Sobolev inequality fcf _{m, G} ,fH ^m (G) are obtained in closed form by a reproducing kernel technique, where the Sobolev spaceH ^m (G) for a domainG in ⁿ is defined as the completion ofC ^m (G) with respect to the Sobolev norm given by , where is the norm ofL ₂ (G) and is the supremum norm onG. Numerical values for the case whereG is the ⁿ are given.     

The intuitionistic propositional calculus with quantifiers

Let L be the language of the intuitionistic propositional calculus J completed by the quantifiers and , and let calculus 2J in language L contain, besides the axioms of J, the axioms xB (x) B(y) and B(y) xB (x). A Kripke semantics is constructed for 2J and a completeness theorem is proven. A result of D. Gabbay is generalized concerning the undecidability of C2J⁺-extension of 2J by schemes x (x B) and x(A B(x))A xB (x) specificially: the undecidability is proven of each T theory in language L such that [2J]T [C2J+] ([2J] ([2J] denotes the set of all theorems of calculus 2J).Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 69–76, July, 1977.     

On the stochastic independence properties of hard-core distributions

A probability measurep on the set of matchings in a graph (or, more generally 2-bounded hypergraph) ishard-core if for some : [0,), the probabilityp(M) ofM is proportional to . We show that such distributions enjoy substantial approximate stochastic independence properties. This is based on showing that, withM chosen according to the hard-core distributionp, MP () the matching polytope of , and >0, if the vector ofmarginals, (Pr(AM):A an edge of ), is in (1–) MP (), then the weights (A) are bounded by someA(). This eventually implies, for example, that under the same assumption, with fixed, as the distance betweenA, B tends to infinity.Thought to be of independent interest, our results have already been applied in the resolutions of several questions involving asymptotic behaviour of graphs and hypergraphs (see [14, 16], [11]–[13]).Supported in part by NSFThis work forms part of the author's doctoral dissertation [16]; see also [17]. The author gratefully acknowledges NSERC for partial support in the form of a 1967 Science and Engineering Scholarship.     

On the solvability of a complete second-order differential equation in Banach space

The paper deals with the Cauchy problem for a complete second-order differential equation with unbounded operator coefficientsu+A(t)u+B(t)u=f, u(0)=u0, u(0)=u ₁ . By using the commutant method, we construct a coercive solution of this problem in Holder space in the case where the operatorB is as strong as the operator A².Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 10, pp. 1449–1454, October, 1993.