DSPF_dp_cholesky_cmplx
[Matrix]

Collaboration diagram for DSPF_dp_cholesky_cmplx:

---

Detailed Description

Modules
	DSPF_dp_cholesky_in_place_cmplx
	DSPF_dp_cholesky_solver_cmplx
int	DSPF_dp_cholesky_cmplx (const int enable_test, const int Nrows, double *restrict A, double *restrict L)

---

Function Documentation

int DSPF_dp_cholesky_cmplx	(	const int	enable_test,
		const int	Nrows,
		double *restrict	A,
		double *restrict	L
	)

This function tests the square complex matrix A for a symmetric positive definite and decomposes the matrix A into a lower triangular matrix L where A=L*U and U=Hermitian of L. The values stored in the matrices are assumed to be double precision floating point values. This code is suitable for dense matrices. No optimizations are made for sparse matrices.

Parameters:

	enable_test	= enables test for symmetric positive definite matrix
	Nrows	= Nrows of square matrix A
	A	= pointer to square matrix A[Nrows*2*Nrows]
	L	= pointer to lower triangular matrix L[Nrows*2*Nrows]

Algorithm:

DSPF_dp_cholesky_cmplx_cn.c is the natural C equivalent of the optimized intrinsic C code without restrictions. Note that the intrinsic C code is optimized and restrictions may apply.

Assumptions:

1. The arrays A and L are stored in distinct arrays. In-place processing is not allowed.
2. The arrays consist of complex number entries with alternating real and imaginary parts: real0,imag0,real1,imag1,...

Implementation Notes:

Interruptibility : The code is interruptible.
Endian support : supports both Little and Big endian modes.

---

Copyright 2014, Texas Instruments Incorporated