Newton's method: a great algebraic algorithm
暂无分享,去创建一个
[1] H. T. Kung,et al. O((n log n)3/2) ALGORITHMS FOR COMPOSITION AND REVERSION OF POWER SERIES , 1976 .
[2] A. C. Norman,et al. Computing with Formal Power Series , 1975, TOMS.
[3] V. Strassen. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .
[4] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .
[5] H. T. Kung. On computing reciprocals of power series , 1974 .
[6] Allan Borodin,et al. Fast Modular Transforms , 1974, J. Comput. Syst. Sci..
[7] S. Cook,et al. ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .
[8] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.