lauum_recursive.hpp File Reference

#include "tlapack/base/utils.hpp"
#include "tlapack/blas/trmm.hpp"

Include dependency graph for lauum_recursive.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
template<TLAPACK_SMATRIX matrix_t>
int	tlapack::lauum_recursive (const Uplo &uplo, matrix_t &C)
	LAUUM is a specific type of inplace HERK.

Detailed Description

Author

Heidi Meier, University of Colorado Denver

Function Documentation

lauum_recursive()

template<TLAPACK_SMATRIX matrix_t>

int tlapack::lauum_recursive	(	const Uplo &	uplo,
		matrix_t &	C
	)

LAUUM is a specific type of inplace HERK.

Given C a triangular matrix (lower or upper), LAUUM computes the Hermitian matrix upper times lower.

If C is lower triangular, then LAUUM computes C^H * C. If C is upper triangular in input, then LAUUM computes C*C^H. The output (symmetric) matrix is stored in place of the input triangular matrix.

This is the recursive variant.

Parameters

[in]	uplo	Uplo::Upper: Upper triangle of C is referenced; the strictly lower triangular part of C is not referenced. Uplo::Lower: Lower triangle of C is referenced; the strictly upper triangular part of C is not referenced.
[in,out]	C	n-by-n (upper of lower) (triangular or symmetric) matrix. On entry, the (upper of lower) part of the n-by-n triangular matrix. On exit, the (upper of lower) part of the n-by-n symmetric matrix C^H * C or C * C^H.

Returns

= 0: successful exit

Todo:

: implement nx to bail out of recursion before 1-by-1 case