Effective bounds for P-recursive sequences
From MaRDI portal
Publication:992808
DOI10.1016/J.JSC.2010.06.024zbMATH Open1201.65219OpenAlexW2055334714MaRDI QIDQ992808FDOQ992808
Publication date: 10 September 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.024
Recommendations
- On linear recurrence sequences with polynomial coefficients
- A unified rounding error bound for polynomial evaluation
- Effective upper bounds for the number of zeros of a linear recursive sequence
- scientific article; zbMATH DE number 2107594
- Rounding error analysis of linear recurrences using generating series
algorithmasymptotic behaviourboundslinear recurrence relationholonomic functionsCauchy-Kovalevskaya majorantcertified evaluationevaluation of power series
Cites Work
- GFUN
- ACETAF
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Differentiably finite power series
- A holonomic systems approach to special functions identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Poincaré theorem for difference equations
- Symbolic integration. I: Transcendental functions
- Title not available (Why is that?)
- D-finite power series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resurrecting the asymptotics of linear recurrences
- Title not available (Why is that?)
- Taylor forms -- use and limits.
- On Taylor Model Based Integration of ODEs
- Title not available (Why is that?)
- Fast evaluation of holonomic functions
- Fast evaluation of holonomic functions near and in regular singularities
- Improved validated bounds for Taylor coefficients and for Taylor remainder series
- Sur les points singuliers des équations différentielles
- On effective analytic continuation
- Title not available (Why is that?)
- Automatic average-case analysis of algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective asymptotics of linear recurrences with rational coefficients
- Asymptotic behavior of a Poincaré recurrence system
- Lösungstypen von Differenzgleichungen und Summengleichungen in normierten abelschen Gruppen
- Leibniz's Formula, Cauchy Majorants, and Linear Differential Equations
Cited In (12)
- Effective approximation of the solutions of algebraic equations
- Univariate polynomial solutions of algebraic difference equations
- D-finite numbers
- Rounding error analysis of linear recurrences using generating series
- Kostant's partition function and magic multiplex juggling sequences
- Efficient and accurate computation of upper bounds of approximation errors
- Multiple binomial sums
- Linear differential equations as a data structure
- Confluence of meromorphic solutions of \(q\)-difference equations
- Truncation bounds for differentially finite series
- Computing Hypergeometric Functions Rigorously
- An Accurate Numerical Method and Algorithm for Constructing Solutions of Chaotic Systems
Uses Software
This page was built for publication: Effective bounds for P-recursive sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992808)