An Algebraic Computational Approach to the Identifiability of Fourier Models

Computer algebra and in particular Gröbner bases are powerful tools in experimental design (Pistone and Wynn, 1996,Biometrika83, 653–666). This paper applies this algebraic methodology to the identifiability of Fourier models. The choice of the class of trigonometric models forces one to deal with c...

Full description

Saved in:
Bibliographic Details
Published inJournal of symbolic computation Vol. 26; no. 2; pp. 245 - 260
Main Authors Caboara, M., Riccomagno, E.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.08.1998
Online AccessGet full text

Cover

More Information
Summary:Computer algebra and in particular Gröbner bases are powerful tools in experimental design (Pistone and Wynn, 1996,Biometrika83, 653–666). This paper applies this algebraic methodology to the identifiability of Fourier models. The choice of the class of trigonometric models forces one to deal with complex entities and algebraic irrational numbers. By means of standard techniques we have implemented a version of the Buchberger algorithm that computes Gröbner bases over the complex rational numbers and other simple algebraic extensions of the rational numbers. Some examples are fully carried out.
ISSN:0747-7171
1095-855X
DOI:10.1006/jsco.1998.0209