mindegree.hh

Go to the documentation of this file.
1 /*----------------------------------------------------------------------------
2 Sparse QR solver for linear systems of equations or least squares problems
3 Copyright (C) 1996, Thomas H. Robey
4 
5 This library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Library General Public
7 License as published by the Free Software Foundation; either
8 version 2 of the License, or (at your option) any later version.
9 
10 This library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Library General Public License for more details.
14 
15 You should have received a copy of the GNU Library General Public
16 License along with this library; if not, write to the Free
17 Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 
19 Inquiries can be directed to trobey@arc.unm.edu or
20 
21 Thomas H. Robey
22 925 Madison NE
23 Albuquerque, NM 87110
24 USA
25 ----------------------------------------------------------------------------*/
26 
27 #ifndef mindegree_hh
28 #define mindegree_hh
29 
30 #include <stddef.h>
31 
32 namespace sparseqr {
33 
38  class MinDegree {
39  public:
40  MinDegree(QR *,int);
42  delete[] degree;
43  };
44  int MinSearch(QR *,int,int,int *);
45  void Track(QR *,int,int,int);
46  void Untrack(QR *,int,int,int,int);
47  private:
48  int *degree,*list;
49  int *work;
50  };
51 
52 } // namespace sparseqr
53 
54 #endif // mindegree_hh
void Untrack(QR *, int, int, int, int)
MinDegree(QR *, int)
QR factorization.
Definition: sparseqr.hh:128
SparseQR solver.
Definition: driver.hh:19
int MinSearch(QR *, int, int, int *)
void Track(QR *, int, int, int)
Page URL: http://wiki.math.ethz.ch/bin/view/Concepts/WebHome
21 August 2020
© 2020 Eidgenössische Technische Hochschule Zürich