What ODE-Approximation Schemes of Time-Delay Systems Reveal about Lyapunov-Krasovskii Functionals
원문 초록
The article proposes an approach to complete-type and related Lyapunov-Krasovskii functionals that neither requires knowledge of the delay-Lyapunov matrix function nor does it involve linear matrix inequalities. The approach is based on ordinary differential equations (ODEs) that approximate the time-delay system. The ODEs are derived via spectral methods, e.g., the Chebyshev collocation method (also called pseudospectral discretization) or the Legendre tau method. A core insight is that the Lyapunov-Krasovskii theorem resembles a theorem for Lyapunov-Rumyantsev partial stability in ODEs. For the linear approximating ODE, only a Lyapunov equation has to be solved to obtain a partial Lyapunov function. The latter approximates the Lyapunov-Krasovskii functional. Results are validated by applying Clenshaw-Curtis and Gauss quadrature to a semi-analytical result of the functional, yielding a comparable finite-dimensional approximation. In particular, the article provides a formula for a tight quadratic lower bound, which is important in applications. Examples confirm that this new bound is significantly less conservative than known results.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
How Far Are We from Optimal Reasoning Efficiency?
A Dictionary of Closed-Form Kernel Mean Embeddings
Force-Free Molecular Dynamics Through Autoregressive Equivariant Networks
Underdamped Diffusion Bridges with Applications to Sampling
Provable Quantum Algorithm Advantage for Gaussian Process Quadrature
FNIN: A Fourier Neural Operator-based Numerical Integration Network for Surface-form-gradients
토론
이 논문과 연결된 포럼 글이 아직 없습니다.