There is one prototype of lansy
            available, please see below. 
lansy( const char norm, const MatrixA& a );
            lansy (short for $FRIENDLY_NAME)
            provides a C++ interface to LAPACK routines SLANSY, DLANSY, CLANSY, and
            ZLANSY. lansy returns
            the value of the one norm, or the Frobenius norm, or the infinity norm,
            or the element of largest absolute value of a complex symmetric matrix
            A.
          
            Description =====
          
            lansy returns the value
          
            lansy = ( max(abs(A(i,j))),
            NORM = 'M' or 'm' ( ( norm1(A), NORM = '1', 'O' or 'o' ( ( normI(A),
            NORM = 'I' or 'i' ( ( normF(A), NORM = 'F', 'f', 'E' or 'e'
          
where norm1 denotes the one norm of a matrix (maximum column sum), normI denotes the infinity norm of a matrix (maximum row sum) and normF denotes the Frobenius norm of a matrix (square root of sum of squares). Note that max(abs(A(i,j))) is not a consistent matrix norm.
            The selection of the LAPACK routine is done during compile-time, and
            is determined by the type of values contained in type MatrixA.
            The type of values is obtained through the value_type
            meta-function typename value_type<MatrixA>::type. The dispatching table below illustrates
            to which specific routine the code path will be generated.
          
Table 1.357. Dispatching of lansy
| Value type of MatrixA | LAPACK routine | 
|---|---|
| 
                       | SLANSY | 
| 
                       | DLANSY | 
| 
                       | CLANSY | 
| 
                       | ZLANSY | 
            Defined in header boost/numeric/bindings/lapack/auxiliary/lansy.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/auxiliary/lansy.hpp> using namespace boost::numeric::bindings; lapack::lansy( x, y, z );
this will output
[5] 0 1 2 3 4 5