zbMATH — the first resource for mathematics

What should be a rate of convergence? (English) Zbl 0378.65031

65J05 General theory of numerical analysis in abstract spaces
40A05 Convergence and divergence of series and sequences
54A20 Convergence in general topology (sequences, filters, limits, convergence spaces, nets, etc.)
Full Text: DOI EuDML
[1] 1. J. KRÍZKOVÁ and P. VRBOVA, A remark on a factorization theorem, Com. Math. Univ. Car. 15, 1974, p. 611-614 Zbl0329.46055 MR361789 · Zbl 0329.46055
[2] 2. H. PETZELTOVA and P. VRBOVA, A remark on small divisors problems (in print). Zbl0419.47029 · Zbl 0419.47029
[3] 3. V. PTAK, Deux théorèmes de factorisation, Comptes Rendus Ac. Sci. Paris 278, 1974, p. 1091-1094. Zbl0277.46047 MR341096 · Zbl 0277.46047
[4] 4. V. PTAK, A theorem of the closed graph type, Manuscripta math. 13, 1974, p. 109-130. Zbl0286.46008 MR348430 · Zbl 0286.46008
[5] 5. V. PTAK, Mondiscrete mathematical induction and iterative existence proofs, Linear algebra and its applications 13, 1976, p. 223-238. Zbl0323.46005 MR394119 · Zbl 0323.46005
[6] 6. V. PTAK, The rate of convergence of Newton’s process, Num. Mathem. 25, 1976, p. 279-285. Zbl0304.65037 MR478587 · Zbl 0304.65037
[7] 7. V. PTAK, A rate of convergence, Abhandlungen aus dem mathematischen Seminar Hamburg (in print).
[8] 8. V. PTAK, Concerning the rate of convergence of Newton’s process, Comm. Math. Univ. Carolinae 16, 1975, p. 699-705. Zbl0314.65023 MR398092 · Zbl 0314.65023
[9] 9. V. PTAK, A modification of Newtons Method, Cas. pest. mat. 101, 1976, p. 188-194. Zbl0328.46013 MR443326 · Zbl 0328.46013
[10] 10. J. ZEMANEK, A remark on transitivity of operator algebras, Cas. pest. mat. 100, 1975, p. 176-178. Zbl0302.46044 MR380436 · Zbl 0302.46044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.