Sciweavers

42 search results - page 1 / 9
» Computing Characteristic Polynomials from Eigenvalues
Sort
View
SIAMMAX
2011
180views more  SIAMMAX 2011»
12 years 12 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
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
13 years 11 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
SIAMCO
2000
99views more  SIAMCO 2000»
13 years 4 months ago
Spectral Analysis of Fokker--Planck and Related Operators Arising From Linear Stochastic Differential Equations
We study spectral properties of certain families of linear second-order differential operators arising from linear stochastic differential equations. We construct a basis in the Hi...
Daniel Liberzon, Roger W. Brockett
MOC
1998
85views more  MOC 1998»
13 years 4 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe