Quotient-difference algorithm and code for cubic polynomials with computational implementation

DOI10.15372/SJNM20250104MaRDI QIDQ6964906zbMATH OpenFDO

Authors G. Debnath, Babu R. Vasu

Publication date 4 July 2025

Published in Sibirskiĭ Zhurnal Vychislitel'noĭ Matematiki (Search for Journal in Brave)

zbMATH Keywords

polynomial rootscomputational algorithmquotient-difference algorithmC programQ-D table

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites work

• Accurate quotient-difference algorithm: error analysis, improvements and applications
• Accurate singular values and differential qd algorithms
• Algorithms for accurate, validated and fast polynomial evaluation
• Approximate GCD and its application to ill-conditioned algebraic equations
• Finding zeros of a polynomial by the Q-D algorithm
• Floating-point versus symbolic computations in the qd-algorithm
• From qd to LR, or, how were the qd and LR algorithms discovered?
• Handbook of continued fractions for special functions. With contributions by Franky Backeljauw and Catherine Bonan-Hamada. Verified numerical output by Stefan Becuwe and Annie Cuyt
• Numerical methods for roots of polynomials. II
• Padé approximation and continued fractions
• Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate
• The Padé approximant
• The epsilon algorithm and related topics

This page was built for publication: Quotient-difference algorithm and code for cubic polynomials with computational implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964906)