Created
April 22, 2012 14:54
-
-
Save lilac/2464434 to your computer and use it in GitHub Desktop.
Invert matrix by Boost uBlas
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
The following code inverts the matrix input using LU-decomposition with backsubstitution of unit vectors. Reference: Numerical Recipies in C, 2nd ed., by Press, Teukolsky, Vetterling & Flannery. | |
you can solve Ax=b using three lines of ublas code: | |
permutation_matrix<> piv; | |
lu_factorize(A, piv); | |
lu_substitute(A, piv, x); | |
*/ | |
#ifndef INVERT_MATRIX_HPP | |
#define INVERT_MATRIX_HPP | |
// REMEMBER to update "lu.hpp" header includes from boost-CVS | |
#include <boost/numeric/ublas/vector.hpp> | |
#include <boost/numeric/ublas/vector_proxy.hpp> | |
#include <boost/numeric/ublas/matrix.hpp> | |
#include <boost/numeric/ublas/triangular.hpp> | |
#include <boost/numeric/ublas/lu.hpp> | |
#include <boost/numeric/ublas/io.hpp> | |
namespace ublas = boost::numeric::ublas; | |
/* Matrix inversion routine. | |
Uses lu_factorize and lu_substitute in uBLAS to invert a matrix */ | |
template<class T> | |
bool InvertMatrix? (const ublas::matrix<T>& input, ublas::matrix<T>& inverse) { | |
using namespace boost::numeric::ublas; | |
typedef permutation_matrix<std::size_t> pmatrix; | |
// create a working copy of the input | |
matrix<T> A(input); | |
// create a permutation matrix for the LU-factorization | |
pmatrix pm(A.size1()); | |
// perform LU-factorization | |
int res = lu_factorize(A,pm); | |
if( res != 0 ) return false; | |
// create identity matrix of "inverse" | |
inverse.assign(ublas::identity_matrix<T>(A.size1())); | |
// backsubstitute to get the inverse | |
lu_substitute(A, pm, inverse); | |
return true; | |
} | |
#endif //INVERT_MATRIX_HPP |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Thanks