Schroder, H. ; Murthy, V. K. ; Krishnamurthy, E. V. (1991) Systolic algorithm for polynomial interpolation and related problems Parallel Computing, 17 (4-5). pp. 493-503. ISSN 0167-8191
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1016/S0167-8191(05)80151-6
Abstract
This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any field using a linear array of processors. The periods of these algorithms are O(n) for interpolatin and O(1) for evaluation. This algorithm is readily adapted for Chinese remaindering, easily generalized for the multivariable interpolation and can be extended for rational interpolation to produce Pade approximants. The instruction systolic array implementation of the algorithm is presented here.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Chinese Remaindering; Evaluation; Interpolation; Polynomials; Instruction Systolic Arrays; Lagrange Interpolant; Newton Interpolation; Period of Algorithm; Quorum Security Locks; Systolic Algorithms; Systolic Architectures |
| ID Code: | 85932 |
| Deposited On: | 06 Mar 2012 13:55 |
| Last Modified: | 06 Mar 2012 13:55 |
Repository Staff Only: item control page
