All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
scheduler_matrix_vector.cpp
Go to the documentation of this file.
/* =========================================================================
Copyright (c) 2010-2016, Institute for Microelectronics,
Institute for Analysis and Scientific Computing,
TU Wien.
Portions of this software are copyright by UChicago Argonne, LLC.
-----------------
ViennaCL - The Vienna Computing Library
-----------------
Project Head: Karl Rupp rupp@iue.tuwien.ac.at
(A list of authors and contributors can be found in the PDF manual)
License: MIT (X11), see file LICENSE in the base directory
============================================================================= */
//
// *** System
//
#include <iostream>
#include <vector>
//
// *** ViennaCL
//
#include "viennacl/scalar.hpp"
#include "viennacl/matrix.hpp"
#include "viennacl/vector.hpp"
#include "viennacl/linalg/prod.hpp"
#include "viennacl/linalg/norm_2.hpp"
#include "viennacl/linalg/direct_solve.hpp"
#include "viennacl/linalg/lu.hpp"
#include "viennacl/tools/random.hpp"
#include "viennacl/scheduler/execute.hpp"
#include "viennacl/scheduler/io.hpp"
//
// -------------------------------------------------------------
//
template<typename ScalarType>
ScalarType diff(ScalarType & s1, viennacl::scalar<ScalarType> & s2)
{
viennacl::backend::finish();
if (s1 != s2)
return (s1 - s2) / std::max(std::fabs(s1), std::fabs(s2));
return 0;
}
template<typename ScalarType, typename VCLVectorType>
ScalarType diff(std::vector<ScalarType> const & v1, VCLVectorType const & v2)
{
std::vector<ScalarType> v2_cpu(v2.size());
viennacl::backend::finish(); //workaround for a bug in APP SDK 2.7 on Trinity APUs (with Catalyst 12.8)
viennacl::copy(v2.begin(), v2.end(), v2_cpu.begin());
ScalarType norm_inf = 0;
for (unsigned int i=0;i<v1.size(); ++i)
{
if ( std::max( std::fabs(v2_cpu[i]), std::fabs(v1[i]) ) > 0 )
{
ScalarType tmp = std::fabs(v2_cpu[i] - v1[i]) / std::max( std::fabs(v2_cpu[i]), std::fabs(v1[i]) );
if (tmp > norm_inf)
norm_inf = tmp;
}
}
return norm_inf;
}
template<typename ScalarType, typename VCLMatrixType>
ScalarType diff(std::vector<std::vector<ScalarType> > const & mat1, VCLMatrixType const & mat2)
{
std::vector<std::vector<ScalarType> > mat2_cpu(mat2.size1(), std::vector<ScalarType>(mat2.size2()));
viennacl::backend::finish(); //workaround for a bug in APP SDK 2.7 on Trinity APUs (with Catalyst 12.8)
viennacl::copy(mat2, mat2_cpu);
ScalarType ret = 0;
ScalarType act = 0;
for (std::size_t i = 0; i < mat2_cpu.size(); ++i)
{
for (std::size_t j = 0; j < mat2_cpu[i].size(); ++j)
{
act = std::fabs(mat2_cpu[i][j] - mat1[i][j]) / std::max( std::fabs(mat2_cpu[i][j]), std::fabs(mat1[i][j]) );
if (act > ret)
ret = act;
}
}
//std::cout << ret << std::endl;
return ret;
}
//
// -------------------------------------------------------------
//
template<typename NumericT, typename Epsilon,
typename STLMatrixType, typename STLVectorType,
typename VCLMatrixType, typename VCLVectorType1, typename VCLVectorType2>
int test_prod_rank1(Epsilon const & epsilon,
STLMatrixType & std_m1, STLVectorType & std_v1, STLVectorType & std_v2,
VCLMatrixType & vcl_m1, VCLVectorType1 & vcl_v1, VCLVectorType2 & vcl_v2)
{
int retval = EXIT_SUCCESS;
// sync data:
viennacl::copy(std_v1.begin(), std_v1.end(), vcl_v1.begin());
viennacl::copy(std_v2.begin(), std_v2.end(), vcl_v2.begin());
viennacl::copy(std_m1, vcl_m1);
/* TODO: Add rank-1 operations here */
//reset vcl_matrix:
viennacl::copy(std_m1, vcl_m1);
// --------------------------------------------------------------------------
std::cout << "Matrix-Vector product" << std::endl;
for (std::size_t i=0; i<std_m1.size(); ++i)
{
std_v1[i] = 0;
for (std::size_t j=0; j<std_m1[i].size(); ++j)
std_v1[i] += std_m1[i][j] * std_v2[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_assign(), viennacl::linalg::prod(vcl_m1, vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Matrix-Vector product with inplace-add" << std::endl;
for (std::size_t i=0; i<std_m1.size(); ++i)
{
for (std::size_t j=0; j<std_m1[i].size(); ++j)
std_v1[i] += std_m1[i][j] * std_v2[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_inplace_add(), viennacl::linalg::prod(vcl_m1, vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Matrix-Vector product with inplace-sub" << std::endl;
for (std::size_t i=0; i<std_m1.size(); ++i)
{
for (std::size_t j=0; j<std_m1[i].size(); ++j)
std_v1[i] -= std_m1[i][j] * std_v2[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_inplace_sub(), viennacl::linalg::prod(vcl_m1, vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
// --------------------------------------------------------------------------
/*
std::cout << "Matrix-Vector product with scaled matrix" << std::endl;
std_v1 = viennacl::linalg::prod(NumericT(2.0) * std_m1, std_v2);
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_assign(), viennacl::linalg::prod(NumericT(2.0) * vcl_m1, vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}*/
// --------------------------------------------------------------------------
std::cout << "Matrix-Vector product with scaled vector" << std::endl;
/*
std_v1 = viennacl::linalg::prod(std_m1, NumericT(2.0) * std_v2);
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_assign(), viennacl::linalg::prod(vcl_m1, NumericT(2.0) * vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}*/
// --------------------------------------------------------------------------
std::cout << "Matrix-Vector product with scaled matrix and scaled vector" << std::endl;
/*
std_v1 = viennacl::linalg::prod(NumericT(2.0) * std_m1, NumericT(2.0) * std_v2);
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_assign(), viennacl::linalg::prod(NumericT(2.0) * vcl_m1, NumericT(2.0) * vcl_v2));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}*/
// --------------------------------------------------------------------------
std::cout << "Matrix-Vector product with scaled add" << std::endl;
NumericT alpha = static_cast<NumericT>(2.786);
NumericT beta = static_cast<NumericT>(3.1415);
viennacl::copy(std_v1.begin(), std_v1.end(), vcl_v1.begin());
viennacl::copy(std_v2.begin(), std_v2.end(), vcl_v2.begin());
for (std::size_t i=0; i<std_m1.size(); ++i)
{
std_v1[i] = 0;
for (std::size_t j=0; j<std_m1[i].size(); ++j)
std_v1[i] += std_m1[i][j] * std_v2[j];
std_v1[i] = alpha * std_v1[i] - beta * std_v1[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_assign(), alpha * viennacl::linalg::prod(vcl_m1, vcl_v2) - beta * vcl_v1);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Matrix-Vector product with scaled add, inplace-add" << std::endl;
viennacl::copy(std_v1.begin(), std_v1.end(), vcl_v1.begin());
viennacl::copy(std_v2.begin(), std_v2.end(), vcl_v2.begin());
for (std::size_t i=0; i<std_m1.size(); ++i)
{
NumericT tmp = 0;
for (std::size_t j=0; j<std_m1[i].size(); ++j)
tmp += std_m1[i][j] * std_v2[j];
std_v1[i] += alpha * tmp - beta * std_v1[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_inplace_add(), alpha * viennacl::linalg::prod(vcl_m1, vcl_v2) - beta * vcl_v1);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Matrix-Vector product with scaled add, inplace-sub" << std::endl;
viennacl::copy(std_v1.begin(), std_v1.end(), vcl_v1.begin());
viennacl::copy(std_v2.begin(), std_v2.end(), vcl_v2.begin());
for (std::size_t i=0; i<std_m1.size(); ++i)
{
NumericT tmp = 0;
for (std::size_t j=0; j<std_m1[i].size(); ++j)
tmp += std_m1[i][j] * std_v2[j];
std_v1[i] -= alpha * tmp - beta * std_v1[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v1, viennacl::op_inplace_sub(), alpha * viennacl::linalg::prod(vcl_m1, vcl_v2) - beta * vcl_v1);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v1, vcl_v1)) > epsilon )
{
std::cout << "# Error at operation: matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v1, vcl_v1)) << std::endl;
retval = EXIT_FAILURE;
}
// --------------------------------------------------------------------------
viennacl::copy(std_v1.begin(), std_v1.end(), vcl_v1.begin());
viennacl::copy(std_v2.begin(), std_v2.end(), vcl_v2.begin());
std::cout << "Transposed Matrix-Vector product" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
std_v2[i] = 0;
for (std::size_t j=0; j<std_m1.size(); ++j)
std_v2[i] += std_m1[j][i] * std_v1[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_assign(), viennacl::linalg::prod(trans(vcl_m1), vcl_v1));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Transposed Matrix-Vector product, inplace-add" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
for (std::size_t j=0; j<std_m1.size(); ++j)
std_v2[i] += std_m1[j][i] * std_v1[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_inplace_add(), viennacl::linalg::prod(trans(vcl_m1), vcl_v1));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Transposed Matrix-Vector product, inplace-sub" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
for (std::size_t j=0; j<std_m1.size(); ++j)
std_v2[i] -= std_m1[j][i] * std_v1[j];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_inplace_sub(), viennacl::linalg::prod(trans(vcl_m1), vcl_v1));
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
// --------------------------------------------------------------------------
std::cout << "Transposed Matrix-Vector product with scaled add" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
NumericT tmp = 0;
for (std::size_t j=0; j<std_m1.size(); ++j)
tmp += std_m1[j][i] * std_v1[j];
std_v2[i] = alpha * tmp + beta * std_v2[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_assign(), alpha * viennacl::linalg::prod(trans(vcl_m1), vcl_v1) + beta * vcl_v2);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Transposed Matrix-Vector product with scaled add, inplace-add" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
NumericT tmp = 0;
for (std::size_t j=0; j<std_m1.size(); ++j)
tmp += std_m1[j][i] * std_v1[j];
std_v2[i] += alpha * tmp + beta * std_v2[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_inplace_add(), alpha * viennacl::linalg::prod(trans(vcl_m1), vcl_v1) + beta * vcl_v2);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
std::cout << "Transposed Matrix-Vector product with scaled add, inplace-sub" << std::endl;
for (std::size_t i=0; i<std_m1[0].size(); ++i)
{
NumericT tmp = 0;
for (std::size_t j=0; j<std_m1.size(); ++j)
tmp += std_m1[j][i] * std_v1[j];
std_v2[i] -= alpha * tmp + beta * std_v2[i];
}
{
viennacl::scheduler::statement my_statement(vcl_v2, viennacl::op_inplace_sub(), alpha * viennacl::linalg::prod(trans(vcl_m1), vcl_v1) + beta * vcl_v2);
viennacl::scheduler::execute(my_statement);
}
if ( std::fabs(diff(std_v2, vcl_v2)) > epsilon )
{
std::cout << "# Error at operation: transposed matrix-vector product with scaled additions" << std::endl;
std::cout << " diff: " << std::fabs(diff(std_v2, vcl_v2)) << std::endl;
retval = EXIT_FAILURE;
}
// --------------------------------------------------------------------------
return retval;
}
//
// -------------------------------------------------------------
//
template< typename NumericT, typename F, typename Epsilon >
int test(Epsilon const& epsilon)
{
int retval = EXIT_SUCCESS;
viennacl::tools::uniform_random_numbers<NumericT> randomNumber;
std::size_t num_rows = 141;
std::size_t num_cols = 79;
// --------------------------------------------------------------------------
std::vector<NumericT> std_v1(num_rows);
for (std::size_t i = 0; i < std_v1.size(); ++i)
std_v1[i] = randomNumber();
std::vector<NumericT> std_v2 = std::vector<NumericT>(num_cols, NumericT(3.1415));
std::vector<std::vector<NumericT> > std_m1(std_v1.size(), std::vector<NumericT>(std_v2.size()));
for (std::size_t i = 0; i < std_m1.size(); ++i)
for (std::size_t j = 0; j < std_m1[i].size(); ++j)
std_m1[i][j] = static_cast<NumericT>(0.1) * randomNumber();
std::vector<std::vector<NumericT> > std_m2(std_v1.size(), std::vector<NumericT>(std_v1.size()));
for (std::size_t i = 0; i < std_m2.size(); ++i)
{
for (std::size_t j = 0; j < std_m2[i].size(); ++j)
std_m2[i][j] = static_cast<NumericT>(-0.1) * randomNumber();
std_m2[i][i] = static_cast<NumericT>(2) + randomNumber();
}
viennacl::vector<NumericT> vcl_v1_native(std_v1.size());
viennacl::vector<NumericT> vcl_v1_large(4 * std_v1.size());
viennacl::vector_range< viennacl::vector<NumericT> > vcl_v1_range(vcl_v1_large, viennacl::range(3, std_v1.size() + 3));
viennacl::vector_slice< viennacl::vector<NumericT> > vcl_v1_slice(vcl_v1_large, viennacl::slice(2, 3, std_v1.size()));
viennacl::vector<NumericT> vcl_v2_native(std_v2.size());
viennacl::vector<NumericT> vcl_v2_large(4 * std_v2.size());
viennacl::vector_range< viennacl::vector<NumericT> > vcl_v2_range(vcl_v2_large, viennacl::range(8, std_v2.size() + 8));
viennacl::vector_slice< viennacl::vector<NumericT> > vcl_v2_slice(vcl_v2_large, viennacl::slice(6, 2, std_v2.size()));
viennacl::matrix<NumericT, F> vcl_m1_native(std_m1.size(), std_m1[0].size());
viennacl::matrix<NumericT, F> vcl_m1_large(4 * std_m1.size(), 4 * std_m1[0].size());
viennacl::matrix_range< viennacl::matrix<NumericT, F> > vcl_m1_range(vcl_m1_large,
viennacl::range(8, std_m1.size() + 8),
viennacl::range(std_m1[0].size(), 2 * std_m1[0].size()) );
viennacl::matrix_slice< viennacl::matrix<NumericT, F> > vcl_m1_slice(vcl_m1_large,
viennacl::slice(6, 2, std_m1.size()),
viennacl::slice(std_m1[0].size(), 2, std_m1[0].size()) );
viennacl::matrix<NumericT, F> vcl_m2_native(std_m2.size(), std_m2[0].size());
viennacl::matrix<NumericT, F> vcl_m2_large(4 * std_m2.size(), 4 * std_m2[0].size());
viennacl::matrix_range< viennacl::matrix<NumericT, F> > vcl_m2_range(vcl_m2_large,
viennacl::range(8, std_m2.size() + 8),
viennacl::range(std_m2[0].size(), 2 * std_m2[0].size()) );
viennacl::matrix_slice< viennacl::matrix<NumericT, F> > vcl_m2_slice(vcl_m2_large,
viennacl::slice(6, 2, std_m2.size()),
viennacl::slice(std_m2[0].size(), 2, std_m2[0].size()) );
/* std::cout << "Matrix resizing (to larger)" << std::endl;
matrix.resize(2*num_rows, 2*num_cols, true);
for (unsigned int i = 0; i < matrix.size1(); ++i)
{
for (unsigned int j = (i<result.size() ? rhs.size() : 0); j < matrix.size2(); ++j)
matrix(i,j) = 0;
}
vcl_matrix.resize(2*num_rows, 2*num_cols, true);
viennacl::copy(vcl_matrix, matrix);
if ( std::fabs(diff(matrix, vcl_matrix)) > epsilon )
{
std::cout << "# Error at operation: matrix resize (to larger)" << std::endl;
std::cout << " diff: " << std::fabs(diff(matrix, vcl_matrix)) << std::endl;
return EXIT_FAILURE;
}
matrix(12, 14) = NumericT(1.9);
matrix(19, 16) = NumericT(1.0);
matrix (13, 15) = NumericT(-9);
vcl_matrix(12, 14) = NumericT(1.9);
vcl_matrix(19, 16) = NumericT(1.0);
vcl_matrix (13, 15) = NumericT(-9);
std::cout << "Matrix resizing (to smaller)" << std::endl;
matrix.resize(result.size(), rhs.size(), true);
vcl_matrix.resize(result.size(), rhs.size(), true);
if ( std::fabs(diff(matrix, vcl_matrix)) > epsilon )
{
std::cout << "# Error at operation: matrix resize (to smaller)" << std::endl;
std::cout << " diff: " << std::fabs(diff(matrix, vcl_matrix)) << std::endl;
return EXIT_FAILURE;
}
*/
//
// Run a bunch of tests for rank-1-updates, matrix-vector products
//
std::cout << "------------ Testing rank-1-updates and matrix-vector products ------------------" << std::endl;
std::cout << "* m = full, v1 = full, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_native, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = full, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_native, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = full, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_native, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = range
std::cout << "* m = full, v1 = range, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_range, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = range, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_range, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = range, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_range, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = slice
std::cout << "* m = full, v1 = slice, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_slice, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = slice, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_slice, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = full, v1 = slice, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_native, vcl_v1_slice, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = full, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_native, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = full, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_native, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = full, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_native, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = range
std::cout << "* m = range, v1 = range, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_range, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = range, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_range, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = range, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_range, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = slice
std::cout << "* m = range, v1 = slice, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_slice, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = slice, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_slice, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = range, v1 = slice, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_range, vcl_v1_slice, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = full, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_native, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = full, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_native, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = full, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_native, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = range
std::cout << "* m = slice, v1 = range, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_range, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = range, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_range, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = range, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_range, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
// v1 = slice
std::cout << "* m = slice, v1 = slice, v2 = full" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_slice, vcl_v2_native);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = slice, v2 = range" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_slice, vcl_v2_range);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
std::cout << "* m = slice, v1 = slice, v2 = slice" << std::endl;
retval = test_prod_rank1<NumericT>(epsilon,
std_m1, std_v1, std_v2,
vcl_m1_slice, vcl_v1_slice, vcl_v2_slice);
if (retval == EXIT_FAILURE)
{
std::cout << " --- FAILED! ---" << std::endl;
return retval;
}
else
std::cout << " --- PASSED ---" << std::endl;
return retval;
}
//
// -------------------------------------------------------------
//
int main()
{
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << "## Test :: Matrix" << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
int retval = EXIT_SUCCESS;
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
{
typedef float NumericT;
NumericT epsilon = NumericT(1.0E-3);
std::cout << "# Testing setup:" << std::endl;
std::cout << " eps: " << epsilon << std::endl;
std::cout << " numeric: float" << std::endl;
std::cout << " layout: row-major" << std::endl;
retval = test<NumericT, viennacl::row_major>(epsilon);
if ( retval == EXIT_SUCCESS )
std::cout << "# Test passed" << std::endl;
else
return retval;
}
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
{
typedef float NumericT;
NumericT epsilon = NumericT(1.0E-3);
std::cout << "# Testing setup:" << std::endl;
std::cout << " eps: " << epsilon << std::endl;
std::cout << " numeric: float" << std::endl;
std::cout << " layout: column-major" << std::endl;
retval = test<NumericT, viennacl::column_major>(epsilon);
if ( retval == EXIT_SUCCESS )
std::cout << "# Test passed" << std::endl;
else
return retval;
}
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
#ifdef VIENNACL_WITH_OPENCL
if ( viennacl::ocl::current_device().double_support() )
#endif
{
{
typedef double NumericT;
NumericT epsilon = 1.0E-11;
std::cout << "# Testing setup:" << std::endl;
std::cout << " eps: " << epsilon << std::endl;
std::cout << " numeric: double" << std::endl;
std::cout << " layout: row-major" << std::endl;
retval = test<NumericT, viennacl::row_major>(epsilon);
if ( retval == EXIT_SUCCESS )
std::cout << "# Test passed" << std::endl;
else
return retval;
}
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
{
typedef double NumericT;
NumericT epsilon = 1.0E-11;
std::cout << "# Testing setup:" << std::endl;
std::cout << " eps: " << epsilon << std::endl;
std::cout << " numeric: double" << std::endl;
std::cout << " layout: column-major" << std::endl;
retval = test<NumericT, viennacl::column_major>(epsilon);
if ( retval == EXIT_SUCCESS )
std::cout << "# Test passed" << std::endl;
else
return retval;
}
std::cout << std::endl;
std::cout << "----------------------------------------------" << std::endl;
std::cout << std::endl;
}
std::cout << std::endl;
std::cout << "------- Test completed --------" << std::endl;
std::cout << std::endl;
return retval;
}
viennacl::scalar
This class represents a single scalar value on the GPU and behaves mostly like a built-in scalar type...
Definition: forwards.h:227
norm_2.hpp
Generic interface for the l^2-norm. See viennacl/linalg/vector_operations.hpp for implementations...
diff
ScalarType diff(ScalarType &s1, viennacl::scalar< ScalarType > &s2)
Definition: scheduler_matrix_vector.cpp:50
viennacl::matrix_slice
Class for representing strided submatrices of a bigger matrix A.
Definition: forwards.h:443
trans
std::vector< std::vector< NumericT > > trans(std::vector< std::vector< NumericT > > const &A)
Definition: blas3_solve.cpp:195
prod.hpp
Generic interface for matrix-vector and matrix-matrix products. See viennacl/linalg/vector_operations...
matrix.hpp
Implementation of the dense matrix class.
io.hpp
Some helper routines for reading/writing/printing scheduler expressions.
viennacl::op_assign
A tag class representing assignment.
Definition: forwards.h:81
viennacl::backend::finish
void finish()
Synchronizes the execution. finish() will only return after all compute kernels (CUDA, OpenCL) have completed.
Definition: memory.hpp:54
viennacl::matrix
A dense matrix class.
Definition: forwards.h:375
viennacl::scheduler::execute
void execute(statement const &s)
Definition: execute.hpp:279
test
int test(Epsilon const &epsilon)
Definition: scheduler_matrix_vector.cpp:431
s2
viennacl::scalar< int > s2
Definition: global_variables.cpp:58
s1
viennacl::scalar< float > s1
Definition: global_variables.cpp:57
viennacl::linalg::detail::max
T max(const T &lhs, const T &rhs)
Maximum.
Definition: util.hpp:59
viennacl::ocl::current_device
viennacl::ocl::device const & current_device()
Convenience function for returning the active device in the current context.
Definition: backend.hpp:351
viennacl::op_inplace_add
A tag class representing inplace addition.
Definition: forwards.h:83
NumericT
float NumericT
Definition: bisect.cpp:40
test_prod_rank1
int test_prod_rank1(Epsilon const &epsilon, STLMatrixType &std_m1, STLVectorType &std_v1, STLVectorType &std_v2, VCLMatrixType &vcl_m1, VCLVectorType1 &vcl_v1, VCLVectorType2 &vcl_v2)
Definition: scheduler_matrix_vector.cpp:107
v1
viennacl::vector< float > v1
Definition: global_variables.cpp:60
viennacl::linalg::prod
VectorT prod(std::vector< std::vector< T, A1 >, A2 > const &matrix, VectorT const &vector)
Definition: prod.hpp:102
viennacl::traits::size
vcl_size_t size(VectorType const &vec)
Generic routine for obtaining the size of a vector (ViennaCL, uBLAS, etc.)
Definition: size.hpp:239
viennacl::tools::uniform_random_numbers
Random number generator for returning uniformly distributed values in the closed interval [0...
Definition: random.hpp:44
main
int main()
Definition: scheduler_matrix_vector.cpp:909
viennacl::vector_range
Class for representing non-strided subvectors of a bigger vector x.
Definition: forwards.h:434
viennacl::vector_slice
Class for representing strided subvectors of a bigger vector x.
Definition: forwards.h:437
viennacl::ocl::device::double_support
bool double_support() const
ViennaCL convenience function: Returns true if the device supports double precision.
Definition: device.hpp:956
viennacl::vector< NumericT >
lu.hpp
Implementations of LU factorization for row-major and column-major dense matrices.
direct_solve.hpp
Implementations of dense direct solvers are found here.
viennacl::op_inplace_sub
A tag class representing inplace subtraction.
Definition: forwards.h:85
v2
viennacl::vector< int > v2
Definition: global_variables.cpp:61
vector.hpp
The vector type with operator-overloads and proxy classes is defined here. Linear algebra operations ...
viennacl::linalg::norm_inf
T norm_inf(std::vector< T, A > const &v1)
Definition: norm_inf.hpp:60
viennacl::copy
void copy(std::vector< NumericT > &cpu_vec, circulant_matrix< NumericT, AlignmentV > &gpu_mat)
Copies a circulant matrix from the std::vector to the OpenCL device (either GPU or multi-core CPU) ...
Definition: circulant_matrix.hpp:150
random.hpp
A small collection of sequential random number generators.
viennacl::basic_range
A range class that refers to an interval [start, stop), where 'start' is included, and 'stop' is excluded.
Definition: forwards.h:424
ScalarType
float ScalarType
Definition: fft_1d.cpp:42
execute.hpp
Provides the datastructures for dealing with a single statement such as 'x = y + z;'.
viennacl::matrix_range
Class for representing non-strided submatrices of a bigger matrix A.
Definition: forwards.h:440
viennacl::scheduler::statement
The main class for representing a statement such as x = inner_prod(y,z); at runtime.
Definition: forwards.h:502
viennacl::basic_slice
A slice class that refers to an interval [start, stop), where 'start' is included, and 'stop' is excluded.
Definition: forwards.h:429
scalar.hpp
Implementation of the ViennaCL scalar class.