Sciweavers

2766 search results - page 76 / 554
» Algorithms for trigonometric polynomials
Sort
View
100
Voted
SIAMNUM
2010
87views more  SIAMNUM 2010»
14 years 7 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
114
Voted
ERSHOV
2009
Springer
15 years 7 months ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
Laura Kovács
89
Voted
SODA
2004
ACM
88views Algorithms» more  SODA 2004»
15 years 2 months ago
Constructing finite field extensions with large order elements
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
Qi Cheng
IEICET
2008
84views more  IEICET 2008»
15 years 24 days ago
Factorization of Square-Free Integers with High Bits Known
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Ka...
110
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 10 days ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard