Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Num. Meth. Prog., 2008, Volume 9, Issue 3, Pages 366–370 (Mi vmp447)  

Вычислительные методы и приложения

On the computation of characteristic polynomial coefficients

O. N. Pereslavtseva

Tambov State University named after G.R. Derzhavin

Abstract: 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.

Full text: PDF file (194 kB)
UDC: 512.643

Citation: O. N. Pereslavtseva, “On the computation of characteristic polynomial coefficients”, Num. Meth. Prog., 9:3 (2008), 366–370

Citation in format AMSBIB
\Bibitem{Per08}
\by O.~N.~Pereslavtseva
\paper On the computation of characteristic polynomial coefficients
\jour Num. Meth. Prog.
\yr 2008
\vol 9
\issue 3
\pages 366--370
\mathnet{http://mi.mathnet.ru/vmp447}


Linking options:
  • http://mi.mathnet.ru/eng/vmp447
  • http://mi.mathnet.ru/eng/vmp/v9/i3/p366

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Numerical methods and programming
    Number of views:
    This page:42
    Full text:21

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022