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
|
#include <lapack.hh>
#include <vector>
#include <stdio.h>
#include "util.hh"
//------------------------------------------------------------------------------
template <typename T>
void run( int n )
{
int lda = n;
std::vector<T> A( lda*n, 1.0 ); // m-by-k
// Make diagonally dominant to be positive definite.
for (int i = 0; i < n; ++i)
A[ i + i*lda ] += n;
// ... fill in application data into A ...
// Cholesky factorization of A.
int info = lapack::potrf( lapack::Uplo::Lower, n, A.data(), lda );
if (info != 0)
printf( "potrf error: %d\n", info );
}
//------------------------------------------------------------------------------
int main( int argc, char** argv )
{
// Parse command line to set types for s, d, c, z precisions.
bool types[ 4 ];
parse_args( argc, argv, types );
int n = 100;
if (types[ 0 ]) {
printf( "run< float >( %d )\n", n );
run< float >( n );
}
if (types[ 1 ]) {
printf( "run< double >( %d )\n", n );
run< double >( n );
}
if (types[ 2 ]) {
printf( "run< complex<float> >( %d )\n", n );
run< std::complex<float> >( n );
}
if (types[ 3 ]) {
printf( "run< complex<double> >( %d )\n", n );
run< std::complex<double> >( n );
}
return 0;
}
|
