.TH BStri_solve 3 "12/25/1995" " " "BlockSolve95"
.SH NAME
BStri_solve \- Multiply the matrix A(-1) by a block of vectors

.SH INPUT PARAMETERS
.PD 0
.TP
.B A 
- a sparse matrix
.PD 1
.PD 0
.TP
.B fact_A 
- a possibly incompletely factored version of A
.PD 1
.PD 0
.TP
.B comm_A 
- the communication structure for A (fact_A)
.PD 1
.PD 0
.TP
.B vec 
- the block of vectors to multiply by
.PD 1
.PD 0
.TP
.B pre_option 
- the preconditioner to select
PRE_ICC: incomplete Cholesky factorization
PRE_ILU: incomplete LU factorization
PRE_SSOR: Successive over relaxation
PRE_BJACOBI: Block Jacobi
.PD 1
.PD 0
.TP
.B BS 
- the number of vectors in vec
.PD 1
.PD 0
.TP
.B procinfo 
- the usual processor stuff
.PD 1

.SH OUTPUT PARAMETERS
.PD 0
.TP
.B vec 
- the resulting block of vectors
.PD 1

.SH RETURNS
void

.SH NOTES
Different code is used to multiply a single vector than is used
to multiply a block of vectors (this improves efficiency).

.SH SYNOPSIS
.nf
void BStri_solve(BSpar_mat *A, BSpar_mat *fact_A, BScomm *comm_A, FLOAT *vec,
  int pre_option, int BS, BSprocinfo *procinfo)

.fi

.SH LOCATION
 BlockSolve95/src/BStri_solve.c