errdavidson.cpp

An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpai

#include "../davidson/errdavidson.h"

ErrDavidson::ErrDavidson(const ntyp &err)
{
    no_err = err;
}


char *ErrDavidson::Message() 
{
    switch (no_err) {
        case 1 : return "Dimension of matrix A is smaller from maximuma "
        				"size of base (N<LIM)";
        case 2 : return "The maximum dimension of base is smaller from 1(LIM < 1)";
        case 4 : return "Lack indices eigenpair for determining (ISELECT[0] < 1)";
        case 8 : return "The maximum number of eigenpair for determining is larger "
        				"from dimensions of matrix A (IHIGH > N)";
        case 16 : return "The maximum number of eigenpair for determining is "
                         "smaller from minimum number eigenpair for determining "
                         "(IHIGH < ILOQ)";
        case 32 : return "It is determined too much number of eigenpairs (K > LIM)";
        case 64 : return "It is determined two or more once the same eigenpairs "
        				 "(ISELECT[i]=ISELECT[j], i<>j)";
        case 128 : return "NUME > LIM";
        case 256 : return "Inappropriate value of MBLOCK";
        case 512 : return "Too small value of IWRSZ or IIWSZ";
        case 1024 : return "Orthogonalization failured";
        case 2048 : return "It is reached the maximum number of iterations";
        default : return "Error in DSPEVX procedure (eigenpairs not converged)";

    }
}