Abstract
We propose a parallel algorithm to perform the Newton interpolation in time on a newly proposed mesh-of-unshuffle network of processors, where n + 1 is the number of given points. The algorithm is cost-optimal in the sense that number of processors times execution time is minimized. Besides, if processors are used in the network, the problem can be solved faster in time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.