Mark 26 NAG Fortran Library News

At Mark 26 of the NAG Library new functionality has been introduced in addition to improvements in existing areas. The Library now contains 1855 user-callable routines, all of which are documented, of which 37 are new at this mark.

Chapter D01 (Quadrature) has two new routines to calculate weights and abscissae for use in Gaussian quadrature and a new routine to solve a specific Gaussian quadrature problem.

Chapter D02 (Ordinary Differential Equations) has reverse communication versions of the Runge–Kutta step and interpolation routines. The interpolation routine has extended the functionality to include the high-order method.

Chapter E04 (Minimizing or Maximizing a Function) has a new suite of routines, NAG Modelling Optimization Suite for quadratic programming (QP), linear semidefinite programming (SDP), semidefinite programming with bilinear matrix inequalities (BMI-SDP), and general nonlinear programming (NLP). This suite can, for example, solve the nearest correlation matrix problem with individually weighted elements or minimize the maximum eigenvalue of a matrix. The suite introduces a novel interface, allowing the gradual build up of a problem definition and avoiding the long parameter lists of earlier interfaces. The SDP solver is based upon a generalized augmented Lagrangian method and as such complements existing solvers in the optimization chapters. The QP/NLP solver of this suite is based upon IPOPT, an interior-point method optimization package, suitable for large-scale problems, that complements the active-set sequential quadratic programming (SQP) solvers already present.

Chapter F08 (Least Squares and Eigenvalue Problems (LAPACK)) has additional blocked (BLAS-3) variants of routines for computing the generalized SVD, or generalized eigenvalues of real or complex matrix pairs.

Chapter G02 (Correlation and Regression Analysis) has a new nearest correlation routine that, using a shrinking method, allows the fixing of arbitrary elements in the input matrix.

Chapter X06 (OpenMP Utilities has a new routine to identify, at runtime, whether you are using a threaded Library or not.

At this release we have made changes to the introductory documentation supporting the Library. The document previously called the 'Essential Introduction' has been revised so that relevant information and advice on how to use the Library and its documentation can be found quickly. The document has been renamed to How to Use the NAG Library and its Documentation.

We have also provided clarification of the term 'Direct and Reverse Communication Routines', see Section 3.3.3 in How to Use the NAG Library and its Documentation, and taken the decision to document a number of error conditions, i.e., Dynamic Memory Allocation, License Management and Unexpected Errors (see Sections 3.7, 3.8 and 3.9 in How to Use the NAG Library and its Documentation).

You will also notice that on every HTML page there is now a Keyword Search box.

The 37 new user-callable routines included in the NAG Library at Mark 26 are as follows.

RoutineName |
Purpose |

D01TDF | Calculation of weights and abscissae for Gaussian quadrature rules, method of Golub and Welsch |

D01TEF | Generates recursion coefficients needed by D01TDF to calculate a Gaussian quadrature rule |

D01UBF | Non-automatic routine to evaluate $\underset{0}{\overset{\infty}{\int}}}\mathrm{exp}\left({-x}^{2}\right)f\left(x\right)dx$ |

D02PGF | Ordinary differential equations, initial value problem, Runge–Kutta method, integration by reverse communication |

D02PHF | Set up interpolant by reverse communication for solution and derivative evaluations at points within the range of the last integration step taken by D02PGF |

D02PJF | Evaluate interpolant, set up using D02PQF, to approximate solution and/or solution derivatives at a point within the range of the last integration step taken by D02PGF |

E04MWF | Write MPS data file defining LP, QP, MILP or MIQP problem |

E04RAF | Initialization of a handle for the NAG optimization modelling suite for problems, such as, quadratic programming (QP), nonlinear programming (NLP), linear semidefinite programming (SDP) or SDP with bilinear matrix inequalities (BMI-SDP) |

E04RDF | A reader of sparse SDPA data files for linear SDP problems |

E04REF | Define a linear objective function to a problem initialized by E04RAF |

E04RFF | Define a linear or a quadratic objective function to a problem initialized by E04RAF |

E04RGF | Define a nonlinear objective function to a problem initialized by E04RAF |

E04RHF | Define bounds of variables of a problem initialized by E04RAF |

E04RJF | Define a block of linear constraints to a problem initialized by E04RAF |

E04RKF | Define a block of nonlinear constraints to a problem initialized by E04RAF |

E04RLF | Define a structure of Hessian of the objective, constraints or the Lagrangian to a problem initialized by E04RAF |

E04RNF | Add one or more linear matrix inequality constraints to a problem initialized by E04RAF |

E04RPF | Define bilinear matrix terms to a problem initialized by E04RAF |

E04RYF | Print information about a problem handle initialized by E04RAF |

E04RZF | Destroy the problem handle initialized by E04RAF and deallocate all the memory used |

E04STF | Run an interior point solver on a sparse nonlinear programming problem (NLP) initialized by E04RAF and defined by other routines from the suite |

E04SVF | Run the Pennon solver on a compatible problem initialized by E04RAF and defined by other routines from the suite, such as, semidefinite programming (SDP) and SDP with bilinear matrix inequalities (BMI) |

E04ZMF | Option setting routine for the solvers from the NAG optimization modelling suite |

E04ZNF | Option getting routine for the solvers from the NAG optimization modelling suite |

E04ZPF | Option setting routine for the solvers from the NAG optimization modelling suite from external file |

F08VCF | Computes, using BLAS-3, the generalized singular value decomposition of a real matrix pair |

F08VGF | Produces orthogonal matrices, using BLAS-3, that simultaneously reduce the $m$ by $n$ matrix $A$ and the $p$ by $n$ matrix $B$ to upper triangular form |

F08VQF | Computes, using BLAS-3, the generalized singular value decomposition of a complex matrix pair |

F08VUF | Produces unitary matrices, using BLAS-3, that simultaneously reduce the complex, $m$ by $n$, matrix $A$ and the complex, $p$ by $n$, matrix $B$ to upper triangular form |

F08WCF | Computes, for a real nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors |

F08WFF | Performs, using BLAS-3, an orthogonal reduction of a pair of real general matrices to generalized upper Hessenberg form |

F08WQF | Computes, for a complex nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, and optionally, the left and/or right generalized eigenvectors |

F08WTF | Performs, using BLAS-3, a unitary reduction of a pair of complex general matrices to generalized upper Hessenberg form |

F08XCF | Computes, for a real nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, the generalized real Schur form and, optionally, the left and/or right matrices of Schur vectors |

F08XQF | Computes, for a complex nonsymmetric matrix pair, using BLAS-3, the generalized eigenvalues, the generalized complex Schur form and, optionally, the left and/or right matrices of Schur vectors |

G02APF | Computes a correlation matrix from an approximate one using a specified target matrix |

X06XAF | Tests whether a threaded NAG Library is being used |

There have been no internal changes at this mark.

The following routines have been withdrawn from the NAG Library at Mark 26. Warning of their withdrawal was included in the NAG Library Manual at Mark 25, together with advice on which routines to use instead. See the document ‘Advice on Replacement Calls for Withdrawn/Superseded Routines’ for more detailed guidance.

WithdrawnRoutine |
Replacement Routine(s) |

C06EAF | C06PAF |

C06EBF | C06PAF |

C06ECF | C06PCF |

C06EKF | C06FKF |

C06FRF | C06PSF |

C06FUF | C06PUF |

C06GBF | No replacement required |

C06GCF | No replacement required |

C06GQF | No replacement required |

C06GSF | No replacement required |

C06HAF | C06REF |

C06HBF | C06RFF |

C06HCF | C06RGF |

C06HDF | C06RHF |

D01BAF | D01UAF |

D01BBF | D01TBF |

D02PCF | D02PEF and associated D02P routines |

D02PDF | D02PFF or D02PGF and associated D02P routines |

D02PVF | D02PQF |

D02PWF | D02PRF |

D02PXF | D02PSF |

D02PYF | D02PTF |

D02PZF | D02PUF |

F04YCF | F04YDF |

F04ZCF | F04ZDF |

G01AAF | G01ATF |

The routines listed below are scheduled for withdrawal from the NAG Library, because improved routines have now been included in the Library. You are advised to stop using routines which are scheduled for withdrawal and to use recommended replacement routines instead. See the document ‘Advice on Replacement Calls for Withdrawn/Superseded Routines’ for more detailed guidance, including advice on how to change a call to the old routine into a call to its recommended replacement.

The following routines will be withdrawn at Mark 27.

Routines Scheduledfor Withdrawal |
Replacement Routine(s) |

D01RBF | No replacement required |

D02TKF | D02TLF |

E02ACF | E02ALF |

F02SDF | F12AGF and F12FGF |

F02WDF | F02WUF and F08AEF (DGEQRF) |

G10BAF | G10BBF |

The following routines have been superseded, but will not be withdrawn from the Library until Mark 28 at the earliest.

SupersededRoutine |
Replacement Routine(s) |

C06FPF | C06PQF |

C06FQF | C06PQF |

F04ABF | F07FBF (DPOSVX) |

F04AEF | F07ABF (DGESVX) |

F04ASF | F07FBF (DPOSVX) |

F04ATF | F07ABF (DGESVX) |