Inversibility of rational mappings and structural identifiability in automatics

ABSTRACT

We investigate different methods for testing whether a rational mapping ƒ from kn to km admits a rational inverse, or whether a polynomial mapping admits a polynomial one. We give a new solution, which seems much more efficient in practice than previously known ones using “tag” variables and standard basis, and a majoration for the degree of the standard basis calculations which is valid for both methods in the case of a polynomial map which is birational. We further show that a better bound can be given for our method, under some assumption on the form of ƒ. Our method can also extend to check whether a given polynomial belongs to the subfield generated by a finite set of fractions. We then illustrate our algorithm, with a application to structural identifiability. The implementation has been done in the IBM computer algebra system Scratchpad II.

REFERENCES

• AE: K. ADJAMAGBO and A. van den ESSEN A Differential Criterion and Formula for the Inversion of a Polynomial Map in Several Variables (to appear).
• B: H. BASS et al. The jacobian conjecture: reduction of degree and formal expansion of the inverse, Bulletin of the A.M.S. 7,2 , 1982.
• FGLM: J.C. FAUG~RE, P. GIANNI, D. LAZARD and T. MORA Efficient computation of zero-dimentional Gr~bner bases by change of ordering, 1988, preprint.
• H: Robin HARTSHORNE, Algebraic Geometry , Graduate Texts in Mathematics; 52, Springer Verlag, 1977.
• J: Heinrich W. E. JUNG, ~ber ganze birationale Transformationen der Ebene , J. Reine Agew. Math. 184, 1942.
• LA: Daniel LAZARD, in Eurocal, 1983.
• LE: Yves LECOURTIER Propri~t~s structurelles de mod~les, Etudes th~oriques, tests formels, Applications ~ la catalyse h~t~rog~ne , th~se de Doctorat ~s Sciences, universit~ Paris-Sud, 1985.
• LW: Yves LECOURTIER and Eric WALTER, The testing of Structural Properties throught Symbolic Computation in Identifiability of Parametric models, ch. 7., ed. E. Walter, Pergamon, Oxford, 1987.
• O1: Fran~ois OLLIVIER Le probl~me de l'identitlabilit~ structurelle globale en automatique, preprint to appear in CALSYF VIII ,1988.
• O2: Fran~ois OLLIVIER Une borne sur le degr~ des calculs interm~diaires pour determiner l'inverse d'une application birationnelle par l'algorithme de base standard , preprint ,1988.
• R: Atilla RAKSANYI Utilisation du calcul formel pour l'~tude des syst~mes d'~quations polynomiaIes (application en mod~lisatlon) , th&egravese de Doctorat ~s Sciences, universit~ Paris-Dauphine, 1986.
• RLWV: Atilla RAKSANYI, Yves LECOURTIER, Eric WALTER and Allain VENOT Identifiability and Distinguishability testing Via Computer Algebra, Mathematical Biosciences, 77, 245-266, 1985.
• SS1: David Shannon , Moss Sweedler, Using Gro¨bner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence, Journal of Symbolic Computation, v.6 n.2-3, p.267-273, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80047-6]
• SS2: David SHANNON and Moss SWEEDLER Using Groebner bases to determine subalgebra membership, preprint, 1988.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS

Additional Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION

General Terms:
Algorithms, Experimentation, Theory