capd::matrixAlgorithms::Gershgorin< MatrixType, true > Class Template Reference

Specialization for rigorous (interval) types. More...

#include <capd/matrixAlgorithms/floatMatrixAlgorithms.hpp>

Public Types
typedef MatrixType::ScalarType	ScalarType
typedef MatrixType::size_type	size_type

Static Public Member Functions
static ScalarType	spectralRadius (const MatrixType &D)
	Bounds for spectral radius of a given matrix D. More...
static ScalarType	maxEigenValueOfSymMatrix (const MatrixType &D)
	Rigorous bounds for maximal eigenvalue of a given symmetrix matrix D. More...

Detailed Description

template<typename MatrixType>
class capd::matrixAlgorithms::Gershgorin< MatrixType, true >

Specialization for rigorous (interval) types.

Member Typedef Documentation

ScalarType

template<typename MatrixType >

typedef MatrixType::ScalarType capd::matrixAlgorithms::Gershgorin< MatrixType, true >::ScalarType

size_type

template<typename MatrixType >

typedef MatrixType::size_type capd::matrixAlgorithms::Gershgorin< MatrixType, true >::size_type

Member Function Documentation

maxEigenValueOfSymMatrix()

template<typename MatrixType >

static ScalarType capd::matrixAlgorithms::Gershgorin< MatrixType, true >::maxEigenValueOfSymMatrix ( const MatrixType &  D )

inlinestatic

Rigorous bounds for maximal eigenvalue of a given symmetrix matrix D.

Remarks

To obtain good estimates the matrix should be in almost diagonal form

spectralRadius()

template<typename MatrixType >

static ScalarType capd::matrixAlgorithms::Gershgorin< MatrixType, true >::spectralRadius ( const MatrixType &  D )

inlinestatic

Bounds for spectral radius of a given matrix D.

Remarks

To obtain good estimates the matrix should be in almost diagonal form