Abstract
It is shown that the solution of confluent Vandermonde linear systems can be obtained by the Hermite evaluation of rational functions, which can actually be converted to the Hermite evaluation of two polynomials. Based on this result, divide and conquer methods are used to construct a fast algorithm for confluent Vandermonde linear systems. If fast polynomial multiplication and division (fast Fourier transform (FFT)) are used, the algorithm needs only $O(n \log n \log p)$ operations.
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.
