upper_conj.c File Reference

Detailed Description

Conjugate sparse triangular solve implementation when the matrix is upper triangular.

Todo:
The case of sorted indices assumes not only that the indices are sorted, but also that there is a unique diagonal element. Do we need to fix this? The general ordering case makes no such assumption.

#include <assert.h>
#include <oski/config.h>
#include <oski/common.h>
#include <oski/mangle.h>
#include <oski/vecview.h>
#include <oski/CSR/format.h>
#include <oski/CSR/module.h>

Defines

#define REGISTER   register
 Real-valued, so use explicit 'register' keyword.

Functions

static void CSR_MatConjTrisolveUpper_Unitdiag_xsX (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *restrict x, oski_index_t incx)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • the diagonal is implicit and equal to 1,
  • the column indices within a given row may be unsorted, and
  • $x$ is an array with general stride.

static void CSR_MatConjTrisolveUpper_Unitdiag_xs1 (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *x)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • the diagonal is implicit and equal to 1,
  • the column indices within a given row may be unsorted, and
  • $x$ is an array with unit-stride.

static void CSR_MatConjTrisolveUpper_Diag_Sorted_xsX (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *restrict x, oski_index_t incx)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • a full (all non-zero) diagonal exists,
  • the column indices within a given row are sorted in increasing order (i.e., the last element of each row is the diagonal non-zero value), and
  • $x$ is an array with general stride.

static void CSR_MatConjTrisolveUpper_Diag_Sorted_xs1 (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *x)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • a full (all non-zero) diagonal exists,
  • the column indices within a given row are sorted in increasing order (i.e., the last element of each row is the diagonal non-zero value), and
  • $x$ is an array with unit-stride.

static void CSR_MatConjTrisolveUpper_Diag_Unsorted_xsX (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *restrict x, oski_index_t incx)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • a full (all non-zero) diagonal exists,
  • the column indices within a given row may be unsorted, and
  • $x$ is an array with general stride.

static void CSR_MatConjTrisolveUpper_Diag_Unsorted_xs1 (oski_index_t m, oski_index_t indbase, const oski_index_t *restrict ptr, const oski_index_t *restrict ind, const oski_value_t *restrict val, oski_value_t alpha, oski_value_t *x)
 Solves $T\cdot x = \alpha\cdot b$ for $x$, where:
  • $T$ is upper triangular,
  • a full (all non-zero) diagonal exists,
  • the column indices within a given row may be unsorted, and
  • $x$ is an array with unit-stride.

void CSR_MatConjTrisolveUpper (oski_index_t m, oski_index_t indbase, int is_unit, int is_sorted, const oski_index_t *ptr, const oski_index_t *ind, const oski_value_t *val, oski_value_t alpha, oski_value_t *restrict x, oski_index_t num_vecs, oski_index_t rowinc, oski_index_t colinc)

Generated on Wed Sep 19 16:41:23 2007 for BeBOP Optimized Sparse Kernel Interface Library by  doxygen 1.4.6