Partitioning multi-edge graphs

We introduce a new kind of graph called multi-edge graph which arises in many applications such as finite state Markov chains and broadcasting communication networks. A cluster in such a graph is a set of nodes such that for any ordered pair of nodes, there is a path of multi-edges from one to the other such that these edges remain within the same set. We give two algorithms to partition a multi-edge graph into maximal clusters. Both these algorithms are based on the depth-first search algorithm to find strongly connected components of the directed graph. We also discuss some applications of clustering in multi-edge graphs.     

Comparison theorems for weak splittings of bounded operators

Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502     

Parallel and superfast algorithms for Hankel systems of equations

Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n ²) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log² n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).     

Hölder exponents and box dimension for self-affine fractal functions

We consider some self-affine fractal functions previously studied by Barnsleyet al. The graphs of these functions are invariant under certain affine scalings, and we extend their definition to allow the use of nonlinear scalings. The Hölder exponent,h, for these fractal functions is calculated and we show that there is a larger Hölder exponent,h , defined at almost every point (with respect to Lebesgue measure). For a class of such functions defined using linear affinities these exponents are related to the box dimensionD _B of the graph byh2–D _Bh .Communicated by Michael F. Barnsley.     

A fast ‘Monte-Carlo cross-validation’ procedure for large least squares problems with noisy data

Summary We propose a fast Monte-Carlo algorithm for calculating reliable estimates of the trace of the influence matrixA involved in regularization of linear equations or data smoothing problems, where is the regularization or smoothing parameter. This general algorithm is simply as follows: i) generaten pseudo-random valuesw ₁, ...,w _n , from the standard normal distribution (wheren is the number of data points) and letw=(w ₁, ...,w _n ) ^T , ii) compute the residual vectorw–A w, iii) take the normalized inner-product (w ^T (w–A w))/(w ^T w) as an approximation to (1/n)tr(I–A ). We show, both by theoretical bounds and by numerical simulations on some typical problems, that the expected relative precision of these estimates is very good whenn is large enough, and that they can be used in practice for the minimization with respect to of the well known Generalized Cross-Validation (GCV) function. This permits the use of the GCV method for choosing in any particular large-scale application, with only a similar amount of work as the standard residual method. Numerical applications of this procedure to optimal spline smoothing in one or two dimensions show its efficiency.     

Symmetries and conservation laws of Kadomtsev-Pogutse equations

Kadomtsev-Pogutse equations are of great interest from the viewpoint of the theory of symmetries and conservation laws and, in particular, enable us to demonstrate their potentials in action. This paper presents, firstly, the results of computations of symmetries and conservation laws for these equations and the methods of obtaining these results. Apparently, all the local symmetries and conservation laws admitted by the considered equations are exhausted by those enumerated in this paper. Secondly, we point out some reductions of Kadomtsev-Pogutse equations to more simpler forms which have less independent variables and which, in some cases, allow us to construct exact solutions. Finally, the technique of solution deformation by symmetries and their physical interpretation are demonstrated.     

On the solution of singular linear systems of algebraic equations by semiiterative methods

Summary For a square matrixT ^n,n , where (I–T) is possibly singular, we investigate the solution of the linear fixed point problemx=T x+c by applying semiiterative methods (SIM's) to the basic iterationx ₀ ⁿ ,x _k T c _k–1+c(k1). Such problems arise if one splits the coefficient matrix of a linear systemA x=b of algebraic equations according toA=M–N (M nonsingular) which leads tox=M ^–1 N x+M ^–1 bT x+c. Even ifx=T x+c is consistent there are cases where the basic iteration fails to converge, namely ifT possesses eigenvalues 1 with ||1, or if =1 is an eigenvalue ofT with nonlinear elementary divisors. In these cases — and also ifx=T x+c is incompatible — we derive necessary and sufficient conditions implying that a SIM tends to a vector which can be described in terms of the Drazin inverse of (I–T). We further give conditions under which is a solution or a least squares solution of (I–T)x=c.Research supported in part by the Alexander von Humboldt-Stiftung     

The many limits of mixed means

The sequences introduced by Carlson (1971) are variants of the Gauss arithmetic geometric sequences (which have been elegantly discussed by D. A. Cox (1984, 1985)). Given (complex)a ₀,b ₀ we define

Differential form methods in the theory of variational systems and Lagrangian field theories

This paper will attempt to unify diverse material from physics and engineering in terms of differential forms on manifolds. A variational system will be defined by means of a scalar-valued differential form on a manifold and an ideal in the Grassmann algebra of differential forms on that manifold to serve as constraints. Two types of extremal submanifolds will be defined. The first-called the Euler-Lagrange extremals-will be defined by a method that is the generalization of the classical methods in the calculus of variations. The second—a generalization of a method used by Cartan in his treatise Leçons sur les invariants intégraux-will define extremals as integral submanifolds of an exterior differential system invariently attached to the variational system. As examples, the variational systems attached to string theories in Riemannian manifolds and Yang-Mills fields will be discussed from this differential form point of view. Finally, as application, the differential geometric properties and definition of energy will be presented from the differential form point of view.This work was supported by a grant from the Applied Mathematics program of the National Science Foundation.     

Normal subgroups and elementary theories of lattice-ordered groups

We show that any lattice-ordered group (l-group) G can be l-embedded into continuously many l-groups H _i which are pairwise elementarily inequivalent both as groups and as lattices with constant e. Our groups H _i can be distinguished by group-theoretical first-order properties which are induced by lattice-theoretically nice properties of their normal subgroup lattices. Moreover, they can be taken to be 2-transitive automorphism groups A(S _i ) of infinite linearly ordered sets (S _i , ) such that each group A(S _i ) has only inner automorphisms. We also show that any countable l-group G can be l-embedded into a countable l-group H whose normal subgroup lattice is isomorphic to the lattice of all ideals of the countable dense Boolean algebra B.