Linear differential equations as a data structure
From MaRDI portal
Publication:2329042
DOI10.1007/s10208-018-09411-xzbMath1431.68166arXiv1811.08616OpenAlexW2963462404MaRDI QIDQ2329042
Publication date: 17 October 2019
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.08616
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Data structures (68P05) Formal solutions and transform techniques for ordinary differential equations in the complex domain (34M25) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Linear ordinary differential equations and systems in the complex domain (34M03)
Related Items
Stability Problems on D-finite Functions ⋮ Rounding error analysis of linear recurrences using generating series ⋮ Polynomial continued fractions for exp(π) ⋮ Rational dynamical systems, \(S\)-units, and \(D\)-finite power series ⋮ A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method
Uses Software
Cites Work
- Creative Telescoping for Holonomic Functions
- The Dynamic Dictionary of Mathematical Functions (DDMF)
- Fast evaluation of holonomic functions near and in regular singularities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diagonals of rational fractions
- Divergent series, summability and resurgence. III. Resurgent methods and the first Painlevé equation
- Divergent series, summability and resurgence II. Simple and multiple summability
- Even faster integer multiplication
- Multiple binomial sums
- Non-D-finite excursions in the quarter plane
- Trading order for degree in creative telescoping
- Divergent series, summability and resurgence I. Monodromy and resurgence
- The method of differentiating under the integral sign
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- Effective bounds for P-recursive sequences
- Algebraic power series and diagonals
- A holonomic systems approach to special functions identities
- The method of creative telescoping
- A proof that Euler missed. Apéry's proof of the irrationality of \(\zeta(3)\). An informal report
- Non-commutative elimination in Ore algebras proves multivariate identities
- Fast evaluation of holonomic functions
- Some integrals involving Bessel functions
- From divergent power series to analytic functions. Theory and application of multisummable power series
- Binomial identities -- combinatorial and algorithmic aspects
- An introduction to pseudo-linear algebra
- When does Zeilberger's algorithm succeed?
- Linear equations in non-commutative fields
- Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
- Weyl closure of a linear differential operator
- Gevrey series of arithmetic type. I: Purity and duality theorems
- Theory of non-commutative polynomials
- An extension of Zeilberger's fast algorithm to general holonomic functions
- On the zeta function of a hypersurface. II
- Lindelöf representations and (non-)holonomic sequences
- Reduction-based creative telescoping for Fuchsian D-finite functions
- Efficient accelero-summation of holonomic functions
- Algebraic functions over finite fields
- On the periods of certain rational integrals. I, II
- Nilpotent connections and the monodromy theorem: Applications of a result of Turrittin
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
- Algebraic diagonals and walks: algorithms, bounds, complexity
- Constructing reductions for creative telescoping. The general differentially finite case
- Computing periods of rational integrals
- Ore Polynomials in Sage
- A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms
- Formulas for Continued Fractions
- Analytic Combinatorics in Several Variables
- Chebyshev expansions for solutions of linear differential equations
- A non-holonomic systems approach to special function identities
- NumGfun
- Complexity of creative telescoping for bivariate rational functions
- Hermite reduction and creative telescoping for hyperexponential functions
- Creative telescoping for rational functions using the griffiths
- Desingularization explains order-degree curves for ore operators
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
- Efficient Algorithms for Mixed Creative Telscoping
- Reduction-Based Creative Telescoping for Algebraic Functions
- New Bounds for Hypergeometric Creative Telescoping
- Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables
- A new algorithm for the recursion of multisums with improved universal denominator
- Lattice Green functions: thed-dimensional face-centered cubic lattice,d= 8, 9, 10, 11, 12
- Singularity Analysis of Generating Functions
- Faster Integer Multiplication
- On the complexity of calculating factorials
- Rational function certification of multisum/integral/“𝑞” identities
- A general theory of identities of the Rogers-Ramanujan type
- Fast Multiple-Precision Evaluation of Elementary Functions
- Extended Watson integrals for the cubic lattices
- GFUN
- The computation of classical constants
- Isingn-fold integrals as diagonals of rational functions and integrality of series expansions
- The complete generating function for Gessel walks is algebraic
- Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
- Computing the Volume of Compact Semi-Algebraic Sets
- Telescopers for rational and algebraic functions via residues
