Skip to main content
Log in

Implementation of an Algorithm for Finding Analyticity Conditions for a Solution of a Difference Equation

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

A linear difference operator L with polynomial coefficients and a function F(x) satisfying the equation LF(x) = 0 are considered. The function is assumed to be analytic in the interval (–σ, d), where σ > 0. In the paper, an implementation of an algorithm suggested by S.A. Abramov and M. van Hoeij for finding conditions that guarantee analyticity of F(x) on the entire real axis \(\mathbb{R}\) is presented. The analyticity conditions are linear relations for values of F(x) and its derivatives at a given point belonging to the half-interval [0, d). A procedure for computing values of F(x) and its derivatives up to a prescribed order at a given point x 0\(\mathbb{R}\) is also implemented. Examples illustrating the program operation are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Abramov, S.A. and van Hoeij, M., Set of Poles of Solutions of Linear Difference Equations with Polynomial Coefficients, Zh. Vychisl. Mat. Mat. Fiz., 2003, no. 1, in press.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitichkina, A.M. Implementation of an Algorithm for Finding Analyticity Conditions for a Solution of a Difference Equation. Programming and Computer Software 29, 100–103 (2003). https://doi.org/10.1023/A:1022952800869

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022952800869

Keywords

Navigation