Affine minimal hypersurfaces of rotation

We give a complete list of affine minimal surfaces inA ³ with Euclidean rotational symmetry, completing the treatise given in [1] and prove that these surfaces have maximal affine surface area within the class of all affine surfaces of rotation satisfying suitable boundary conditions. Besides we show that for rotationally symmetric locally strongly convex affine minimal hypersurfaces inA ⁿ ,n4, the second variation of the affine surface area is negative definite under certain conditions on the meridian.     

Perturbation Analysis for the Eigenvalue Problem of a Formal Product of Matrices

We study the perturbation theory for the eigenvalue problem of a formal matrix product A ₁ ^{s 1} ··· A _p ^{s p}, where all A _k are square and s _k {–1, 1}. We generalize the classical perturbation results for matrices and matrix pencils to perturbation results for generalized deflating subspaces and eigenvalues of such formal matrix products. As an application we then extend the structured perturbation theory for the eigenvalue problem of Hamiltonian matrices to Hamiltonian/skew-Hamiltonian pencils.     

On a class of matrices which arise in the numerical solution of Euler equations

Summary We study block matricesA=[A_ij], where every blockA _ij ^k,k is Hermitian andA _ii is positive definite. We call such a matrix a generalized H-matrix if its block comparison matrix is a generalized M-matrix. These matrices arise in the numerical solution of Euler equations in fluid flow computations and in the study of invariant tori of dynamical systems. We discuss properties of these matrices and we give some equivalent conditions for a matrix to be a generalized H-matrix.Research supported by the Graduiertenkolleg mathematik der Universität Bielefeld     

Some inequalities for communtators and an application to spectral variation

Summary If –I is a positive semidefinite operator andA andB are either both Hermitian or both unitary, then every unitarily invariant norm ofA–B is shown to be bounded by that ofA–B. Some related inequalities are proved. An application leads to a generalization of the Lidskii-Wielandt inequality to matrices similar to Hermitian.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

On some operator monotone functions

We try to find a continuous functionu defined on a real right half-line with the range (0, ) such thatu ^–1 is operator monotone. We then look for another functionv such thatv(u ^–1) is operator monotone, namely,u(A)u(B) impliesv(A)v(B) for self-adjoint operatorsA andB.     

Perturbation bounds for theLDL H andLU decompositions

LetA andA+A be Hermitian positive definite matrices. Suppose thatA=LDL ^H and (A+A)=(L+L)(D+D)(L+L)^H are theLDL ^H decompositons ofA andA+A, respectively. In this paper upper bounds on |D| _F and |L| _F are presented. Moreover, perturbation bounds are given for theLU decomposition of a complexn ×n matrix.     

Generalization of the determinants for trace-potent linear operators

SupposeA is a bounded linear operator on a separable Hilbert space withA ^m of trace class for some positive integerm. A generalized determinant for the operatorI–A is defined, its properties studied and this determinant is then used to exhibit an inversion formula forI–A.     

Coinverters and categories of fractions for categories with structure

A category of fractions is a special case of acoinverter in the 2-categoryCat. We observe that, in a cartesian closed 2-category, the product of tworeflexive coinverter diagrams is another such diagram. It follows that an equational structure on a categoryA, if given by operationsA ⁿ A forn N along with natural transformations and equations, passes canonically to the categoryA [^–1] of fractions, provided that is closed under the operations. We exhibit categories with such structures as algebras for a class of 2-monads onCat, to be calledstrongly finitary monads.The first and third authors gratefully acknowledge the support of the Australian Research Council.     

On perturbations of linear m-accretive operators on reflexive Banach spaces

In this note we prove some results on the m-accretivity of sums and products of linear operators. In particular we obtain the following theorem: LetA, B be two m-accretive operators on a reflexive Banach space. IfA is invertible and (A)^–1 B is accretive thenBA ^–1 andA+B are m-accretive.     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Strong monotonicity of operator functions

LetA, B be bounded selfadjoint operators on a Hilbert space. We will give a formula to get the maximum subspace such that is invariant forA andB, and . We will use this to show strong monotonicity or strong convexity of operator functions. We will see that when 0≤A≤B, andB−A is of finite rank,A ^t ≤B ^t for somet>1 if and only if the null space ofB−A is invariant forA.     

Para-orthogonal Laurent polynomials and associated sequences of rational functions

On the space, , of Laurent polynomials (L-polynomials) we consider a linear functional which is positive definite on (0, ) and is defined in terms of a given bisequence, { _k } _– . Two sequences of orthogonal L-polynomials, {Q _n (z) ₀ and , are constructed which span in the order {1,z ^–1,z,z ^–2,z ²,...} and {1,z,z ^–1,z ²,z ^–2,...} respectively. Associated sequences of L-polynomials {P _n (z) ₀ , and are introduced and we define rational functions , wherew is a fixed positive number. The partial fraction decomposition and integral representation of,M _n (z, w) are given and correspondence of {M _n (z, w)} is discussed. We get additional solutions to the strong Stieltjes moment problem from subsequences of {M _n (z, w)}. In particular when { _k } _– is a log-normal bisequence, {M _2n (z, w)} and {M _2n+1 (z, w)} yield such solutions.Research supported in part by the National Science Foundation under Grant DMS-9103141.     

Theq-gamma function forx<0

F. H. Jackson defined aq analogue of the gamma function which extends theq-factorial (n!) _q =1(1+q)(1+q+q ²)...(1+q+q ²+...+q ^n–1) to positivex. Askey studied this function and obtained analogues of most of the classical facts about the gamma function, for 0<q<1. He proved an analogue of the Bohr-Mollerup theorem, which states that a logarithmically convex function satisfyingf(1)=1 andf(x+1)=[(q ^x –1)/(q–1)]f(x) is in fact theq-gamma function He also studied the behavior of _q asq changes and showed that asq1^–, theq-gamma function becomes the ordinary gamma function forx>0.I proved many of these results forq>1. The current paper contains a study of the behavior of _q (x) forx<0 and allq>0. In addition to some basic properties of _q , we will study the behavior of the sequence {x _n (q)} of critical points asn orq changes.     

A posteriori error estimates for linear equations

Summary This paper describes upper and lowerp-norm error bounds for approximate solutions of the linear system of equationsAx=b. These bounds imply that the error is proportional to the quantity wherer is the residual andq is the conjugate index top. The constant of proportionality is larger than 1 and lies in a specified range. Similar results are obtained for approximations toA ^–1 and solutions of nonsingular linear equations on general spaces.Research was partially supported by NSF Grant DMS8901477     

Regarding thep-norms of radial basis interpolation matrices

A radial basis function approximation has the form where:R ^d R is some given (usually radially symmetric) function, (y _j ) ₁ ⁿ are real coefficients, and the centers (x _j ) ₁ ⁿ are points inR ^d . For a wide class of functions , it is known that the interpolation matrixA=((x _j –x _k )) _j,k=1 ⁿ is invertible. Further, several recent papers have provided upper bounds on ||A ^–1||₂, where the points (x _j ) ₁ ⁿ satisfy the condition ||x _j –x _k ||₂,jk, for some positive constant . In this paper we calculate similar upper bounds on ||A ^–1||₂ forp1 which apply when decays sufficiently quickly andA is symmetric and positive definite. We include an application of this analysis to a preconditioning of the interpolation matrixA _n = ((j–k)) _j,k=1 ⁿ when (x)=(x ²+c ²)^1/2, the Hardy multiquadric. In particular, we show that sup _n ||A _n ^–1 || is finite. Furthermore, we find that the bi-infinite symmetric Toeplitz matrix enjoys the remarkable property that ||E ^–1|| _p = ||E ^–1||₂ for everyp1 when is a Gaussian. Indeed, we also show that this property persists for any function which is a tensor product of even, absolutely integrable Pólya frequency functions.Communicated by Charles Micchelli.     

On the sharpness of some upper bounds for the spectral radii of S.O.R. iteration matrices

Summary Sharpness is shown for three upper bounds for the spectral radii of point S.O.R. iteration matrices resulting from the splitting (i) of a nonsingularH-matrixA into the usualD–L–U, and (ii) of an hermitian positive definite matrixA intoD–L–U, whereD is hermitian positive definite andL=1/2(A–D+S) withS some skew-hermitian matrix. The first upper bound (which is related to the splitting in (i)) is due to Kahan [6], Apostolatos and Kulisch [1] and Kulisch [7], while the remaining upper bounds (which are related to the splitting in (ii)) are due to Varga [11]. The considerations regarding the first bound yield an answer to a question which, in essence, was recently posed by Professor Ridgway Scott: What is the largest interval in , 0, for which the point S.O.R. iterative method is convergent for all strictly diagonally dominant matrices of arbitrary order? The answer is, precisely, the interval (0, 1].Research supported in part by the Air Force Office of Scientific Research, and the Department of Energy     

An algorithm for determining if the inverse of a strictly diagonally dominant Stieltjes matrix is strictly ultrametric

Summary It was recently shown that the inverse of a strictly ultrametric matrix is a strictly diagonally dominant Stieltjes matrix. On the other hand, as it is well-known that the inverse of a strictly diagonally dominant Stieltjes matrix is a real symmetric matrix with nonnegative entries, it is natural to ask, conversely, if every strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse. Examples show, however, that the converse is not true in general, i.e., there are strictly diagonally dominant Stieltjes matrices in ^n×n (for everyn3) whose inverses are not strictly ultrametric matrices. Then, the question naturally arises if one can determine which strictly diagonally dominant Stieltjes matrices, in ^n×n (n3), have inverses which are strictly ultrametric. Here, we develop an algorithm, based on graph theory, which determines if a given strictly diagonally dominant Stieltjes matrixA has a strictly ultrametric inverse, where the algorithm is applied toA and requires no computation of inverse. Moreover, if this given strictly diagonally dominant Stieltjes matrix has a strictly ultrametric inverse, our algorithm uniquely determines this inverse as a special sum of rank-one matrices.Research supported by the National Science FoundationResearch supported by the Deutsche Forschungsgemeinschaft     

A characterization of the generalized twisted field planes of characteristic ≥5

Let be a non-Desarguesian semifield plane of orderp ⁿ, p a prime number 5 andn3, and let denote the group induced by the autotopism groupG of on the line at infinity. We prove that is a generalized twisted field plane if, and only if, has an element of order (p ^k–1)((p ⁿ–1)/(p ^m–1)), for some integersk andm, wherek | m, m | n, andm.This work was supported in part by NSF grants RII-9014056, component IV of the EPSCoR of Puerto Rico grant and ARO grant for Cornell MSI     

Strongly definitizable linear pencils in Hilbert space

Selfadjoint linear pencils F–G are considered which have discrete spectrum and neither F nor G is definite. Several characterizations are given of a strongly definitizable property when F and G are bounded, and also when both operators are unbounded. The theory is applied to analysis of the stability of a linear second order initial-boundary value problem with boundary conditions dependent on the eigenvalue parameter.Research supported in part by a grant from the Natural Sciences and Engineering Research Council of Canada.     

Inversion of the Weyl integral transform and the radon transform on Rn using generalized wavelets

We invert the Weyl integral transform by means of a generalized continuous wavelet transform on the half line associated with the Bessel operatorL , >–1/2. Next, we use the connection between radial classical wavelets onR ⁿ and generalized wavelets associated with the Bessel operatorL( _n–2)/2 to derive new inversion formulas for the Radon transform onR ⁿ ,n2.