GVector.cc

Go to the documentation of this file.

#include <vecmath/GVector.h>
#include <vecmath/GMatrix.h>

void GVector::LUDBackSolve(GMatrix& gmatrix, GVector& gvector, GVector& gvector1) {
    int i = gmatrix.nRow * gmatrix.nCol;
    double *ad = new double[i];
    double *ad1 = new double[i];
    int *ai = new int[gvector.getSize()];

    for (int j = 0; j < gmatrix.nRow; j++) {
        for (int k1 = 0; k1 < gmatrix.nCol; k1++)
            ad[j * gmatrix.nCol + k1] = gmatrix.values[j][k1];
    }

    for (int k = 0; k < i; k++)
        ad1[k] = 0.0;

    for (int l = 0; l < gmatrix.nRow; l++)
        ad1[l * gmatrix.nCol] = gvector.values[l];

    for (int i1 = 0; i1 < gmatrix.nCol; i1++)
        ai[i1] = (int)gvector1.values[i1];

    GMatrix::luBacksubstitution(gmatrix.nRow, ad, ai, ad1);
    for (int j1 = 0; j1 < gmatrix.nRow; j1++)
        values[j1] = ad1[j1 * gmatrix.nCol];

        delete []ad;
        delete []ad1;
        delete []ai;
}

void GVector::SVDBackSolve(GMatrix& gmatrix, GMatrix& gmatrix1, GMatrix& gmatrix2, GVector& gvector) {
    GMatrix gmatrix3(gmatrix.nRow, gmatrix1.nCol);
    gmatrix3.mul(gmatrix, gmatrix2);
    gmatrix3.mulTransposeRight(gmatrix, gmatrix1);
    gmatrix3.invert();
    mul(gmatrix3, gvector);
}

void GVector::mul(const GMatrix& gmatrix, const GVector& gvector) {
    for (int j = 0; j < length; j++) {
        values[j] = 0.0;
        for (int i = 0; i < gvector.length; i++)
            values[j] += gmatrix.values[j][i] * gvector.values[i];
    }
}

void GVector::mul(const GVector& gvector, const GMatrix& gmatrix) {
    for (int j = 0; j < length; j++) {
        values[j] = 0.0;
        for (int i = 0; i < gvector.length; i++)
            values[j] += gmatrix.values[i][j] * gvector.values[i];
    }
}

---