-optimal Model Reduction of Linear Quadratic Output Systems in Finite Frequency Range
Abstract
Linear quadratic output systems constitute an important class of dynamical systems with numerous practical applications. When the order of these models is exceptionally high, simulating and analyzing these systems becomes computationally prohibitive. In such instances, model order reduction offers an effective solution by approximating the original high-order system with a reduced-order model while preserving the system’s essential characteristics.
In frequency-limited model order reduction, the objective is to maintain the frequency response of the original system within a specified frequency range in the reduced-order model. In this paper, a mathematical expression for the frequency-limited norm is derived, which quantifies the error within the desired frequency interval. Subsequently, the necessary conditions for a local optimum of the frequency-limited norm of the error are derived. The inherent difficulty in satisfying these conditions within a Petrov-Galerkin projection framework is also discussed. Based on the optimality conditions and Petrov-Galerkin projection, a stationary point iteration algorithm is proposed that enforces three of the four optimality conditions upon convergence. A numerical example is provided to illustrate the algorithm’s effectiveness in accurately approximating the original high-order model within the specified frequency interval.
keywords:
-optimal, frequency-limited, model order reduction, projection, reduced-order model, quadratic output1 Introduction
This study focuses on a specific class of nonlinear dynamical systems with weak nonlinearity. These systems have linear time-invariant (LTI) state equations but feature quadratic nonlinear terms in the output equation, referred to as linear quadratic output (LQO) systems [1]. They naturally arise in scenarios where it is necessary to observe quantities involving products of state components in either the time or frequency domain. For example, they are used in applications that quantify energy or power, such as the internal energy functional of a system [2] or the objective cost function in optimal quadratic control problems [3]. Additionally, they are used to measure the deviation of a state’s coordinates from a reference point, such as the root mean squared displacement of spatial coordinates around an excitation point, or in stochastic modeling for calculating the variance of a random variable [4].
Consider a LQO system described by the following state and output equations:
(1) |
wherein represents the state vector, represents inputs, and represents outputs. is the state-space realization of with , , , and . The state equation in (1) is identical to that of standard LTI systems. However, the output equation in (1) introduces a nonlinearity in the form of the quadratic function of states .
Let us denote and . The input-output mapping between and is represented by the following transfer function:
Additionally, the input-output mapping between and is represented by the following multivariate transfer function:
cf. [5].
To ensure high fidelity in the mathematical modeling of complex physical phenomena, it is often necessary to use dynamical systems with very high orders, sometimes exceeding several thousand. This high order makes it computationally difficult or even prohibitive to simulate and analyze the model (1). Therefore, it is important to approximate (1) with a reduced-order model (ROM) of much lower order (where ). This approach simplifies the simulation and analysis processes. The process of creating such a ROM while preserving the key features of the original model is known as model order reduction (MOR); refer to [6, 7, 8, 9, 10] for a deeper understanding of the topic.
Let us denote the -order ROM of as , characterized by the following state and output equations:
(2) |
wherein , , , and , satisfying the Petrov-Galerkin projection condition . The projection matrices and project onto a reduced subspace to obtain the ROM . Various MOR methods differ in how they construct and . The choice of and depends on the specific characteristics of that need to be preserved in .
Let and . The input-output relationships between and , as well as and , are described by the following transfer functions:
Throughout this paper, it is assumed that both and are Hurwitz.
The Balanced Truncation (BT) method, introduced in 1981, is a prominent technique for MOR [11]. This approach retains states that significantly effect energy transfer between inputs and outputs, discarding those with minimal impact as indicated by their Hankel singular values. A notable advantage of BT is its ability to estimate errors in advance of creating the ROM [12]. Moreover, BT preserves the stability of the original system. Originally proposed for LTI systems, BT’s application has broadened to include descriptor systems [13], second-order systems [14], linear time-varying systems [15], parametric systems [16], nonlinear systems [17], and bilinear systems [18]. Additionally, BT has been tailored to maintain specific system properties such as positive realness [19], bounded realness [20], passivity [21], and special structural characteristics [22]. For a detailed overview of the various BT algorithms, refer to the survey [23]. BT has been adapted for LQO systems in [24, 25, 26]. Of these algorithms, only the one proposed in [26] preserves the LQO structure in the ROM.
The -optimal MOR problem for standard LTI systems has been thoroughly explored in the literature. Wilson’s conditions, which are necessary conditions for achieving a local optimum of the norm of error, are outlined in [27]. The iterative rational Krylov algorithm (IRKA) was the first to apply interpolation theory to meet these conditions [28]. Other algorithms using Sylvester equations and projection have been developed and enhanced for improved robustness in [29] and [30]. Recently, the -optimal MOR problem for LQO systems has been addressed in [31], where a Sylvester equation-based algorithm has been proposed to achieve a local optimum upon convergence.
Many MOR problems are inherently frequency-limited, with certain frequency ranges being more important. For example, when creating a ROM for a notch filter, it is crucial to minimize the approximation error near the notch frequency [32]. Similarly, for closed-loop stability, the ROM of a plant must accurately capture the system’s behavior in the crossover frequency region [33, 34]. In interconnected power systems, low-frequency oscillations are essential for small-signal stability studies, so the ROM should accurately represent the behavior within the frequency range of inter-area and inter-plant oscillations [35, 36]. This need has led to frequency-limited MOR, which focuses on achieving high accuracy within specific frequency intervals rather than the entire spectrum [37].
The frequency-limited MOR problem aims to create a ROM that ensures that
are small when , , and are within the specified frequency range of rad/sec.
BT typically offers an accurate approximation of the original model across the entire frequency spectrum. In [37], BT was adapted to address the frequency-limited MOR problem, resulting in the frequency-limited BT (FLBT) algorithm. However, FLBT does not preserve the stability and a priori error bounds that BT does. The computational aspects of FLBT and efficient methods for handling large-scale systems are discussed in [38]. Additionally, FLBT has been expanded to cover a wider range of systems, including descriptor systems [39], second-order systems [40], and bilinear systems [41]. FLBT has been recently generalized for LQO systems in [42].
The frequency-limited norm for LTI systems is defined in [43], with Gramian-based conditions outlined for achieving a local optimum. Generalizations of the iterative rational Krylov algorithm (IRKA) have resulted in the development of the frequency-limited IRKA (FLIRKA) in [44, 45, 46], which approximately fulfills these conditions. This paper examines the frequency-limited -optimal MOR problem for LQO systems.
This research work makes several important contributions. First, it introduces the frequency-limited norm ( norm) for LQO systems and shows how to compute it using frequency-limited system Gramians defined in [42]. Second, it derives the necessary conditions for achieving a local optimum of . Third, it compares these conditions with those for standard -optimal model order reduction [31], highlighting that Petrov-Galerkin projection generally cannot achieve a local optimum in the frequency-limited scenario. Fourth, it proposes a stationary point algorithm based on Petrov-Galerkin projection, which meets three of the four necessary conditions for optimality upon convergence. The paper includes a numerical example demonstrating the algorithm’s accuracy within the specified frequency range and showing it outperforms existing methods.
2 Literature Review
In this section, we will briefly explore two key MOR algorithms relevant to LQO systems within the context of the problem at hand. The first is the FLBT [42], and the second is the -optimal MOR method [31].
2.1 Frequency-limited Balanced Truncation (FLBT) [42]
FLBT creates the ROM by truncating states that contribute minimally to the input-output energy transfer within the desired frequency range of rad/sec. This is achieved by constructing a frequency-limited balanced realization using frequency-limited Gramians and then truncating the states corresponding to the smallest frequency-limited Hankel singular values.
The frequency-limited controllability Gramian within the desired frequency interval rad/sec is given by
Next, we define as
With this, can be computed by solving the following Lyapunov equation:
(3) |
The frequency-limited observability Gramian within the frequency range rad/sec is defined as
, , and can be determined by solving the following Lyapunov equations:
The frequency-limited Hankel singular values are defined as
where denotes the eigenvalues. The projection matrices in FLBT are then computed such that , where are the largest frequency-limited Hankel singular values of .
2.2 -optimal MOR Algorithm (HOMORA) [31]
Let us define the matrices , , , , , , , and , which satisfy the following set of linear matrix equations:
According to [31], the necessary conditions for achieving a local optimum of the (squared) -norm of the error, denoted as , are described by the following set of equations:
(4) | ||||
(5) | ||||
(6) | ||||
(7) |
Furthermore, it is shown that these optimality conditions can be met by setting the projection matrices as and . Starting with an initial guess for the ROM, the projection matrices are iteratively updated until convergence, at which point the optimality conditions (4)-(7) are satisfied.
3 Main Work
In this section, we define the frequency-limited norm and establish its connection to the frequency-limited observability Gramian. We then derive the necessary conditions for achieving a local optimum of the (squared) frequency-limited norm of the error. Building on these optimality conditions, we present a projection-based iterative algorithm that meets three of the four optimality conditions. The challenge of satisfying the fourth optimality condition within the projection framework is also discussed. Finally, the computational aspects of the proposed algorithm are briefly discussed.
3.1 norm Definition
The classical norm for LQO systems is defined in the frequency domain as follows:
cf. [5, 31]. The norm quantifies the output response’s power to unit white noise across the entire frequency spectrum. However, for the problem at hand, we are only interested in the output response’s power within a specific, limited frequency range. This leads to the definition of the frequency-limited norm.
Definition 3.1.
The frequency-limited norm of the LQO system within the frequency interval rad/sec is defined as
Proposition 3.2.
The norm is related to the frequency-limited observability Gramian as follows:
Proof.
Observe that
Additionally, note that
Therefore, we have . ∎
3.2 Norm of the Error
Let us define with the following state-space equations
wherein
(8) |
Let us define as follows
Then the frequency-limited controllability Gramian and the frequency-limited observability Gramian of realization can be determined by solving the following Lyapunov equations:
Let us partition , , , and according to (8) as follows:
Additionally, define as
The following linear matrix equations then hold:
(9) | |||
(10) | |||
(11) | |||
(12) | |||
(13) | |||
(14) | |||
(15) | |||
(16) |
Finally, the norm of can be expressed as:
Corollary 3.3.
The expression holds, where denotes the inner product of and .
Proof.
The first and last terms in the expression for are straightforward. The main objective is to demonstrate that the middle term corresponds to the inner product of and . By expanding the definition of the inner product, we can express it as:
Furthermore,
The Sylvester equations (11) and (13) can be solved by evaluating the following integrals:
cf. [26, 42] Consequently, the inner product between and can be written as
∎
3.3 Optimality Conditions
In this subsection, we present the necessary conditions for achieving a local optimum of . These optimality conditions require the introduction of several new variables. We begin by defining and as the solutions to the following equations:
It is important to note that , , and can be derived from , , and , respectively, by restricting the integration limits to rad/sec in their integral definitions. Next, we define , , , and as follows:
(17) | ||||
(18) | ||||
(19) | ||||
(20) |
Additionally, we define , and as follows:
where denotes the Fr’echet derivative of the matrix logarithm in the direction of the matrix , specifically:
cf. [47].
We are now ready to state the necessary conditions for a local optimum of .
Theorem 3.4.
The local optimum of must satisfy the following necessary conditions:
(21) | ||||
(22) | ||||
(23) | ||||
(24) |
Proof.
The proof of this theorem is lengthy and complex, so it is provided in the Appendix A. ∎
3.4 Comparison with Local Optimum of
In this subsection, we compare the necessary conditions for the local optima of and . To begin, we provide the expression for as presented in [26]. The controllability Gramian and the observability Gramian of realization can be computed by solving the following Lyapunov equations:
We then partition , , , and according to (8) as follows:
The norm of can be expressed as:
The optimality conditions (21)-(24) and (4)-(7) are similar, but there are some important differences. By restricting the integration limit of and to rad/sec, the optimality conditions (22)-(24) can be derived from (5)-(7), respectively. However, the optimality condition (4) does not simplify to (21) by merely limiting the integration range.
Furthermore, from the optimality conditions (5)-(7), we can deduce the optimal selections for , , and as:
(25) | ||||
(26) | ||||
(27) |
By restricting the integration limits of and to rad/sec, we can derive the frequency-limited optimal choices for , , and from (25)-(27) as follows:
(28) | ||||
(29) | ||||
(30) |
The optimal projection matrices and for computing a local optimum of are given by:
In the frequency-limited scenario, by setting:
we make with the optimal choices for , , and as indicated by the optimality conditions (22)-(24). However, with this choice of and , determining an optimal remains elusive. By enforcing the Petrov–Galerkin projection condition , we ensure
It is important to note that, generally, does not simplify to zero with this choice of projection matrices. Consequently, this selection introduces a deviation in the optimality condition (21) quantified by . In contrast, in the classical -optimal MOR framework, enforcing the Petrov–Galerkin projection condition satisfies the optimality condition (4) and achieves a local optimum of . In summary, it is generally impossible to attain a local optimum of within the projection framework. While the optimality conditions (22)-(24) can be precisely met, the optimality condition (21) can only be approximately satisfied.
Up to this point, we have determined the appropriate projection matrices and for the problem at hand. However, these matrices depend on the ROM , which is unknown. Therefore, equations (2) and (9)-(14) form a coupled system of equations, expressed as:
The stationary points of the function
satisfy the optimality conditions (22)-(24). Additionally, by enforcing the Petrov-Galerkin projection condition , the optimality condition (21) is nearly satisfied, with the deviation quantified by . In the classical -optimal MOR scenario, the situation is similar; however, enforcing the Petrov–Galerkin projection condition at the stationary points ensures that all the optimality conditions (4)-(7) are fully satisfied.
In the classical -optimal MOR case, it is demonstrated that if the reduction matrices are chosen as and instead of and , the stationary points satisfy:
Thus, the projection matrices and , along with the Petrov–Galerkin projection condition , satisfy all the optimality conditions (4)-(7). However, using and along with the Petrov–Galerkin projection condition does not satisfy any of the optimality conditions (21)-(24).
Theorem 3.5.
Proof.
The proof is provided in Appendix B. ∎
3.5 Algorithm
So far, for simplicity, we have considered and as complex matrices in the problem under consideration. However, in practice, using complex projection matrices results in a complex ROM, which is undesirable since most practical dynamical systems are represented by real mathematical models. This issue can be addressed by extending the desired frequency interval to include negative frequencies, i.e., rad/sec. Additionally, we have assumed that the desired frequency interval starts from rad/sec for simplicity. For any general frequency interval rad/sec, the only modification needed is in the computation of and given by:
(32) | ||||
(33) |
see [48] for more details.
We are now ready to present the algorithm, referred to in this paper as the “Frequency-limited Near-optimal Iterative Algorithm (FLHNOIA)”. The algorithm begins with an arbitrary initial guess for the ROM and iteratively updates it until convergence is achieved. Convergence is quantified by the stagnation in the relative change of the state-space matrices of the ROM. In each iteration, Steps (4) and (5) calculate the projection matrices, while Steps (6)-(10) bi-orthogonalize these matrices using the bi-orthogonal Gram–Schmidt method to ensure that .
Input: Full order system: ; Desired frequency interval: rad/sec; Initial guess of ROM: ; Tolerance: . Output: ROM: .
Remark 1.
For evaluating convergence, observing the stagnation of the ROM poles provides a more dependable measure compared to analyzing state-space realizations. This is because -optimal MOR techniques often produce ROMs with varied state-space representations but identical transfer functions. Therefore, the stagnation of ROM poles is commonly used as a convergence criterion in -optimal MOR algorithms, due to its proven effectiveness [44].
3.6 Computational Aspects
In this subsection, we briefly discuss the efficient implementation of FLHNOIA. Step (1) of FLHNOIA involves the computation of the matrix logarithm , which can become computationally expensive when the order of the original model is large. In such cases, Krylov subspace-based methods proposed in [38] can be utilized to approximate , , and . The most computationally intensive task in each iteration is solving the Sylvester equations (9), (11), and (13). The state-space matrices of most high-order dynamical systems are sparse, making these equations “sparse-dense” Sylvester equations, which are commonly encountered in -optimal MOR algorithms. A “sparse-dense” Sylvester equation typically has the structure:
where the large matrices and () are sparse, while the smaller matrices and are dense. An efficient algorithm for solving this type of Sylvester equation is proposed in [30]. The remaining steps in FLHNOIA involve basic matrix computations and the solution of simple Lyapunov equations, which can be executed with minimal computational cost.
4 Illustrative Example
This section provides an illustrative example to validate the key properties of FLHNOIA. Consider a sixth-order LQO system defined by the following state-space representation:
The desired frequency range for this example is rad/sec. To initialize FLHNOIA, the following initial guess is employed:
FLHNOIA was terminated when the change in eigenvalues of stagnated, as the change in the ROM’s state-space realization persisted. The resulting final ROM is:
The numerical results below confirm that this ROM effectively satisfies the optimality conditions (22)-(24):
Next, a third-order ROM is generated using BT, FLBT, and HOMORA, with the same initial ROM used to initialize HOMORA. Figures 1 and 2 display the relative error on a logarithmic scale within the specified frequency range of to rad/sec. As illustrated, FLBT and FLHNOIA exhibit superior accuracy.


5 Conclusion
This research addresses the problem of -optimal MOR within a specified finite frequency range. To measure the output strength within this range, we introduce the frequency-limited norm for LQO systems. We derive the necessary conditions for achieving local optima of the squared frequency-limited norm of the error and compare these conditions to those of the standard, unconstrained -optimal MOR problem. The study highlights the limitations of the Petrov-Galerkin projection method in satisfying all optimality conditions in the frequency-limited context. As a result, we propose a Petrov-Galerkin projection algorithm that meets three out of the four optimality conditions. Numerical experiments are conducted to validate the theoretical results and demonstrate the algorithm’s effectiveness in achieving high accuracy within the specified frequency range.
Appendix A
In this appendix, we present the proof of Theorem 3.4. Throughout the proof, the following properties of the trace operation are utilized repeatedly:
-
1.
Trace of Hermitian: .
-
2.
Circular permutation in trace: .
-
3.
Trace of addition: ;
cf. [49].
Let us define the cost function as the component of that depends on the ROM, expressed as:
When a small first-order perturbation is added to , changes to . This causes and to perturb to and , respectively. Consequently, the first-order terms of are given by:
Furthermore, it is evident from (15) and (16) that and satisfy the following Lyapunov equations:
where
cf. [47]. Since we are only concerned with first-order perturbations, the term will be omitted for the rest of the proof. Now,
Similarly, note that:
Therefore:
Since
we have:
cf. [50]. Note that
Additionally, note that
Thus,
Recall that
By exchanging the trace and integral operations, we obtain
cf. [48]. Hence,
Therefore, the gradient of with respect of is given by
cf. [47]. Consequently,
(34) |
is a necessary condition for a local optimum of . Moreover, substituting (17)-(20) into (34), it simplifies to
Additionally, since and , we arrive at
By introducing a small first-order perturbation to , is perturbed to . Consequently, and are perturbed to and , respectively. As a result, the first-order terms of are given by
Furthermore, it can be easily observed from (15) and (16) that and satisfy the following Lyapunov equations:
Observe that
Additionally, note that
Thus, becomes
Hence, the gradient of with respect to is given by
Therefore,
is a necessary condition for the local optimum of .
By introducing a small first-order perturbation to , is perturbed to . Consequently, , , and are perturbed to , , , and , respectively. As a result, the first-order terms of are given by
It follows from (9)-(16) that , , , and satisfy the following equations:
Note that
Furthermore,
Thus,
Additionally,
Similarly,
Thus,
Therefore, the gradient of with respect to is
Hence,
is a necessary condition for the local optimum of .
First, we reformat the cost function as follows:
Since
we can write
cf. [50]. By adding a small first-order perturbation to , the cost function is perturbed to . The first-order terms of are given by:
Thus, the gradient of with respect to is:
Therefore, the necessary condition for the local optimum of is:
This concludes the proof.
Appendix B
References
- [1] J. M. Montenbruck, S. Zeng, F. Allgöwer, Linear systems with quadratic outputs, in: 2017 American Control Conference (ACC), IEEE, 2017, pp. 1030–1034.
- [2] A. Van Der Schaft, Port-hamiltonian systems: An introductory survey, in: International Congress of Mathematicians, European Mathematical Society Publishing House (EMS Ph), 2006, pp. 1339–1365.
- [3] B. Picinbono, P. Devaut, Optimal linear-quadratic systems for detection and estimation, IEEE Transactions on Information Theory 34 (2) (1988) 304–311.
- [4] Q. Aumann, S. W. Werner, Structured model order reduction for vibro-acoustic problems using interpolation and balancing methods, Journal of Sound and Vibration 543 (2023) 117363.
- [5] S. Reiter, S. W. Werner, Interpolatory model order reduction of large-scale dynamical systems with root mean squared error measures, arXiv preprint arXiv:2403.08894 (2024).
- [6] R. Van Beeumen, K. Van Nimmen, G. Lombaert, K. Meerbergen, Model reduction for dynamical systems with quadratic output, International Journal for Numerical Methods in Engineering 91 (3) (2012) 229–248.
- [7] P. Benner, V. Mehrmann, D. C. Sorensen, Dimension reduction of large-scale systems, Vol. 45, Springer, 2005.
- [8] A. Antoulas, D. Sorensen, K. A. Gallivan, P. Van Dooren, A. Grama, C. Hoffmann, A. Sameh, Model reduction of large-scale dynamical systems, in: Computational Science-ICCS 2004: 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III 4, Springer, 2004, pp. 740–747.
- [9] A. C. Antoulas, R. Ionutiu, N. Martins, E. J. W. ter Maten, K. Mohaghegh, R. Pulch, J. Rommes, M. Saadvandi, M. Striebel, Model order reduction: Methods, concepts and properties, Coupled Multiscale Simulation and Optimization in Nanoelectronics (2015) 159–265.
- [10] A. C. Antoulas, C. A. Beattie, S. Gugercin, Interpolatory methods for model reduction, SIAM, 2020.
- [11] B. Moore, Principal component analysis in linear systems: Controllability, observability, and model reduction, IEEE Transactions on Automatic Control 26 (1) (1981) 17–32.
- [12] D. F. Enns, Model reduction with balanced realizations: An error bound and a frequency weighted generalization, in: The 23rd IEEE Conference on Decision and Control, IEEE, 1984, pp. 127–132.
- [13] V. Mehrmann, T. Stykel, Balanced truncation model reduction for large-scale systems in descriptor form, in: Dimension Reduction of Large-Scale Systems: Proceedings of a Workshop held in Oberwolfach, Germany, October 19–25, 2003, Springer, 2005, pp. 83–115.
- [14] T. Reis, T. Stykel, Balanced truncation model reduction of second-order systems, Mathematical and Computer Modelling of Dynamical Systems 14 (5) (2008) 391–406.
- [15] H. Sandberg, A. Rantzer, Balanced truncation of linear time-varying systems, IEEE Transactions on Automatic Control 49 (2) (2004) 217–229.
- [16] N. T. Son, P.-Y. Gousenbourger, E. Massart, T. Stykel, Balanced truncation for parametric linear systems using interpolation of gramians: a comparison of algebraic and geometric approaches, Model Reduction of Complex Dynamical systems (2021) 31–51.
- [17] B. Kramer, K. Willcox, Balanced truncation model reduction for lifted nonlinear systems, in: Realization and Model Reduction of Dynamical Systems: A Festschrift in Honor of the 70th Birthday of Thanos Antoulas, Springer, 2022, pp. 157–174.
- [18] P. Benner, P. Goyal, M. Redmann, Truncated gramians for bilinear systems and their advantages in model order reduction, Model reduction of Parametrized Systems (2017) 285–300.
- [19] N. Wong, V. Balakrishnan, Fast positive-real balanced truncation via quadratic alternating direction implicit iteration, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 26 (9) (2007) 1725–1731.
- [20] C. Guiver, M. R. Opmeer, Bounded real and positive real balanced truncation for infinite-dimensional systems, Mathematical Control and Related Fields 3 (1) (2013) 83–119.
- [21] N. Wong, V. Balakrishnan, C.-K. Koh, Passivity-preserving model reduction via a computationally efficient project-and-balance scheme, in: Proceedings of the 41st Annual Design Automation Conference, 2004, pp. 369–374.
- [22] A. Sarkar, J. M. Scherpen, Structure-preserving generalized balanced truncation for nonlinear Port-Hamiltonian systems, Systems & Control Letters 174 (2023) 105501.
- [23] S. Gugercin, A. C. Antoulas, A survey of model reduction by balanced truncation and some new results, International Journal of Control 77 (8) (2004) 748–766.
- [24] R. Van Beeumen, K. Meerbergen, Model reduction by balanced truncation of linear systems with a quadratic output, in: AIP Conference Proceedings, Vol. 1281, American Institute of Physics, 2010, pp. 2033–2036.
- [25] R. Pulch, A. Narayan, Balanced truncation for model order reduction of linear dynamical systems with quadratic outputs, SIAM Journal on Scientific Computing 41 (4) (2019) A2270–A2295.
- [26] P. Benner, P. Goyal, I. P. Duff, Gramians, energy functionals, and balanced truncation for linear dynamical systems with quadratic outputs, IEEE Transactions on Automatic Control 67 (2) (2021) 886–893.
- [27] D. Wilson, Optimum solution of model-reduction problem, in: Proceedings of the Institution of Electrical Engineers, Vol. 117, IET, 1970, pp. 1161–1165.
- [28] S. Gugercin, A. C. Antoulas, C. Beattie, model reduction for large-scale linear dynamical systems, SIAM journal on matrix analysis and applications 30 (2) (2008) 609–638.
- [29] Y. Xu, T. Zeng, Optimal model reduction for large scale MIMO systems via tangential interpolation, International Journal of Numerical Analysis & Modeling 8 (1) (2011).
- [30] P. Benner, M. Køhler, J. Saak, Sparse-dense Sylvester equations in -model order reduction, Preprint MPIMD/11-11, Max Planck Institute Magdeburg, available from http://www.mpi-magdeburg.mpg.de/preprints/ (Dec. 2011).
- [31] S. Reiter, I. Pontes Duff, I. V. Gosea, S. Gugercin, optimal model reduction of linear systems with multiple quadratic outputs, arXiv preprint arXiv:2405.05951 (2024).
- [32] R. W. Aldhaheri, Frequency-domain model reduction approach to design iir digital filters using orthonormal bases, AEU-International Journal of Electronics and Communications 60 (6) (2006) 413–420.
- [33] G. Obinata, B. D. Anderson, Model reduction for control system design, Springer Science & Business Media, 2012.
- [34] D. F. Enns, Model reduction for control system design, Tech. Rep. NASA-CR-170417, NASA, CA (1985).
- [35] U. Zulfiqar, V. Sreeram, X. Du, Finite-frequency power system reduction, International Journal of Electrical Power & Energy Systems 113 (2019) 35–44.
- [36] U. Zulfiqar, V. Sreeram, X. Du, Frequency-limited pseudo-optimal rational Krylov algorithm for power system reduction, International Journal of Electrical Power & Energy Systems 118 (2020) 105798.
- [37] W. Gawronski, J.-N. Juang, Model reduction in limited time and frequency intervals, International Journal of Systems Science 21 (2) (1990) 349–376.
- [38] P. Benner, P. Kürschnerrschner, J. Saak, Frequency-limited balanced truncation with low-rank approximations, SIAM Journal on Scientific Computing 38 (1) (2016) A471–A499.
- [39] M. Imran, A. Ghafoor, Model reduction of descriptor systems using frequency limited Gramians, Journal of the Franklin Institute 352 (1) (2015) 33–51.
- [40] P. Benner, S. W. Werner, Frequency-and time-limited balanced truncation for large-scale second-order systems, Linear Algebra and its Applications 623 (2021) 68–103.
- [41] H. R. Shaker, M. Tahavori, Frequency-interval model reduction of bilinear systems, IEEE Transactions on Automatic Control 59 (7) (2013) 1948–1953.
- [42] Q.-Y. Song, U. Zulfiqar, Z.-H. Xiao, M. M. Uddin, V. Sreeram, Balanced truncation of linear systems with quadratic outputs in limited time and frequency intervals, arXiv preprint arXiv:2402.11445 (2024).
- [43] D. Petersson, J. Löfberg, Model reduction using a frequency-limited -cost, Systems & Control Letters 67 (2014) 32–39.
- [44] P. Vuillemin, C. Poussot-Vassal, D. Alazard, optimal and frequency limited approximation methods for large-scale LTI dynamical systems, IFAC Proceedings Volumes 46 (2) (2013) 719–724.
- [45] X. Du, K. I. B. Iqbal, M. M. Uddin, A. M. Fony, M. T. Hossain, M. I. Ahmad, M. S. Hossain, Computational techniques for optimal frequency-limited model order reduction of large-scale sparse linear systems, Journal of Computational Science 55 (2021) 101473.
- [46] U. Zulfiqar, X. Du, Q.-Y. Song, V. Sreeram, On frequency-and time-limited -optimal model order reduction, Automatica 153 (2023) 111012.
- [47] N. J. Higham, Functions of matrices: theory and computation, SIAM, 2008.
- [48] D. Petersson, A nonlinear optimization approach to -optimal modeling and control, Ph.D. thesis, Linköping University Electronic Press (2013).
- [49] K. B. Petersen and M. S. Pedersen, The matrix cookbook, Technical University of Denmark 7 (15) (2008) 510.
- [50] U. Zulfiqar, V. Sreeram, X. Du, Adaptive frequency-limited -model order reduction, Asian Journal of Control 24 (6) (2022) 2807–2823.