<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.1" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Successive over-relaxation (SOR)</title>
	<link>http://dahoiv.net/programmering/matlab/successive-over-relaxation</link>
	<description>- My programming projects and some linux tips</description>
	<pubDate>Tue, 06 Jan 2009 03:33:12 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.1</generator>

	<item>
		<title>Successive over-relaxation (SOR)</title>
		<link>http://dahoiv.net/programmering/matlab/successive-over-relaxation#comment-155</link>
		<author>Daniel Høyer Iversen</author>
		<pubDate>Sat, 07 Jun 2008 13:29:54 +0000</pubDate>
		<guid>http://dahoiv.net/programmering/matlab/successive-over-relaxation#comment-155</guid>
		<description>http://en.wikipedia.org/wiki/Successive_over-relaxation :
Successive over-relaxation (SOR) is a numerical method used to speed up convergence of the Gauss–Seidel method for solving a linear system of equations. A similar method can be used for any slowly converging iterative process. It was devised simultaneously by David M. Young and by H. Frankel in 1950 for the purpose of automatically solving linear systems on digital computers. Over-relaxation methods have been used before the work of Young and Frankel. For instance, the method of Lewis Fry Richardson, and the methods developed by R. V. Southwell. However, these methods were designed for computation by human calculators, and they required some expertise to ensure convergence to the solution which made them inapplicable for programming on digital computers. These aspects are discussed in the thesis of David M. Young.</description>
		<content:encoded><![CDATA[<p><a href="http://en.wikipedia.org/wiki/Successive_over-relaxation" rel="nofollow">http://en.wikipedia.org/wiki/Successive_over-relaxation</a> :<br />
Successive over-relaxation (SOR) is a numerical method used to speed up convergence of the Gauss–Seidel method for solving a linear system of equations. A similar method can be used for any slowly converging iterative process. It was devised simultaneously by David M. Young and by H. Frankel in 1950 for the purpose of automatically solving linear systems on digital computers. Over-relaxation methods have been used before the work of Young and Frankel. For instance, the method of Lewis Fry Richardson, and the methods developed by R. V. Southwell. However, these methods were designed for computation by human calculators, and they required some expertise to ensure convergence to the solution which made them inapplicable for programming on digital computers. These aspects are discussed in the thesis of David M. Young.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
