This book contains the edited versions of most of the papers presented at the 9th International Conference on Boundary Elements held at the University of Stuttgart, Germany from August 31st to September 4th, 1987, which was organized in co-operation with the Computational Mechanics Institute and GAMM (Society for Applied Mathematics and Mechanics). This Conference, as the previous ones, aimed to review the latest developments in technique and theory and point out new advanced future trends. The emphasis of the meeting was on the engineering advances versus mathematical formulations, in an effort to consolidate the basis of many new applications. Recently engineers have proposed different techniques to solve non-linear and time dependent problems and many of these formulations needed a better mathematical understanding. Furthermore, new approximate formulations have been proposed for boundary elements which appeared to work in engineering practice, but did not have a proper theoretical background. The Conference also discussed the engineering applications of the method and concentrated on a link between BEM practitioners, industrial users and researchers working on the latest development of the method. The editors would like to express their appreciation and thanks to Ms. Liz Newman and Mr. H. Schmitz for their unstinting work in the preparation of the Conference.

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.

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 contains the edited versions of most of the papers presented at the 9th International Conference on Boundary Elements held at the University of Stuttgart, Germany from August 31st to September 4th, 1987, which was organized in co-operation with the Computational Mechanics Institute and GAMM (Society for Applied Mathematics and Mechanics). This Conference, as the previous ones, aimed to review the latest developments in technique and theory and point out new advanced future trends. The emphasis of the meeting was on the engineering advances versus mathematical formulations, in an effort to consolidate the basis of many new applications. Recently engineers have proposed different techniques to solve non-linear and time dependent problems and many of these formulations needed a better mathematical understanding. Furthermore, new approximate formulations have been proposed for boundary elements which appeared to work in engineering practice, but did not have a proper theoretical background. The Conference also discussed the engineering applications of the method and concentrated on a link between BEM practitioners, industrial users and researchers working on the latest development of the method. The editors would like to express their appreciation and thanks to Ms. Liz Newman and Mr. H. Schmitz for their unstinting work in the preparation of the Conference.

This unique book provides a comprehensive introduction to computational mathematics, which forms an essential part of contemporary numerical algorithms, scientific computing and optimization. It uses a theorem-free approach with just the right balance between mathematics and numerical algorithms. This edition covers all major topics in computational mathematics with a wide range of carefully selected numerical algorithms, ranging from the root-finding algorithm, numerical integration, numerical methods of partial differential equations, finite element methods, optimization algorithms, stochastic models, nonlinear curve-fitting to data modelling, bio-inspired algorithms and swarm intelligence. This book is especially suitable for both undergraduates and graduates in computational mathematics, numerical algorithms, scientific computing, mathematical programming, artificial intelligence and engineering optimization. Thus, it can be used as a textbook and/or reference book.

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.

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography