You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The Procrustes method can be solved where the transformation is a Toeplitz matrix http://dx.doi.org/10.1155/2013/696019
I don't know any applications of this, so I consider it low priority. But it does look straightforward.
The text was updated successfully, but these errors were encountered:
A key question is whether the "closest Toeplitz matrix" or "closest Hankel matrix" to a given matrix is useful? Or are there cases wehre the transformation as a Hankel/Toeplitz matrix.
Thank you for your interest. I would assume you want to learn how to start. You can go through our Procrustes paper (https://doi.org/10.1016/j.cpc.2022.108334) as well as this one (http://dx.doi.org/10.1155/2013/696019). You can get familiar with the general background and the related math details for one-sided Procrustes for Toeplitz matrices problem. Then you can start to get familiar with the API design and implement your codes. But please be sure to fork our repo and work on a new branch instead of the master/main branch. Once you think the code is ready for review, please make a pull request and tag me. I will take a look.
Thank you and feel free to post details questions in GitHub Actions. @PK-SS
The Procrustes method can be solved where the transformation is a Toeplitz matrix
http://dx.doi.org/10.1155/2013/696019
I don't know any applications of this, so I consider it low priority. But it does look straightforward.
The text was updated successfully, but these errors were encountered: