Sciweavers

394 search results - page 7 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
14 years 9 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 2 months ago
Balanced state-space representations: a polynomial algebraic approach
Abstract— We show how to compute a minimal Riccatibalanced state map and a minimal Riccati-balanced state space representation starting from an image representation of a strictly...
Paolo Rapisarda, Harry L. Trentelman
80
Voted
ITA
2002
14 years 9 months ago
On multiplicatively dependent linear numeration systems, and periodic points
Abstract. Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively...
Christiane Frougny
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
HYBRID
2007
Springer
15 years 3 months ago
Approximation of the Joint Spectral Radius of a Set of Matrices Using Sum of Squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
Pablo A. Parrilo, Ali Jadbabaie