GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
PSPBSV(l) ) PSPBSV(l)

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

SUBROUTINE PSPBSV(
UPLO, N, BW, NRHS, A, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )
CHARACTER UPLO INTEGER BW, IB, INFO, JA, LWORK, N, NRHS INTEGER DESCA( * ), DESCB( * ) REAL A( * ), B( * ), WORK( * )

PSPBSV 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
 
banded symmetric positive definite distributed
 
matrix with bandwidth BW.
 
Cholesky factorization is used to factor a reordering of
 
the matrix into L L'.
 
See PSPBTRF and PSPBTRS for details.
 
13 August 2001 ScaLAPACK version 1.7

Search for    or go to Top of page |  Section l |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.