/opt/ros/diamondback/stacks/freiburg_tools/gaussian_process/include/gaussian_process/cholesky.hpp File Reference

cholesky decomposition More...

#include <cassert>
#include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/vector_proxy.hpp>
#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/matrix_proxy.hpp>
#include <boost/numeric/ublas/vector_expression.hpp>
#include <boost/numeric/ublas/matrix_expression.hpp>
#include <boost/numeric/ublas/triangular.hpp>

Include dependency graph for cholesky.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
template<class MATRIX >
size_t	cholesky_decompose (MATRIX &A)
	decompose the symmetric positive definit matrix A into product L L^T.
template<class MATRIX , class TRIA >
size_t	cholesky_decompose (const MATRIX &A, TRIA &L)
	decompose the symmetric positive definit matrix A into product L L^T.
template<class TRIA , class VEC >
void	cholesky_solve (const TRIA &L, VEC &x, ublas::lower)
	solve system L L^T x = b inplace
template<class MATRIX >
size_t	incomplete_cholesky_decompose (MATRIX &A)
	decompose the symmetric positive definit matrix A into product L L^T.

---

Detailed Description

cholesky decomposition

-*- c++ -*-

Definition in file cholesky.hpp.

---

Function Documentation

template<class MATRIX >

size_t cholesky_decompose

(

MATRIX &

A

)

[inline]

decompose the symmetric positive definit matrix A into product L L^T.

Parameters:

	MATRIX	type of matrix A
	A	input: square symmetric positive definite matrix (only the lower triangle is accessed)
	A	output: the lower triangle of A is replaced by the cholesky factor

Returns:

nonzero if decompositon fails (the value ist 1 + the numer of the failing row)

Definition at line 94 of file cholesky.hpp.

template<class MATRIX , class TRIA >

size_t cholesky_decompose	(	const MATRIX &	A,
		TRIA &	L
	)			[inline]

decompose the symmetric positive definit matrix A into product L L^T.

Parameters:

	MATRIX	type of input matrix
	TRIA	type of lower triangular output matrix
	A	square symmetric positive definite input matrix (only the lower triangle is accessed)
	L	lower triangular output matrix

Returns:

nonzero if decompositon fails (the value ist 1 + the numer of the failing row)

Definition at line 52 of file cholesky.hpp.

template<class TRIA , class VEC >

void cholesky_solve	(	const TRIA &	L,
		VEC &	x,
		ublas::lower
	)			[inline]

solve system L L^T x = b inplace

Parameters:

	L	a triangular matrix
	x	input: right hand side b; output: solution x

Definition at line 221 of file cholesky.hpp.

template<class MATRIX >

size_t incomplete_cholesky_decompose

(

MATRIX &

A

)

[inline]

decompose the symmetric positive definit matrix A into product L L^T.

Parameters:

	MATRIX	type of matrix A
	A	input: square symmetric positive definite matrix (only the lower triangle is accessed)
	A	output: the lower triangle of A is replaced by the cholesky factor

Returns:

nonzero if decompositon fails (the value ist 1 + the numer of the failing row)

Definition at line 173 of file cholesky.hpp.