A simple algorithm for the evaluation of the hypergeometric series using quasi-linear time and linear space

Sergey V. Yakhontov

A simple algorithm for the evaluation of the hypergeometric series using quasi-linear time and linear space

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1106.2301 v2 pith:MT27CF2V submitted 2011-06-12 cs.DS

Sergey V. Yakhontov This is my paper

classification cs.DS

keywords algorithmcomplexityevaluationhypergeometriclinearquasi-linearseriessimple

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is shown that this algorithm is suitable in practical informatics for constructive analogues of often used constants of analysis.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Fast Ramanujan-type Series for Logarithms. Part I
math.NT 2025-06 conditional novelty 7.0 of 10

The paper introduces new, mostly proven hypergeometric series for log 2, log 3, and log 5 with lower binary splitting costs than Machin-type formulas, plus a variable-p family.

Pith tools