Cited by 28

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

An efficient algorithm to test the observability of rational nonlinear systems with unmeasured inputs

Shi, X., Chatzis, M.N.·2022·Mechanical Systems and Signal Processing

Overview

Integrity signals

Registry

Crossref · 10.1016/j.ymssp.2021.108345

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 2 references

Research works printed but not linked: 25

  1. Chatzis, 2015, On the observability and identifiability of nonlinear structural and mechanical systems, Struct. Control Health Monit., 22, 574, 10.1002/stc.1690 · DOI · Paper page
  2. Sedoglavic, 2002, A probabilistic algorithm to test local algebraic observability in polynomial time, J. Symbolic Comput., 33, 735, 10.1006/jsco.2002.0532 · DOI
  3. Merkt, 2015, Higher-order Lie symmetries in identifiability and predictability analysis of dynamic models, Phys. Rev. E, 92, 10.1103/PhysRevE.92.012920 · DOI
  4. X. Shi, M.N. Chatzis, Lie symmetries, observability and model transformation of nonlinear systems with unknown inputs, in: Proceedings of the XI International Conference on Structural Dynamics, EURODYN, Athens, Greece, 2020, pp. 901–911. · DOI
  5. Miao, 2011, On identifiability of nonlinear ODE models and applications in viral dynamics, Soc. Ind. Appl. Math., 53, 3
  6. S. Diop, M. Fliess, Nonlinear observability, identifiability, and persistent trajectories, in: Proceedings of the 30th IEEE Conference on Decision and Control, Brighton, UK, 1991, pp. 714–719. · DOI
  7. Pohjanpalo, 1978, System identifiability based on the power series expansion of the solution, Math. Biosci., 41, 21, 10.1016/0025-5564(78)90063-9 · DOI · Paper page
  8. Vajda, 1989, Similarity transformation approach to identifiability analysis of nonlinear compartmental models, Math. Biosci., 93, 217, 10.1016/0025-5564(89)90024-2 · DOI
  9. Ljung, 1994, On global identifiability for arbitrary model parametrizations, Automatica, 30, 265, 10.1016/0005-1098(94)90029-9 · DOI
  10. Boulier, 2009, Computing representations for radicals of finitely generated differential ideals, Appl. Algebra Eng. Commun. Comput., 20, 73, 10.1007/s00200-009-0091-7 · DOI
  11. Franco, 2005, On the uniqueness of solutions for the identification of linear structural systems, J. Appl. Mech., 73, 153, 10.1115/1.2062829 · DOI
  12. Maes, 2021, Observability of modally reduced order models with unknown parameters, Mech. Syst. Signal Process., 146, 1, 10.1016/j.ymssp.2020.106993 · DOI · Paper page
  13. Gillijns, 2007, Unbiased minimum-variance input and state estimation for linear discrete-time systems with direct feedthrough, Automatica, 43, 934, 10.1016/j.automatica.2006.11.016 · DOI
  14. Naets, 2015, An online coupled state/input/parameter estimation approach for structural dynamics, Comput. Methods Appl. Mech. Engrg., 283, 1167, 10.1016/j.cma.2014.08.010 · DOI
  15. Dertimanis, 2019, Input-state-parameter estimation of structural systems from limited output information, Mech. Syst. Signal Process., 126, 711, 10.1016/j.ymssp.2019.02.040 · DOI
  16. A. Martinelli, Extension of the observability rank condition to nonlinear systems driven by unknown inputs, in: Proceedings of the 23rd Mediterranean Conference on Control and Automation (MED), Torremolinos, Spain, 2015, pp. 589–595. · DOI
  17. Maes, 2019, Observability of nonlinear systems with unmeasured inputs, Mech. Syst. Signal Process., 130, 378, 10.1016/j.ymssp.2019.05.010 · DOI
  18. De Jager, 1995, The use of symbolic computation in nonlinear control: is it viable?, IEEE Trans. Automat. Control, 40, 84, 10.1109/9.362897 · DOI
  19. Villaverde, 2019, Full observability and estimation of unknown inputs, states and parameters of nonlinear biological models, R. Soc. Publ., 16
  20. Martinez, 2020, Nonlinear observability algorithms with known and unknown inputs: Analysis and implementation, Mathematics, 8, 1876, 10.3390/math8111876 · DOI
  21. Kugi, 1999, Symbolic computation for the analysis and synthesis of nonlinear control systems, Trans. Eng. Sci., 22, 255
  22. J. Karlsson, M. Anguelova, M. Jirstrand, An efficient method for structural identifiability analysis of large dynamic systems, in: Proceedings of the 16th International Federation of Automatic Control, Vol. 45, Brussels, Belgium, 2012, pp. 941–946. · DOI
  23. Shi, 2021, A robust algorithm to test the observability of large linear systems with unknown parameters, Mech. Syst. Signal Process., 157, 1, 10.1016/j.ymssp.2021.107633 · DOI
  24. Margaria, 2004, Structural identifiability analysis of some highly structured families of state space models using differential algebra, J. Math. Biol., 49, 433, 10.1007/s00285-003-0261-3 · DOI
  25. Brent, 1978, Fast algorithms for manipulating formal power series, J. Assoc. Comput. Mach., 25, 581, 10.1145/322092.322099 · DOI

Cited by

Sorted by citations

See all 28

Metadata

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An efficient algorithm to test the observability of rational nonlinear systems with unmeasured inputs. https://app.cochat.ai/papers/10.1016/j.ymssp.2021.108345
The paper
Shi, X., & Chatzis, M. N. (2022). An efficient algorithm to test the observability of rational nonlinear systems with unmeasured inputs. Mechanical Systems and Signal Processing. https://doi.org/10.1016/j.ymssp.2021.108345