NAG Logo
Numerical Algorithms Group
Join our Group at LinkedIn Follow NAGTalk on Twitter

NAG C Libary - Decision Trees

Selecting the best routine

Decision Trees within many Chapter Introductions in the NAG C 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. For example, the following decision tree is one of several included in the chapter on Partial Differential Equations (Chapter d03):

Example of Decision Tree

The following links will bring you to the location of the decision trees in the chapters indicated for the NAG C Library Mark 8 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
Link to xhtml document*
Quadrature Tree 1: One-dimensional integrals over a finite interval
Tree 2: One-dimensional integrals over a semi-finite or infinite interval
Tree 3: Multi-dimensional integrals
Chapter d01
Link to xhtml document*
Ordinary Differential Equations Tree 1: Initial Value Problems
Tree 2: Boundary Value Problems
Chapter d02
Link to xhtml document*
Partial Differential Equations Tree 1
Tree 2: Hyperbolic branch
Tree 3: Parabolic branch
Tree 4: Branch for parabolic PDE in non-conservative form
Chapter d03
Link to xhtml document*
Interpolation Tree 1 Chapter e01
Link to PDF
Curve and Surface Fitting Tree 1
Tree 2
Chapter e02
Link to PDF
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
Tree 4: Quadratic programming
Chapter e04
Link to PDF
Matrix Factorizations 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
Link to PDF
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
Link to PDF
Determinants Tree 1 Chapter f03
Link to PDF
Simultaneous Linear Equations Tree 1: Black Box functions for unique solution of Ax=b (Real matrix)
Tree 2: Black Box functions for unique solution of Ax=b (Complex matrix)
Tree 3: General purpose functions for unique solution of Ax=b (Real matrix)
Tree 4: General purpose functions fur unique solution of Ax=b (Complex matrix)
Chapter f04
Link to PDF
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
Link to PDF
Large Scale Linear Systems Tree 1: Solvers Chapter f11
Link to PDF


*Advice on viewing and navigating available formats of the C Library documenation can be found in the C library online help document. Information is provided on using the XHTML+MathML format.

© The Numerical Algorithms Group 2010
Privacy Policy | Trademarks

© Numerical Algorithms Group

Visit NAG on the web at:

www.nag.co.uk (Europe and ROW)
www.nag.com (North America)
www.nag-j.co.jp (Japan)

http://www.nag.com/numeric/cl/decisiontrees.asp