Geodesic
Algoritmy na výpočet kořenů polynomu
Pokroky matematiky, fyziky a astronomie, Tome 46 (2001) no. 1, pp. 33-42 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 12Y05, 26C10, 30C15, 65-02, 65H05 
@article{PMFA_2001_46_1_a3,
     author = {\v{S}{\'\i}pek, Jan and Z{\'\i}tko, Jan},
     title = {Algoritmy na v\'ypo\v{c}et ko\v{r}en\r{u} polynomu},
     journal = {Pokroky matematiky, fyziky a astronomie},
     pages = {33--42},
     year = {2001},
     volume = {46},
     number = {1},
     zbl = {1051.65063},
     language = {cs},
     url = {http://geodesic.mathdoc.fr/item/PMFA_2001_46_1_a3/}
}
TY  - JOUR
AU  - Šípek, Jan
AU  - Zítko, Jan
TI  - Algoritmy na výpočet kořenů polynomu
JO  - Pokroky matematiky, fyziky a astronomie
PY  - 2001
SP  - 33
EP  - 42
VL  - 46
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/PMFA_2001_46_1_a3/
LA  - cs
ID  - PMFA_2001_46_1_a3
ER  - 
%0 Journal Article
%A Šípek, Jan
%A Zítko, Jan
%T Algoritmy na výpočet kořenů polynomu
%J Pokroky matematiky, fyziky a astronomie
%D 2001
%P 33-42
%V 46
%N 1
%U http://geodesic.mathdoc.fr/item/PMFA_2001_46_1_a3/
%G cs
%F PMFA_2001_46_1_a3
Šípek, Jan; Zítko, Jan. Algoritmy na výpočet kořenů polynomu. Pokroky matematiky, fyziky a astronomie, Tome 46 (2001) no. 1, pp. 33-42. http://geodesic.mathdoc.fr/item/PMFA_2001_46_1_a3/

[Ba95] Bailey, D. H.: A Fortran Based Multiprecision System. Tech. Report RNR-94-013, 1995.

[Be40] Bell, E. T.: The Development of Mathematics. McGraw–Hill, New York 1940. | MR | Zbl

[Bo68] Boyer, C. A.: A History of Mathematics. John Wiley & Sons, New York 1968. | MR | Zbl

[Br78] Brent, R. P.: A Fortran Multiple Precision Arithmetic Package. ACM Trans. on Math. Software 4 (1978), 57–70.

[Ev83] Eves, H.: An Introduction to the History of Mathematics. Saunders College Publishing 1983. | MR | Zbl

[He64] Henrici, P.: Elements of Numerical Analysis. John Wiley & Sons, New York 1964. | MR | Zbl

[Je70] Jenkins, M. A., Traub, J. F.: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration. Numer. Math. 14 (1970), 252–263. | MR | Zbl

[Je72] Jenkins, M. A., Traub, J. F.: Algorithm 419: Zeros of a Complex Polynomial. Communications of the ACM 15 (1972), 97–110.

[Kn69] Knuth, D. E.: The Art of Computer Programming. Volume 2 / Seminumerical Algorithms. Addison–Wesley publishing company, Inc. 1969. | MR | Zbl

[Ku98] Kyurkchiev, N. V.: Initial Approximations and Root Finding Methods. 1998. | MR | Zbl

[Ma49] Marden, M.: The Geometry of the Zeros of a Polynomial. Amer. Math. Soc., Providence, R. I. 1949. | MR | Zbl

[Nr95] Press, W. H., Teukolsky, S. A., Vetterling, W. T., Flannery, B. P.: Numerical Recipes in FORTRAN. The Art of Scientific Computing, Second Edition. Cambridge University Press 1995. | MR

[Pa64] Parlett, B.: Laguerre’s Method Applied to the Matrix Eigenvalue Problem. Math. Comp. 18 (1964), 466–485. | MR | Zbl

[Pr81] Práger, M.: Numerická matematika. SPN, Praha 1981.

[Pv97] Pan, V. Y.: Solving a polynomial equation: Some history and recent progress. SIAM Rev. 39 (1997), 2, 187–220. | MR | Zbl

[Ra65] Ralston, A.: A first course in numerical analysis. McGraw-Hill, New York 1965. | MR | Zbl

[Vi87] Vitásek, E.: Numerické metody. SNTL, Praha 1987.

[Wi63] Wilkinson, J. H.: Rounding Errors in Algebraic Processes. Notes on App. Sci. No. 32. Her Majesty’s Stationery Office 1963. | MR | Zbl

[Zi75] Zítko, J.: Úvod do numerické matematiky. SPN, Praha 1975.