Exact linear modeling using Ore algebras

DOI10.1016/J.JSC.2011.08.001MaRDI QIDQ650834zbMATH OpenOpenAlexFDO

Authors V. Levandovskyy, E. Zerz, Kristina Schindelar

Publication date 7 December 2011

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.2924

zbMATH Keywords

Syzygiesannihilatorlinear exact modelingOre algebranoncommutative Gröbner basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of associative rings (general theory) (16Z05) Algebraic methods (93B25)

Abstract: Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gr"obner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples.

Recommendations

• Exact linear modeling with polynomial coefficients
• Effective algebraic analysis approach to linear systems over Ore algebras
• Gröbner bases with respect to generalized term orders and their application to the modelling problem
• \textsc{OreModules}: A symbolic package for the study of multidimensional linear systems
• Recursive computation of the MPUM

Cites work

• scientific article; zbMATH DE number 803209 (Why is no real title available?)
• scientific article; zbMATH DE number 227002 (Why is no real title available?)
• A behavioral approach to linear exact modeling
• Algebraic analysis of linear multidimensional control systems
• Algorithmic proofs of two theorems of Stafford.
• Behavioral Models for List Decoding
• Characteristic Frequencies, Polynomial-Exponential Trajectories, and Linear Exact Modeling with Multidimensional Behaviors
• Effective algorithms for parametrizing linear control systems over Ore algebras
• Exact linear modeling with polynomial coefficients
• Non-commutative elimination in Ore algebras proves multivariate identities
• Noncommutative Noetherian rings. With the cooperation of L. W. Small.
• On preimages of ideals in certain non-commutative algebras
• Reed–Solomon List Decoding From a System-Theoretic Perspective
• The discrete multidimensional MPUM
• \textsc{OreModules}: A symbolic package for the study of multidimensional linear systems

Cited in

(6)

• Structure at infinity and defect of transfer matrices with time-varying coefficients, with application to exact model-matching
• Constructive \(D\)-module theory with \texttt{Singular}
• Exact linear modeling with polynomial coefficients
• Characteristic Frequencies, Polynomial-Exponential Trajectories, and Linear Exact Modeling with Multidimensional Behaviors
• A linear algebraic procedure for solving linear perfect foresight models
• Recursive computation of the MPUM

Describes a project that uses

Uses Software

• Plural
• SINGULAR
• OreModules

This page was built for publication: Exact linear modeling using Ore algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650834)