Geodesic
On the computation of characteristic polynomial coefficients
Numerical methods and programming, Tome 9 (2008) no. 3, pp. 366-370 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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.
Keywords: computation of characteristic polynomial, computational complexity, parallel algorithms. 
@article{VMP_2008_9_3_a15,
     author = {O. N. Pereslavtseva},
     title = {On the computation of characteristic polynomial coefficients},
     journal = {Numerical methods and programming},
     pages = {366--370},
     year = {2008},
     volume = {9},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2008_9_3_a15/}
}
TY  - JOUR
AU  - O. N. Pereslavtseva
TI  - On the computation of characteristic polynomial coefficients
JO  - Numerical methods and programming
PY  - 2008
SP  - 366
EP  - 370
VL  - 9
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VMP_2008_9_3_a15/
LA  - ru
ID  - VMP_2008_9_3_a15
ER  - 
%0 Journal Article
%A O. N. Pereslavtseva
%T On the computation of characteristic polynomial coefficients
%J Numerical methods and programming
%D 2008
%P 366-370
%V 9
%N 3
%U http://geodesic.mathdoc.fr/item/VMP_2008_9_3_a15/
%G ru
%F VMP_2008_9_3_a15
O. N. Pereslavtseva. On the computation of characteristic polynomial coefficients. Numerical methods and programming, Tome 9 (2008) no. 3, pp. 366-370. http://geodesic.mathdoc.fr/item/VMP_2008_9_3_a15/