The customer response times in the processor sharing queue are associated

The customer response times in the egalitarian processor sharing queue are shown to be associated random variables under renewal inputs and general independent service times assumptions.The work by this author was supported in part by the National Science Foundation under grant ASC 88-8802764 and by the Office of Naval Research under grant ONR N00014-87-K-0796.     

The scalar curvature equation on 2- and 3-spheres

In this article we obtain a priori estimates for solutions to the prescribed scalar curvature equation on 2- and 3-spheres under a nondegeneracy assumption on the curvature function. Using this estimate, we use the continuity method to demonstrate the existence of solutions to this equation when a map associated to the given curvature function has non-zero degree.Research of first author supported in part by NSF grant 91-03949Research of second author supported by a NSF Postdoctoral Fellowship.Research of third author supported in part by NSF grant 91-02872 and the Ellentuck Fund.     

The Superconvergence of the Composite Trapezoidal Rule for Hadamard Finite Part Integrals

The composite trapezoidal rule has been well studied and widely applied for numerical integrations and numerical solution of integral equations with smooth or weakly singular kernels. However, this quadrature rule has been less employed for Hadamard finite part integrals due to the fact that its global convergence rate for Hadamard finite part integrals with (p+1)-order singularity is p-order lower than that for the Riemann integrals in general. In this paper, we study the superconvergence of the composite trapezoidal rule for Hadamard finite part integrals with the second-order and the third-order singularity, respectively. We obtain superconvergence estimates at some special points and prove the uniqueness of the superconvergence points. Numerical experiments confirm our theoretical analysis and show that the composite trapezoidal rule is efficient for Hadamard finite part integrals by noting the superconvergence phenomenon. The work of this author was partially supported by the National Natural Science Foundation of China(No.10271019), a grant from the Research Grants Council of the Hong Kong Special Administractive Region, China (Project No. City 102204) and a grant from the Laboratory of Computational Physics The work of this author was supported in part by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 102204).     

A note on parameter estimations of panel vector autoregressive models with intercorrelation

This note considers parameter estimation for panel vector autoregressive models with intercorrelation. Conditional least squares estimators are derived and the asymptotic normality is established. A simulation is carried out for illustration.     

Second order parallel algorithms for piecewise smooth displacement kernels

Second order parallel algorithms for Fredholm integral equations with piecewise smooth displacement kernels are derived. One is based on a difference scheme of Runge-Kutta type for an unusual partial differential equations for continuous functions of two variables. The other is based on the trapezoidal quadrature rule applied to a modified integral equations. It is found that the Runge-Kutta type algorithm exhibits certain advantages.The work of these authors was supported in part by the NSF Grant DMS-9007030The work of this author was supported in part by a grant from the National Science and Engineering Research Council of Canada     

A real algorithm for the Hermitian eigenvalue decomposition

Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.     

Harnack inequality for some classes of Markov processes

In this paper we establish a Harnack inequality for nonnegative harmonic functions of some classes of Markov processes with jumps. Mathematics Subject Classification (2000): Primary 60J45, 60J75, Secondary 60J25.This work was completed while the authors were in the Research in Pairs program at the Mathematisches Forschungsinstitut Oberwolfach. We thank the Institute for the hospitality.The research of this author is supported in part by NSF Grant DMS-9803240.The research of this author is supported in part by MZT grant 0037107 of the Republic of Croatia.     

Subdirect decomposition of rings and the axiom of choice

The second author is supported in part by a research grant of the Council of Scientific and Industrial Research of South Africa.     

Weakly self-injective semilattices

In this note we characterize weakly self-injective semilattices as Brouwerian semilattices which are compact in the residuated interval topology. We also characterize weakly self-injective semigroups which are semilattices of groups with trivial multiplication. Research of first author supported in part by a research grant from the Faculty Research Committee of Bowling Green State University. Research of second author supported in part by a postdoctoral fellowship in the Biomathematics Program at North Carolina State University under PHS Grant #GM-678 from NIGMS.     

Weighted norm inequalities for operators of potential type and fractional maximal functions

In this paper, we study two-weight norm inequalities for operators of potential type in homogeneous spaces. We improve some of the results given in [6] and [8] by significantly weakening their hypotheses and by enlarging the class of operators to which they apply. We also show that corresponding results of Carleson type for upper half-spaces can be derived as corollaries of those for homogeneous spaces. As an application, we obtain some necessary and sufficient conditions for a large class of weighted norm inequalities for maximal functions under various assumptions on the measures or spaces involved.Research of the first author was supported in part by NSERC grant A5149.Research of the second author was supported in part by NSF grant DMS93-02991.     

On the existence of global vortex rings

Sans résumé Supported in part by a grant from the National Science Foundation. The results of this paper were obtained while the author was partially supported by U. S. Army Research Office grant No. DAA-29-78-6-0127 at Courant Institute, New York University.     

Superlinear primal-dual affine scaling algorithms for LCP

We describe an interior-point algorithm for monotone linear complementarity problems in which primal-dual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Q-order up to (but not including) two. The technique is shown to be consistent with a potential-reduction algorithm, yielding the first potential-reduction algorithm that is both globally and superlinearly convergent.Corresponding author. The work of this author was based on research supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.The work of this author was based on research supported by the National Science Foundation under grant DDM-9109404 and the Office of Naval Research under grant N00014-93-1-0234. This work was done while the author was a faculty member of the Systems and Industrial Engineering Department at the University of Arizona.     

The endomorphism semiring of a semilattice

We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe its monolith. The endomorphism semiring is congruence simple if and only if the semilattice has both a least and a largest element. The third author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA), grant nos. T 48809 and K 60148. The work is a part of the research project MSM0021620839 financed by MSMT.     

Local convergence of interior-point algorithms for degenerate monotone LCP

Most asymptotic convergence analysis of interior-point algorithms for monotone linear complementarity problems assumes that the problem is nondegenerate, that is, the solution set contains a strictly complementary solution. We investigate the behavior of these algorithms when this assumption is removed.The work of this author was based on research supported by the National Science Foundation under grant DDM-9109404 and the Office of Naval Research under grant N00014-93-1-0234.The work of this author was based on research supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

Some minimax principles and their applications in nonlinear elliptic equations

Sans résumé Supported in part by NSF grant MCS-77-18723 (02). The results of this paper were obtained while the author was partially supported by U. S. Army Research Office grant No. DAA-29-78-6-0127 at Courant Institute, New York University.     

Convergence of Bieberbach polynomials in domains with interior cusps

We extend the results on the uniform convergence of Bieberbach polynomials for domains with certain interior zero angles (outward pointing cusps) and show that they play a special role in the problem. Namely, we construct a Keldysh-type example on the divergence of Bieberbach polynomials at an outward pointing cusp and discuss thecritical order of tangency at this interior zero angle, separating the convergent behavior of Bieberbach polynomials from the divergent one for sufficiently thin cusps. Research of both authors was supported in part by the National Science Foundation grant DMS-9707359. Research of the second author was also supported in part by the National Science Foundation grant DMS-9970659.     

On the spectra of sums of orthogonal projections with applications to parallel computing

Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while the convergence of a related sequential method is determined by the spectrum of the product of complementary projections. We study spectral properties of sums of orthogonal projections and in the case of two projections, characterize the spectrum of the sum completely in terms of the spectrum of the product.This work was supported in part by the Norwegian Research Council for Science and the Humanities under grant D.01.08.054 and by The Royal Norwegian Council for Scientific and Industrial Research under grant IT2.28.28484; also supported in part by the Air Force Office of Scientific Research under grant AFOSR-86-0126 and by the National Science Foundation under grant DMS-8704169.     

Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints

Using the theory of exact penalization for mathematical programs with subanalytic constraints, the theory of error bounds for quadratic inequality systems, and the theory of parametric normal equations, we derive various exact penalty functions for mathematical programs subject to equilibrium constraints, and we also characterize stationary points of these programs. The research of this author is based on work supported by the National Sciences and Engineering Research Council of Canada under grant OPG0090391. The research of this author is based on work supported by the National Science Foundation under grants DDM-9104078 and CCR-9213739. Part of this paper was completed while he was visiting The University of Melbourne and The University of New South Wales. The research of this author is based on work supported by the Australian Research Council.     

CD(4) has bounded width

We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves a previous result by Kiss and Valeriote and presents some evidence that the Larose–Zádori conjecture holds in the congruence-distributive case. The first author was supported by EPSRC grant EP/C54384X/1. The second author was supported by the MEC under grant TIN 2006-15387-C03-03, the EU PASCAL Network of Excellence IST-2002-506778, and the MODNET Marie Curie Research Training Network MRTN-CT-2004-512234. The third author was supported by grant no. 144011G of the Ministry of Science and Environment of Serbia. The fourth author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA), grant nos. T 48809 and K 60148.     

Chains of Modular Elements and Lattice Connectivity

We show that the order complex of any finite lattice with a chain of modular elements is at least (r−2)-connected. The first author was supported during part of this work by a postdoctoral fellowship from the Mathematical Sciences Research Institute. The second author was supported by NSF grant DMS-0300483.