Abstract
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal differences. This algorithm constructs the continued fraction/Padé 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
