Fast beampattern evaluation by polynomial rooting
نویسندگان
چکیده
منابع مشابه
FFT-based fast polynomial rooting
A fast, accurate and robust approach is proposed for the computation of the roots of complex polynomials. The method is derived from the DFT-based differential cepstrum estimation for moving average signals. This minimudmaximum-phase polynomial factorisation is easily extended to a factorisation along an arbitrary circle. In an iterative fashion, we estimate the largest root modulus from the di...
متن کاملFast polynomial evaluation and composition
The library fast polynomial for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as Hörner, divide and conquer and new ones can be added easily. Notably, a new scheme is introduced that improves the classical divide and conquer scheme when the number of terms is not a pure power of two. Natively, the library handles polynomials ...
متن کاملFast Approximate Polynomial Multipoint Evaluation and Applications
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial F ∈ C[x] of degree n at n complex-valued points can be done with Õ(n) exact field operations in C, where Õ(·) means that we omit polylogarithmic factors. We complement this result by an analysis of approximate multipoint evaluation of F to a precision of L bits after the binary po...
متن کاملA polynomial rooting approach to super-resolution array design
This paper is concerned with the design of super-resolution direction finding (DF) arrays that satisfy prespecified performance levels, such as detection-resolution thresholds and Cramér–Rao bounds on error variance. The sensor placement problem is formulated in the framework of subspace-based DF techniques and a novel polynomial rooting approach to the design problem, based on the new concept ...
متن کاملPolynomial Systems Solving by Fast Linear Algebra
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to stick to the most general case, we consider a representation of the solutions from which one can easily recover the exact solutions or a certified approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Radio Science
سال: 2011
ISSN: 1684-9973
DOI: 10.5194/ars-9-145-2011