*(English)*Zbl 0649.65026

The problem of computing a nearest positive semidefinite matrix (notation used $X\ge 0)$ to an arbitrary real matrix A is considered. The criterion of approximation is the distance $\delta \left(A\right)={min}_{X={X}^{T}\ge 0}\parallel A-X\parallel $ where the norm is chosen to be either Frobenius or 2-norm. The paper consists of two parts. In the first part the author proves that the nearest unique positive approximant ${X}_{F}$ of A in the Frobenius norm is ${X}_{F}=(B+H)/2,$ where $B=(A+{A}^{T})/2$ and H is the symmetric polar factor of B, and the corresponding distance from A is ${\delta}_{F}^{2}\left(A\right)={\sum}_{{\lambda}_{i}\left(B\right)<0}{\lambda}_{i}^{2}\left(B\right)+{\parallel C\parallel}_{F}^{2},$ where $C=(A-{A}^{T})/2\xb7$

In the second part the problem is studied in 2-norm. Examining from a computational view point the famous Halmos formula for the distance ${\delta}_{2}\left(A\right)$ the author proposes two algorithms to estimate ${\delta}_{2}\left(A\right)$ as well as the positive approximant (which is not unique in general): (i) an efficient bisection algorithm of low accuracy that is $\alpha \ge {\delta}_{2}\left(A\right)\le \alpha +2max\{f\alpha ,tol\},$ where f is a relative error tolerance and tol is an absolute error tolerance; (ii) a hybrid Newton-bisection type algorithm for high accuracy computations. The problem of computational testing for positive definiteness as well as some details concerning the implementation of algorithm (ii) are discussed. Numerical examples are presented.

##### MSC:

65F30 | Other matrix algorithms |

15A60 | Applications of functional analysis to matrix theory |

15A48 | Positive matrices and their generalizations (MSC2000) |

65K05 | Mathematical programming (numerical methods) |

90C25 | Convex programming |