Risk-Aware Code Review: Auto Approve Low-Risk Changes
LiveReview LiveReview LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt GitHub Install Now

We'd appreciate a star

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

Name

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

Purpose

       PCPBTRSV solves a banded triangular system of linear equations
                                      or
                           A(1:N, JA:JA+N-1)^H * 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 PCPBTRF
       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)^H  is  dictated  by  the  user  by  the
       parameter TRANS.

       Routine PCPBTRF MUST be called first.

LAPACK version 1.5                                 12 May 1997                                       PCPBTRSV(l)

Synopsis

       SUBROUTINE PCPBTRSV( 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( * )

           COMPLEX          A( * ), AF( * ), B( * ), WORK( * )

See Also