Skip to content
naulon
Not checkedNot checked for notices yet.

Reduction of Large-Scale Dynamical Systems by Extended Balanced Singular Perturbation Approximation

Santosh Kumar Suman, Awadhesh Kumar

International Journal of Mathematical, Engineering and Management Sciences · 2020

doi:10.33889/ijmems.2020.5.5.072 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

A simplified approach for model order reduction (MOR) idea is planned for better understanding and explanation of large- scale linear dynamical (LSLD) system. Such approaches are designed to well understand the description of the LSLD system based upon the Balanced Singular Perturbation Approximation (BSPA) approach. BSPA is tested for minimum / non-minimal and continuous/discrete-time systems valid for linear time-invariant (LTI) systems. The reduced-order model (ROM) is designed to preserved complete parameters with reasonable accuracy employing MOR. The Proposed approach is based upon retaining the dominant modes (may desirable states) of the system and eliminating comparatively the less significant eigenvalues. As the ROM has been derived from retaining the dominant modes of the large- scale linear dynamical stable system, which preserves stability. The strong aspect of the balanced truncation (BT) method is that the steady-state values of the ROM do not match with the original system (OS). The singular perturbation approximation approach (SPA) has been used to remove this drawback. The BSPA has been efficaciously applied on a large-scale system and the outcomes obtained show the efficacy of the approach. The time and frequency response of an approximated system has been also demonstrated by the proposed approach, which proves to be an excellent match as compared to the response obtained by other methods in the literature review with the original system.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.