Sciweavers

23 search results - page 1 / 5
» Exploration of multiple roots for a polynomial system
Sort
View
ICDIM
2007
IEEE
13 years 11 months ago
Exploration of multiple roots for a polynomial system
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...
Crina Grosan, Ajith Abraham
ENGL
2008
192views more  ENGL 2008»
13 years 4 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
NA
2010
153views more  NA 2010»
13 years 3 months ago
Verified error bounds for multiple roots of systems of nonlinear equations
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
Siegfried M. Rump, Stef Graillat
TCS
2008
13 years 4 months ago
Real algebraic numbers and polynomial systems of small degree
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
Ioannis Z. Emiris, Elias P. Tsigaridas
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 4 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel