This book provides a conceptual introduction to the theory of ordinary differential equations, concentrating on the initial value problem for equations of evolution and with applications to the calculus of variations and classical mechanics, along with a discussion of chaos theory and ecological models. It has a unified and visual introduction to the theory of numerical methods and a novel approach to the analysis of errors and stability of various numerical solution algorithms based on carefully chosen model problems. While the book would be suitable as a textbook for an undergraduate or elementary graduate course in ordinary differential equations, the authors have designed the text also to be useful for motivated students wishing to learn the material on their own or desiring to supplement an ODE textbook being used in a course they are taking with a text offering a more conceptual approach to the subject.

Topics of this book span the range from spatial and temporal discretization techniques for contact and impact problems with small and finite deformations over investigations on the reliability of micromechanical contact models over emerging techniques for rolling contact mechanics to homogenization methods and multi-scale approaches in contact problems.

A very active field of research is emerging at the frontier of statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. This book sets up a common language and pool of concepts, accessible to students and researchers from each of these fields.

This book contains a systematical analysis of geometrical situations leading to contact pairs -- point-to-surface, surface-to-surface, point-to-curve, curve-to-curve and curve-to-surface. Each contact pair is inherited with a special coordinate system based on its geometrical properties such as a Gaussian surface coordinate system or a Serret-Frenet curve coordinate system. The formulation in a covariant form allows in a straightforward fashion to consider various constitutive relations for a certain pair such as anisotropy for both frictional and structural parts. Then standard methods well known in computational contact mechanics such as penalty, Lagrange multiplier methods, combination of both and others are formulated in these coordinate systems. Such formulations require then the powerful apparatus of differential geometry of surfaces and curves as well as of convex analysis. The final goals of such transformations are then ready-for-implementation numerical algorithms within the finite element method including any arbitrary discretization techniques such as high order and isogeometric finite elements, which are most convenient for the considered geometrical situation. The book proposes a consistent study of geometry and kinematics, variational formulations, constitutive relations for surfaces and discretization techniques for all considered geometrical pairs and contains the associated numerical analysis as well as some new analytical results in contact mechanics.

When, in 1984?86, Richard P. Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a ?Feynmanesque? overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

Proper treatment of structural behavior under severe loading - such as the performance of a high-rise building during an earthquake - relies heavily on the use of probability-based analysis and decision-making tools. Proper application of these tools is significantly enhanced by a thorough understanding of the underlying theoretical and computation

Now you can clearly present even the most complex computational theory topics to your students with Sipser’s distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today’s computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser’s well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition’s refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject’s rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E’s comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.

A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided. Divided into two parts, the first highlights the traditional computation models used in the first studies on computability: - Automata and Turing Machines; - Recursive functions and the Lambda-Calculus; - Logic-based computation models. and the second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages.

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

Introduction to Computational Contact Mechanics: A Geometrical Approach covers the fundamentals of computational contact mechanics and focuses on its practical implementation. Part one of this textbook focuses on the underlying theory and covers essential information about differential geometry and mathematical methods which are necessary to build the computational algorithm independently from other courses in mechanics. The geometrically exact theory for the computational contact mechanics is described in step-by-step manner, using examples of strict derivation from a mathematical point of view. The final goal of the theory is to construct in the independent approximation form /so-called covariant form, including application to high-order and isogeometric finite elements. The second part of a book is a practical guide for programming of contact elements and is written in such a way that makes it easy for a programmer to implement using any programming language. All programming examples are accompanied by a set of verification examples allowing the user to learn the research verification technique, essential for the computational contact analysis. Key features: Covers the fundamentals of computational contact mechanics Covers practical programming, verification and analysis of contact problems Presents the geometrically exact theory for computational contact mechanics Describes algorithms used in well-known finite element software packages Describes modeling of forces as an inverse contact algorithm Includes practical exercises Contains unique verification examples such as the generalized Euler formula for a rope on a surface, and the impact problem and verification of thå percussion center Accompanied by a website hosting software Introduction to Computational Contact Mechanics: A Geometrical Approach is an ideal textbook for graduates and senior undergraduates, and is also a useful reference for researchers and practitioners working in computational mechanics.