Computing the normal forms of matrices depending on parameters

Authors:
G. Chen
Affiliations:
Laboratoire TIM3-IMAG, Grenoble, France
Venue:
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Year:
1989

Citing 1
Cited 3

The algebraic eigenvalue problem

The algebraic eigenvalue problem

An algorithm for computing the formal solutions of differential systems in the neighborhood of an irregular singular point

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Nilpotent normal form via Carleman linearization (for systems of ordinary differential equations)

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Rational normal form for dynamical systems by Carleman linearization

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider in this paper an algorithm for the exact computation of the Frobenius, Jordan and Arnold's form of matrices depending holomorphically on parameters. The problem originates from the problem of formal resolution of a first order system of differential equations depending on parameter. We have implemented this algorithm in Macsyma.