Skip to main content
added 332 characters in body
Source Link
Felix Goldberg
  • 7k
  • 4
  • 31
  • 55

$DBD$ is in effect a re-scaling of the rows and columns of $B$, and you want it to have constant row-sums. If $B$ were positive, this would be possible by, say, Sinkhorn's theorem. For $B$ with negative values, I'd have to think a bitthis would be much more difficult, but possible in special cases. See this survey by C.R.Johnson & R.Reams for a panorama of the subject:

Scaling of Symmetric Matrices by Positive Diagonal Congruence http://faculty.plattsburgh.edu/robert.reams/research/sinkhorn.pdf

P.S. Do you have more detailed information about the structure of your matrix $B$?

$DBD$ is in effect a re-scaling of the rows and columns of $B$, and you want it to have constant row-sums. If $B$ were positive, this would be possible by, say, Sinkhorn's theorem. For $B$ with negative values, I'd have to think a bit more.

$DBD$ is in effect a re-scaling of the rows and columns of $B$, and you want it to have constant row-sums. If $B$ were positive, this would be possible by, say, Sinkhorn's theorem. For $B$ with negative values, this would be much more difficult, but possible in special cases. See this survey by C.R.Johnson & R.Reams for a panorama of the subject:

Scaling of Symmetric Matrices by Positive Diagonal Congruence http://faculty.plattsburgh.edu/robert.reams/research/sinkhorn.pdf

P.S. Do you have more detailed information about the structure of your matrix $B$?

Source Link
Felix Goldberg
  • 7k
  • 4
  • 31
  • 55

$DBD$ is in effect a re-scaling of the rows and columns of $B$, and you want it to have constant row-sums. If $B$ were positive, this would be possible by, say, Sinkhorn's theorem. For $B$ with negative values, I'd have to think a bit more.