PSDTSV
PSDTSV
Section: LAPACK routine (version 1.5) (l) Updated: 12 May 1997 Local index
Up
NAME
PSDTSV  solve a system of linear equations A(1:N, JA:JA+N1) * X = B(IB:IB+N1, 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
where A(1:N, JA:JA+N1) is an NbyN real
tridiagonal diagonally dominantlike distributed
matrix.
Gaussian elimination without pivoting
is used to factor a reordering
of the matrix into L U.
See PSDTTRF and PSDTTRS for details.
Index
 NAME

 SYNOPSIS

 PURPOSE

This document was created by
man2html,
using the manual pages.
Time: 21:53:08 GMT, April 16, 2011