Obreshkoff-Ehrlich方法对代数、三角和指数方程重根的推广
A Generalization of Obreshkoff-Ehrlich Method for Multiple Roots of Algebraic, Trigonometric and Exponential Equations
AI总结：
本文推广Obreshkoff-Ehrlich方法以同时求解广义多项式（代数、三角和指数方程）的重根，保持三次收敛速度且计算量不变。
摘要：
本文发展了同时求广义多项式所有根的方法。这些方法针对根为重根的情形。它们具有三次收敛速度，且其计算工作量与仅针对简单根情形的已知方法相当。
英文摘要：
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as the known methods related to the case of polynomials with simple roots only.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
