<?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 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Numerical_linear_algebra&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Numerical_linear_algebra&amp;p=8">3.Next</a>
</p>
<p>the <a href="page.php?w=QR_factorization">QR factorization</a>, the <a href="page.php?w=LU_factorization">LU factorization</a>, or the <a href="page.php?w=eigendecomposition">eigendecomposition</a>, which can then be used to answer common linear algebraic problems like solving linear systems of equations, locating eigenvalues, or least squares optimisation. Numerical linear algebra's central concern with developing algorithms that do not introduce errors when applied to real data on a finite precision computer is often achieved by <a href="page.php?w=iterative">iterative</a></p><p>
<a accesskey="1" href="page.php?w=Numerical_linear_algebra&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Numerical_linear_algebra&amp;p=8">3.Next</a>
</p>

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

</card>
</wml>
