“Fairly Well Known and Need Not be Discussed”: Colonel A.F. Duguid and the Canadian Official History of the First World War

In 1938, Colonel Archer Fortescue Duguid published the first and only volume of his Canadian official history of the First World War. It was eagerly anticipated as the Historical Section had been directed to compile such a history in 1921, and many veterans as well as the public were puzzled by the delay in publication. Despite this, however, reviewers were generally satisfied with the results. Writing in the Legionary, W.W. Murray declared it “a masterly work of great care and precision,” while W.B. Kerr believed that it would form the basis for all future works on the subject. It was hoped that the positive response would hasten completion of the remaining seven volumes; but nine years later and with seemingly little progress made, the project was ancelled

Rectangular Full Packed Format for Cholesky's Algorithm: Factorization, Solution and Inversion

We describe a new data format for storing triangular, symmetric, and Hermitian matrices called RFPF (Rectangular Full Packed Format). The standard two dimensional arrays of Fortran and C (also known as full format) that are used to represent triangular and symmetric matrices waste nearly half of the storage space but provide high performance via the use of Level 3 BLAS. Standard packed format arrays fully utilize storage (array space) but provide low performance as there is no Level 3 packed BLAS. We combine the good features of packed and full storage using RFPF to obtain high performance via using Level 3 BLAS as RFPF is a standard full format representation. Also, RFPF requires exactly the same minimal storage as packed format. Each LAPACK full and/or packed triangular, symmetric, and Hermitian routine becomes a single new RFPF routine based on eight possible data layouts of RFPF. This new RFPF routine usually consists of two calls to the corresponding LAPACK full format routine and two calls to Level 3 BLAS routines. This means {\it no} new software is required. As examples, we present LAPACK routines for Cholesky factorization, Cholesky solution and Cholesky inverse computation in RFPF to illustrate this new work and to describe its performance on several commonly used computer platforms. Performance of LAPACK full routines using RFPF versus LAPACK full routines using standard format for both serial and SMP parallel processing is about the same while using half the storage. Performance gains are roughly one to a factor of 43 for serial and one to a factor of 97 for SMP parallel times faster using vendor LAPACK full routines with RFPF than with using vendor and/or reference packed routines

Modeling the missile-launch tube problem in DYSCO

DYSCO is a versatile, general purpose dynamic analysis program which assembles equations and solves dynamics problems. The executive manages a library of technology modules which contain routines that compute the matrix coefficients of the second order ordinary differential equations of the components. The executive performs the coupling of the equations of the components and manages the solution of the coupled equations. Any new component representation may be added to the library if, given the state vector, a FORTRAN program can be written to compute M, C, K, and F. The problem described demonstrates the generality of this statement

Elimination for Systems of Algebraic Differential Equations

We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data of the system of differential equations through the theory of differential kernels to provide a new upper bound for proving the consistency of the system. We then prove a new upper bound for the effective differential Nullstellensatz, which determines a sufficient number of times to differentiate the original system in order to prove its inconsistency. Finally, we study the Rosenfeld-Gröbner algorithm, which approaches differential elimination by decomposing the given system of differential equations into simpler systems. We analyze the complexity of the Rosenfeld-Gröbner algorithm by computing an upper bound for the orders of the derivatives in all intermediate steps and in the output of the algorithm

Chapter 8 The music editions of Christian Egenolff

The present chapter, based on a first-hand examination of all of Egenolff’s music editions, including every known exemplar of ten of the fourteen extant editions, aims to remedy this, so that future work on Egenolff and the music in his editions can rest on a surer bibliographical foundation. The catalogue closes with a number of titles that either do not in fact contain printed music, or the printing of which is hypothesise