DragonFly On-Line Manual Pages

Search: Section:  


PSDTSV(l)                              )                             PSDTSV(l)

NAME

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

SYNOPSIS

SUBROUTINE PSDTSV( N, NRHS, DL, D, DU, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO ) INTEGER IB, INFO, JA, LWORK, N, NRHS INTEGER DESCA( * ), DESCB( * ) REAL B( * ), D( * ), DL( * ), DU( * ), WORK( * )

PURPOSE

PSDTSV solves a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS) where A(1:N, JA:JA+N-1) is an N-by-N real tridiagonal diagonally dominant-like distributed matrix. Gaussian elimination without pivoting is used to factor a reordering of the matrix into L U. See PSDTTRF and PSDTTRS for details. ScaLAPACK version 1.7 13 August 2001 PSDTSV(l)

Search: Section: