Polynomial evaluation subroutines are the key to fast efficient dynamic system analysis programs. Yet, an examination of the latest software will reveal that the polynomial subroutines use the old standard techniques consisting of either a direct evaluation or Horner\u27s method with complex arithmetic. This report contains new algorithms which are used to design subroutines that will execute in the order of 10-to-1 faster than most subroutines presently used
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
The key program for linear system analysis and/or synthesis is a program for factoring higher order ...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
Smart algorithms are the essential key in making computing faster and more efficient. Different tech...
Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton&...
A.H. Nuttall's (see ibid., vol. ASSP-35, no.10, p.1486-7, 1987) algorithm for the evaluation of a po...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
In recent years a number of algorithms have been designed for the "inverse" computational ...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
A.H. Nuttall's (see ibid., vol. ASSP-35, no.10, p.1486-7, 1987) algorithm for the evaluation of a po...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
The key program for linear system analysis and/or synthesis is a program for factoring higher order ...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
Smart algorithms are the essential key in making computing faster and more efficient. Different tech...
Novel approaches are used to ensure consistently rapid convergence of an algorithm, based on Newton&...
A.H. Nuttall's (see ibid., vol. ASSP-35, no.10, p.1486-7, 1987) algorithm for the evaluation of a po...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
In recent years a number of algorithms have been designed for the "inverse" computational ...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
A.H. Nuttall's (see ibid., vol. ASSP-35, no.10, p.1486-7, 1987) algorithm for the evaluation of a po...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...