Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью
DOI10.14498/VSGTU924zbMATH Open1463.68030OpenAlexW2323371818MaRDI QIDQ4960011FDOQ4960011
Authors: S. V. Yakhontov
Publication date: 8 April 2020
Published in: Vestnik Samarskogo Gosudarstvennogo Tekhnicheskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vsgtu924
Recommendations
- Space-efficient evaluation of hypergeometric series
- Time- and space-efficient evaluation of some hypergeometric constants
- Computing hypergeometric solutions of linear recurrence equations
- A Simple Algorithm for the Evaluation of a Class of Generalized Hypergeometric Series
- Accelerating indefinite hypergeometric summation algorithms
- Efficient computation of Schlömilch-type series
- Computing power series in polynomial time
- Algorithms for \(m\)-fold hypergeometric summation
- Reduced complexity evaluation of hypergeometric functions
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computation over the reals, computable analysis (03D78) Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Constructive and recursive analysis (03F60) Classical models of computation (Turing machines, etc.) (68Q04) Computational aspects of special functions (33F99)
Cites Work
Cited In (4)
This page was built for publication: Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960011)