You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
403 lines
13 KiB
C
403 lines
13 KiB
C
/*
|
|
*
|
|
* MLD2P4 version 1.1
|
|
* MultiLevel Domain Decomposition Parallel Preconditioners Package
|
|
* based on PSBLAS (Parallel Sparse BLAS version 2.3.1)
|
|
*
|
|
* (C) Copyright 2008,2009
|
|
*
|
|
* Salvatore Filippone University of Rome Tor Vergata
|
|
* Alfredo Buttari University of Rome Tor Vergata
|
|
* Pasqua D'Ambra ICAR-CNR, Naples
|
|
* Daniela di Serafino Second University of Naples
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions, and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the MLD2P4 group or the names of its contributors may
|
|
* not be used to endorse or promote products derived from this
|
|
* software without specific written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE MLD2P4 GROUP OR ITS CONTRIBUTORS
|
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*
|
|
* File: mld_zslud_interface.c
|
|
*
|
|
* Functions: mld_zsludist_fact_, mld_zsludist_solve_, mld_zsludist_free_.
|
|
*
|
|
* This file is an interface to the SuperLU_dist routines for sparse factorization and
|
|
* solve. It was obtained by modifying the c_fortran_zgssv.c file from the SuperLU_dist
|
|
* source distribution; original copyright terms are reproduced below.
|
|
*
|
|
*/
|
|
|
|
/* =====================
|
|
|
|
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.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
(1) Redistributions of source code must retain the above copyright notice,
|
|
this list of conditions and the following disclaimer.
|
|
(2) Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation
|
|
and/or other materials provided with the distribution.
|
|
(3) Neither the name of Lawrence Berkeley National Laboratory, U.S. Dept. of
|
|
Energy nor the names of its contributors may be used to endorse or promote
|
|
products derived from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
/*
|
|
* -- Distributed SuperLU routine (version 2.0) --
|
|
* Lawrence Berkeley National Lab, Univ. of California Berkeley.
|
|
* March 15, 2003
|
|
*
|
|
*/
|
|
|
|
/* No single complex version in SuperLU_Dist */
|
|
|
|
#ifdef Have_SLUDist_
|
|
#undef Have_SLUDist_
|
|
#endif
|
|
#ifdef Have_SLUDist_
|
|
#include <math.h>
|
|
#include "superlu_zdefs.h"
|
|
|
|
#define HANDLE_SIZE 8
|
|
/* kind of integer to hold a pointer. Use int.
|
|
This might need to be changed on 64-bit systems. */
|
|
#ifdef Ptr64Bits
|
|
typedef long long fptr;
|
|
#else
|
|
typedef int fptr; /* 32-bit by default */
|
|
#endif
|
|
|
|
typedef struct {
|
|
SuperMatrix *A;
|
|
LUstruct_t *LUstruct;
|
|
gridinfo_t *grid;
|
|
ScalePermstruct_t *ScalePermstruct;
|
|
} factors_t;
|
|
|
|
|
|
#else
|
|
|
|
#include <stdio.h>
|
|
|
|
#endif
|
|
|
|
|
|
#ifdef LowerUnderscore
|
|
#define mld_csludist_fact_ mld_csludist_fact_
|
|
#define mld_csludist_solve_ mld_csludist_solve_
|
|
#define mld_csludist_free_ mld_csludist_free_
|
|
#endif
|
|
#ifdef LowerDoubleUnderscore
|
|
#define mld_csludist_fact_ mld_csludist_fact__
|
|
#define mld_csludist_solve_ mld_csludist_solve__
|
|
#define mld_csludist_free_ mld_csludist_free__
|
|
#endif
|
|
#ifdef LowerCase
|
|
#define mld_csludist_fact_ mld_csludist_fact
|
|
#define mld_csludist_solve_ mld_csludist_solve
|
|
#define mld_csludist_free_ mld_csludist_free
|
|
#endif
|
|
#ifdef UpperUnderscore
|
|
#define mld_csludist_fact_ MLD_CSLUDIST_FACT_
|
|
#define mld_csludist_solve_ MLD_CSLUDIST_SOLVE_
|
|
#define mld_csludist_free_ MLD_CSLUDIST_FREE_
|
|
#endif
|
|
#ifdef UpperDoubleUnderscore
|
|
#define mld_csludist_fact_ MLD_CSLUDIST_FACT__
|
|
#define mld_csludist_solve_ MLD_CSLUDIST_SOLVE__
|
|
#define mld_csludist_free_ MLD_CSLUDIST_FREE__
|
|
#endif
|
|
#ifdef UpperCase
|
|
#define mld_csludist_fact_ MLD_CSLUDIST_FACT
|
|
#define mld_csludist_solve_ MLD_CSLUDIST_SOLVE
|
|
#define mld_csludist_free_ MLD_CSLUDIST_FREE
|
|
#endif
|
|
|
|
|
|
|
|
|
|
void
|
|
mld_csludist_fact_(int *n, int *nl, int *nnzl, int *ffstr,
|
|
#ifdef Have_SLUDist_
|
|
complex *values, int *rowptr, int *colind,
|
|
fptr *f_factors, /* a handle containing the address
|
|
pointing to the factored matrices */
|
|
#else
|
|
void *values, int *rowptr, int *colind,
|
|
void *f_factors,
|
|
#endif
|
|
int *nprow, int *npcol, int *info)
|
|
|
|
{
|
|
/*
|
|
* This routine can be called from Fortran.
|
|
* performs LU decomposition.
|
|
*
|
|
* f_factors (input/output) fptr*
|
|
* On output contains the pointer pointing to
|
|
* the structure of the factored matrices.
|
|
*
|
|
*/
|
|
|
|
#ifdef Have_SLUDist_
|
|
SuperMatrix *A;
|
|
NRformat_loc *Astore;
|
|
|
|
ScalePermstruct_t *ScalePermstruct;
|
|
LUstruct_t *LUstruct;
|
|
SOLVEstruct_t SOLVEstruct;
|
|
gridinfo_t *grid;
|
|
int i, panel_size, permc_spec, relax;
|
|
trans_t trans;
|
|
float drop_tol = 0.0,berr[1];
|
|
mem_usage_t mem_usage;
|
|
superlu_options_t options;
|
|
SuperLUStat_t stat;
|
|
factors_t *LUfactors;
|
|
int fst_row;
|
|
int *icol,*irpt;
|
|
complex *ival,b[1];
|
|
|
|
trans = NOTRANS;
|
|
grid = (gridinfo_t *) SUPERLU_MALLOC(sizeof(gridinfo_t));
|
|
superlu_gridinit(MPI_COMM_WORLD, *nprow, *npcol, grid);
|
|
/* Initialize the statistics variables. */
|
|
PStatInit(&stat);
|
|
fst_row = (*ffstr) -1;
|
|
/* Adjust to 0-based indexing */
|
|
icol = (int *) malloc((*nnzl)*sizeof(int));
|
|
irpt = (int *) malloc(((*nl)+1)*sizeof(int));
|
|
ival = (complex *) malloc((*nnzl)*sizeof(doublecomplex));
|
|
for (i = 0; i < *nnzl; ++i) ival[i] = values[i];
|
|
for (i = 0; i < *nnzl; ++i) icol[i] = colind[i] -1;
|
|
for (i = 0; i <= *nl; ++i) irpt[i] = rowptr[i] -1;
|
|
|
|
A = (SuperMatrix *) malloc(sizeof(SuperMatrix));
|
|
zCreate_CompRowLoc_Matrix_dist(A, *n, *n, *nnzl, *nl, fst_row,
|
|
ival, icol, irpt,
|
|
SLU_NR_loc, SLU_Z, SLU_GE);
|
|
|
|
/* Initialize ScalePermstruct and LUstruct. */
|
|
ScalePermstruct = (ScalePermstruct_t *) SUPERLU_MALLOC(sizeof(ScalePermstruct_t));
|
|
LUstruct = (LUstruct_t *) SUPERLU_MALLOC(sizeof(LUstruct_t));
|
|
ScalePermstructInit(*n,*n, ScalePermstruct);
|
|
LUstructInit(*n,*n, LUstruct);
|
|
|
|
/* Set the default input options. */
|
|
set_default_options_dist(&options);
|
|
options.IterRefine=NO;
|
|
options.PrintStat=NO;
|
|
|
|
pzgssvx(&options, A, ScalePermstruct, b, *nl, 0,
|
|
grid, LUstruct, &SOLVEstruct, berr, &stat, info);
|
|
|
|
if ( *info == 0 ) {
|
|
;
|
|
} else {
|
|
printf("pzgssvx() error returns INFO= %d\n", *info);
|
|
if ( *info <= *n ) { /* factorization completes */
|
|
;
|
|
}
|
|
}
|
|
if (options.SolveInitialized) {
|
|
zSolveFinalize(&options,&SOLVEstruct);
|
|
}
|
|
|
|
|
|
/* Save the LU factors in the factors handle */
|
|
LUfactors = (factors_t *) SUPERLU_MALLOC(sizeof(factors_t));
|
|
LUfactors->LUstruct = LUstruct;
|
|
LUfactors->grid = grid;
|
|
LUfactors->A = A;
|
|
LUfactors->ScalePermstruct = ScalePermstruct;
|
|
/* fprintf(stderr,"slud factor: LUFactors %p \n",LUfactors); */
|
|
/* fprintf(stderr,"slud factor: A %p %p\n",A,LUfactors->A); */
|
|
/* fprintf(stderr,"slud factor: grid %p %p\n",grid,LUfactors->grid); */
|
|
/* fprintf(stderr,"slud factor: LUstruct %p %p\n",LUstruct,LUfactors->LUstruct); */
|
|
*f_factors = (fptr) LUfactors;
|
|
|
|
PStatFree(&stat);
|
|
#else
|
|
fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n");
|
|
*info=-1;
|
|
#endif
|
|
}
|
|
|
|
|
|
void
|
|
mld_csludist_solve_(int *itrans, int *n, int *nrhs,
|
|
#ifdef Have_SLUDist_
|
|
doublecomplex *b, int *ldb,
|
|
fptr *f_factors, /* a handle containing the address
|
|
pointing to the factored matrices */
|
|
#else
|
|
void *b, int *ldb,
|
|
void *f_factors,
|
|
#endif
|
|
int *info)
|
|
|
|
{
|
|
/*
|
|
* This routine can be called from Fortran.
|
|
* performs triangular solve
|
|
*
|
|
*/
|
|
#ifdef Have_SLUDist_
|
|
SuperMatrix *A;
|
|
ScalePermstruct_t *ScalePermstruct;
|
|
LUstruct_t *LUstruct;
|
|
SOLVEstruct_t SOLVEstruct;
|
|
gridinfo_t *grid;
|
|
int i, panel_size, permc_spec, relax;
|
|
trans_t trans;
|
|
double drop_tol = 0.0;
|
|
double *berr;
|
|
mem_usage_t mem_usage;
|
|
superlu_options_t options;
|
|
SuperLUStat_t stat;
|
|
factors_t *LUfactors;
|
|
|
|
LUfactors = (factors_t *) *f_factors ;
|
|
A = LUfactors->A ;
|
|
LUstruct = LUfactors->LUstruct ;
|
|
grid = LUfactors->grid ;
|
|
|
|
ScalePermstruct = LUfactors->ScalePermstruct;
|
|
/* fprintf(stderr,"slud solve: LUFactors %p \n",LUfactors); */
|
|
/* fprintf(stderr,"slud solve: A %p %p\n",A,LUfactors->A); */
|
|
/* fprintf(stderr,"slud solve: grid %p %p\n",grid,LUfactors->grid); */
|
|
/* fprintf(stderr,"slud solve: LUstruct %p %p\n",LUstruct,LUfactors->LUstruct); */
|
|
|
|
|
|
if (*itrans == 0) {
|
|
trans = NOTRANS;
|
|
} else if (*itrans ==1) {
|
|
trans = TRANS;
|
|
} else if (*itrans ==2) {
|
|
trans = CONJ;
|
|
} else {
|
|
trans = NOTRANS;
|
|
}
|
|
|
|
/* fprintf(stderr,"Entry to sludist_solve\n"); */
|
|
berr = (double *) malloc((*nrhs) *sizeof(double));
|
|
|
|
/* Initialize the statistics variables. */
|
|
PStatInit(&stat);
|
|
|
|
/* Set the default input options. */
|
|
set_default_options_dist(&options);
|
|
options.IterRefine = NO;
|
|
options.Fact = FACTORED;
|
|
options.PrintStat = NO;
|
|
|
|
pzgssvx(&options, A, ScalePermstruct, b, *ldb, *nrhs,
|
|
grid, LUstruct, &SOLVEstruct, berr, &stat, info);
|
|
|
|
/* fprintf(stderr,"Double check: after solve %d %lf\n",*info,berr[0]); */
|
|
if (options.SolveInitialized) {
|
|
zSolveFinalize(&options,&SOLVEstruct);
|
|
}
|
|
PStatFree(&stat);
|
|
free(berr);
|
|
#else
|
|
fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n");
|
|
*info=-1;
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
void
|
|
mld_csludist_free_(
|
|
#ifdef Have_SLUDist_
|
|
fptr *f_factors, /* a handle containing the address
|
|
pointing to the factored matrices */
|
|
#else
|
|
void *f_factors,
|
|
#endif
|
|
int *info)
|
|
|
|
{
|
|
/*
|
|
* This routine can be called from Fortran.
|
|
*
|
|
* free all storage in the end
|
|
*
|
|
*/
|
|
#ifdef Have_SLUDist_
|
|
SuperMatrix *A;
|
|
ScalePermstruct_t *ScalePermstruct;
|
|
LUstruct_t *LUstruct;
|
|
SOLVEstruct_t SOLVEstruct;
|
|
gridinfo_t *grid;
|
|
int i, panel_size, permc_spec, relax;
|
|
trans_t trans;
|
|
double drop_tol = 0.0;
|
|
double *berr;
|
|
mem_usage_t mem_usage;
|
|
superlu_options_t options;
|
|
SuperLUStat_t stat;
|
|
factors_t *LUfactors;
|
|
|
|
LUfactors = (factors_t *) *f_factors ;
|
|
A = LUfactors->A ;
|
|
LUstruct = LUfactors->LUstruct ;
|
|
grid = LUfactors->grid ;
|
|
ScalePermstruct = LUfactors->ScalePermstruct;
|
|
|
|
Destroy_CompRowLoc_Matrix_dist(A);
|
|
ScalePermstructFree(ScalePermstruct);
|
|
LUstructFree(LUstruct);
|
|
superlu_gridexit(grid);
|
|
|
|
free(grid);
|
|
free(LUstruct);
|
|
free(LUfactors);
|
|
|
|
#else
|
|
fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n");
|
|
*info=-1;
|
|
#endif
|
|
}
|
|
|
|
|