Exact linear modeling with polynomial coefficients

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a finite set of polynomial, multivariate, and vector-valued functions, we show that their span can be written as the solution set of a linear system of partial differential equations (PDE) with polynomial coefficients. We present two different but equivalent ways to construct a PDE system whose solution set is precisely the span of the given trajectories. One is based on commutative algebra and the other one works directly in the Weyl algebra, thus requiring the use of tools from non-commutative computer algebra. In behavioral systems theory, the resulting model for the data is known as the most powerful unfalsified model (MPUM) within the class of linear systems with kernel representations over the Weyl algebra, i.e.; the ring of differential operators with polynomial coefficients. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Zerz, E., Levandovskyy, V., & Schindelar, K. (2011). Exact linear modeling with polynomial coefficients. Multidimensional Systems and Signal Processing, 22(1–3), 55–65. https://doi.org/10.1007/s11045-010-0125-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free