The constrained least-squares n × n-matrix problem where the feasibility set is the subspace of the Toeplitz matrices is analyzed. The general, the upper and lower triangular cases are solved by ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback