Murthy, V. K. ; Krishnamurthy, E. V. ; Chen, Pin (1992) Systolic algorithm for rational interpolation and Padé approximation Parallel Computing, 18 (1). pp. 75-83. ISSN 0167-8191
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/0...
Related URL: http://dx.doi.org/10.1016/0167-8191(92)90112-K
Abstract
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal differences. This algorithm constructs the continued fraction/Pade approximant of a stream of input data using a linear array of processors. The period of this algorithm is O(n+1) (where n+1 is the number of distinct points at which the function values are available) to produce an M/M Padé approximant ( M = n+1/2, n odd; M= n/2, n even) using n + 1 processors. For illustrative purpose the Connection Machine implementation of this systolic algorithm in CM Fortran is presented with an example.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Systolic Algorithm; Rational Interpolation; Padé Approximation; Connection Machine |
| ID Code: | 85933 |
| Deposited On: | 06 Mar 2012 13:53 |
| Last Modified: | 06 Mar 2012 13:53 |
Repository Staff Only: item control page
