On computing minimal proper nullspace bases with applications in fault detection

DOI10.1007/978-94-007-0602-6_20zbMATH Open1251.65062OpenAlexW1947219295MaRDI QIDQ2913174FDOQ2913174

Authors: Andras Varga 

Publication date: 26 September 2012

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://elib.dlr.de/70415/1/nlassc11_varga.pdf

Recommendations

• Computing minimal nullspace bases
• Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
• Numerical computation of minimal polynomial bases: a generalized resultant approach
• The Null Space Problem II. Algorithms
• An improved Toeplitz algorithm for polynomial matrix null-space computation

zbMATH Keywords

algorithmsfault detectionpolynomial matrixrational matrixminimal proper nullspace basesreduction to a Kronecker-like form

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Vector spaces, linear dependence, rank, lineability (15A03) Matrices over function rings in one or more variables (15A54)

Cited In (1)

• Computing minimal nullspace bases

This page was built for publication: On computing minimal proper nullspace bases with applications in fault detection

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