
The author studies the problem of finding the nearest matrix to a positive semidefinite Hankel matrix in such a way that all the special properties are preserved. In the usual evaluation techniques rounding and truncation limitations result in some of the properties to be lost. The author describes a semidefinite programming optimization problem, the solution of which can produce a suitable matrix. The proposed algorithm is presented in detail (section 4) and the results of the computational experimentation are reported at the end of the article.
nearest matrix, numerical examples, algorithm, Applied Mathematics, Primal–dual interior-point method, Other matrix algorithms, Hankel matrix, Interior-point methods, semidefinite programming, primal-dual interior-point algorithm, Computational Mathematics, Numerical mathematical programming methods, Semidefinite programming
nearest matrix, numerical examples, algorithm, Applied Mathematics, Primal–dual interior-point method, Other matrix algorithms, Hankel matrix, Interior-point methods, semidefinite programming, primal-dual interior-point algorithm, Computational Mathematics, Numerical mathematical programming methods, Semidefinite programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
