An upper bound on the number of linear relations identified from noisy data by the Frisch scheme

DOI10.1016/0167-6911(94)00005-GzbMATH Open0877.93130MaRDI QIDQ673885FDOQ673885

Authors: Keith G. Woodgate 

Publication date: 28 February 1997

Published in: Systems \& Control Letters (Search for Journal in Brave)

Recommendations

• Identification of the maximal number of linear relations from noisy data
• scientific article; zbMATH DE number 5620939
• scientific article; zbMATH DE number 37094
• Linear models based on noisy data and the Frisch scheme
• The Frisch scheme in dynamic system identification

zbMATH Keywords

Schur complementsSystem identificationFrisch schemeLinear algebraPositive semi-definite matrices

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Identification in stochastic control theory (93E12)

Cites Work

• Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis
• The Frisch scheme in dynamic system identification
• Title not available (Why is that?)
• Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
• What are Schur complements, anyway?
• Title not available (Why is that?)
• Identification of noisy systems
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Identification of the maximal number of linear relations from noisy data
• Linear models based on noisy data and the Frisch scheme
• Identification of static errors-in-variables models: The rank reducibility problem

This page was built for publication: An upper bound on the number of linear relations identified from noisy data by the Frisch scheme

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