SuperLU Distributed 8.2.1
Distributed memory sparse direct solver
|
Solves a system of linear equations A*X=B,. More...
Functions | |
void | pzgssvx_ABglobal (superlu_dist_options_t *options, SuperMatrix *A, zScalePermstruct_t *ScalePermstruct, doublecomplex B[], int ldb, int nrhs, gridinfo_t *grid, zLUstruct_t *LUstruct, double *berr, SuperLUStat_t *stat, int *info) |
Solves a system of linear equations A*X=B,.
Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)
All rights reserved.
The source code is distributed under BSD license, see the file License.txt at the top-level directory.
-- Distributed SuperLU routine (version 4.3) -- Lawrence Berkeley National Lab, Univ. of California Berkeley. September 1, 1999 Last modified: December 31, 2015 version 4.3
void pzgssvx_ABglobal | ( | superlu_dist_options_t * | options, |
SuperMatrix * | A, | ||
zScalePermstruct_t * | ScalePermstruct, | ||
doublecomplex | B[], | ||
int | ldb, | ||
int | nrhs, | ||
gridinfo_t * | grid, | ||
zLUstruct_t * | LUstruct, | ||
double * | berr, | ||
SuperLUStat_t * | stat, | ||
int * | info | ||
) |
Purpose ======= pzgssvx_ABglobal solves a system of linear equations A*X=B, by using Gaussian elimination with "static pivoting" to compute the LU factorization of A. Static pivoting is a technique that combines the numerical stability of partial pivoting with the scalability of Cholesky (no pivoting), to run accurately and efficiently on large numbers of processors. See our paper at http://www.nersc.gov/~xiaoye/SuperLU/ for a detailed description of the parallel algorithms. Here are the options for using this code: 1. Independent of all the other options specified below, the user must supply - B, the matrix of right hand sides, and its dimensions ldb and nrhs