Finding the closest Toeplitz matrix
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 making use of the singular value decomposition. For the symmetric case, an algorithm based on the alterna...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2003
|
| Assuntos: | |
| Texto completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022003000100001 |
| País: | Brasil |
| Oai: | oai:scielo:S1807-03022003000100001 |