Employing a closed set-theoretic foundation for interval computations, Global Optimization Using Interval Analysis simplifies algorithm construction and increases generality of interval arithmetic. This Second Edition contains an up-to-date discussion of interval methods for solving systems of nonlinear equations and global optimization problems. It expands and improves various aspects of its forerunner and features significant new discussions, such as those on the use of consistency methods to enhance algorithm performance. Provided algorithms are guaranteed to find and bound all solutions...

Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra. They are used to identify nontrivial connections across notions, expose conceptual properties, and mediate the application of methods from one area toward questions of the other four. After a concentrated review of the prerequisite mathematical background, Graph Algebras and Automata defines graph algebras and reveals their applicability to automata theory. It proceeds to explore assorted monoids, semigroups, rings, codes, and other...

Radical Theory of Rings distills the most noteworthy present-day theoretical topics, gives a unified account of the classical structure theorems for rings, and deepens understanding of key aspects of ring theory via ring and radical constructions. Assimilating radical theory's evolution in the decades since the last major work on rings and radicals was published, the authors deal with some distinctive features of the radical theory of nonassociative rings, associative rings with involution, and near-rings. Written in clear algebraic terms by globally acknowledged authorities, the presentation...

Like many other textbooks aimed at an advanced graduate audience, Rao's (math, U. of California-Riverside) can also be used as a reference by working professionals. Rao exerts himself considerably to prevent these two uses from conflicting by frequently restating key concepts, keeping the chapters r

Graduate textbooks often have a rather daunting heft. So it's pleasant for a text intended for first-year graduate students to be concise, and brief enough that at the end of a course nearly the entire text will have been covered. This book manages that feat, entirely without sacrificing any materia

Covers design methods for optimal (or quasioptimal) control algorithms in the form synthesis for deterministic and stochastic dynamical systems. The text offers applications in aerospace, robotic and servomechanical technologies, and provides results on exact and approximate solutions.