This paper presents an efficient model reduction technique for linear time-varying systems based on shifted Legendre polynomials.The approach constructs approximate low-rank decomposition factors of finite-time Gramia...This paper presents an efficient model reduction technique for linear time-varying systems based on shifted Legendre polynomials.The approach constructs approximate low-rank decomposition factors of finite-time Gramians directly from the expansion coefficients of impulse responses.Leveraging these factors,we develop two model reduction algorithms that integrate the low-rank square root method with dominant subspace projection.Our method is computationally efficient and flexible,requiring only a few matrix-vector operations and a singular value decomposition of a low-dimensional matrix,thereby avoiding the need to solve differential Lyapunov equations.Numerical experiments confirm the effectiveness of the proposed approach.展开更多
文摘This paper presents an efficient model reduction technique for linear time-varying systems based on shifted Legendre polynomials.The approach constructs approximate low-rank decomposition factors of finite-time Gramians directly from the expansion coefficients of impulse responses.Leveraging these factors,we develop two model reduction algorithms that integrate the low-rank square root method with dominant subspace projection.Our method is computationally efficient and flexible,requiring only a few matrix-vector operations and a singular value decomposition of a low-dimensional matrix,thereby avoiding the need to solve differential Lyapunov equations.Numerical experiments confirm the effectiveness of the proposed approach.
