Uniquely devoted to the computational aspects of D-optimal matrices, this book presents a compendium of known algorithmic techniques used to search for D-optimal matrices of a specific type. The application of each algorithm is illustrated with examples.

This is the first book devoted to the computational aspects of D-optimal matrices. The monograph presents a compendium of known algorithmic techniques used to search for D-optimal matrices of a specific type and a unique approach in searching for D-optimal matrices as combinatorial optimization problems. The application of each algorithm is illustrated with fully worked examples. New results on D-optimal matrices are also stated and proven.

Résumé
This monograph presents a compendium of known algorithmic techniques used to search for D-optimal matrices of a specific type. We plan to illustrate the application of each algorithm with fully worked out examples. We also state and prove some new results on D-optimal matrices.

Contenu
-1. Introduction (statement of the problem, basic definitions, PAF). -2. Properties of D-optimal matrices (determinant, Ehlich's two-circulant construction, symmetries). -3. Algorithms for searching for D-optimal matrices (power spectral density, supplementary difference sets, string sorting, combinatorial optimization).-4. Features of the objective function landscapes for D-optimal matrices. -5. Applications of D-optimal matrices. -6. Bibliographical references.-7. Subject Index.