ilu.hh File Reference

The incomplete LU factorization kernels. More...

#include <cmath>
#include <complex>
#include <map>
#include <vector>
#include <dune/common/fmatrix.hh>
#include <dune/common/scalarvectorview.hh>
#include <dune/common/scalarmatrixview.hh>
#include "istlexception.hh"

Go to the source code of this file.

Classes
struct	Dune::ILU::CRS< B, Alloc >
	a simple compressed row storage matrix class More...

Namespaces
	Dune
	Dune namespace.

Functions
template<class M >
void	Dune::ILU::blockILU0Decomposition (M &A)
	compute ILU decomposition of A. A is overwritten by its decomposition
template<class M , class X , class Y >
void	Dune::ILU::blockILUBacksolve (const M &A, X &v, const Y &d)
	LU backsolve with stored inverse.
template<class M >
void	Dune::ILU::blockILUDecomposition (const M &A, int n, M &ILU)
template<class M , class CRS , class InvVector >
void	Dune::ILU::convertToCRS (const M &A, CRS &lower, CRS &upper, InvVector &inv)
	convert ILU decomposition into CRS format for lower and upper triangular and inverse.
template<class CRS , class InvVector , class X , class Y >
void	Dune::ILU::blockILUBacksolve (const CRS &lower, const CRS &upper, const InvVector &inv, X &v, const Y &d)
	LU backsolve with stored inverse in CRS format for lower and upper triangular.

Detailed Description

The incomplete LU factorization kernels.

Function Documentation

blockILUDecomposition()

template<class M >

void Dune::ILU::blockILUDecomposition	(	const M &	A,
		int	n,
		M &	ILU
	)

ILU decomposition of order n Computes ILU decomposition of order n. The matrix ILU should be an empty matrix in row_wise creation mode. This allows the user to either specify the number of nonzero elements or to determine it automatically at run-time.

References Dune::ILU::blockILUDecomposition().

Referenced by Dune::ILU::blockILUDecomposition().