Artifact fa5b6bc26729e4ecb54e556f926230642cda124de687ef6eee3a314a77b45ebb:

• Executable file r37/lisp/csl/html/r37_0581.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 1241) [annotate] [blame] [check-ins using] [more...]

<A NAME=cholesky>

<TITLE>cholesky</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>CHOLESKY</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
<P>
<P>
 <P> <H3> 
syntax: </H3>
<em>cholesky</em>(&lt;matrix&gt;) 
<P>
<P>
<P>
&lt;matrix&gt; :- a positive definite matrix containing numeric entries. 
<P>
<P>
<em>cholesky</em>computes the cholesky decomposition of &lt;matrix&gt;. 
<P>
<P>
It returns {L,U} where L is a lower matrix, U is an upper matrix, 
A = LU, and U = L^T. 
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
F := mat((1,1,0),(1,3,1),(0,1,1)); 


       [1  1  0]
       [       ]
  f := [1  3  1]
       [       ]
       [0  1  1]



on rounded; 

cholesky(F); 

  {
   [1        0               0       ]
   [                                 ]
   [1  1.41421356237         0       ]
   [                                 ]
   [0  0.707106781187  0.707106781187]
   ,
   [1        1              0       ]
   [                                ]
   [0  1.41421356237  0.707106781187]
   [                                ]
   [0        0        0.707106781187]
  }

</TT></PRE><P>Related functions: 
<A HREF=r37_0597.html>lu_decom</A>. 
<P>
<P>