Sciweavers

793 search results - page 1 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ISSAC
2005
Springer
71views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Efficient computation of the characteristic polynomial
Jean-Guillaume Dumas, Clément Pernet, Zhend...
SIAMMAX
2011
180views more  SIAMMAX 2011»
13 years 2 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
CORR
2006
Springer
69views Education» more  CORR 2006»
13 years 7 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 9 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
14 years 2 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...