The robustness analysis problem of a class of nonlinear descriptor systems is studied. Nonlinear matrix inequality which has the good computation property of convex feasibility is employed to derive some sufficient co...The robustness analysis problem of a class of nonlinear descriptor systems is studied. Nonlinear matrix inequality which has the good computation property of convex feasibility is employed to derive some sufficient conditions to guarantee that the nonlinear descriptor systems have robust disturbance attenuation performance, which (avoids) the computational difficulties in conversing nonlinear matrix and Hamilton-Jacobi inequality. The computation property of convex feasibility of nonlinear matrix inequality makes it possible to apply the results of nonlinear robust control to practice.展开更多
基金ProjectsupportedbytheTeachingandResearchAwardProgramforOutstandingYoungTeachersinHigherEducationInstitutionsofMOE China
文摘The robustness analysis problem of a class of nonlinear descriptor systems is studied. Nonlinear matrix inequality which has the good computation property of convex feasibility is employed to derive some sufficient conditions to guarantee that the nonlinear descriptor systems have robust disturbance attenuation performance, which (avoids) the computational difficulties in conversing nonlinear matrix and Hamilton-Jacobi inequality. The computation property of convex feasibility of nonlinear matrix inequality makes it possible to apply the results of nonlinear robust control to practice.
