There is one prototype of sptrf
            available, please see below. 
sptrf( MatrixAP& ap, VectorIPIV& ipiv );
            sptrf (short for $FRIENDLY_NAME)
            provides a C++ interface to LAPACK routines SSPTRF, DSPTRF, CSPTRF, and
            ZSPTRF. sptrf computes
            the factorization of a complex symmetric matrix A stored in packed format
            using the Bunch-Kaufman diagonal pivoting method:
          
A = UD*U*T or A = LD*L*T
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1-by-1 and 2-by-2 diagonal blocks.
            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.288. Dispatching of sptrf
| Value type of MatrixAP | LAPACK routine | 
|---|---|
| 
                       | SSPTRF | 
| 
                       | DSPTRF | 
| 
                       | CSPTRF | 
| 
                       | ZSPTRF | 
            Defined in header boost/numeric/bindings/lapack/computational/sptrf.hpp.
          
Parameters
The definition of term 1
The definition of term 2
The definition of term 3.
Definitions may contain paragraphs.
#include <boost/numeric/bindings/lapack/computational/sptrf.hpp> using namespace boost::numeric::bindings; lapack::sptrf( x, y, z );
this will output
[5] 0 1 2 3 4 5