---
name: "pzpbsv"
section: "3"
platform: "linux"
package: "scalapack-doc"
version: "1.5-11"
release: "Debian 11 (Bullseye)"
platforms: ["linux"]
url: "https://new.carta.tech/pzpbsv"
---

# pzpbsv(3)

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

## NAME

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

## SYNOPSIS

- SUBROUTINE PZPBSV(

  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( \* )

- COMPLEX\*16

  A( \* ), B( \* ), WORK( \* )

## PURPOSE

PZPBSV solves a system of linear equations

where A(1:N, JA:JA+N-1) is an N-by-N complex\
 banded symmetric positive definite distributed\
 matrix with bandwidth BW.\

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

See PZPBTRF and PZPBTRS for details.\