Developer Reference for Intel® oneAPI Math Kernel Library for C
mkl_sparse_?_qr_rsolve
Second stage of the solving step of the SPARSE QR solver.
Syntax
sparse_status_t mkl_sparse_d_qr_rsolve ( sparse_operation_t operation,
sparse_matrix_t A,
sparse_layout_t layout,
MKL_INT columns,
double *x,
MKL_INT ldx,
const double *b,
MKL_INT ldb );
sparse_status_t mkl_sparse_s_qr_rsolve ( sparse_operation_t operation,
sparse_matrix_t A,
sparse_layout_t layout,
MKL_INT columns,
float *x,
MKL_INT ldx,
const float *b,
MKL_INT ldb );
Include Files
mkl_sparse_qr.h
Description
The mkl_sparse_?_qr_rsolve routine implements the second step for computing the solution of \(A\cdot x = b\) using the QR-decomposition, \(Q\cdot R\cdot x = b\). In particular, it performs the triangular solve with \(R\),
\[R \cdot x = b\]
or
\[x = R^{-1} \cdot b\]
where \(R\) is a sparse upper triangular matrix factor, \(b\) is now the right hand side matrix after first step ( mkl_sparse_?_qr_qmult) is applied and \(x\) is the solution matrix to be computed.
Input Parameters
operation
Specifies the operation to perform for the system: \(op(A)\cdot x = b\) to be solved using the QR-decomposition.
A
Handle containing a sparse matrix in an internal data structure.
layout
Describes the storage scheme for the dense matrix:
SPARSE_LAYOUT_COLUMN_MAJOR |
Storage of elements uses column-major layout. |
SPARSE_LAYOUT_ROW_MAJOR |
Storage of elements uses row-major layout. |
x
Array with a size of at least rows * cols where :
layout = SPARSE_LAYOUT_COLUMN_MAJOR |
layout = SPARSE_LAYOUT_ROW_MAJOR |
|
rows (number of rows in x ) |
ldx |
Number of columns in A |
cols (number of columns in x ) |
columns |
ldx |
columns
Number of columns in matrix b .
ldx
Specifies the leading dimension of matrix x .
b
Array with a size of at least rows * cols where:
layout = SPARSE_LAYOUT_COLUMN_MAJOR |
layout = SPARSE_LAYOUT_ROW_MAJOR |
|
rows (number of rows in b ) |
ldb |
Number of columns in A |
cols (number of columns in b ) |
columns |
ldb |
ldb
Specifies the leading dimension of matrix b .
Output Parameters
x
Contains the solution of the upper triangular system \(R\cdot x = b\) .
Return Values
Value indicating whether the operation was successful, and if not, why:
SPARSE_STATUS_SUCCESS |
The operation was successful. |
SPARSE_STATUS_NOT_INITIALIZED |
The routine encountered an empty handle or matrix array. |
SPARSE_STATUS_ALLOC_FAILED |
Internal memory allocation failed. |
SPARSE_STATUS_INVALID_VALUE |
The input parameters contain an invalid value. |
SPARSE_STATUS_EXECUTION_FAILED |
Execution failed. |
SPARSE_STATUS_INTERNAL_ERROR |
An error in algorithm implementation occurred. |
SPARSE_STATUS_NOT_SUPPORTED |
The requested operation is not supported. |