logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

PDPBTRSV - solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,

Name

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

Purpose

       PDPBTRSV solves a banded triangular system of linear equations
                                      or
                           A(1:N, JA:JA+N-1)^T * X = B(IB:IB+N-1, 1:NRHS)

       where A(1:N, JA:JA+N-1) is a banded
       triangular matrix factor produced by the
       Cholesky factorization code PDPBTRF
       and is stored in A(1:N,JA:JA+N-1) and AF.
       The matrix stored in A(1:N, JA:JA+N-1) is either
       upper or lower triangular according to UPLO,
       and the choice of solving A(1:N, JA:JA+N-1) or A(1:N,  JA:JA+N-1)^T  is  dictated  by  the  user  by  the
       parameter TRANS.

       Routine PDPBTRF MUST be called first.

LAPACK version 1.5                                 12 May 1997                                       PDPBTRSV(l)

Synopsis

       SUBROUTINE PDPBTRSV( UPLO, TRANS, N, BW, NRHS, A, JA, DESCA, B, IB, DESCB, AF, LAF, WORK, LWORK, INFO )

           CHARACTER        TRANS, UPLO

           INTEGER          BW, IB, INFO, JA, LAF, LWORK, N, NRHS

           INTEGER          DESCA( * ), DESCB( * )

           DOUBLE           PRECISION A( * ), AF( * ), B( * ), WORK( * )

See Also