<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Gaia Environmental Sciences &#187; Sparse QR</title>
	<atom:link href="http://gaiaes.com/tag/sparse-qr/feed/" rel="self" type="application/rss+xml" />
	<link>http://gaiaes.com</link>
	<description>Energy and Computer Consulting</description>
	<lastBuildDate>Wed, 08 Sep 2010 04:15:04 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Sparse QR Decomposition</title>
		<link>http://gaiaes.com/2008/09/sparse-qr-decomposition/</link>
		<comments>http://gaiaes.com/2008/09/sparse-qr-decomposition/#comments</comments>
		<pubDate>Wed, 10 Sep 2008 03:26:36 +0000</pubDate>
		<dc:creator>trobey</dc:creator>
				<category><![CDATA[Computer Programming]]></category>
		<category><![CDATA[Numerical Analysis]]></category>
		<category><![CDATA[Sparse QR]]></category>

		<guid isPermaLink="false">http://gaiaes.com/?p=5</guid>
		<description><![CDATA[This serial routine computes the QR decomposition of a matrix A in Remxn, m &#62; = n, such that P_r*QT*A*P_cT = &#124; R &#124; &#124; 0 &#124; where QT*Q = I in Remxm, R in Renxn upper triangular, and P_r in Remxm as well as P_c in Renxn are permutation matrices. Note that this is [...]]]></description>
			<content:encoded><![CDATA[<p>This serial routine computes the QR decomposition of a matrix <strong>A</strong> in Re<sup><em>mxn</em></sup>, <em>m</em> &gt; = <em>n</em>, such that</p>
<p style="text-align: center;"><strong>P_r</strong>*<strong>Q</strong><sup>T</sup>*<strong>A</strong>*<strong>P_c</strong><sup>T</sup> =<br />
| <strong>R</strong> |<br />
| <strong>0</strong> |</p>
<p><span id="more-5"></span>where <strong>Q</strong><sup>T</sup>*<strong>Q</strong> = <strong>I</strong> in Re<sup><em>mxm</em></sup>, <strong>R</strong> in Re<sup><em>nxn</em></sup> upper triangular, and <strong>P_r</strong> in Re<sup><em>mxm</em></sup> as well as <strong>P_c</strong> in Re<sup><em>nxn</em></sup> are permutation matrices.  Note that this is a research code developed for the following paper.</p>
<p>Thomas H. Robey and Deborah L. Sulsky, <em>Row Ordering for Sparse QR Decomposition</em>, SIAM J. Matrix Anal. and Appl., Vol. 15, No. 4, pp. 1208-1225, October 1994.</p>
<p>The software is available in C and C++ under the GNU Library General Public License.  To obtain the source code click on the desired version listed below.</p>
<ul>
<li><a href="/sparseqr/sparseqr-2.1.tar.gz">C version</a></li>
<li><a href="/sparseqr/sparseqr++3.1.tar.gz">C++ version</a></li>
</ul>
<p>Version 2.* has improved code for calculating fill that results in less memory and faster execution.  Version 3.* reduces work in the minimum degree calculation resulting in faster execution.</p>
]]></content:encoded>
			<wfw:commentRss>http://gaiaes.com/2008/09/sparse-qr-decomposition/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
