www.pudn.com > Lapackpp1_1a.zip > bmd.cc
//
// LAPACK++ 1.1 Linear Algebra Package 1.1
// University of Tennessee, Knoxvilee, TN.
// Oak Ridge National Laboratory, Oak Ridge, TN.
// Authors: J. J. Dongarra, E. Greaser, R. Pozo, D. Walker
// (C) 1992-1996 All Rights Reserved
//
// NOTICE
//
// Permission to use, copy, modify, and distribute this software and
// its documentation for any purpose and without fee is hereby granted
// provided that the above copyright notice appear in all copies and
// that both the copyright notice and this permission notice appear in
// supporting documentation.
//
// Neither the Institutions (University of Tennessee, and Oak Ridge National
// Laboratory) nor the Authors make any representations about the suitability
// of this software for any purpose. This software is provided ``as is''
// without express or implied warranty.
//
// LAPACK++ was funded in part by the U.S. Department of Energy, the
// National Science Foundation and the State of Tennessee.
#include "lafnames.h"
#include LA_BAND_MAT_DOUBLE_H
int LaBandMatDouble::debug_= 0;
int* LaBandMatDouble::info_ = new int;
double LaBandMatDouble::outofbounds_ = 0.0;
LaBandMatDouble& LaBandMatDouble::operator=(double a)
{
int M = size(0);
int N = size(1);
int i,j;
for (j=0; j=j)&&(i-j<=kl_))||((j>i)&&(j-i<=ku_)))
s << ob(i,j) << ' ';
else
s << " ";
s << "\n";
}
}
#endif //0
else
{
int i,j;
int N_ = ob.N_;
for (j=0; j=N_)||(j<0||j>=N_))
{
cerr << "Index to Banded Matrix out of range!\n";
exit (1);
}
#endif
if (i<0)
{
if (-i<=kl_)
return data_(kl_+i-j,j);
else
return outofbounds_;
}
if (i>=j)
{
if (i-j<=kl_)
return data_(kl_+ku_+i-j,j);
else
return outofbounds_;
}
else // (j>i)
{
if (j-i<=ku_)
return data_(kl_+ku_+i-j,j); // kl_ is factorization storage here.
else
return outofbounds_;
}
}
double& LaBandMatDouble::operator()(int i, int j) const
{
#ifdef LA_BOUNDS_CHK
if ((i<0||i>=N_)||(j<0||j>=N_))
{
cerr << "Index to Banded Matrix out of range!\n";
exit (1);
}
#endif
if (i<0)
{
if (-i<=kl_)
return data_(kl_+i-j,j);
else
return outofbounds_;
}
if (i>=j)
{
if (i-j<=kl_)
return data_(kl_+ku_+i-j,j);
else
return outofbounds_;
}
else // (j>i)
{
if (j-i<=ku_)
return data_(kl_+ku_+i-j,j); // kl_ is factorization storage here.
else
return outofbounds_;
}
}