This volume is concerned with the transport of thermal energy in flows of practical significance. The temperature distributions which result from convective heat transfer, in contrast to those associated with radiation heat transfer and conduction in solids, are related to velocity characteristics and we have included sufficient information of momentum transfer to make the book self-contained. This is readily achieved because of the close relation ship between the equations which represent conservation of momentum and energy: it is very desirable since convective heat transfer involves flows with large temperature differences, where the equations are coupled through an equation of state, as well as flows with small temperature differences where the energy equation is dependent on the momentum equation but the momentum equation is assumed independent of the energy equation. The equations which represent the conservation of scalar properties, including thermal energy, species concentration and particle number density can be identical in form and solutions obtained in terms of one dependent variable can represent those of another. Thus, although the discussion and arguments of this book are expressed in terms of heat transfer, they are relevant to problems of mass and particle transport. Care is required, however, in making use of these analogies since, for example, identical boundary conditions are not usually achieved in practice and mass transfer can involve more than one dependent variable.

Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number p can be computed in time bounded by a fixed power of the logarithm of p. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program. The computation of the Galois representations uses their realization, following Shimura and Deligne, in the torsion subgroup of Jacobian varieties of modular curves. The main challenge is then to perform the necessary computations in time polynomial in the dimension of these highly nonlinear algebraic varieties. Exact computations involving systems of polynomial equations in many variables take exponential time. This is avoided by numerical approximations with a precision that suffices to derive exact results from them. Bounds for the required precision--in other words, bounds for the height of the rational numbers that describe the Galois representation to be computed--are obtained from Arakelov theory. Two types of approximations are treated: one using complex uniformization and another one using geometry over finite fields. The book begins with a concise and concrete introduction that makes its accessible to readers without an extensive background in arithmetic geometry. And the book includes a chapter that describes actual computations.

The main objective of this volume is to create a bridge between control theory and its numerical analysis aspects. It is unique because it presents both subjects in a single volume. The book combines an exposition of linear control theory and the corresponding modern relevant computational techniques such as orthogonal polynomials, Padé approximation, numerical linear algebra, and some topics on nonlinear differential equations. It can be considered as an introduction to control theory for numerical analysts looking for a wide area of applications and as an introduction to recent numerical methods for control specialists. Audience: Aimed at advanced students at a doctoral or post-doctoral level, engineers, and researchers in control theory and numerical analysis.

The development of new computational techniques and better computing power has made it possible to attack some classical problems of algebraic geometry. The main goal of this book is to highlight such computational techniques related to algebraic curves. The area of research in algebraic curves is receiving more interest not only from the mathematics community, but also from engineers and computer scientists, because of the importance of algebraic curves in applications including cryptography, coding theory, error-correcting codes, digital imaging, computer vision, and many more.This book covers a wide variety of topics in the area, including elliptic curve cryptography, hyperelliptic curves, representations on some Riemann-Roch spaces of modular curves, computation of Hurwitz spectra, generating systems of finite groups, Galois groups of polynomials, among other topics.

This book describes computational problems related to kernel density estimation (KDE) – one of the most important and widely used data smoothing techniques. A very detailed description of novel FFT-based algorithms for both KDE computations and bandwidth selection are presented. The theory of KDE appears to have matured and is now well developed and understood. However, there is not much progress observed in terms of performance improvements. This book is an attempt to remedy this. The book primarily addresses researchers and advanced graduate or postgraduate students who are interested in KDE and its computational aspects. The book contains both some background and much more sophisticated material, hence also more experienced researchers in the KDE area may find it interesting. The presented material is richly illustrated with many numerical examples using both artificial and real datasets. Also, a number of practical applications related to KDE are presented.

Three subjects of major interest in one textbook: linear elasticity, mechanics of structures in linear isotropic elasticity, and nonlinear mechanics including computational algorithms. After the simplest possible, intuitive approach there follows the mathematical formulation and analysis, with computational methods occupying a good portion of the book. There are several worked-out problems in each chapter and additional exercises at the end of the book, plus mathematical expressions are bery often given in more than one notation. The book is intended primarily for students and practising engineers in mechanical and civil engineering, although students and experts from applied mathematics, materials science and other related fields will also find it useful.

This is the first book devoted entirely to total least squares. The authors give a unified presentation of the TLS problem. A description of its basic principles are given, the various algebraic, statistical and sensitivity properties of the problem are discussed, and generalizations are presented. Applications are surveyed to facilitate uses in an even wider range of applications. Whenever possible, comparison is made with the well-known least squares methods. A basic knowledge of numerical linear algebra, matrix computations, and some notion of elementary statistics is required of the reader; however, some background material is included to make the book reasonably self-contained.

This book introduces a computationally feasible, cognitively inspired formal model of concept invention, drawing on Fauconnier and Turner's theory of conceptual blending, a fundamental cognitive operation. The chapters present the mathematical and computational foundations of concept invention, discuss cognitive and social aspects, and further describe concrete implementations and applications in the fields of musical and mathematical creativity. Featuring contributions from leading researchers in formal systems, cognitive science, artificial intelligence, computational creativity, mathematical reasoning and cognitive musicology, the book will appeal to readers interested in how conceptual blending can be precisely characterized and implemented for the development of creative computational systems.

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra-Lenstra-Lovász lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.