SuperLU Distributed 8.2.1
Distributed memory sparse direct solver
pddrive3_ABglobal.c File Reference

Driver program for pdgssvx_ABglobal example. More...

#include <math.h>
#include "superlu_ddefs.h"
Include dependency graph for pddrive3_ABglobal.c:

Functions

int main (int argc, char *argv[])
 
int cpp_defs ()
 

Detailed Description

Driver program for pdgssvx_ABglobal example.

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.1) --
Lawrence Berkeley National Lab, Univ. of California Berkeley.
September 1, 1999
April 5, 2015

Function Documentation

◆ cpp_defs()

int cpp_defs ( )
Here is the caller graph for this function:

◆ main()

int main ( int  argc,
char *  argv[] 
)
Purpose
=======

The driver program pddrive3A_ABglobal.

This example illustrates how to use pdgssvx_ABglobal to solve
systems repeatedly with the same sparsity pattern and similar
numerical values of matrix A.
In this case, the column permutation vector and symbolic factorization are
computed only once. The following data structures will be reused in the
subsequent call to pdgssvx_ABglobal:
       ScalePermstruct : DiagScale, R, C, perm_r, perm_c
       LUstruct        : etree, Glu_persist, Llu

NOTE:
The distributed nonzero structures of L and U remain the same,
although the numerical values are different. So 'Llu' is set up once
in the first call to pdgssvx_ABglobal, and reused in the subsequent call.

On an IBM SP, the program may be run by typing:
   poe pddrive3_ABglobal -r <proc rows> -c <proc columns> <input_matrix>  -procs 
 
Here is the call graph for this function: