File: lnmatrxv.h

package info (click to toggle)
arpack%2B%2B 2.3-10
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, forky, sid, trixie
  • size: 4,556 kB
  • sloc: cpp: 16,612; sh: 8,819; ansic: 2,312; makefile: 258
file content (82 lines) | stat: -rw-r--r-- 1,294 bytes parent folder | download | duplicates (8)
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
   ARPACK++ v1.2 2/20/2000
   c++ interface to ARPACK code.

   MODULE LNMatrxV.h
   Function template that generates a  sparse (2n x n) rectangular matrix.

   ARPACK Authors
      Richard Lehoucq
      Danny Sorensen
      Chao Yang
      Dept. of Computational & Applied Mathematics
      Rice University
      Houston, Texas
*/

#ifndef LNMATRXV_H
#define LNMATRXV_H


template<class ARFLOAT, class ARINT>
void RectangularMatrix(ARINT n, ARINT& m, ARINT& nnz, ARFLOAT* &A, 
                       ARINT* &irow, ARINT* &pcol)
{

  ARINT   i, j;
  ARFLOAT dd, dl, du;

  // Defining constants.

  dl = 1.0;
  dd = 4.0;
  du = 2.0;

  // Defining the number of nonzero elements and lines of the matrix.

  nnz =  n*6-2;
  m   =  n*2;

  // Creating output vectors.

  A    = new ARFLOAT[nnz];
  irow = new ARINT[nnz];
  pcol = new ARINT[n+1];

  // Filling A, irow and pcol.

  pcol[0] = 0;
  j = 0;

  for (i=0; i!=n; i++) {

    if (i != 0) {
      irow[j] = i-1;
      A[j++]  = du;
    }

    irow[j] = i;
    A[j++]  = dd;

    irow[j] = i+1;
    A[j++]  = dl;

    irow[j] = i+n-1;
    A[j++]  = dl;

    irow[j] = i+n;
    A[j++]  = dd;

    if (i != (n-1)) {
      irow[j] = i+n+1;
      A[j++]  = du;
    }

    pcol[i+1] = j;

  }

} // Rectangular matrix.

#endif // LNMATRXV_H