TruncatedSeries Package

The TruncatedSeries package is designed to search for Laurent solutions, regular solutions and formal exponetial-logarithmic solutions of linear ordinary differential equations and systems with truncated series coefficients:

TruncatedSeries2023.zip – the archive with two files: maple.ind and maple.lib are a Maple library. Put these files to some directory, for example to ”/usr/userlib”. Assign

libname := ”/usr/userlib”, libname

in the Maple session.

The procedures LaurentSolution and RegularSolution (a single equation with truncated series coefficients)

The procedures LaurentSolution and RegularSolution have been implemented in Maple 2020 by D.E.Khmelnov. See for detail in

* Abramov S.A., Khmelnov D.E., Ryabenko A.A. Laurent solutions of linear ordinary differential equations with coefficients in the form of truncated power series. Computer Algebra: International Conference Proceedings, Moscow, June 17–21, 2019, pp.75–82.

CA.Moscow.2019.Equation.mw – the Maple session with examples of the talk in Computer Algebra: Moscow, June 17–21, 2019.

CA.Moscow.2019.Equation.pdfPDF version of the Maple session.

TruncatedSeriesExamples.mw – the Maple session with examples of using the package for Laurent solutions and regular solutions.

TruncatedSeriesExamples.pdfPDF version of the Maple session.

The next version of the procedure LaurentSolution (a single equation with algorithmically represented and truncated series coefficients)

The procedure LaurentSolution for linear ordinary differential equations, each of the coefficients of which is either an algorithmically represented power series, or a truncated power series. It has been implemented in Maple 2020 by D.E.Khmelnov. See for detail in

MixedSeriesExamples.mw – the Maple session with examples of using the package for Laurent solutions; samples from the paper and slides for CASC 2020.

MixedSeriesExamples.pdfPDF version of the Maple session with examples of using the package for Laurent solutions.

The procedure FormalSolution (a single equation with truncated series coefficients)

The procedures LaurentSolution, RegularSolution and FormalSolution (a single equation with algorithmically represented and truncated series coefficients)

The procedures for automatic confirmation of exhaustive use of information on a given equation (a single equation with truncated series coefficients)

Algorithms were previously proposed that allow one to find truncated solutions to linear differential equations with coefficients in the form of truncated formal power series. Below are suggested some automatic means of confirming the impossibility of obtaining a larger number of terms of such solutions without some additional information on a given equation. The confirmation has the form of a counterexample to the assumption about the possibility of obtaining some additional terms of the solution.

More details are to be found in:

ExhaustiveUseExamples.mw – the Maple session with examples for LaurentSolution and RegularSolution.

ExhaustiveUseExamples.pdfPDF version of the Maple session.

ExhaustiveUse_FormalSolution.mw – the Maple session with examples for FormalSolution of the talk in CASC 2022.

ExhaustiveUse_FormalSolution.pdfPDF version of the Maple session.

The procedures LaurentSolution (a system with truncated series coefficients)

The procedure LaurentSolution has been extended for the case of systems with all coefficients given as truncated series.

We consider systems of linear ordinary differential equations with infinite formal power series as coefficients. The series are represented in a truncated form, while the degree of truncation may differ for different coefficients. As a tool of studying such systems we use induced recurrent systems and literal designations for unspecified coefficients of the series. For the case when the determinant of the leading matrix of the induced system is not zero and does not contain literals, an algorithm for constructing Laurent solutions of the system is proposed. The series included in the solutions are still truncated. The algorithm finds for them the maximum possible number of terms that are invariant with respect to any prolongations of truncated coefficients of the original system. The implementation of the algorithm as a Maple procedure and examples of its usage are presented.

See examples of the procedure's use for the systems in

LaurentForSystem2022.mw – the Maple session.

LaurentForSystem2022.pdfPDF version of the Maple session.

In the second version of LaurentSolution for truncated system, we advance in extending our algorithm to the case when the leading matrix of the induced system is singular using algorithm EG as an auxiliary tool. More details are to be found in:

See examples in

LaurentForSystem2023.mw – the Maple session.

LaurentForSystem2023.pdfPDF version of the Maple session.

truncatedseries.txt · Last modified: 2023/08/17 13:29 by anna
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial 3.0 Unported
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki