File: copyright

package info (click to toggle)
mumps 5.1.2-5
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 15,704 kB
  • sloc: fortran: 310,672; ansic: 12,364; xml: 521; makefile: 469
file content (147 lines) | stat: -rw-r--r-- 6,922 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
Upstream-Name: mumps
Upstream-Contact: Patrick Amestoy et al.
Source: http://mumps.enseeiht.fr/

Files: *
Copyright: 1991-2016 CERFACS, CNRS, ENS Lyon, INP Toulouse, Inria,
           University of Bordeaux.
License: CeCILL-C
 This version of MUMPS is provided to you free of charge. It is
 released under the CeCILL-C license,
 http://www.cecill.info/licences/Licence_CeCILL-C_V1-en.html,
 except for the external and optional ordering PORD,
 in separate directory PORD, which is public domain (see PORD/README).
 .
 You can acknowledge (using references [1] and [2]) the contribution of
 this package in any scientific publication dependent upon the use of
 the package. Please use reasonable endeavours to notify the authors
 of the package of this publication.
 .
  [1] P. R. Amestoy, I. S. Duff, J. Koster and  J.-Y. L'Excellent,
  A fully asynchronous multifrontal solver using distributed dynamic
  scheduling, SIAM Journal of Matrix Analysis and Applications,
  Vol 23, No 1, pp 15-41 (2001).
 .
  [2] P. R. Amestoy, A. Guermouche, J.-Y. L'Excellent and
  S. Pralet, Hybrid scheduling for the parallel solution of linear
  systems. Parallel Computing Vol 32 (2), pp 136-156 (2006).
 .
 As a counterpart to the access to the source code and rights to copy,
 modify and redistribute granted by the license, users are provided only
 with a limited warranty  and the software's author,  the holder of the
 economic rights,  and the successive licensors  have only  limited
 liability.
 .
 In this respect, the user's attention is drawn to the risks associated
 with loading,  using,  modifying and/or developing or reproducing the
 software by the user in light of its specific status of free software,
 that may mean  that it is complicated to manipulate,  and  that  also
 therefore means  that it is reserved for developers  and  experienced
 professionals having in-depth computer knowledge. Users are therefore
 encouraged to load and test the software's suitability as regards their
 requirements in conditions enabling the security of their systems and/or
 data to be ensured and,  more generally, to use and operate it in the
 same conditions as regards security.
 .
 The fact that you are presently reading this means that you have had
 knowledge of the CeCILL-C license and that you accept its terms.

Files: PORD/*
Copyright: Juergen Schulze
License: public-domain
 We are grateful to Juergen Schulze for letting us distribute PORD.
 .
 SPACE-1.0 (which includes PORD) is in the public domain, see
 http://www2.cs.uni-paderborn.de/cs/ag-monien/PERSONAL/SCHLUNZ/vrp.html

Files: debian/*
Copyright: 2009-2011 Adam C. Powell, IV <hazelsct@debian.org>
           2016      Mattia Rizzolo <mattia@debian.org>
	   2017      Drew Parsons <dparsons@debian.org>
License: public-domain-debian
 These Debian control files may be used and reused freely 
 without restriction.

Files: src/ana_orderings.F
Copyright: 1996-2016 Timothy A. Davis, Patrick R. Amestoy, and Iain S. Duff
           1997-2000 Patrick Amestoy
           2004-2005 Stephane Pralet
License: LGPL/CeCill-C/BSD-3
 This file includes various modifications of an original 
 LGPL/ CeCILL-C compatible 
 code implementing the Approximate Minimum Degree ordering
 . 
  The main reference for the approach used in routine
  MUMPS_ANA_H is
   Patrick Amestoy, Timothy A. Davis, and Iain S. Duff,
    "An approximate minimum degree ordering algorithm,"
    SIAM J. Matrix Analysis  vol 17, pages=886--905 (1996)
    MUMPS_ANA_H is based on the original AMD code:
 .
    AMD, Copyright (c), 1996-2016, Timothy A. Davis,
    Patrick R. Amestoy, and Iain S. Duff.  All Rights Reserved.
    Used in MUMPS under the BSD 3-clause license.
    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 HOLDERS 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.
 .
 All other routines are modifications of this original routine
 done by MUMPS developers over the years (1996-2012).
 .
   MUMPS_AMD_ELT is a modification 
   designed to handle amalgamated and compressed
   graphs and was developed in 1999 by Patrick Amestoy 
   in the context of the PARASOL project (1997-1999).
 .
   MUMPS_HAMD is a modification 
   designed to take into account a halo in the graph. 
   The graph is composed is partitioned in two types of nodes
   the so called internal nodes and the so called halo nodes.
   Halo nodes cannot be selected the both the initial degrees 
   and updated degrees of internal node should be taken 
   into account.  
   This routine also referred to as HALOAMD in MUMPS comments
   is used for both Schur functionality and in the coupling with 
   partitioners such as SCOTCH.
   This code was developed for MUMPS platform 
   by Patrick Amestoy between 1997 and 1999.
 .
   MUMPS_HAMF4 is a major modification of MUMPS_HAMD 
   since metric used to select pivots in not anymore the 
   degree but an approximation of the fill-in.
   In this approximation 
   all cliques of elements adjacent to the variable are deducted.
   Written by Patrick Amestoy between 1999 and 2000.
   It is also used by F. Pellegrini in SCOTCH since 2000.
 .
   MUMPS_QAMD: modified version of reference AMD routine MUMPS_ANA_H 
   designed to automatically detect and exploit dense or quasi dense
   rows in the reduced matrix at any step of the minimum degree.
   Written in 1997 by Patrick Amestoy.
   References:
    P.R. AMESTOY, Recent progress in parallel multifrontal solvers
      for unsymmetric sparse matrices,
      Proceedings of the 15th World Congress on Scientific Computation,
      Modelling and Applied Mathematics, IMACS, Berlin (1997).
    P.R. AMESTOY (1999), Methodes directes paralleles de
      resolution des systemes creux de grande taille.
      Rapport de these d'habilitation de l'INPT.
 .
   MUMPS_CST_AMF: modified version of MUMPS_HAMF4 routine 
   implementing constraint minimum fill-in based ordering.
   Written by Stephane Pralet for MUMPS platform 
   during his post-doctorate at INPT-IRIT (Oct. 2004- Oct. 2005)
 .
  The preceding licence text was taken verbatim from src/ana_orderings.F
  For reference, the standard LGPL can be found at
  /usr/share/common-licenses/LGPL-3.