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
We present algorithms for computing rational and hyperexponential solutions of linear D-finite parti...
AbstractIn this paper we discuss the differentiation of Pfaffians which is useful in Pfaffian techni...
AbstractWe present an efficient algorithm for computing the pfaffian of a matrix whose elements belo...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
An explicit solution is given for the system of linear equations EφEt=φ′, where φ,φ′ are alternating...
International audienceWe present algorithms for computing rational and hyperex-ponential solutions o...
International audienceWe present algorithms for computing rational and hyperex-ponential solutions o...
We present algorithms for computing rational and hyperexponential solutions of linear D-finite parti...
AbstractIn this paper we discuss the differentiation of Pfaffians which is useful in Pfaffian techni...
AbstractWe present an efficient algorithm for computing the pfaffian of a matrix whose elements belo...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceIn this paper, we present an algorithm for computing a fundamental matrix of f...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
International audienceThe local analysis of formal meromorphic linear differential systems with coef...
An explicit solution is given for the system of linear equations EφEt=φ′, where φ,φ′ are alternating...
International audienceWe present algorithms for computing rational and hyperex-ponential solutions o...
International audienceWe present algorithms for computing rational and hyperex-ponential solutions o...
We present algorithms for computing rational and hyperexponential solutions of linear D-finite parti...
AbstractIn this paper we discuss the differentiation of Pfaffians which is useful in Pfaffian techni...
AbstractWe present an efficient algorithm for computing the pfaffian of a matrix whose elements belo...