Abstract
The quotient-difference (=QD) algorithm developed by the author may be considered as an extension ofBernoulli's method for solving algebraic equations. WhereasBernoulli's method gives the dominant root as the limit of a sequence of quotientsq 1 () =s 1 (+1) /s 1 () formed from a certain numerical sequences 1 () , the QD-algorithm gives (under certain conditions) all the rootsλ σ as the limits of similiar quotient sequencesq σ () =s σ (+1) /s σ () . Close relationship exists between this method and the theory of continued fractions. In fact the QD-algorithm permits developing a function given in the form of a power series into a continued fraction in a remarkably simple manner. In this paper only the theoretical aspects of the method are discussed. Practical applications will be discussed later.
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 callMore From: Zeitschrift für angewandte Mathematik und Physik ZAMP
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.
