For the extremal problem: E„r(a):= min||exp(-W«)(x-+ ■■■)\\L„ a > 0, where U (0 < r < oo) denotes the usual integral norm over R, and the minimum is taken over all monic polynomials of degree n, we describe the asymptotic form of the error E„ r(a) (as n -» oo) as well as the limiting distribution of the zeros of the corresponding extremal polynomials. The case r = 2 yields new information regar...

Let Ψn be a product of n independent, identically distributed random matrices M , with the properties that Ψn is bounded in n, and that M has a deterministic (constant) invariant vector. Assuming that the probability of M having only the simple eigenvalue 1 on the unit circle does not vanish, we show that Ψn is the sum of a fluctuating and a decaying process. The latter converges to zero almost...

Absfrac-The following problem arises in many applications involving classification, identification, and inference. There is a set of objects X, and a particular x E X is chosen (unknown to us). Based on information obtained about x in a sequential manner, we wish to decide whether x belongs to one class of objects A , or a different class of objects A, . We study a general paradigm applicable t...

this paper presents a rational haar wavelet operational method for solving the inverse laplace transform problemand improves inherent errors from irrational haar wavelet. the approach is thus straightforward, rather simple andsuitable for computer programming. we define that $p$ is the operational matrix for integration of the orthogonalhaar wavelet. simultaneously, simplify the formulaes of li...

abstract. the main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. properties of the legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. afterwards, an iterative algorithm is examined for solvin...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...

the current paper contributes a novel framework for solving a class of linear matrix differential equations. to do so, the operational matrix of the derivative based on the shifted bernoulli polynomials together with the collocation method are exploited to reduce the main problem to system of linear matrix equations. an error estimation of presented method is provided. numerical experiments are...

in today’s highly competitive manufacturing environment, an effective supplier selection process is very important for the success of any business organization. selection of the best supplier is always a difficult task for the purchasing manager. suppliers have varied strengths and weaknesses which require careful assessment by the purchasing manager before selecting and ranking them. any suppl...

this paper presents an auto redundant technique for analysis of grid with curved members.this technique is based on the force method, but in the technique choice of the redundant iscompletely eliminated. the analysis technique is found very effective, accurate andprogrammable. a comprehensive c++ program has been developed to compute internalforces at the end of each member of the grid for diff...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...