DSPF_sp_qrd_inverse
[DSPF_sp_qrd, DSPF_sp_qrd_cmplx]

Collaboration diagram for DSPF_sp_qrd_inverse:

---

Detailed Description

Functions
int	DSPF_sp_qrd_inverse (const int Nrows, const int Ncols, float *restrict Q, float *restrict R, float *restrict inv_A)
int	DSPF_sp_qrd_inverse_cmplx (const int Nrows, const int Ncols, float *restrict Q, float *restrict R, float *restrict inv_A)

---

Function Documentation

int DSPF_sp_qrd_inverse	(	const int	Nrows,
		const int	Ncols,
		float *restrict	Q,
		float *restrict	R,
		float *restrict	inv_A
	)

This function processes an orthogonal matrix Q, and an upper triangular matrix R generated by DSPF_sp_qrd and generates the inverse of the A matrix where inv_A=inv(R)*inv(Q). In place processing is performed on the R matrix such that its original contents are modified. The values stored in the matrices are assumed to be single precision floating point values. This code is suitable for dense matrices. No optimizations are made for sparse matrices.

Parameters:

	Nrows	= number of rows in matrix A
	Ncols	= number of columns in matrix A
	Q	= pointer to lower triangular matrix Q[Nrows*Nrows]
	R	= pointer to upper triangular matrix R[Nrows*Ncols]
	inv_A	= pointer to inverse of matrix A[Nrows*Ncols]

Algorithm:

DSPF_sp_qrd_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:

The arrays Q, R, and inv_A are stored in distinct arrays. In-place processing of R is done.

Implementation Notes:

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

int DSPF_sp_qrd_inverse_cmplx	(	const int	Nrows,
		const int	Ncols,
		float *restrict	Q,
		float *restrict	R,
		float *restrict	inv_A
	)

This function processes an orthogonal matrix Q, and an upper triangular matrix R generated by DSPF_sp_qrd_cmplx and generates the inverse of the A matrix where inv_A=inv(R)*inv(Q). In place processing is performed on the R matrix such that its original contents are modified. The values stored in the matrices are assumed to be float precision floating point values. This code is suitable for dense matrices. No optimizations are made for sparse matrices.

Parameters:

	Nrows	= number of rows in matrix A
	Ncols	= number of columns in matrix A
	Q	= pointer to lower triangular matrix Q[Nrows*2*Nrows]
	R	= pointer to upper triangular matrix R[Nrows*2*Ncols]
	inv_A	= pointer to inverse of matrix A[Nrows*Ncols]

Algorithm:

DSPF_sp_qrd_complex_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 Q, R, and inv_A are stored in distinct arrays. In-place processing of R is done.
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