A program for solving the \(L_ 2\) reduced-order model problem with fixed denominator degree
From MaRDI portal
Publication:1895877
DOI10.1007/BF02141596zbMath0830.65066MaRDI QIDQ1895877
Michela Redivo-Zaglia, Antonio Lepschy, Wiesław Krajewski, Umberto Viaro
Publication date: 4 February 1996
Published in: Numerical Algorithms (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) System structure simplification (93B11) Large-scale systems (93A15)
Related Items (5)
On MIMO model reduction by the weighted equation-error approach ⋮ A method for the integer-order approximation of fractional-order systems ⋮ Convergence of the iterative rational Krylov algorithm ⋮ Revisiting IRKA: connections with pole placement and backward stability ⋮ na8
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identification and rational \(L^ 2\) approximation: A gradient algorithm
- On model reduction by \(L_ 2\)-optimal pole retention
- Reduced order modelling of linear multivariable systems using an error minimization technique
- A new algorithm for \(L_ 2\) optimal model reduction
- Optimality conditions in multivariable \(L_ 2\) model reduction
- Second-order algorithm for optimal model order reduction
- The optimal projection equations for model reduction and the relationships among the methods of Wilson, Skelton, and Moore
- A new algorithm for optimal reduction of multivariable systems
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Optimal chained aggregation for reduced-order modeling†
- Homotopy methods for solving the optimal projection equations for theH2reduced order model problem
- Linear system reduction using Pade approximation to allow retention of dominant modes
- Model reduction for multivariable systems
- Synthesis of n-Reactance Networks for Desired Transient Response
This page was built for publication: A program for solving the \(L_ 2\) reduced-order model problem with fixed denominator degree
