Keywords
- Banach Algebra
- Factorization Theorem
- Small Function
- Induction Principle
- Closed Graph Theorem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
List of references
V. PTÁK, Some metric aspects of the open mapping theorem, Math. Ann. 163 (1966), 95–104
V. PTÁK, Deux théorèmes de factorisation, Comptes Rendus Acad.Sci. Paris 278 (1974), 1091–1094
V. PTÁK, A theorem of the closed graph type, Manuscripta Math. 13 (1974), 109–130
V. PTÁK, A quantitative refinement of the closed graph theorem, Czechoslovak Math.J. 99 (1974), 503–506
V. PTÁK, Nondiscrete mathematical induction and iterative existence proofs, Linear Algebra and Appl. 13 (1976), 223–238
V. PTÁK, The rate of convergence of Newton's process, Numer.Math. 25 (1976), 279–285
V. PTÁK, Concerning the rate of convergence of Newton's process, Comment.Math.Univ.Carolinae 16 (1975), 699–705
V. PTÁK, A rate of convergence, Abh.Math.Sem.Univ. Hamburg (in print)
V. PTÁK, A modification of Newton's method, Časopis pěst.mat. 101 (1976), 188–194
H. PETZELTOVÁ and P. VRBOVÁ, A remark on small divisors problems, Revue Roumaine Math. (in print)
J. ZEMÁNEK, A remark on transitivity of operator algebras, Časopis pěst.mat. 100 (1975), 176–178
V. PTÁK, What should be a rate of convergence, RAIRO, Analyse numérique (in print)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag
About this paper
Cite this paper
Pták, V. (1977). Nondiscrete mathematical induction. In: Novák, J. (eds) General Topology and Its Relations to Modern Analysis and Algebra IV. Lecture Notes in Mathematics, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0068681
Download citation
DOI: https://doi.org/10.1007/BFb0068681
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08437-2
Online ISBN: 978-3-540-37108-3
eBook Packages: Springer Book Archive
