A fitting algorithm for real coefficient 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...
متن کاملA Reduced-complexity Ldpc Decoding Algorithm with Chebyshev Polynomial Fitting
BP decoding algorithm is a high-performance low-density parity-check (LDPC) code decoding algorithm, but because of its high complexity, it can’t be applied to the high-speed communications systems. So in order to further reduce the implementation complexity with the minimum affection to the system performance, , we proposed a BP algorithm based on Chebyshev polynomial fitting for its good appr...
متن کاملModelling of Friction Coefficient for Shoes Type LL By Means of Polynomial Fitting
RESEARCH ARTICLE Modelling of Friction Coefficient for Shoes Type LL By Means of Polynomial Fitting L. Cantone and A. Ottati Department of Engineering for Enterprise “Mario Lucertini" University of Rome “Tor Vergata”, via del Politecnico, 1, 00133 Rome, Italy Tecnologie Meccaniche e Sistemi Frenanti Ingegneria Rotabili e Tecnologie di Base, Direzione Tecnica TRENITALIA, Viale Spartaco Lavagnini...
متن کاملEdge Closing of Synthetic and Real Images using Polynomial Fitting
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as incomplete or open contours. These inaccuracies mislead the subsequent processing. In this article, we propose a method to close contours of synthetic and real images. This method combines polynomial contour fitting with e...
متن کاملProbabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
Let f, f1, . . . , fs be n-variate polynomials with rational coefficients of maximum degree D and let V be the set of common complex solutions of F = (f1, . . . , fs). We give an algorithm which, up to some regularity assumptions on F, computes an exact representation of the global infimum f? of the restriction of the map x → f (x) to V ∩ Rn, i.e. a univariate polynomial vanishing at f? and an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2012.02.027