نتایج جستجو برای: simple zeros

تعداد نتایج: 465239  

Journal: :Kybernetika 1991
Michel Fliess

This paper should be read in conjunction with [8], where basic structural properties, such as controllability, observability and state-variable representation, of constant or time-varying generalized linear systems were examined in the context of module theory. Our aim here is to illustrate this approach by giving a simple and transparent definition of hidden modes, poles and zeros of constant ...

2009
IGOR E. PRITSKER

Schur studied limits of the arithmetic means An of zeros for polynomials of degree n with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that lim supn→∞ |An| ≤ 1 − √ e/2. We show that An → 0, and estimate the rate of convergence by generalizing the Erdős-Turán theorem on the distribution of zeros. As an application, we show t...

2002
M R Dennis

Comparison is made between the distribution of saddle points in the chaotic analytic function and in the characteristic polynomials of the Ginibre ensemble. Realising the logarithmic derivative of these infinite polynomials as the electric field of a distribution of coulombic charges at the zeros, a simple mean-field electrostatic argument shows that the density of saddles minus zeros falls off...

1999
Dr. G. J. Rieger

We investigate the distribution of simple zeros of the Riemann zeta-function. Let H ≤ T and L = log T . We calculate in a new way (following old ideas of Atkinson and new ideas of Jutila and Motohashi) the mean square of the product of F (s) = ζ(s) + 1 Lζ ′(s) and a certain Dirichlet polynomial A(s) = ∑ n≤M a(n) ns of length M = T θ with θ < 38 near the critical line: if R is a positive constan...

Journal: :Computers & Mathematics with Applications 2008
Stef Graillat

In the paper, we examine the local behavior of Newton’s method in floating point arithmetic for the computation of a simple zero of a polynomial assuming that an good initial approximation is available. We allow an extended precision (twice the working precision) in the computation of the residual. We prove that, for a sufficient number of iterations, the zero is as accurate as if computed in t...

2004
Jerzy Tokarzewski

In standard MIMO LTI continuous-time systems S(A,B,C) the classical notion of the Smith zeros does not characterize fully the output-zeroing problem nor the zero dynamics. The question how this notion can be extended and related to the state-space methods is discussed. Nothing is assumed about the relationship of the number of inputs to the number of outputs nor about the normal rank of the und...

2004
Jerzy Tokarzewski Lech Sokalski

In standard MIMO LTI continuous-time systems S(A,B,C) the classical notion of the Smith zeros does not characterize fully the output-zeroing problem nor the zero dynamics. The question how this notion can be extended and related to the state-space methods is discussed. Nothing is assumed about the relationship of the number of inputs to the number of outputs nor about the normal rank of the und...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید