<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, Cholesky Decomposition for a symbolic matrix</title>
    <link>http://www.mapleprimes.com/questions/142810-Cholesky-Decomposition-For-A-Symbolic-Matrix</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Thu, 11 Jun 2026 00:34:43 GMT</lastBuildDate>
    <pubDate>Thu, 11 Jun 2026 00:34:43 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, Cholesky Decomposition for a symbolic matrix</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, Cholesky Decomposition for a symbolic matrix</title>
      <link>http://www.mapleprimes.com/questions/142810-Cholesky-Decomposition-For-A-Symbolic-Matrix</link>
    </image>
    <item>
      <title>conjugate=false option</title>
      <link>http://www.mapleprimes.com/questions/142810-Cholesky-Decomposition-For-A-Symbolic-Matrix?ref=Feed:MaplePrimes:Cholesky Decomposition for a symbolic matrix:Comments#answer142811</link>
      <itunes:summary>&lt;p&gt;Just add the conjugate=false option to your LUDecomposition call. This is mentioned in its help docs. You can even omit the simplify call afterwards. But you will need to apply it to C.Transpose(C) to obtain the original Matrix.&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;Just add the conjugate=false option to your LUDecomposition call. This is mentioned in its help docs. You can even omit the simplify call afterwards. But you will need to apply it to C.Transpose(C) to obtain the original Matrix.&lt;/p&gt;</description>
      <guid>142811</guid>
      <pubDate>Wed, 30 Jan 2013 18:33:05 Z</pubDate>
      <itunes:author>Thomas Richard</itunes:author>
      <author>Thomas Richard</author>
    </item>
    <item>
      <title>choice</title>
      <link>http://www.mapleprimes.com/questions/142810-Cholesky-Decomposition-For-A-Symbolic-Matrix?ref=Feed:MaplePrimes:Cholesky Decomposition for a symbolic matrix:Comments#answer142812</link>
      <itunes:summary>&lt;pre&gt;A := Matrix([[a, b], [b, c]], shape = symmetric, attributes = [positive_definite]):

B := LinearAlgebra:-LUDecomposition(A, method = Cholesky);
Bhat := simplify(B) assuming real, positive;
map(normal, Bhat.Bhat^%T - A );

F := LinearAlgebra:-LUDecomposition(A, method = Cholesky, conjugate=false);
map(normal, F.F^%T - A );
&lt;/pre&gt;
&lt;p&gt;If you go with conjugate=false then you might still want to simplify under the assumption of being positive, depending on example.&lt;/p&gt;
&lt;!--break--&gt;
&lt;p&gt;acer&lt;/p&gt;</itunes:summary>
      <description>&lt;pre&gt;A := Matrix([[a, b], [b, c]], shape = symmetric, attributes = [positive_definite]):

B := LinearAlgebra:-LUDecomposition(A, method = Cholesky);
Bhat := simplify(B) assuming real, positive;
map(normal, Bhat.Bhat^%T - A );

F := LinearAlgebra:-LUDecomposition(A, method = Cholesky, conjugate=false);
map(normal, F.F^%T - A );
&lt;/pre&gt;
&lt;p&gt;If you go with conjugate=false then you might still want to simplify under the assumption of being positive, depending on example.&lt;/p&gt;
&lt;!--break--&gt;
&lt;p&gt;acer&lt;/p&gt;</description>
      <guid>142812</guid>
      <pubDate>Wed, 30 Jan 2013 18:35:13 Z</pubDate>
      <itunes:author>acer</itunes:author>
      <author>acer</author>
    </item>
  </channel>
</rss>