Identification of the maximal number of linear relations from noisy data
From MaRDI portal
Publication:673887
DOI10.1016/0167-6911(94)00006-HzbMATH Open0877.93131MaRDI QIDQ673887FDOQ673887
Authors: Roberto Guidorzi
Publication date: 28 February 1997
Published in: Systems \& Control Letters (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 37094
- An upper bound on the number of linear relations identified from noisy data by the Frisch scheme
- Identification of linear relations from noisy data: Geometrical aspects
- Publication:4892193
- Identification of linear systems from noisy data
- scientific article; zbMATH DE number 218675
- scientific article; zbMATH DE number 851959
- scientific article; zbMATH DE number 16939
- Recognizing linear structure in noisy matrices
- An optimal lower bound on the number of variables for graph identification
Cites Work
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Errors-in-variables methods in system identification
- Recognizing linear structure in noisy matrices
- Identification of linear relations from noisy data: Geometrical aspects
- Direction-of-arrival estimation in nonuniform noise fields: a Frisch scheme approach
- Linear models based on noisy data and the Frisch scheme
- Certain models from uncertain data: The algebraic case
- Title not available (Why is that?)
- Identification of static errors-in-variables models: The rank reducibility problem
This page was built for publication: Identification of the maximal number of linear relations from noisy data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673887)