Leverrier-Takeno Coefficients for the Characteristic Polynomial of a Matrix

نویسندگان
چکیده

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

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

منابع مشابه

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

On the Coefficients of the Laplacian Characteristic Polynomial of Trees

k=0 (−1)n−k ck(T ) λk . Then, as well known, c0(T ) = 0 and c1(T ) = n . If T differs from the star (Sn) and the path (Pn), which requires n ≥ 5 , then c2(Sn) < c2(T ) < c2(Pn) and c3(Sn) < c3(T ) < c3(Pn) . If n = 4 , then c3(Sn) = c3(Pn) . AMS Mathematics Subject Classification (2000): 05C05, 05C12, 05C50

متن کامل

The CHACM Method for Computing the Characteristic Polynomial of a Polynomial Matrix

This paper presents an efficient algorithm for computing the characteristic polynomial of a matrix, which utilizes Cayley-Hamilton’s theorem. The algorithm requires no condition on input matrix and can be performed only with basic matrix operations except only one computation of inverse of constant matrix. Though the algorithm can be applied to a constant matrix, it is the most effective when a...

متن کامل

Some Properties of the Characteristic Polynomial of a Nonnegative Matrix*

In this paper, we extend and generalize some of the well known spectral properties of a nonnegative matrix by establishing analogous properties for the zeros of derivatives of the characteristic polynomial of such a matrix.

متن کامل

On the Characteristic Polynomial of a Random Unitary Matrix

We present a range of fluctuation and large deviations results for the logarithm of the characteristic polynomial Z of a random N ×N unitary matrix, as N → ∞. First we show that lnZ/ √ 1 2 lnN , evaluated at a finite set of distinct points, is asymptotically a collection of i.i.d. complex normal random variables. This leads to a refinement of a recent central limit theorem due to Keating and Sn...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of the Institute of Engineering

سال: 1970

ISSN: 1810-3383

DOI: 10.3126/jie.v8i1-2.5118