On the computation of characteristic polynomial coefficients

Several algorithms for computing the exact values of characteristic polynomial coefficients is considered for the case of large-scale matrices. Some recommendations on using these algorithms according to matrix sizes are given. The parallel implementation of the algorithms is discussed. A number of experimental results obtained on a computing cluster are presented.