Conjugate-gradient method for computing the Moore-Penrose inverse and rank of a matrix

A conjugate-gradient method is developed for computing the Moore-Penrose generalized inverseA of a matrix and the associated projectors, by using the least-square characteristics of both the method and the inverseA . Two dual algorithms are introduced for computing the least-square and the minimum-norm generalized inverses, as well asA . It is shown that (i) these algorithms converge for any starting approximation; (ii) if they are started from the zero matrix, they converge toA ; and (iii) the trace of a sequence of approximations multiplied byA is a monotone increasing function converging to the rank ofA. A practical way of compensating the self-correcting feature in the computation ofA is devised by using the duality of the algorithms. Comparison with Ben-Israel's method is made through numerical examples. The conjugate-gradient method has an advantage over Ben-Israel's method.After having completed the present paper, the author received from Professor M. R. Hestenes his paper entitledPseudo Inverses and Conjugate Gradients. This paper treated the same subject and appeared in Communications of the ACM, Vol. 18, pp. 40–43, 1975.     

Immersions with fractal set of points of zero Gauss-Kronecker curvature

We construct, for any good Cantor set F of S ^n-1, an immersion of the sphere S ⁿ with set of points of zero Gauss-Kronecker curvature equal to F × D ¹, where D ¹ is the 1-dimensional disk. In particular these examples show that the theorem of Matheus-Oliveira strictly extends two results by do Carmo-Elbert and Barbosa-Fukuoka-Mercuri.To professor João Lucas Barbosa, in occasion of his 60th birthday. Supported by CNPq/Brazil. Supported by Faperj/Brazil.     

Helicoidal surfaces under the cubic screw motion in Minkowski 3-space

In this paper, we construct helicoidal surfaces under the cubic screw motion with prescribed mean or Gauss curvature in Minkowski 3-space . We also find explicitly the relation between the mean curvature and Gauss curvature of them. Furthermore, we discuss helicoidal surfaces under the cubic screw motion with H²=K and prove that these surfaces have equal constant principal curvatures.     

Prescribed Mean Curvature Hypersurfaces in Hn+1(-1) with Convex Planar Boundary, I

We study immersed prescribed mean curvature compact hypersurfaces with boundary in Hⁿ⁺¹(-1). When the boundary is a convex planar smooth manifold with all principal curvatures greater than 1, we solve a nonparametric Dirichlet problem and use this, together with a general flux formula, to prove a parametric uniqueness result, in the class of all immersed compact hypersurfaces with the same boundary. We specialize this result to a constant mean curvature, obtaining a characterization of totally umbilic hypersurface caps.     

Flatness of Gaussian curvature and area of ideal triangles

Let M be aC ^k ,k 4, compact surface of genus greater than two whose curvature is negative in all points but along a simple closed geodesic (t) where the curvature is zero at every point. We show that the area of ideal triangles having a lifting of as an edge is infinite. This provides a family of surfaces having ideal triangles of infinite area whose geodesic flows are equivalent to Anosov flows, in contrast with the well-known examples of surfaces with flat strips which also have ideal triangles of infinite area. By the CAT-comparison theory we can deduce, using these surfaces as models, that aC compact surface of non-positive curvature having one geodesic along which the curvature is zero has ideal triangles of infinite area.Partially supported by CNPq of Brazilian Government     

Regular Resolution Lower Bounds For The Weak Pigeonhole Principle

We prove that any regular resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length , (for some global constant > 0).* Research supported by NSF grant CCR-9820831, US-Israel BSF grant 98-00349, and an NSERC grant. Research supported by US-Israel BSF grant 98-00349, and NSF grant CCR-9987077.     

The circle problem on surfaces of variable negative curvature

In this note we study the problem of orbit counting for certain groups of isometries of simply connected surfaces with possibly variable negative curvature. We show that ifN(t) denotes the orbit counting function for a convex co-compact group of isometries then for some constantsC, h>0,N(t) Ce ^ht , ast +.     

Invariant surfaces in the homogeneous space Sol with constant curvature

A surface in homogeneous space is said to be an invariant surface if it is invariant under some of the two 1‐parameter groups of isometries of the ambient space whose fix point sets are totally geodesic surfaces. In this work we study invariant surfaces that satisfy a certain condition on their curvatures. We classify invariant surfaces with constant mean curvature and constant Gaussian curvature. Also, we characterize invariant surfaces that satisfy a linear Weingarten relation.     

On the Value of a Random Minimum Weight Steiner Tree

Consider a complete graph on n vertices with edge weights chosen randomly and independently from an exponential distribution with parameter 1. Fix k vertices and consider the minimum weight Steiner tree which contains these vertices. We prove that with high probability the weight of this tree is (1+o(1))(k-1)(log n-log k)/n when k =o(n) and n.* Research supported in part by NSF grant DSM9971788 Research supported in part by NSF grants DMS-0106589, CCR-9987845 and by the State of New Jersey. Part of this research was done while visiting IBM T. J. Watson Research Center.     

Multi-valued graphs in embedded constant mean curvature disks

In this paper we prove that an embedded constant mean curvature disk with Gaussian curvature large at a point contains a multi-valued graph around that point on the scale of . This generalizes Colding and Minicozzi's result for minimal surfaces.

     

Minimal boundaries enclosing a given volume

We prove some facts concerning surfaces of minimal area bounding regions of prescribed volume in ⁿ. The main result we prove is that the mean curvature of such a surface is constant, if possibly a discontinuous function of the enclosed volume. The boundary behaviour of the solutions is also discussed.     

A density function and the structure of singularities of the mean curvature flow

We study singularity formation in the mean curvature flow of smooth, compact, embedded hypersurfaces of non-negative mean curvature in ⁿ⁺¹, primarily in the boundaryless setting. We concentrate on the so-called Type I case, studied by Huisken in [Hu 90], and extend and refine his results. In particular, we show that a certain restriction on the singular points covered by his analysis may be removed, and also establish results relating to the uniqueness of limit rescalings about singular points, and to the existence of slow-forming singularities of the flow.The main new ingredient introduced, to address these issues, is a certain density function, analogous to the usual density function in the study of harmonic maps in the stationary setting. The definition of this function is based on Huisken's important monotonicity formula for mean curvature flow.     

Plateau's problem for surfaces of prescribed mean curvature in given regions

Plateau's problem for surfaces of prescribed mean curvature will be considered in regions which are not necessarily H-convex.     

Hypersurfaces with constant mean curvature in hyperbolic space form

In this article, we prove the following theorem: A complete hypersurface of the hyperbolic space form, which has constant mean curvature and non-negative Ricci curvature Q, has non-negative sectional curvature. Moreover, if it is compact, it is a geodesic distance sphere; if its soul is not reduced to a point, it is a geodesic hypercylinder; if its soul is reduced to a point p, its curvature satisfies Q<, and the geodesic spheres centered at p are convex, then it is a horosphere.A part of this work has been done when the second author visited Université Claude Bernard Lyon 1, and was supported by a grant of the People's Republic of China.     

Isoperimetric Invariants For Product Markov Chains and Graph Products

Bounds on some isoperimetric constants of the Cartesian product of Markov chains are obtained in terms of related isoperimetric quantities of the individual chains.* Research supported in part by NSF Grants. Research supported by NSF Grant No. CCR-9503952 and DMS-9800351.     

Recognizing Berge Graphs

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|⁹). This is independent of the recent proof of the strong perfect graph conjecture.* Currently this author is a Clay Mathematics Institute Research Fellow.** Supported by NSF grant DMI-0352885 and ONR grant N00014-97-1-0196. Supported by ONR grant N00014-01-1-0608, and NSF grant DMS-0070912. Supported by EPSRC grant GR/R35629/01.     

Sharp Concentration of the Number of Submaps in Random Planar Triangulations

We show that the maximum vertex degree in a random 3-connected planar triangulation is concentrated in an interval of almost constant width. This is a slightly weaker type of result than our earlier determination of the limiting distribution of the maximum vertex degree in random planar maps and in random triangulations of a (convex) polygon. We also derive sharp concentration results on the number of vertices of given degree in random planar maps of all three types. Some sharp concentration results about general submaps in 3-connected triangulations are also given.* Research supported by NSERC and Australian Research Council Research supported by the Australian Research Council     

Mappings of Ruled Surfaces in Simply Isotropic Space <Emphasis Type="Italic">I</Emphasis><Subscript>3</Subscript><Superscript>1</Superscript> that Preserve the Generators

In this paper we study some mappings of skew ruled surfaces in simply isotropic space which preserve the generators. We study isometries, conformal mappings and mappings which preserve the area. Furthermore, we study mappings of surfaces in I ₃ ¹ which preserve the asymptotic lines.Received December 18, 2001; in revised form July 12, 2002 Published online April 4, 2003     

The numerical solution of fractional differential equations: Speed versus accuracy

This paper is concerned with the development of efficient algorithms for the approximate solution of fractional differential equations of the form D y(t)=f(t,y(t)), R ⁺–N.()We briefly review standard numerical techniques for the solution of () and we consider how the computational cost may be reduced by taking into account the structure of the calculations to be undertaken. We analyse the fixed memory principle and present an alternative nested mesh variant that gives a good approximation to the true solution at reasonable computational cost. We conclude with some numerical examples.