A bounding approach to calculating ^1/p

DOI10.1007/BF02242176zbMATH Open0561.65010OpenAlexW57382074MaRDI QIDQ2266564FDOQ2266564

Authors: A. M. Cohen 

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242176

Recommendations

• A note on rational approximation to \((1-x)^{\alpha}\)
• On two sequences of algorithms for approximating square roots
• General approach of the root of a \(p\)-adic number
• On the size of the coefficients of rational functions approximating powers. II
• Newton-like algorithms for kth root calculation

zbMATH Keywords

arithmetic meanharmonic meangeometric meaninterval arithmetic estimatesp-th roots

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Elementary functions (26A09)

Cited In (3)

• One optional observation inflates \(\alpha\) by \({100/\sqrt{n}}\) per cent
• Pickands' constant \(H_{\alpha}\) does not equal \(1/\Gamma(1/\alpha)\), for small \(\alpha\)
• Title not available (Why is that?)

This page was built for publication: A bounding approach to calculating \(\alpha ^{1/p}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266564)