Well posed cauchy problems for complex nonlinear equations must be semilinear

The first author was supported in part by CNPq     

Limits of parallelism in explicit ODE methods

Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois.     

A remark on compact matrix quantum groups

A simpler set of axioms of the theory of compact matrix quantum groups (pseudogroups) is found.Supported by Japan Society for Promoting Science. On leave from the Department of Mathematical Methods in Physics, Faculty of Physics, University of Warsaw, Hoa 74, 00-682 Warsaw, Poland.     

Estimating the matrixp-norm

Summary The Hölderp-norm of anm×n matrix has no explicit representation unlessp=1,2 or . It is shown here that thep-norm can be estimated reliably inO(mn) operations. A generalization of the power method is used, with a starting vector determined by a technique with a condition estimation flavour. The algorithm nearly always computes ap-norm estimate correct to the specified accuracy, and the estimate is always within a factorn ^1–1/p of A _p . As a by-product, a new way is obtained to estimate the 2-norm of a rectangular matrix; this method is more general and produces better estimates in practice than a similar technique of Cline, Conn and Van Loan.     

Convex hull of powers of a complex number,trinomial equations and the Farey sequence

The color of a complex number is defined as the number of vertices of the convex hull of powers of that number. This induces a coloring of the unit disk. The structure of the set of points where the color changes is investigated here. It is observed that there is a connection between this fractal set and some family of trinomial equations. Three algorithms for coloring the unit disk are described, the last one (related to the Farey sequence) arising out of a conjecture. This conjecture is formulated and proved in this presentation.     

A non-linear version of Hunt-Lion's theorem from the point of view of T-accretivity

In the classical topological context, Dellacherie [10] has given a non-linear version of Hunt's theorem characterizing the proper kernels verifying the complete maximum principle as those closing a submarkovian resolvent. In this paper we study the relation between this non-linear version of Hunt's theorem and T-accretivity.     

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008     

Evaluating the Frechet derivative of the matrix exponential

LetM _n denote the space ofn×n matrices. GivenX, ZM _n define

Existence of generic homoclinic tangencies for henon mappings

It is an open question whether there is a strange attractor for the Henon mapping. We show that for certain maps close to the Henon map there are strange attractors.