An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix

ISSN： 0021-9991

Source： Journal of Computational Physics, Vol.140, Iss.2, 1998-03, pp. : 453-458

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I

By Chistov A.

Journal of Mathematical Sciences, Vol. 131, Iss. 2, 2005-11 ,pp. : 5547-5568

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. II

By Chistov A.

Journal of Mathematical Sciences, Vol. 138, Iss. 3, 2006-10 ,pp. : 5733-5752

Springer Publishing Company

Access to resources Recommend Favorite

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

By Arimura Hiroki Uno Takeaki

Journal of Combinatorial Optimization, Vol. 13, Iss. 3, 2007-04 ,pp. : 243-262

Springer Publishing Company

Access to resources Recommend Favorite

General algorithm of computation of c -table and detection of valleys

By Gilewicz J. Pindor M.

Ukrainian Mathematical Journal, Vol. 62, Iss. 6, 2010-12 ,pp. : 882-893

Springer Publishing Company

Access to resources Recommend Favorite

An efficient and tunable matrix‐disguising method toward privacy‐preserving computation

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 17, 2015-11 ,pp. : 3099-3110

John Wiley & Sons Inc

Access to resources Recommend Favorite