pspbtrsv3
Solve a banded triangular system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)
Usage
- SUBROUTINE PSPBTRSV(
-
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( * )
- REAL
-
A( * ), AF( * ), B( * ), WORK( * )
Purpose
PSPBTRSV 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 PSPBTRF
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 PSPBTRF MUST be called first.
Releases
Unchanged in 11 releases since Debian 2.2 (Potato).