From: Daniel Arndt Date: Fri, 17 Aug 2018 23:56:49 +0000 (+0200) Subject: Implement CUDAWrappers::SparseMatrix::print* X-Git-Tag: v9.1.0-rc1~799^2~3 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=208cf2445095e526e5b7b3ad2d18be721ac24417;p=dealii.git Implement CUDAWrappers::SparseMatrix::print* --- diff --git a/include/deal.II/lac/cuda_sparse_matrix.h b/include/deal.II/lac/cuda_sparse_matrix.h index 8c82c43046..f8a1bb11e2 100644 --- a/include/deal.II/lac/cuda_sparse_matrix.h +++ b/include/deal.II/lac/cuda_sparse_matrix.h @@ -20,6 +20,8 @@ #include +#include + #ifdef DEAL_II_COMPILER_CUDA_AWARE # include @@ -136,6 +138,50 @@ namespace CUDAWrappers */ std::size_t n_nonzero_elements() const; + + /** + * Print the matrix to the given stream, using the format (row,column) + * value, i.e. one nonzero entry of the matrix per line. If + * across is true, print all entries on a single line, using the + * format row,column:value. + * + * If the argument diagonal_first is true, diagonal elements of + * quadratic matrices are printed first in their row. If it is false, + * the elements in a row are written in ascending column order. + */ + template + void + print(StreamType &out, + const bool across = false, + const bool diagonal_first = true) const; + + /** + * Print the matrix in the usual format, i.e. as a matrix and not as a list + * of nonzero elements. For better readability, elements not in the matrix + * are displayed as empty space, while matrix elements which are explicitly + * set to zero are displayed as such. + * + * The parameters allow for a flexible setting of the output format: + * precision and scientific are used to determine the + * number format, where scientific = false means fixed point + * notation. A zero entry for width makes the function compute a + * width, but it may be changed to a positive value, if output is crude. + * + * Additionally, a character for an empty value may be specified. + * + * Finally, the whole matrix can be multiplied with a common denominator to + * produce more readable output, even integers. + * + * @attention This function may produce large amounts of output if + * applied to a large matrix! + */ + void + print_formatted(std::ostream & out, + const unsigned int precision = 3, + const bool scientific = true, + const unsigned int width = 0, + const char * zero_string = " ", + const double denominator = 1.) const; //@} /** @@ -340,6 +386,125 @@ namespace CUDAWrappers { return nnz; } + + + + template + template + inline void + SparseMatrix::print(StreamType &out, + const bool across, + const bool diagonal_first) const + { + Assert(column_index_dev != nullptr, ExcNotInitialized()); + Assert(val_dev != nullptr, ExcNotInitialized()); + Assert(row_ptr_dev != nullptr, ExcNotInitialized()); + + std::vector rows(n_rows + 1); + std::vector cols(nnz); + std::vector val(nnz); + Utilities::CUDA::copy_to_host(row_ptr_dev, rows); + Utilities::CUDA::copy_to_host(column_index_dev, cols); + Utilities::CUDA::copy_to_host(val_dev, val); + + bool has_diagonal = false; + Number diagonal = Number(); + + for (size_type i = 0; i < n_rows; ++i) + { + if (diagonal_first) + { + // find the diagonal and print if it exists + for (size_type j = rows[i]; j < rows[i + 1] && cols[j] <= i; ++j) + { + if (i == cols[j]) + { + diagonal = val[j]; + has_diagonal = true; + if (across) + out << ' ' << i << ',' << i << ':' << diagonal; + else + out << '(' << i << ',' << i << ") " << diagonal + << std::endl; + break; + } + } + } + for (size_type j = rows[i]; j < rows[i + 1]; ++j) + { + if (has_diagonal && i == cols[j]) + continue; + if (across) + out << ' ' << i << ',' << cols[j] << ':' << val[j]; + else + out << "(" << i << "," << cols[j] << ") " << val[j] << std::endl; + } + } + if (across) + out << std::endl; + } + + + + template + void + SparseMatrix::print_formatted(std::ostream & out, + const unsigned int precision, + const bool scientific, + const unsigned int width_, + const char * zero_string, + const double denominator) const + { + Assert(column_index_dev != nullptr, ExcNotInitialized()); + Assert(val_dev != nullptr, ExcNotInitialized()); + Assert(row_ptr_dev != nullptr, ExcNotInitialized()); + + std::vector rows(n_rows + 1); + std::vector cols(nnz); + std::vector val(nnz); + Utilities::CUDA::copy_to_host(row_ptr_dev, rows); + Utilities::CUDA::copy_to_host(column_index_dev, cols); + Utilities::CUDA::copy_to_host(val_dev, val); + + unsigned int width = width_; + + std::ios::fmtflags old_flags = out.flags(); + unsigned int old_precision = out.precision(precision); + + if (scientific) + { + out.setf(std::ios::scientific, std::ios::floatfield); + if (!width) + width = precision + 7; + } + else + { + out.setf(std::ios::fixed, std::ios::floatfield); + if (!width) + width = precision + 2; + } + + for (size_type i = 0; i < n_rows; ++i) + { + size_type j = rows[i]; + for (size_type k = 0; k < n_cols; ++k) + { + if (k == cols[j]) + { + out << std::setw(width) << val[j] * Number(denominator) << ' '; + ++j; + } + else + out << std::setw(width) << zero_string << ' '; + } + out << std::endl; + }; + AssertThrow(out, ExcIO()); + + // reset output format + out.precision(old_precision); + out.flags(old_flags); + } } // namespace CUDAWrappers DEAL_II_NAMESPACE_CLOSE