1gotst(1) Scotch user's manual gotst(1)
2
6 gomtst - compute statistics on sparse matrix orderings
7
9 gotst [options] [gfile] [ofile] [lfile]
10
13 The gotst program computes, in a sequential way, statistics on a sparse
14 matrix ordering, such as fill-in, operation count, and separator tree
15 parameters: minimum, maximum, average height and variance of its
16 leaves.
17 Source graph file gfile can only be a centralized graph file. File
19 ofile represents the ordering of the symmetric sparse matrix the pat‐
20 tern of which is represented by gfile. The resulting statistics are
21 stored in file lfile. When file names are not specified, data is read
22 from standard input and written to standard output. Standard streams
23 can also be explicitly represented by a dash '-'.
24 When the proper libraries have been included at compile time, gtst can
26 directly handle compressed graphs, both as input and output. A stream
27 is treated as compressed whenever its name is postfixed with a com‐
28 pressed file extension, such as in 'brol.grf.bz2' or '-.gz'. The com‐
29 pression formats which can be supported are the bzip2 format ('.bz2'),
30 the gzip format ('.gz'), and the lzma format ('.lzma').
31 Since gotst performs sequentially the symbolic factorization of matrix
33 gfile in order to compute fill-in and operation count numbers, this
34 program can take a long time or even run out of memory, when applied to
35 very large graphs.
36
38 -h Display some help.
39 -v Do not account for vertex weights when computing factorization
41 costs.
42 -V Display program version and copyright.
44
46 Display statistics on ordering brol.ord of graph brol.grf:
47 $ gotst brol.grf brol.ord
49
52 gord(1), gtst(1), dgord(1).
53 Scotch user's manual.
55
57 Francois Pellegrini <francois.pellegrini@labri.fr>
58 02 September 2020 gotst(1)