Abstract

This paper presents a parallel algorithm for polynomial interpolation implemented on a mesh of trees. The algorithm is based on the Lagrange's interpolation formula. It requires O(log n) time using n 2 processors where n is the number of input data points at which the values of the function will be specified. We have also shown how the algorithm can be extended to the case when only p 2 processors ( p < n) will be available. The algorithm mapped on p 2 processors has a time complexity of O(( n 2 p 2 ) log n) .

Full Text
Paper version not known

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 call

Disclaimer: 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.