PrevUpHomeNext
pptrf
Prototype

There is one prototype of pptrf available, please see below.

pptrf( MatrixAP& ap );

Description

pptrf (short for $FRIENDLY_NAME) provides a C++ interface to LAPACK routines SPPTRF, DPPTRF, CPPTRF, and ZPPTRF. pptrf computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format.

The factorization has the form A = U*H * U, if UPLO = 'U', or A = L * L*H, if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular.

The selection of the LAPACK routine is done during compile-time, and is determined by the type of values contained in type MatrixAP. The type of values is obtained through the value_type meta-function typename value_type<MatrixAP>::type. The dispatching table below illustrates to which specific routine the code path will be generated.

Table 1.278. Dispatching of pptrf

Value type of MatrixAP

LAPACK routine

float

SPPTRF

double

DPPTRF

complex<float>

CPPTRF

complex<double>

ZPPTRF


Definition

Defined in header boost/numeric/bindings/lapack/computational/pptrf.hpp.

Parameters or Requirements on Types

Parameters

MatrixA

The definition of term 1

MatrixB

The definition of term 2

MatrixC

The definition of term 3.

Definitions may contain paragraphs.

Complexity
Example

#include <boost/numeric/bindings/lapack/computational/pptrf.hpp>
using namespace boost::numeric::bindings;

lapack::pptrf( x, y, z );

this will output

[5] 0 1 2 3 4 5

Notes
See Also

PrevUpHomeNext