QRSolver< T > Class Template Reference

QRSolver - QR decomposition of a matrix A For an m-by-n matrix A, with m>=n, the QR decomposition is A = Q*R, where Q is an m-by-n orthogonal matrix, and R is an n-by-n upper-triangular matrix. More...

Public Member Functions
	QRSolver (const Array2D< T > &A)
	~QRSolver ()
const Array1DImpl< T > *	apply (const Array1D< T > &B) const
const Array1DImpl< T > *	apply (const Array2D< T > &B) const
const Array2DImpl< T > *	getQ () const
const Array2DImpl< T > *	getR () const
bool	isFullRank ()

Protected Attributes
bool	isfullrank_
int	m_
int	n_
Array2DImpl< T >	qr_
Array1DImpl< T > *	rdiag_

Detailed Description

template<class T>
class QRSolver< T >

QRSolver - QR decomposition of a matrix A For an m-by-n matrix A, with m>=n, the QR decomposition is A = Q*R, where Q is an m-by-n orthogonal matrix, and R is an n-by-n upper-triangular matrix.

<>

Constructor & Destructor Documentation

QRSolver()

template<class T >

QRSolver< T >::QRSolver ( const Array2D< T > &  A )

inline

~QRSolver()

template<class T >

QRSolver< T >::~QRSolver

inline

Member Function Documentation

apply() [1/2]

template<class T >

const Array1DImpl< T > * QRSolver< T >::apply ( const Array1D< T > &  B ) const

inline

apply() [2/2]

template<class T >

const Array1DImpl< T > * QRSolver< T >::apply ( const Array2D< T > &  B ) const

inline

getQ()

template<class T >

const Array2DImpl< T > * QRSolver< T >::getQ

inline

getR()

template<class T >

const Array2DImpl< T > * QRSolver< T >::getR

inline

isFullRank()

template<class T >

bool QRSolver< T >::isFullRank ( )

inline

Member Data Documentation

isfullrank_

template<class T >

bool QRSolver< T >::isfullrank_

protected

m_

template<class T >

int QRSolver< T >::m_

protected

n_

template<class T >

int QRSolver< T >::n_

protected

qr_

template<class T >

Array2DImpl<T> QRSolver< T >::qr_

protected

rdiag_

template<class T >

Array1DImpl<T>* QRSolver< T >::rdiag_

protected