Computing error bounds for asymptotic expansions of regular P-recursive sequences

DOI10.1090/mcom/3888arXiv2212.11742MaRDI QIDQ6181106

Stephen Melczer, Unnamed Author, Marc Mezzarobba

Publication date: 2 January 2024

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.11742

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Interval and finite arithmetic (65G30) Asymptotic enumeration (05A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic average-case analysis of algorithms
• Galois theory of difference equations
• Truncation bounds for differentially finite series
• Efficient accelero-summation of holonomic functions
• The asymptotic expansion of a ratio of gamma functions
• Ore Polynomials in Sage
• When can we detect that a P-finite sequence is positive?
• Termination conditions for positivity proving procedures
• D-finite numbers
• Reduction to Canonical Forms and the Stokes Phenomenon in the Theory of Linear Difference Equations
• Singularity Analysis of Generating Functions
• Error Bounds for the Asymptotic Expansion of the Ratio of Two Gamma Functions with Complex Argument
• Fast Multiple-Precision Evaluation of Elementary Functions
• On the Relation between Linear Difference and Differential Equations with Polynomial Coefficients
• Error bounds for the asymptotic expansion of the Hurwitz zeta function
• Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
• Algorithmic and Symbolic Combinatorics
• Diagonal asymptotics for symmetric rational functions via ACSV
• Uniqueness of Clifford torus with prescribed isoperimetric ratio
• Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes
• Partial match retrieval of multidimensional data
• A procedure for proving special function inequalities involving a discrete parameter
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Rational and algebraic series in combinatorial enumeration
• A hypergeometric proof that 𝖨𝗌𝗈 is bijective
• Fast evaluation of holonomic functions near and in regular singularities

This page was built for publication: Computing error bounds for asymptotic expansions of regular P-recursive sequences