Chebyshev Alternances as a Criterion to Search for Large Determinant Matrices

Abstract

The article discusses the theory and practice of constructing bicyclic matrices with a large or the largest determinant. We review the theoretical-numerical construction of such matrices, along with examples of symmetric matrices and bicyclic Hadamard matrices. The transition to problems with a large determinant is demonstrated. Examples of bicyclic matrices with a large determinant are given.