You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
73 lines
2.4 KiB
73 lines
2.4 KiB
/* btfint.h (interface to BT-factorization) */
|
|
|
|
/***********************************************************************
|
|
* This code is part of GLPK (GNU Linear Programming Kit).
|
|
*
|
|
* Copyright (C) 2013-2014 Andrew Makhorin, Department for Applied
|
|
* Informatics, Moscow Aviation Institute, Moscow, Russia. All rights
|
|
* reserved. E-mail: <mao@gnu.org>.
|
|
*
|
|
* GLPK is free software: you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* GLPK is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with GLPK. If not, see <http://www.gnu.org/licenses/>.
|
|
***********************************************************************/
|
|
|
|
#ifndef BTFINT_H
|
|
#define BTFINT_H
|
|
|
|
#include "btf.h"
|
|
#include "sgf.h"
|
|
|
|
typedef struct BTFINT BTFINT;
|
|
|
|
struct BTFINT
|
|
{ /* interface to BT-factorization */
|
|
int n_max;
|
|
/* maximal value of n (increased automatically) */
|
|
int valid;
|
|
/* factorization is valid only if this flag is set */
|
|
SVA *sva;
|
|
/* sparse vector area (SVA) */
|
|
BTF *btf;
|
|
/* sparse block triangular LU-factorization */
|
|
SGF *sgf;
|
|
/* sparse Gaussian factorizer workspace */
|
|
/*--------------------------------------------------------------*/
|
|
/* control parameters */
|
|
int sva_n_max, sva_size;
|
|
/* parameters passed to sva_create_area */
|
|
int delta_n0, delta_n;
|
|
/* if n_max = 0, set n_max = n + delta_n0
|
|
* if n_max < n, set n_max = n + delta_n */
|
|
double sgf_piv_tol;
|
|
int sgf_piv_lim;
|
|
int sgf_suhl;
|
|
double sgf_eps_tol;
|
|
/* factorizer control parameters */
|
|
};
|
|
|
|
#define btfint_create _glp_btfint_create
|
|
BTFINT *btfint_create(void);
|
|
/* create interface to BT-factorization */
|
|
|
|
#define btfint_factorize _glp_btfint_factorize
|
|
int btfint_factorize(BTFINT *fi, int n, int (*col)(void *info, int j,
|
|
int ind[], double val[]), void *info);
|
|
/* compute BT-factorization of specified matrix A */
|
|
|
|
#define btfint_delete _glp_btfint_delete
|
|
void btfint_delete(BTFINT *fi);
|
|
/* delete interface to BT-factorization */
|
|
|
|
#endif
|
|
|
|
/* eof */
|