DragonFly On-Line Manual Pages

PDPBSV(l)                              )                             PDPBSV(l)

NAME
       PDPBSV - solve a system of linear equations  A(1:N, JA:JA+N-1) * X =
       B(IB:IB+N-1, 1:NRHS)

SYNOPSIS
       SUBROUTINE PDPBSV( UPLO, N, BW, NRHS, A, JA, DESCA, B, IB, DESCB, WORK,
                          LWORK, INFO )
           CHARACTER UPLO
           INTEGER BW, IB, INFO, JA, LWORK, N, NRHS
           INTEGER DESCA( * ), DESCB( * )
           DOUBLE PRECISION A( * ), B( * ), WORK( * )

PURPOSE
       PDPBSV solves a system of linear equations A(1:N, JA:JA+N-1) * X =
       B(IB:IB+N-1, 1:NRHS) where A(1:N, JA:JA+N-1) is an N-by-N real
       banded symmetric positive definite distributed
       matrix with bandwidth BW.

       Cholesky factorization is used to factor a reordering of
       the matrix into L L'.

       See PDPBTRF and PDPBTRS for details.

ScaLAPACK version 1.7           13 August 2001                       PDPBSV(l)