Abstract
The algorithmic classification of singularities of linear differential systems via the computation of Moser- and super-irreducible forms as introduced in [21] and [16] respectively has been widely studied in Computer Algebra ([8, 12, 22, 6, 10]). Algorithms have subsequently been given for other forms of systems such as linear difference systems [4, 3] and the perturbed algebraic eigenvalue problem [18]. In this paper, we extend these concepts to the general class of systems of linear functional equations. We derive a definition of regularity for these type of equations, and an algorithm for recognizing regular systems. When specialised to q-difference systems, our results lead to new algorithms for computing polynomial solutions and regular formal solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
