SuperLU Distributed 8.2.1
Distributed memory sparse direct solver
|
Performs static scheduling for the look-ahead factorization algorithm. More...
#include "superlu_ddefs.h"
Functions | |
void | isort (int_t N, int_t *ARRAY1, int_t *ARRAY2) |
void | isort1 (int_t N, int_t *ARRAY) |
int | dstatic_schedule (superlu_dist_options_t *options, int m, int n, dLUstruct_t *LUstruct, gridinfo_t *grid, SuperLUStat_t *stat, int_t *perm_c_supno, int_t *iperm_c_supno, int *info) |
Performs static scheduling for the look-ahead factorization algorithm.
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.0) -- Lawrence Berkeley National Lab, Univ. of California Berkeley. August 15, 2014 Modified: February 20, 2020, changed to be precision-dependent. Reference:
int dstatic_schedule | ( | superlu_dist_options_t * | options, |
int | m, | ||
int | n, | ||
dLUstruct_t * | LUstruct, | ||
gridinfo_t * | grid, | ||
SuperLUStat_t * | stat, | ||
int_t * | perm_c_supno, | ||
int_t * | iperm_c_supno, | ||
int * | info | ||
) |