<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Cholesky decomposition</title>
	<atom:link href="http://www.tangentspace.net/cz/archives/2006/07/cholesky-decomposition/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.tangentspace.net/cz/archives/2006/07/cholesky-decomposition/</link>
	<description>somewhere near the beginning.</description>
	<pubDate>Mon, 01 Dec 2008 23:41:04 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
		<item>
		<title>By: Peter Steeves</title>
		<link>http://www.tangentspace.net/cz/archives/2006/07/cholesky-decomposition/#comment-75297</link>
		<dc:creator>Peter Steeves</dc:creator>
		<pubDate>Sat, 09 Dec 2006 02:03:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.tangentspace.net/cz/archives/2006/07/cholesky-decomposition#comment-75297</guid>
		<description>Hi, I am a geomatics Engineer. I began programming Cholesky's algorithms in 1975. In 1977, I was able to solve 250,000 non-linear equations on a B2700 computer that had 128 Kilo Bytes of RAM. I authored "The Block Cholesky." I am able to compute any block of the Inverse Matrix without computing all of the matrix. A Mathematics &#38; Computer Science Professor told me it was impossible to solve the inverse by blocks; therefore, I did it. First man on Earth to do so. Actually, my algorithm is really simple. It solves the matrix by blocking it in 10x10, 20x20, or even 100x100 blocks. Only 3 blocks are required in RAM at any one time. This means my solution is only limited by the size of the hard drive and time. It's quite fast even though it's blocked. I adjusted 400 Kms of leveling data from Northern Nigeria in 0.75 seconds. 

See if you can find my papers at www.gssGeomatics.com. I'll be adding more real soon. Right now I am developing a Least Squares solutions for leveling, horizontal control, and GPS. 

Peter Steeves, BSc, MSc, PhD
Geomatics Engineer
Mississauga, Ontario
Canada</description>
		<content:encoded><![CDATA[<p>Hi, I am a geomatics Engineer. I began programming Cholesky&#8217;s algorithms in 1975. In 1977, I was able to solve 250,000 non-linear equations on a B2700 computer that had 128 Kilo Bytes of RAM. I authored &#8220;The Block Cholesky.&#8221; I am able to compute any block of the Inverse Matrix without computing all of the matrix. A Mathematics &amp; Computer Science Professor told me it was impossible to solve the inverse by blocks; therefore, I did it. First man on Earth to do so. Actually, my algorithm is really simple. It solves the matrix by blocking it in 10&#215;10, 20&#215;20, or even 100&#215;100 blocks. Only 3 blocks are required in RAM at any one time. This means my solution is only limited by the size of the hard drive and time. It&#8217;s quite fast even though it&#8217;s blocked. I adjusted 400 Kms of leveling data from Northern Nigeria in 0.75 seconds. </p>
<p>See if you can find my papers at <a href="http://www.gssGeomatics.com" rel="nofollow">http://www.gssGeomatics.com</a>. I&#8217;ll be adding more real soon. Right now I am developing a Least Squares solutions for leveling, horizontal control, and GPS. </p>
<p>Peter Steeves, BSc, MSc, PhD<br />
Geomatics Engineer<br />
Mississauga, Ontario<br />
Canada</p>
]]></content:encoded>
	</item>
</channel>
</rss>
