In this paper we apply simple GMRES bounds to the nearly singular systems that arise in ill-posed problems. Our bounds depend on the eigenvalues of the coefficient matrix, the right-hand side vector and the nonnormality of the system. The bounds show that GMRES residuals initially decrease, as residual components associated with large eigenvalues are reduced, after which semi-convergence can be...

a function is said to be bi-univalent on the open unit disk d if both the function and its inverse are univalent in d. not much is known about the behavior of the classes of bi-univalent functions let alone about their coefficients. in this paper we use the faber polynomial expansions to find coefficient estimates for four well-known classes of bi-univalent functions which are defined by subord...

Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. Only in the recent past has any work been done on deriving conditions for filter stability, convergence rate, and steady state error for the Partial Update LMS algorithm. In [5] approximate bounds were derived on the step size param...

Partial updating of LMS filter coefficients is an effective method for reducing the computational load and the power consumption in adaptive filter implementations. Only in the recent past has any work been done on deriving conditions for filter stability, convergence rate, and steady state error for the Partial Update LMS algorithm. In [5] approximate bounds were derived on the step size param...

We study the number of vertices which must be removed from a graph in order to make it planar or series-parallel. We give improved upper bounds on the number of vertices required to planarize graphs of bounded average degree d, and for small d also an improved bound for series-parallelization. The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need ...

We prove lower bounds of order n logn for both the problem of multiplying polynomials of degree n, and of dividing polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the li...

In terms of Wright generalized hypergeometric function we define a class of analytic functions. The class generalize well known classes of k-starlike functions and k-uniformly convex functions. Necessary and sufficient coefficient bounds are given for functions in this class. Further distortion bounds, extreme points and results on partial sums are investigated.

A comprehensive class of complex-valued harmonic prestarlike univalent functions is introduced. Necessary and sufficient coefficient bounds are given for functions in this class to be starlike. Distortion bounds and extreme points are also obtained. 2000 Mathematics Subject Classification:Primary 30C45, 30C50.

Three sources of variation in experimental results for a test are distinguished: trials, persons, and items. Unreliability is defined only in terms of variation over trials. This definition leads to a more complet~ analysis than does the conventional one; Spearman’s contention is verified that the conventional approach--which was formulated by Yule--introduces unnecessary hypotheses. It is emph...