scientific article; zbMATH DE number 4017268
From MaRDI portal
Publication:3029262
An algorithmic method, based on the idea of a Dedekind cut, is described for numerical estimation of constants in various conditions. As an application, an improved value for the constant \(\lambda\) in \textit{V. V. Pokornyj}'s sufficient univalence condition [Dokl. Akad. Nauk SSR, Nov. Ser. 79, 743-746 (1951; Zbl 0045.359)] \[ | S_ f(z)| (1-| z|^ 2)^{\mu}\leq 2\lambda \] (where f is a locally univalent analytic function in the unit disc and \(S_ f\) its Schwarzian derivative) is computed.
Recommendations
- An interval algorithm for bounding the ranges of real-valued functions of one real variable
- An algorithm and estimates for the Erdős-Selfridge function
- An algorithm of computing b-functions
- scientific article; zbMATH DE number 1380820
- An algebraic method for computing \(N^\epsilon(f)\)
- An asymptotically optimal algorithm for approximating bounded analytic functions
- An algorithm for constructing the resultant of two entire functions
- Evaluating Lipschitz constants for functions given by algorithms
- scientific article; zbMATH DE number 4065592
- A functional equation often arising in the analysis of algorithms (extended abstract)
Cited in
(1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3029262)