<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Numerical linear algebra - Page 18 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=numerical_linear_algebra&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=numerical_linear_algebra&amp;p=19">3.Next</a>
</p>
<p>different decompositions can be used to solve the linear problem, depending on the characteristics of the matrix A and the vectors x and b, which may make one factorization much easier to obtain than others. If A = QR is a QR factorization of A, then equivalently . This is as easy to compute as a matrix factorization. If  is an eigendecomposition A, and we seek to find b so that b = Ax, with  and , then we have . This is closely related to the solution to the linear system using the singular value decomposition, because singular values of a matrix</p><p>
<a accesskey="1" href="page.php?w=numerical_linear_algebra&amp;p=17">1.Previous</a><br />
<a accesskey="3" href="page.php?w=numerical_linear_algebra&amp;p=19">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
