Abstract
The Neville‐type algorithms are widely used in engineering and sciences. As an analog of Neville's algorithm that deals with univariate polynomial interpolation, Bulirsch‐Stoer algorithm is a classical one for univariate rational interpolations. It can be applied to calculating the value of the interpolating function at the given point or recovering rational functions. In this paper, we generalize the algorithm to multivariate cases with two versions for different situations. These two generalizations are recursive algorithms. The first one is suitable to calculate the value of the interpolating function and the other one can be applied to recovering multivariate rational functions from accurate measurements. Some two‐variable examples illustrate that, if we recover the rational functions with higher degrees, the second generalization is superior to Thiele‐Thiele continued fraction and two‐variable Löwner matrix methods.
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.
