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.











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)