src/main/java/edu/ufl/cise/klu/common/KLU_l_analyze.java

   1 /**
   2  * KLU: a sparse LU factorization algorithm.
   3  * Copyright (C) 2004-2009, Timothy A. Davis.
   4  * Copyright (C) 2011, Richard W. Lincoln.
   5  * http://www.cise.ufl.edu/research/sparse/klu
   6  *
   7  * -------------------------------------------------------------------------
   8  *
   9  * KLU is free software; you can redistribute it and/or
  10  * modify it under the terms of the GNU Lesser General Public
  11  * License as published by the Free Software Foundation; either
  12  * version 2.1 of the License, or (at your option) any later version.
  13  *
  14  * KLU is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17  * Lesser General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU Lesser General Public
  20  * License along with this Module; if not, write to the Free Software
  21  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  22  *
  23  */
  24
  25 package edu.ufl.cise.klu.common;
  26
  27 /**
  28  * Orders and analyzes a matrix.
  29  *
  30  * 64-bit version.
  31  */
  32 public class KLU_l_analyze
  33 {
  34
  35         /* Order the matrix with BTF (or not), then order each block with AMD,
  36          * COLAMD, a natural ordering, or with a user-provided ordering function */
  37
  38         /**
  39          *
  40          * @param n A is n-by-n
  41          * @param Ap size n+1, column pointers
  42          * @param Ai size nz, row indices
  43          * @param Common
  44          * @return
  45          */
  46         public static KLU_l_symbolic klu_l_analyze(long n, long[] Ap, long[] Ai,
  47                     KLU_l_common Common)
  48         {
  49                 return null;
  50         }
  51
  52 }