Heidelberg Educational Numerics Library Version 0.24 (from 9 September 2011)
Functions

src/lr.hh File Reference

This file implements a generic and dynamic vector class. More...

#include "vector.hh"
#include "densematrix.hh"

Go to the source code of this file.

Functions

template<class T >
void hdnum::lr (DenseMatrix< T > &A, Array< std::size_t > &p)
 compute lr decomposition of A with first nonzero pivoting
template<class T >
hdnum::abs (const T &t)
 our own abs class that works also for multiprecision types
template<class T >
void hdnum::lr_partialpivot (DenseMatrix< T > &A, Array< std::size_t > &p)
 lr decomposition of A with column pivoting
template<class T >
void hdnum::lr_fullpivot (DenseMatrix< T > &A, Array< std::size_t > &p, Array< std::size_t > &q)
 lr decomposition of A with full pivoting
template<class T >
void hdnum::permute_forward (const Array< std::size_t > &p, Vector< T > &b)
 apply permutations to a right hand side vector
template<class T >
void hdnum::permute_backward (const Array< std::size_t > &q, Vector< T > &z)
 apply permutations to a solution vector
template<class T >
void hdnum::row_equilibrate (DenseMatrix< T > &A, Vector< T > &s)
 perform a row equilibration of a matrix; return scaling for later use
template<class T >
void hdnum::apply_equilibrate (Vector< T > &s, Vector< T > &b)
 apply row equilibration to right hand side vector
template<class T >
void hdnum::solveL (const DenseMatrix< T > &A, Vector< T > &x, const Vector< T > &b)
 Assume L = lower triangle of A with l_ii=1, solve L x = b.
template<class T >
void hdnum::solveR (const DenseMatrix< T > &A, Vector< T > &x, const Vector< T > &b)
 Assume R = upper triangle of A and solve R x = b.

Detailed Description

This file implements a generic and dynamic vector class.