Poster of Linux kernelThe best gift for a Linux geek
PDDBSV

PDDBSV

Section: LAPACK routine (version 1.5) (l) Updated: 12 May 1997
Local index Up
 

NAME

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

SYNOPSIS

SUBROUTINE PDDBSV(
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( * )

    
DOUBLE PRECISION A( * ), B( * ), WORK( * )
 

PURPOSE

PDDBSV solves a system of linear equations

where A(1:N, JA:JA+N-1) is an N-by-N real
banded diagonally dominant-like distributed
matrix with bandwidth BWL, BWU.

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

See PDDBTRF and PDDBTRS for details.


 

Index

NAME
SYNOPSIS
PURPOSE

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