1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
#include <iostream>
#include <flens/flens.cxx>

using namespace std;
using namespace flens;

int
main()
{
    typedef complex<double>             Complex;
    const Complex                       I(0,1);


    GeMatrix<FullStorage<Complex> >     A(4,4), Q;
    DenseVector<Array<Complex> >        b(4);
    DenseVector<Array<Complex> >        tau;
    //DenseVector<Array<Complex> >      work;

    A =  2,   3,  -1,   0,
        -6,  -5,   0,   2,
         2,  -5,   6,  -6,
         4,   6,   2,  -3;
    A *= I;

    b = 20,
       -33,
       -43,
        49;
    b *= I;

    cout << "A = " << A << endl;
    cout << "b = " << b << endl;

///
/// Compute the factorization $A = QR$.  Note that the workspace gets created
/// implicitly and temporarily.  So you might not want to do this inside a loop.
///
    lapack::qrf(A, tau);
    //lapack::qrf(A, tau, work);

///
/// Explicitly setup $Q$.
///
    Q = A;
    lapack::ungqr(Q, tau);
    //lapack::orgqr(Q, tau, work);

    cout << "Q = " << Q << endl;

///
/// Compute $\tilde{b} = Q^T b$.
///
    DenseVector<Array<Complex> >  x;
    x = conjTrans(Q)*b;

///
/// Solve $R x = \tilde{b}$.  Vector $b$ gets overwritten with $x$.
///
    const auto R = A.upper();
    blas::sv(NoTrans, R, x);

    cout << "x = " << x << endl;
}