Newton Identities for Weierstrass Products

نویسنده

  • Florian Breuer
چکیده

We prove a generalization of the Newton Identities for entire functions, which give a relation between the Taylor coefficients and sums of powers of reciprocals of the zeros of an entire function. We apply these identities to a number of special functions, yielding some interesting recursion relations. By the Weierstrass Product Theorem, any entire function f : C → C can be written as a normally convergent product f(z) = ez ∏ n≥1 [( 1− z rn ) exp ( z rn + 1 2 ( z rn )2 + · · ·+ 1 kn ( z rn )kn)] , (1) where g is an entire function, (rn)n≥1 is the finite or infinite (or empty) sequence of non-zero complex roots of f , m ∈ Z≥0 is the order of vanishing of f at 0, and kn ∈ Z≥0 for each n. This, and the special functions considered below, can be found, for example, in [1]. The normal convergence of (1) in C is equivalent to the absolute convergence of the sums Sk := ∑ n≥1, kn<k r−k n , for k = 1, 2, 3, . . . . The logarithmic derivative of (1) is f ′(z) f(z) = d dz log f(z) = d dz g(z) +m log z +∑ n≥1 ( log ( 1− z rn ) + z rn + 1 2 ( z rn )2 + · · ·+ 1 kn ( z rn )kn) = g′(z) + m z + ∑ n≥1 − 1 rn  1 1− ( z rn ) + 1 rn + z r2 n + · · ·+ z kn−1 rn n  = g′(z) + m z + ∑ n≥1 [ − ( 1 rn + z r2 n + z r3 n + · · · ) + 1 rn + z r2 n + · · ·+ z kn−1 rn n ] = g′(z) + m z − ∑ n≥1 [ zn rn n + zn rn n + · · · ]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inequalities for Weierstrass Products

The aim of this note is to find new inequalities for the Weierstrass products n ∏

متن کامل

Generalized Cayley-Hamilton-Newton identities

The q-generalizations of the two fundamental statements of matrix algebra – the Cayley-Hamilton theorem and the Newton relations – to the cases of quantum matrix algebras of an ”RTT-” and of a ”Reflection equation” types have been obtained in [2]–[6]. We construct a family of matrix identities which we call Cayley-HamiltonNewton identities and which underlie the characteristic identity as well ...

متن کامل

Over-constrained Weierstrass iteration and the nearest consistent system

We propose a generalization of the Weierstrass iteration for over-constrained systems of equations and we prove that the proposed method is the Gauss-Newton iteration to find the nearest system which has at least k common roots and which is obtained via a perturbation of prescribed structure. In the univariate case we show the connection of our method to the optimization problem formulated by K...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

Nearest multivariate system with given root multiplicities

We present a symbolic-numeric technique to find the closest multivariate polynomial system to a given one which has roots with prescribed multiplicity structure. Our method generalizes the “Weierstrass iteration”, defined by Ruatta, to the case when the input system is not exact, i.e. when it is near to a system with multiple roots, but itself might not have multiple roots. First, using interpo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 119  شماره 

صفحات  -

تاریخ انتشار 2012