Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.arrayfire.org/docs/benchmarks_2cg_8cpp-example.htm below:

ArrayFire: benchmarks/cg.cpp

#include <iostream>

static size_t dimension = 4 * 1024;

static const int maxIter = 10;

static const int sparsityFactor = 7;

void setupInputs() {

T = randu(dimension, dimension,

);

A = floor(T * 1000);

A = A * ((A % sparsityFactor) == 0) / 1000;

A = transpose(A) + A + A.

(0) * identity(A.

(0), A.

(0),

);

spA = sparse(A);

b = matmul(A, x0);

std::cout << "Sparsity of A = "

<< 100.f * (float)sparseGetNNZ(spA) / (float)spA.

() <<

<< std::endl;

std::cout <<

<< A.

() / (1024.f * 1024.f)

<< " MB" << std::endl;

std::cout << "Memory Usage of spA = "

<< (sparseGetValues(spA).

() + sparseGetRowIdx(spA).

() +

sparseGetColIdx(spA).

()) /

(1024.f * 1024.f)

<< " MB" << std::endl;

}

void sparseConjugateGradient(void) {

r = b - matmul(spA, x);

for (int i = 0; i < maxIter; ++i) {

Ap = matmul(spA, p);

alpha_num = dot(r, r);

alpha_den = dot(p, Ap);

alpha = alpha_num / alpha_den;

r -= tile(alpha, Ap.

()) * Ap;

x += tile(alpha, Ap.

()) * p;

beta_num = dot(r, r);

beta = beta_num / alpha_num;

p = r + tile(beta, p.

()) * p;

}

}

void denseConjugateGradient(void) {

for (int i = 0; i < maxIter; ++i) {

alpha = alpha_num / alpha_den;

beta = beta_num / alpha_num;

}

}

checkConjugateGradient(

in) {

for (int i = 0; i < maxIter; ++i) {

alpha = alpha_num / alpha_den;

beta = beta_num / alpha_num;

}

std::cout << "Final difference in solutions:\n";

}

int main(int, char **) {

setupInputs();

std::cout << "Verifying Dense Conjugate Gradient:" << std::endl;

checkConjugateGradient(A);

std::cout << "Verifying Sparse Conjugate Gradient:" << std::endl;

checkConjugateGradient(spA);

std::cout << "Dense Conjugate Gradient Time: "

<<

(denseConjugateGradient) * 1000 <<

<< std::endl;

std::cout << "Sparse Conjugate Gradient Time: "

<<

(sparseConjugateGradient) * 1000 <<

<< std::endl;

return 0;

}

A multi dimensional data container.

dim4 dims() const

Get dimensions of the array.

size_t bytes() const

Get the size of the array in bytes.

dim_t elements() const

Get the total number of elements across all dimensions of the array.

@ f32

32-bit floating point values

T dot(const array &lhs, const array &rhs, const matProp optLhs=AF_MAT_NONE, const matProp optRhs=AF_MAT_NONE)

C++ Interface to compute the dot product.

AFAPI array matmul(const array &lhs, const array &rhs, const matProp optLhs=AF_MAT_NONE, const matProp optRhs=AF_MAT_NONE)

C++ Interface to multiply two matrices.

array constant(T val, const dim4 &dims, const dtype ty=(af_dtype) dtype_traits< T >::ctype)

C++ Interface to generate an array with elements set to a specified value.

AFAPI void sync(const int device=-1)

Blocks until the device is finished processing.

AFAPI array tile(const array &in, const unsigned x, const unsigned y=1, const unsigned z=1, const unsigned w=1)

C++ Interface to generate a tiled array.

AFAPI double timeit(void(*fn)())

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4