Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings

10/31/2015
by   Moulay A. Barkatou, et al.
0

In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for the bivariate case based on a combination of several reduction techniques and is implemented in the computer algebra system Maple.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2019

On free completely iterative algebras

For every finitary set functor F we demonstrate that free algebras carry...
research
03/15/2019

Numerical computation of formal solutions to interval linear systems of equations

The work is devoted to the development of numerical methods for computin...
research
04/29/2016

Verifying Buchberger's Algorithm in Reduction Rings

In this paper we present the formal, computer-supported verification of ...
research
08/25/2017

A Stabilized Normal Form Algorithm for Generic Systems of Polynomial Equations

We propose a numerical linear algebra based method to find the multiplic...
research
09/19/2023

The information matrix of the bivariate extended skew-normal distribution

For the extended skew-normal distribution, which represents an extension...
research
05/02/2017

Apparent Singularities of D-finite Systems

We generalize the notions of singularities and ordinary points from line...
research
05/08/2019

An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: the Averaging Method Revisited

This paper introduces an algorithmic approach to the analysis of bifurca...

Please sign up or login with your details

Forgot password? Click here to reset