# NAG Fortran Library Decision Trees

Selecting the best routine

Decision Trees within many Chapter Introductions in the NAG Fortran Library Manual make finding the right routine easier and quicker than ever before. The trees lead the user through some simple yes/no questions that categorize the problem and lead to suggestions of the most suitable routines to be used.

The following links will bring you to the location of the decision trees in the chapters indicated for the NAG Library Mark 26 documentation.

Chapter Description Tree Descriptions Chapter & Links
Roots of One or More Transcendental Equations Tree 1: Functions of One Variable
Tree 2: Functions of several variables
Chapter C05
Decision trees
Quadrature Tree 1: One-dimensional integrals over a finite interval
Tree 2: One-dimensional integrals over a semi-infinite or infinite interval
Tree 3: Multidimensional integrals
Chapter D01
Decision trees
Ordinary Differential Equations Tree 1: Initial Value Problems
Tree 2: Boundary Value Problems
Chapter D02
Decision trees
Partial Differential Equations Tree 1:
Tree 2: Elliptic branch
Tree 3: Hyperbolic branch
Tree 4: Parabolic branch
Tree 5: Branch for parabolic PDE in non-conservative form
Chapter D03
Decision trees
Interpolation Tree 1: Chapter E01
Decision trees
Curve and Surface Fitting Tree 1:
Tree 2:
Chapter E02
Decision trees
Minimizing or Maximizing a Function Tree 1: Selection chart for unconstrained problems
Tree 2: Selection chart for bound-constrained, linearly-constrained and nonlinearly-constrained problems
Tree 3: Linear programming
Chapter E04
Decision trees
Matrix Operations, Including Inversion Tree 1:
Tree 2: Inverse of a real n by n matrix of full rank
Tree 3: Inverse of a complex n by n matrix of full rank
Tree 4: Pseudo-inverses
Chapter F01
Decision trees
Eigenvalues and Eigenvectors Tree 1: Eigenvalues and Eigenvectors of Real Matrices
Tree 2: Eigenvalues and Eigenvectors of Complex Matrices
Tree 3: Singular Values and Singular Vectors
Chapter F02
Decision trees
Determinants Tree 1: Chapter F03
Decision trees
Simultaneous Linear Equations Tree 1: Black Box functions for unique solution of A x = b (Real matrix)
Tree 2: Black Box functions for unique solution of A x = b (Complex matrix)
Tree 3: General purpose functions for unique solution of A x = b (Real matrix)
Tree 4: General purpose functions for unique solution of A x = b (Complex matrix)
Tree 5: General purpose functions for least squares and homogeneous equations (without constraints)
Chapter F04
Decision trees
Least Squares and Eigenvalue Problems (LAPACK) Tree 1: Real Symmetric Eigenvalue Problems
Tree 2: Real Generalized Symmetric-definite Eigenvalue Problems
Tree 3: Real Nonsymmetric Eigenvalue Problems
Tree 4: Real Generalized Nonsymmetric Eigenvalue Problems
Tree 5: Complex Hermitian Eigenvalue Problems
Tree 6: Complex Generalized Hermitian-definite Eigenvalue Problems
Tree 7: Complex non-Hermitian Eigenvalue Problems
Tree 8: Complex Generalized non-Hermitian Eigenvalue Problems
Tree 9:
Chapter F08
Decision trees
Large Scale Linear Systems Tree 1: Solvers Chapter F11
Decision trees