Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   show that a couple of matrices A, B (a ‘dynamic’ and a ‘control’ matrix), whose components are in general functions of both state and control variables, can be associated to any stationary nonlinear system whose system function is meromorphic (e.g. all components are ratios of analytic functions) in a way consistent with linear systems theory, and such that the test of accessibility (from a point p of the system domain) can be carried out formally as the controllability test for linear systems: the controllability matrix is build up and the full rank condition checked at the point p. This allows to make the test noticeably easier than the classical accessibility tests so far available in the literature. Further, it is proved that the accessibility from a point p implies the accessibility from every point of the largest open convex subset of the system domain including p, which, for the sub class of σπ-systems (in IRn) can be readily determined as a certain union of orthants of IRn.
['Francesco Carravetta']
I am writing a research paper on a idea On testing the strong accessibility of a nonlinear control system
[{"from": "human", "value": "I am writing a research paper on a idea On testing the strong accessibility of a nonlinear control system"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   show that a couple of matrices A, B (a \u2018dynamic\u2019 and a \u2018control\u2019 matrix), whose components are in general functions of both state and control variables, can be associated to any stationary nonlinear system whose system function is meromorphic (e.g. all components are ratios of analytic functions) in a way consistent with linear systems theory, and such that the test of accessibility (from a point p of the system domain) can be carried out formally as the controllability test for linear systems: the controllability matrix is build up and the full rank condition checked at the point p. This allows to make the test noticeably easier than the classical accessibility tests so far available in the literature. Further, it is proved that the accessibility from a point p implies the accessibility from every point of the largest open convex subset of the system domain including p, which, for the sub class of \u03c3\u03c0-systems (in IRn) can be readily determined as a certain union of orthants of IRn."}]