Research work · 1998

Computing the nearest diagonally dominant matrix

María Mendoza, Marcos Raydan, Pablo Tarazaga

Numerical Linear Algebra with Applications

Abstract

We solve the problem of minimizing the distance from a given matrix to the set of symmetric and diagonally dominant matrices. First, we characterize the projection onto the cone of diagonally dominant matrices with positive diagonal, and then we apply Dykstra's alternating projection algorithm on this cone and on the subspace of symmetric matrices to obtain the solution. We discuss implementation details and present encouraging preliminary numerical results. Copyright © 1999 John Wiley & Sons, Ltd.

DOI: 10.1002/(sici)1099-1506(199811/12)5:6<461::aid-nla141>3.0.co;2-v