1naming(3)                           MEPACK                           naming(3)
2
3
4

NAME

6       naming - Naming Scheme for the Computational Routines
7
8        The computational subroutines, that are not part of a Fortran 90
9       module, follow the Fortran 77 old style calling conventions. The
10       routines have the following naming scheme:
11
12       SUBROUTINE AAA_FFEE_WWW(ARGUMENTS...)
13
14
15        Thereby, the three components AAA, EEE, and WWW have to following
16       meanings:
17
18       • AAA specifies the data type/precision for the numerical input values.
19         This is either SLA for Single Precision Linear Algebra or DLA for
20         Double Precision Linear Algebra. A few routines begin with different
21         prefixes. These routines are only for internal usage and not meant to
22         be called from outside. Making them visible is necessary to fix some
23         issues with different Fortran compilers.
24
25       • FF are two characters specifying the coefficient matrices. This can
26         be one the following combinations:
27
28         • TR, the coefficient matrices are (quasi) upper triangular matrices.
29
30         • TG, the coefficient matrices are matrix pairs with (quasi) upper
31           triangular matrices.
32
33         • GE, the coefficient matrices are general matrices.
34
35         • GG, the coefficient matrices are general matrices, that appear in
36           matrix pairs.
37
38       • EE specifies the equations, this can be
39
40         • SYLV, for Sylvester equations
41
42         • SYLV2, for discrete time Sylvester equations
43
44         • LYAP, for Lyapunov equations
45
46         • STEIN, for Stein equations
47
48         • CSYLV, for the coupled generalized Sylvester equation
49
50         • CSYLV_DUAL, for the dual coupled generalized Sylvester equation
51
52       • WWW (optionally) specifies the details about the solver. The
53         following strings can be part of this description:
54
55         • L3, for a level-3 solver
56
57         • L2, for a level-2 solver
58
59         • DAG, for a parallel, graph-scheduled, solver
60
61         • RECURSIVE, for a recursive solver
62
63         • REFINE, for a solver which uses iterative refinement
64
65       Additionally, the WWW contains hints about the optimizations in the
66       routines. For details, see the documentation of the individual
67       routines.
68
69Version 1.1.0                   Wed Oct 18 2023                      naming(3)
Impressum