Menu

[r198]: / trunk / test / dgematrix / dgematrix-forbiddencode / main.cpp  Maximize  Restore  History

Download this file

97 lines (81 with data), 1.9 kB

 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
83
84
85
86
87
88
89
90
91
92
93
94
95
//=============================================================================
#include <iostream>
#include <cstdlib>
#include <ctime>
#include "cpplapack.h"
using namespace std;
void random( CPPL::drovector & x ) {
for(int i=0; i<x.l; i++){
x(i) =double( rand() /(RAND_MAX/10) );
}
}
void random( CPPL::dcovector & x ) {
for(int i=0; i<x.l; i++){
x(i) =double( rand() /(RAND_MAX/10) );
}
}
void random( CPPL::dgematrix & A ) {
for(int i=0; i<A.m; i++){ for(int j=0; j<A.n; j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
}}
}
void random( CPPL::dsymatrix & A ) {
for(int i=0; i<A.n; i++){ for(int j=0; j<A.n; j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
}}
}
void random( CPPL::dgbmatrix & A ) {
for(int i=0; i<A.m; i++){
for(int j=std::max(0,i-A.kl); j<std::min(A.n,i+A.ku+1); j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
}
}
}
void random( CPPL::dgsmatrix & A ) {
for(int i=0; i<A.m; i++){
for(int j=0; j<=i; j++){
if(rand()%2==0){
A(i,j) =double( rand() / (RAND_MAX/10) );
}
}
}
}
//=============================================================================
/*! main */
int main( int argc, char * argv[] )
{
srand(unsigned(time(NULL)));
int M(9), N(11);
int KL(2), KU(1);
int CAP(4);
CPPL::dgematrix A(M,N);
CPPL::dgbmatrix B(M,N,KL,KU);
CPPL::dgsmatrix C(M,N,CAP);
CPPL::dsymatrix D(M);
CPPL::drovector x(M);
CPPL::dcovector y(M);
random( A );
random( B );
random( C );
random( D );
random( x );
random( y );
std::cout << "A =\n" << A << std::endl;
std::cout << "C =\n" << C << std::endl;
std::cout << "t(C) =\n" << t(C) << std::endl;
/*
//////// cause memory leak ////////
t( A );
t( B );
t( C );
t( D );
t( x );
t( y );
A + B;
+ A;
i( D );
y + t( x );
C * t(C);
*/
return 0;
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.