Explore the vast range of titles available.

The author classifies all the symmetric integer bilinear forms of signature $(2,1)$ whose isometry groups are generated up to finite index by reflections. There are 8,595 of them up to scale, whose 374 distinct Weyl groups fall into 39 commensurability classes. This extends Nikulin's enumeration of the strongly square-free cases. The author's technique is an analysis of the shape of the Weyl chamber, followed by computer work using Vinberg's algorithm and a ``method of bijections''. He also corrects a minor error in Conway and Sloane's definition of their canonical $2$-adic symbol.

This computationally oriented book describes and explains the mathematical relationships among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and conjugate gradient algorithms. The book bridges different mathematical areas to obtain algorithms to estimate bilinear forms involving two vectors and a function of the matrix. The first part of the book provides the necessary mathematical background and explains the theory. The second part describes the applications and gives numerical examples of the algorithms and techniques developed in the first part. Applications addressed in the book include computing elements of functions of matrices; obtaining estimates of the error norm in iterative methods for solving linear systems and computing parameters in least squares and total least squares; and solving ill-posed problems using Tikhonov regularization. This book will interest researchers in numerical linear algebra and matrix computations, as well as scientists and engineers working on problems involving computation of bilinear forms.

We develop the theories of the strong commutator, the rectangular commutator, the strong rectangular commutator, as well as a solvability theory for the nonmodular TC commutator. These theories are used to show that each of the following sets of statements are equivalent for a variety We prove that a residually small variety that satisfies a congruence identity is congruence modular.

Helping readers numerically solve optimization problems, this book focuses on the fundamental principles and applications of PSO and QPSO algorithms. The authors develop their novel QPSO algorithm, a PSO variant motivated from quantum mechanics, and show how to implement it in real-world applications, including inverse problems, digital filter d.

This book represents the first synthesis of the considerable body of new research into positive definite matrices. These matrices play the same role in noncommutative analysis as positive real numbers do in classical analysis. They have theoretical and computational uses across a broad spectrum of disciplines, including calculus, electrical engineering, statistics, physics, numerical analysis, quantum information theory, and geometry. Through detailed explanations and an authoritative and inspiring writing style, Rajendra Bhatia carefully develops general techniques that have wide applications in the study of such matrices. Bhatia introduces several key topics in functional analysis, operator theory, harmonic analysis, and differential geometry--all built around the central theme of positive definite matrices. He discusses positive and completely positive linear maps, and presents major theorems with simple and direct proofs. He examines matrix means and their applications, and shows how to use positive definite functions to derive operator inequalities that he and others proved in recent years. He guides the reader through the differential geometry of the manifold of positive definite matrices, and explains recent work on the geometric mean of several matrices. Positive Definite Matrices is an informative and useful reference book for mathematicians and other researchers and practitioners. The numerous exercises and notes at the end of each chapter also make it the ideal textbook for graduate-level courses.