document.write( "Question 1046540: The symmetrix positive definite matrix \r
\n" ); document.write( "\n" ); document.write( "A = \"%28matrix+%28+3%2C+3%2C+16%2C+-8%2C+-4%2C+-8%2C+29%2C+12%2C+-4%2C+12%2C+41%29%29\"\r
\n" ); document.write( "\n" ); document.write( "can be written as the product of a lower triangular matrix \r
\n" ); document.write( "\n" ); document.write( "L= \r
\n" ); document.write( "\n" ); document.write( "and it's transpose \"L%5ET\", that is \"A=LL%5ET\".\r
\n" ); document.write( "\n" ); document.write( "Find L and \"L%5ET\".\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #661999 by ikleyn(52814)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "For some useful info related to this subject see this Wikipedia article\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "https://en.wikipedia.org/wiki/Cholesky_decomposition\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "https://en.wikipedia.org/wiki/Cholesky_decomposition\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "Somewhere in the beginning of 80-ies I was in need to have my own computer program (subroutine) based on this algorithm \r\n" );
document.write( "(Cholesky LU-decomposition) to use it in the more wide finite element code for solving systems of linear equations.\r\n" );
document.write( "\r\n" );
document.write( "I was lucky: I found very good description of the algorithm in the book by Wilkinson and Reinsch \"Handbook for Automatic Computations\". \r\n" );
document.write( "\r\n" );
document.write( "I learned this algorithm, wrote the subroutine, wrote the entire finite-element code and used it during some years, \r\n" );
document.write( "making my research computer simulations.\r\n" );
document.write( "\r\n" );
document.write( "It worked successfully in solving matrix equations of the size 1000 - 3000 - 5000 in one (in each of the two) matrix dimensions.\r\n" );
document.write( "\r\n" );
document.write( "For more grandiose matrices the algorithm lost its effectiveness, and other methods were required.  \r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Some reminiscences . . . \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Surely, I know the algorithm, but its presentation requires a lot of writing.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "This is why I refer you to that article.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "See also in the Internet with keywords \"Cholesky decomposition\", \"LU-decomposition\" . . . \r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Also, good sources of information are the books\r
\n" ); document.write( "\n" ); document.write( "     - \"Numerical recipies, vol. I\"     (classic)
\n" ); document.write( "     - \"LINPACK user's guide\" (1979) by Dongarra and others . . .     (classic too)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "As well as any authoritative contemporary guide/textbook on Matrix Computations.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "In nowadays, you can even find an online matrix calculator in the Internet making LU-decomposition for free ! ! !\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "I just found one such a calculator for you under the link \r
\n" ); document.write( "\n" ); document.write( "http://comnuan.com/cmnn0100d/\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "http://comnuan.com/cmnn0100d/\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );