A descriptor solution to a class of discrete distance problems
From MaRDI portal
The Nehari approximation problem for discrete systems is considered and this paper gives a general solution in a descriptor framework. One avoids the problem associated with unbounded \(D\)-matrices in the solution representation formula for the optimal case.
Recommendations
- The class of suboptimal and optimal solutions to the discrete Nehari problem: characterization and computation
- Extended Nehari problem for time-variant discrete systems
- The four-block Adamjan-Arov-Krein problem for discrete-time systems
- On the closest stable descriptor system in the respective spaces RH₂ and RH_
- The Suboptimal Nehari Problem for Well-Posed Linear Systems
Cited in
(3)
This page was built for publication: A descriptor solution to a class of discrete distance problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373062)