Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.     

Some new nonlinear inequalities and applications to boundary value problems

In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.     

Existence of solutions on weak vector equilibrium problems

Weak vector equilibrium problems with bi-variable mappings from product space of two bounded complete locally convex Hausdorff topological vector spaces to another topological vector space are studied. The existence theorems of solutions are proved by the FKKM fixed point theorem. Viscosity principle of vector equilibrium problems is dealt with. The relations between solutions of the vector equilibrium problem and those of its perturbation problem are presented.     

Noncommuting selfmaps and invariant approximations

Common fixed-point results are established for a new class of noncommuting selfmaps. We apply them to obtain several invariant approximation results which unify, extend, and complement well-known results.     

On a Formula for the Kostka Numbers

From Kostant’s multiplicity formula for general linear groups, one can derive a formula for the Kostka numbers. In this note we give a combinatorial proof of this formula. Received January 7, 2005     

Asymptotic expansions in sequential estimation for the first-order random coefficient autoregressive model: Regenerative approach

Edgeworth expansions for the distribution of a sequential least squares estimator in the random coefficient autoregressive (RCA) model are derived. The regenerative approach to second-order asymptotic analysis of Markov-type statistical models is developed.     

Extended non-abelian gauge symmetries in the classical WZNW model

Higher spin extensions of the non-Abelian gauge symmetries for the classical WZNW model are considered. Both linear and nonlinear realizations of the extended affine Kac-Moody algebra are obtained. It is a characteristic property of the WZNW model that it admits a higher spin linear realization of the extended affine Kac-Moody algebra which is equivalent to the corresponding higher spin nonlinear realization of the same algebra. However, in both cases, the higher spin Noether currents do not span an invariant space with respect to their generating transformations. Here, the current space is extended to an invariant space which allows us to gauge the symmetry.Supported by Bulgarian Foundation on Fundamental Research under contract Ph-318/93-95.     

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.     

Properties of holomorphic Wiener functions —skeleton,contraction, and local Taylor expansion

Summary We show that each holomorphic Wiener function has a skeleton which is intrinsic from several viewpoints. In particular, we study the topological aspects of the skeletons by using the local Taylor expansion for holomorphic Wiener functions.Supported in part by the Grant-in-Aid for Science Research 03740120 Min. Education     

Finite-gap Solutions of the Fuchsian Equations

We find a new class of Fuchsian equations, with algebro-geometric solutions associated to a hyperelliptic curve. A method for calculating its arithmetic genus and branching points is suggested. Numerous examples are given.