Index

C++ Code Documentation

loop::LULapack

File: LAB/loop/LULapack.H

public:
  • LULapack( uint rows, uint cols );
    constructor
  • virtual ~LULapack();
    destructor
  • int factor( base::ArrayP<Complex > &A );
    Performs LU factorization on A, computing A = L U where L is lower triangular with 1's on the diagonal, and U is upper triangular. Upon completion, L and U are packed into A with the diagonal omitted. A matrix in Lapack is stored as, e.g. a0 a3 a1 a4 a2 a5 i.e. the entries go down the columns (counterintuitive)
  • int solve( base::ArrayP<Complex > &a, base::ArrayP<Complex > &b, uint b_cols );
protected:
  • uint _rows;
  • uint _cols;
private:
  • LULapack( LULapack const & );
  • LULapack &operator=( LULapack const & );

loop::LULapack GANG