Reputation: 81
I have a square n*n matrix S that has to be decomposed into a product of two matrices - A1 and A2, where A2 is transposed matrix to A1 (A2=A1^T) , so A1 * A2 = S. Are there any algorithms to do such operation effectively? C#/C++ solution would be nice.
Upvotes: 0
Views: 1712
Reputation: 15004
I'm not quite sure what you want to do but
here is the GSL lib that might help
14 Linear Algebra
Upvotes: 0
Reputation: 10312
As Andrei suggested, it seems you are trying to do Cholesky Decomposition.
There is provided C++ code in polish wiki site for it.
There is also separate subsection in "Numerical recipes in C" (2.9 Cholesky decomposition, can be found here: http://www.nrbook.com/a/bookcpdf/c2-9.pdf )
Upvotes: 3
Reputation: 5005
In that case you probably want http://en.wikipedia.org/wiki/Cholesky_decomposition
Upvotes: 2