pzdtsv(3)

pzdtsv3

Solve a system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)

Usage

SUBROUTINE PZDTSV(

N, NRHS, DL, D, DU, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )

INTEGER

IB, INFO, JA, LWORK, N, NRHS

INTEGER

DESCA( * ), DESCB( * )

COMPLEX*16

B( * ), D( * ), DL( * ), DU( * ), WORK( * )

Purpose

PZDTSV solves a system of linear equations

where A(1:N, JA:JA+N-1) is an N-by-N complex
tridiagonal diagonally dominant-like distributed
matrix.

Gaussian elimination without pivoting
is used to factor a reordering
of the matrix into L U.

See PZDTTRF and PZDTTRS for details.

Releases

Unchanged in 11 releases since Debian 2.2 (Potato).

  1. 2.2–11

From scalapack-doc 1.5-11 in Debian 11 (Bullseye). Parsed by carta from the page's man source.