Prototype

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

pbstf( MatrixAB& ab );

Description

pbstf (short for $FRIENDLY_NAME) provides a C++ interface to LAPACK routines SPBSTF, DPBSTF, CPBSTF, and ZPBSTF. pbstf computes a split Cholesky factorization of a complex Hermitian positive definite band matrix A.

This routine is designed to be used in conjunction with ZHBGST.

The factorization has the form A = S**H*S where S is a band matrix of the same bandwidth as A and the following structure:

S = ( U ) ( M L )

where U is upper triangular of order m = (n+kd)/2, and L is lower triangular of order n-m.

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

Definition

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

Parameters or Requirements on Types

Complexity

Example

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

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

this will output

[5] 0 1 2 3 4 5

Notes

See Also