Computing the nearest diagonally dominant matrix
✍ Scribed by María Mendoza; Marcos Raydan; Pablo Tarazaga
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 78 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
A method for computing the molecular detour matrix is proposed.
Let T be an arbitrary n × n matrix with real entries. We consider the set of all matrices with a given complex number as an eigenvalue, as well as being given the corresponding left and right eigenvectors. We find the closest matrix A, in Frobenius norm, in this set to the matrix T . The normal cone
## On the diagonalization of holomorphic matrix functions of several variables By DIETER HETTNEMANN in Berlin (Eingegangen am 10.7. 1979) Let X c C n be a domain of holomorphy, L(Ck) be the space of complex k x kmatrices and GL(Ck) be the group of the invertible complex k x k-matrices. Two holom