Home Browse Files
      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
     64
     65
     66
#include <cxxstd/iostream.h>
#include <flens/flens.cxx>

using namespace std;
using namespace flens;

typedef double   T;

int
main()
{
    ///
    ///  Define some convenient typedefs for the matrix/vector types
    ///  of our system of linear equations.
    ///
    typedef GbMatrix<BandStorage<T> >           BandMatrix;
    typedef DenseVector<Array<T> >              Vector;

    ///
    ///  We also need an extra vector type for the pivots.  The type of the
    ///  pivots is taken for the system matrix.
    ///
    typedef BandMatrix::IndexType               IndexType;
    typedef DenseVector<Array<IndexType> >      IndexVector;

    ///
    ///  Set up the baby problem ...
    ///
    const IndexType n = 4;

    ///
    ///  We allocate a band matrix with one sub-diagonal and two superdiagonals.
    ///  Note, if you compute the LU factorization of a tridiagonal matrix then
    ///  an extra superdiagonal is needed!
    ///
    BandMatrix     A(n,n,1,2);

    Vector         b(n);
    IndexVector    piv(n);

    ///
    ///  We initialize the $n \times n$ tridiagonal matrix.
    ///
    A.diag( 1) = -1;
    A.diag( 0) =  2;
    A.diag(-1) = -3;

    b =  4,
        -7,
         0,
         1;

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

    ///
    /// And solve it with __lapack::sv__
    ///
    /// :links: __lapack::sv__ -> doc:flens/lapack/gb/sv
    lapack::sv(A, piv, b);

    cout << "(L\\R) = " << A << endl;

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





































































































Home