Sciweavers

2766 search results - page 26 / 554
» Algorithms for trigonometric polynomials
Sort
View
AISC
2006
Springer
14 years 7 days ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
JCP
2007
104views more  JCP 2007»
13 years 8 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
JCT
2000
103views more  JCT 2000»
13 years 8 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 28 days ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic