Add CG test using cuda

diff --git a/tests/cuda/solver_01.cu b/tests/cuda/solver_01.cu
new file mode 100644 (file)
index 0000000..1389a5b
--- /dev/null
+++ b/tests/cuda/solver_01.cu
@@ -0,0 +1,91 @@
+// ---------------------------------------------------------------------
+//
+// Copyright (C) 2018 by the deal.II authors
+//
+// This file is part of the deal.II library.
+//
+// The deal.II library is free software; you can use it, redistribute
+// it, and/or modify it under the terms of the GNU Lesser General
+// Public License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+// The full text of the license can be found in the file LICENSE at
+// the top level of the deal.II distribution.
+//
+// ---------------------------------------------------------------------
+
+// Check that dealii::SolverCG works with CUDAWrappers::SparseMatrix
+
+#include "../tests.h"
+#include "../testmatrix.h"
+
+#include <deal.II/lac/vector_memory.h>
+#include <deal.II/lac/vector_memory.templates.h>
+
+#include <deal.II/base/exceptions.h>
+#include <deal.II/lac/cuda_sparse_matrix.h>
+#include <deal.II/lac/precondition.h>
+#include <deal.II/lac/read_write_vector.h>
+#include <deal.II/lac/solver_cg.h>
+#include <deal.II/lac/solver_control.h>
+#include <deal.II/lac/vector.h>
+
+void test(cusparseHandle_t cusparse_handle)
+{
+  // Build the sparse matrix on the host
+  const unsigned int problem_size = 10;
+  unsigned int size  = (problem_size-1)*(problem_size-1);
+  FDMatrix testproblem(problem_size, problem_size);
+  SparsityPattern structure(size, size, 5);
+  SparseMatrix<double> A;
+  testproblem.five_point_structure(structure);
+  structure.compress();
+  A.reinit(structure);
+  testproblem.five_point(A);
+
+  // Solve on the host
+  PreconditionIdentity prec_no;
+  SolverControl control(100, 1.e-10);
+  SolverCG<> cg_host(control);
+  Vector<double> sol_host(size);
+  Vector<double> rhs_host(size);
+  for (unsigned int i=0; i<size; ++i)
+    rhs_host[i] = static_cast<double>(i);
+  cg_host.solve(A, sol_host, rhs_host, prec_no);
+
+  // Solve on the device
+  CUDAWrappers::SparseMatrix<double> A_dev(cusparse_handle, A);
+  LinearAlgebra::CUDAWrappers::Vector<double> sol_dev(size);
+  LinearAlgebra::CUDAWrappers::Vector<double> rhs_dev(size);
+  LinearAlgebra::ReadWriteVector<double> rw_vector(size);
+  for (unsigned int i=0; i<size; ++i)
+    rw_vector[i] = static_cast<double>(i);
+  rhs_dev.import(rw_vector, VectorOperation::insert);
+  SolverCG<LinearAlgebra::CUDAWrappers::Vector<double>> cg_dev(control);
+  cg_dev.solve(A_dev, sol_dev, rhs_dev, prec_no);
+
+  // Check the result
+  rw_vector.import(sol_dev, VectorOperation::insert);
+  for (unsigned int i=0; i<size; ++i)
+    AssertThrow(std::fabs(rw_vector[i] - sol_host[i])<1e-8, ExcInternalError());
+}
+
+int main()
+{
+  initlog();
+  deallog.depth_console(0);
+
+  cusparseHandle_t cusparse_handle;
+  cusparseStatus_t cusparse_error_code = cusparseCreate(&cusparse_handle);
+  AssertCusparse(cusparse_error_code);
+
+  test(cusparse_handle);
+
+  GrowingVectorMemory<LinearAlgebra::CUDAWrappers::Vector<double>>::release_unused_memory();
+
+  cusparse_error_code = cusparseDestroy(cusparse_handle);
+  AssertCusparse(cusparse_error_code);
+
+  deallog << "OK" <<std::endl;
+
+  return 0;
+}

diff --git a/tests/cuda/solver_01.output b/tests/cuda/solver_01.output
new file mode 100644 (file)
index 0000000..b0ef558
--- /dev/null
+++ b/tests/cuda/solver_01.output
@@ -0,0 +1,6 @@
+
+DEAL:cg::Starting value 416.989
+DEAL:cg::Convergence step 31 value 8.71925e-12
+DEAL:cg::Starting value 416.989
+DEAL:cg::Convergence step 31 value 8.71925e-12
+DEAL::OK