PSDBSV
PSDBSV
Section: LAPACK routine (version 1.5) (l) Updated: 12 May 1997 Local index
Up
NAME
PSDBSV  solve a system of linear equations A(1:N, JA:JA+N1) * X = B(IB:IB+N1, 1:NRHS)
SYNOPSIS
 SUBROUTINE PSDBSV(

N, BWL, BWU, NRHS, A, JA, DESCA, B, IB, DESCB,
WORK, LWORK, INFO )

INTEGER
BWL, BWU, IB, INFO, JA, LWORK, N, NRHS

INTEGER
DESCA( * ), DESCB( * )

REAL
A( * ), B( * ), WORK( * )
PURPOSE
PSDBSV solves a system of linear equations
where A(1:N, JA:JA+N1) is an NbyN real
banded diagonally dominantlike distributed
matrix with bandwidth BWL, BWU.
Gaussian elimination without pivoting
is used to factor a reordering
of the matrix into L U.
See PSDBTRF and PSDBTRS for details.
Index
 NAME

 SYNOPSIS

 PURPOSE

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