<?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>Matrix Programming</title>
	<atom:link href="http://matrixprogramming.com/feed" rel="self" type="application/rss+xml" />
	<link>http://matrixprogramming.com</link>
	<description>Compiling numerical libraries</description>
	<lastBuildDate>Thu, 05 Jan 2012 20:38:42 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>A parallel version of run_mums</title>
		<link>http://matrixprogramming.com/2012/01/a-parallel-version-of-run_mums</link>
		<comments>http://matrixprogramming.com/2012/01/a-parallel-version-of-run_mums#comments</comments>
		<pubDate>Thu, 05 Jan 2012 20:34:49 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[MUMPS]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=631</guid>
		<description><![CDATA[This text and example files are contributed by Carlo de Falco The files are at /files/contrib/carlo.defalco/ I assume that you have already read Sample code in C++ to run MUMPS. The goal in this section is to compare two codes to run the mumps solver in serial and in parallel.  We would like to develop a command line tool that will [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2012/01/a-parallel-version-of-run_mums/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Compiling MUMPS 4.10.0 with WinMumps using Visual Studio 2008 and Intel</title>
		<link>http://matrixprogramming.com/2011/12/mumps-4-10-0-with-winmumps</link>
		<comments>http://matrixprogramming.com/2011/12/mumps-4-10-0-with-winmumps#comments</comments>
		<pubDate>Fri, 30 Dec 2011 18:48:23 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[msvc]]></category>
		<category><![CDATA[MUMPS]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=627</guid>
		<description><![CDATA[Domen Stadler Files are in /files/contrib/domen.stadler/ For startes, this work was performed on the Windows XP 32 bit computer, but there is no reason to occur any troubles on other windows platforms. To be able to compile, one would need following software: -MUMPS source code (http://graal.ens-lyon.fr/MUMPS/) (tried with versions 4.8.0 and 4.10.0), -WinMUMPS package (http://sourceforge.net/projects/winmumps/) [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/12/mumps-4-10-0-with-winmumps/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sample driver to run a sparse solver</title>
		<link>http://matrixprogramming.com/2011/07/sample-driver-to-run-a-sparse-solver</link>
		<comments>http://matrixprogramming.com/2011/07/sample-driver-to-run-a-sparse-solver#comments</comments>
		<pubDate>Thu, 14 Jul 2011 07:08:35 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=598</guid>
		<description><![CDATA[The code in run_sparse_solver.cpp demonstrates how one can use LinearSolver to programm a tool similar to run_taucs and run_mumps. Yet now the code is written for any sparse solver for that the LinearSolver interface has been implemented. When you start reading the code, it is good first to skip function readArguments and just browse main. Let us now [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/sample-driver-to-run-a-sparse-solver/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Gluing all together: LinearSolver::create</title>
		<link>http://matrixprogramming.com/2011/07/gluing-all-together-linearsolvercreate</link>
		<comments>http://matrixprogramming.com/2011/07/gluing-all-together-linearsolvercreate#comments</comments>
		<pubDate>Wed, 13 Jul 2011 16:08:57 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=591</guid>
		<description><![CDATA[So far we have defined an interface in the class LinearSolver and then implemented it for different solvers: UMFPACK, TAUCS, MUMPS and PARDISO. The implementation in solver_*.cpp uses solvers.h but the application code actually needs almost nothing from these files. The word almost means that it is still necessary to instantiate a particular solver class [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/gluing-all-together-linearsolvercreate/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Class MUMPS and PARDISO</title>
		<link>http://matrixprogramming.com/2011/07/class-mumps-and-pardiso</link>
		<comments>http://matrixprogramming.com/2011/07/class-mumps-and-pardiso#comments</comments>
		<pubDate>Wed, 13 Jul 2011 15:18:27 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[MUMPS]]></category>
		<category><![CDATA[PARDISO]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=585</guid>
		<description><![CDATA[Solvers MUMPS and PARDISO are different from TAUCS and UMFPACK in respect that they posses more functionality within the same interface. For example they can work with positive definite, indefinite or unsymmetric matrices and the switch is done through a single variable. They also support out-of-core and this setting  is controlled by another variable. The LinearSolver interface for [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/class-mumps-and-pardiso/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Class TAUCS</title>
		<link>http://matrixprogramming.com/2011/07/class-taucs</link>
		<comments>http://matrixprogramming.com/2011/07/class-taucs#comments</comments>
		<pubDate>Wed, 13 Jul 2011 14:17:54 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[TAUCS]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=581</guid>
		<description><![CDATA[TAUCS library contains several solvers and there are accordingly more classes in solver_taucs.cpp. Each solver has its own class:  TAUCSllt &#8211; Cholesky decomposition column by column (slow); TAUCSldlt &#8211; LDLT factorization for indefinite matrices (slow); TAUCSllt_mf &#8211; Multifrontal supernodal Cholesky decomposition (the best among TAUCS library for positive definite matrices); TAUCSllt_ll &#8211; Left-looking supernodal Cholesky decomposition; TAUCSllt_ooc &#8211; [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/class-taucs/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Class UMFPACK</title>
		<link>http://matrixprogramming.com/2011/07/class-umfpack</link>
		<comments>http://matrixprogramming.com/2011/07/class-umfpack#comments</comments>
		<pubDate>Wed, 13 Jul 2011 09:56:43 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[UMFPACK]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=577</guid>
		<description><![CDATA[The complete code that implement the LinearSolver interface for the UMFPACK solver is in solver_umfpack.cpp including the declaration of the class UMFPACK. This may look unusual but the reason is quite simple. The declaration of the class UMFPACK is used only to compile the code of the class and it will be never accessed from the application code directly. The [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/class-umfpack/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Class LinearSolver</title>
		<link>http://matrixprogramming.com/2011/07/class-linearsolver</link>
		<comments>http://matrixprogramming.com/2011/07/class-linearsolver#comments</comments>
		<pubDate>Wed, 13 Jul 2011 07:34:51 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=570</guid>
		<description><![CDATA[Two specialized drivers, run_taucs.cpp and run_mumps.cpp presented previously show a common problem when one needs to deal with a sparse solver. If you expect that in the future you may need to change a sparse solver, you must be then ready to modify the part of your code that works with the sparse solver. For example all algorithms that use [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/class-linearsolver/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sample code in C++ to run MUMPS</title>
		<link>http://matrixprogramming.com/2011/07/sample-code-in-c-to-run-mumps</link>
		<comments>http://matrixprogramming.com/2011/07/sample-code-in-c-to-run-mumps#comments</comments>
		<pubDate>Mon, 11 Jul 2011 19:54:50 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[MUMPS]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=557</guid>
		<description><![CDATA[I assume that you have already read Sample code in C++ to run TAUCS. The goal in this section is to compare two codes to run different sparse solvers when the purpose of the code is actually quite similar.  We would like to develop a command line tool that will read a matrix and a right-hand side run_mumps [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/07/sample-code-in-c-to-run-mumps/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Sample code in C++ to run TAUCS</title>
		<link>http://matrixprogramming.com/2011/06/sample-code-to-run-taucs</link>
		<comments>http://matrixprogramming.com/2011/06/sample-code-to-run-taucs#comments</comments>
		<pubDate>Sun, 12 Jun 2011 18:17:25 +0000</pubDate>
		<dc:creator>Evgenii Rudnyi</dc:creator>
				<category><![CDATA[Sparse Matrices]]></category>
		<category><![CDATA[TAUCS]]></category>

		<guid isPermaLink="false">http://matrixprogramming.com/?p=540</guid>
		<description><![CDATA[Now let us employ Matrix and SparseMatrix to run TAUCS. The goal will be to develop a command line tool that will read a matrix and a right-hand side run_taucs matrix rhs in the Matrix Market format and then writes the solution of the system of linear equations in file rhs.solution also in the Matrix [...]]]></description>
		<wfw:commentRss>http://matrixprogramming.com/2011/06/sample-code-to-run-taucs/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
	</channel>
</rss>

