𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algebraic Computational Approach to the Identifiability of Fourier Models

✍ Scribed by M. Caboara; E. Riccomagno

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
506 KB
Volume
26
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

Computer algebra and in particular Gröbner bases are powerful tools in experimental design (Pistone and Wynn, 1996, Biometrika 83, 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.

📜 SIMILAR VOLUMES

An Algebraic Approach to the Classificat
An Algebraic Approach to the Classification of Centers in Polynomial Liénard Systems
✍ Colin Christopher 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We consider the second-order Liénard system where f x and g x are polynomials, which we rewrite in the equivalent twodimensional form, We show that the local question of whether a critical point of this system is a center can be expressed in terms of global conditions on f and g. Using these resul