// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// then make sure we retrieve the same ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == i*j*.5+.5, ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// then make sure we retrieve the same ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == i*j*.5+.5, ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.add (i,j, i*j*.5+.5);
// then make sure we retrieve the same ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == i*j*.5+.5, ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
if (i*j % 2 == 0)
// then make sure we retrieve the same ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == i*j*.5+.5, ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// then add the same elements again
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.add (i,j, i*j*.5+.5);
// then make sure we retrieve the correct
// ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == 2*(i*j*.5+.5), ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// then add the same elements again
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.add (i,j, i*j*.5+.5);
// then make sure we retrieve the correct
// ones
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == 2*(i*j*.5+.5), ExcInternalError());
unsigned int counter = 0;
for (unsigned int i=0; i<m.m(); ++i)
{
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
m.set (i,j, i*j*.5+.5);
// sparsity pattern
unsigned int counter = 0;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
m.set (i,j, i*j*.5+.5);
// first set a few entries. count how many
// entries we have
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// first set a few entries. count how many
// entries we have
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
// entries we have
double norm = 0;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
m.set (i,j, i*j*.5+.5);
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
m *= 1.25;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == (i*j*.5+.5)*1.25, ExcInternalError());
// first set a few entries
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
m.set (i,j, i*j*.5+.5);
m /= 4./3.;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
if ((i+2*j+1) % 3 == 0)
{
Assert (m(i,j) == (i*j*.5+.5)/4*3, ExcInternalError());
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
Assert (v(i) == i, ExcInternalError());
double result = 0;
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (i+2*j)*j;
Assert (w(i) == result, ExcInternalError());
}
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
Assert (v(i) == i, ExcInternalError());
double result = 0;
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (j+2*i)*j;
Assert (w(i) == result, ExcInternalError());
}
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
Assert (v(i) == i, ExcInternalError());
double result = 0;
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (i+2*j)*j;
Assert (w(i) == i+result, ExcInternalError());
}
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
Assert (v(i) == i, ExcInternalError());
double result = 0;
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (j+2*i)*j;
Assert (w(i) == i+result, ExcInternalError());
}
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
double result = 0;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (i+2*j)*j*(i+1);
Assert (s == result, ExcInternalError());
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
double result = 0;
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result += (i+2*j)*j*i;
Assert (s == result, ExcInternalError());
// then create a matrix from that
SparseMatrix<double> m(sp);
for (unsigned int i=0; i<m.m(); ++i)
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
m.set (i,j, i+2*j);
for (unsigned int i=0; i<v.size(); ++i)
Assert (w(i) == i+1, ExcInternalError());
double result = i+1;
- for (unsigned int j=0; j<m.m(); ++j)
+ for (unsigned int j=0; j<m.n(); ++j)
result -= (i+2*j)*j;
Assert (x(i) == result, ExcInternalError());