Parallel Finite-Difference Time-Domain Method

Finite arrangements of convex bodies were intensively investigated in the second half of the twentieth century. Connections to many other subjects were made, including crystallography, the local theory of Banach spaces, and combinatorial optimisation. This book, the first one dedicated solely to the subject, provides an in-depth state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, besides collecting those scattered around in the literature, and provides a comprehensive treatment of problems whose interplay was not clearly understood before. In order to make the material more accessible, each chapter is essentially independent, and two-dimensional and higher-dimensional arrangements are discussed separately. Arrangements of congruent convex bodies in Euclidean space are discussed, and the density of finite packing and covering by balls in Euclidean, spherical and hyperbolic spaces is considered.

An important part of homological algebra deals with modules possessing projective resolutions of finite length. This goes back to Hilbert's famous theorem on syzygies through, in the earlier theory, free modules with finite bases were used rather than projective modules. The introduction of a wider class of resolutions led to a theory rich in results, but in the process certain special properties of finite free resolutions were overlooked. D. A. Buchsbaum and D. Eisenbud have shown that finite free resolutions have a fascinating structure theory. This has revived interest in the simpler kind of resolution and caused the subject to develop rapidly. This Cambridge Tract attempts to give a genuinely self-contained and elementary presentation of the basic theory, and to provide a sound foundation for further study. The text contains a substantial number of exercises. These enable the reader to test his understanding and they allow the subject to be developed more rapidly. Each chapter ends

This text presenting the mathematical theory of finite elements is organized into three main sections. The first part develops the theoretical basis for the finite element methods, emphasizing inf-sup

This accessible text covers the techniques of parallel programming in a practical manner that enables readers to write and evaluate their parallel programs. Supported by the National Science Foundatio

Offers a well-rounded, mathematical approach to problems in signal interpretation using the latest time, frequency, and mixed-domain methodsEqually useful as a reference, an up-to-date review, a learn

An Introductory Guide to Finite Element Analysis is written for engineers and scientists who want to understand the fundamental theory of finite element (FE) analysis and to learn how to analyse pract

A picture dictionary with a difference! Using the tried and tested method of 'look, cover and speak', this fun language learning picture book is organised in popular themes like shopping, school, fami

A picture dictionary with a difference! Using the tried and tested method of 'look, cover and speak', this fun language learning picture book is organised in popular themes like shopping, school, fami

A picture dictionary with a difference! Using the tried and tested method of 'look, cover and speak', this fun language learning picture book is organised in popular themes like shopping, school, fami

Parallel Algorithms for Regular Architectures is the first book to concentrate exclusively on algorithms and paradigms for programming parallel computers such as the hypercube, mesh, pyramid, and mesh

This book provides a basic, in-depth look at techniques for the design and analysis of parallel algorithms and for programming them on commercially available parallel platforms. Principles of parallel

This is the second volume in a two-volume set, which provides a complete self-contained proof of the classification of geometries associated with sporadic simple groups: Petersen and tilde geometries. The second volume contains a study of the representations of the geometries under consideration in GF(2)-vector spaces as well as in some non-abelian groups. The central part is the classification of the amalgam of maximal parabolics, associated with a flag transitive action on a Petersen or tilde geometry. The classification is based on the method of group amalgam, the most promising tool in modern finite group theory. Via their systematic treatment of group amalgams, the authors establish a deep and important mathematical result. This book will be of great interest to researchers in finite group theory, finite geometries and algebraic combinatorics.

This textbook introduces finite element analysis, moving gradually from simple concepts to more advanced theories. Practical matters are also discussed, including modeling for finite element analysis

The introduction of numerical methods, particularly finite element (FE) analysis, represents a significant advance in metal forming operations. Numerical methods are used increasingly to optimize product design and deal with problems in metal forging, rolling, and extrusion processes. Metal Forming Analysis, first published in 2001, describes the most important numerical techniques for simulating metal forming operations. The first part of the book describes principles and procedures and includes numerous examples and worked problems. The remaining chapters focus on applications of numerical analysis to specific forming operations. Most of these results are drawn from the authors' research in the areas of metal testing, sheet metal forming, forging, extrusion, and similar operations. Sufficient information is presented so that readers can understand the nonlinear finite element method as applied to forming problems without a prior background in structural finite element analysis. Gradu

A state-of-the-art guide for the implementation of distributed simulation technology.The rapid expansion of the Internet and commodity parallel computers has made parallel and distributed simulation (

Despite the interest in parallelism and parallel processing, there is a fundamental question that has remained largely unexplored, namely the question of how to design multiprograms (parallel programs

This textbook presents a systematic and unifying viewpoint for a wide class of nonlinear spectroscopic techniques in time domain and frequency domain. It is directed towards active researchers in phys

The focus of this book is the study of the noncommutative aspects of rings and modules, and the style will make it accessible to anyone with a background in basic abstract algebra. Features of interest include an early introduction of projective and injective modules; a module theoretic approach to the Jacobson radical and the Artin-Wedderburn theorem; the use of Baer's criterion for injectivity to prove the structure theorem for finitely generated modules over a principal ideal domain; and applications of the general theory to the representation theory of finite groups. Optional material includes a section on modules over the Weyl algebras and a section on Goldie's theorem. When compared to other more encyclopedic texts, the sharp focus of this book accommodates students meeting this material for the first time. It can be used as a first-year graduate text or as a reference for advanced undergraduates.

The focus of this book is the study of the noncommutative aspects of rings and modules, and the style will make it accessible to anyone with a background in basic abstract algebra. Features of interest include an early introduction of projective and injective modules; a module theoretic approach to the Jacobson radical and the Artin-Wedderburn theorem; the use of Baer's criterion for injectivity to prove the structure theorem for finitely generated modules over a principal ideal domain; and applications of the general theory to the representation theory of finite groups. Optional material includes a section on modules over the Weyl algebras and a section on Goldie's theorem. When compared to other more encyclopedic texts, the sharp focus of this book accommodates students meeting this material for the first time. It can be used as a first-year graduate text or as a reference for advanced undergraduates.

Partial differential equations arise in almost all areas of science, engineering, modeling, and forecasting. During the last two decades pseudospectral methods have emerged as successful alternatives to better known computational procedures, (e.g. finite difference and finite element methods of numerical solution), in several key application areas. These areas include computational fluid dynamics, wave motion, and weather forecasting. This book explains how, when and why this pseudospectral approach works. In order to make the subject accessible to students as well as researchers and engineers, the subject is presented using illustrations, examples, heuristic explanations, and algorithms rather than rigorous theoretical arguments. This book will be of interest to graduate students, scientists and engineers interested in applying pseudospectral methods to real problems.

This volume presents up-to-date research on finite geometries and designs, a key area in modern applicable mathematics. An introductory chapter discusses topics presented in each of the main chapters, and is followed by articles from leading international figures in this field. These include a discussion of the current state of finite geometry from a group-theoretical viewpoint, and surveys of difference sets and of small embeddings of partial cycle systems into Steiner triple systems. Also presented are successful searches for spreads and packing of designs, rank three geometries with simplicial residues and generalized quadrangles satisfying Veblen's Axiom. In addition, there are articles on new 7-designs, biplanes, various aspects of triple systems, and many other topics. This book will be a useful reference for researchers working in finite geometries, design theory or combinatorics in general.

This book is an introductory text on the combinatorial theory of finite geometry. It assumes only a basic knowledge of set theory and analysis, but soon leads the student to results at the frontiers of research. It begins with an elementary combinatorial approach to finite geometries based on finite sets of points and lines, and moves into the classical work on affine and projective planes. The next part deals with polar spaces, partial geometries, and generalised quadrangles. The revised edition contains an entirely new chapter on blocking sets in linear spaces, which highlights some of the most important applications of blocking sets from the initial game-theoretic setting to their recent use in cryptography. Extensive exercises at the end of each chapter ensure the usefulness of this book for senior undergraduate and beginning graduate students.

This book is an introductory text on the combinatorial theory of finite geometry. It assumes only a basic knowledge of set theory and analysis, but soon leads the student to results at the frontiers of research. It begins with an elementary combinatorial approach to finite geometries based on finite sets of points and lines, and moves into the classical work on affine and projective planes. The next part deals with polar spaces, partial geometries, and generalised quadrangles. The revised edition contains an entirely new chapter on blocking sets in linear spaces, which highlights some of the most important applications of blocking sets from the initial game-theoretic setting to their recent use in cryptography. Extensive exercises at the end of each chapter ensure the usefulness of this book for senior undergraduate and beginning graduate students.

The theory of finite fields is a branch of algebra that has come to the fore because of its diverse applications in such areas as combinatorics, coding theory and the mathematical study of switching ciruits. This book is devoted entirely to the theory of finite fields, and it provides comprehensive coverage of the literature. Bibliographical notes at the end of each chapter give an historical survey of the development of the subject. Worked-out examples and lists of exercises found throughout the book make it useful as a text for advanced-level courses.

A hands-on introduction to parallel programming based on the Message-Passing Interface (MPI) standard, the de-facto industry standard adopted by major vendors of commercial parallel systems. This tex

This substantial revision of the text Numerical Solution of Partial Differential Equations by the Finite Element Method by C. Johnson is a two volume introduction to the computational solution of differential equations using a unified approach organised around the adaptive finite element method. It presents a synthesis of mathematical modelling, analysis and computation. It provides the student with theoretical and practical tools useful for addressing the basic questions of computational mathematical modelling in science and engineering: How to model physical phenomena using differential equations? What are the properties of solutions of differential equations? How to compute solutions in practice? How to estimate and control the accuracy of computed solutions? The first volume begins by developing the basic issues at an elementary level in the context of a set of model problems in ordinary differential equations. The second volume extends the scope to nonlinear differential equations

Parallel-Algorithms for Regular Architectures is the first book to concentrate exclusively on algorithms and paradigms for programming parallel computers such as the hypercube, mesh, pyramid, and mesh

This text provides a succinct introduction to basic electric circuit analysis with balanced emphasis on time domain and frequency domain methods. The fifth edition has retained the format and features

This text provides a succinct introduction to basic electric circuit analysis with balanced emphasis on time domain and frequency domain methods. The fifth edition has retained the format and features

This book sets out the principles of parallel computing in a way which will be useful to student and potential user alike. It includes coverage of both conventional and neural computers. The content of the book is arranged hierarchically. It explains why, where and how parallel computing is used; the fundamental paradigms employed in the field; how systems are programmed or trained; technical aspects including connectivity and processing element complexity; and how system performance is estimated (and why doing so is difficult). The penultimate chapter of the book comprises a set of case studies of archetypal parallel computers, each study written by an individual closely connected with the system in question. The final chapter correlates the various aspects of parallel computing into a taxonomy of systems.

This 1994 text covers finite linear spaces. It contains all the important results that had been published up to the time of publication, and is designed to be used not only as a resource for researchers in this and related areas, but also as a graduate-level text. In eight chapters the authors introduce and review fundamental results, and go on to cover the major areas of interest in linear spaces. A combinatorial approach is used for the greater part of the book, but in the final chapter recent advances in group theory relating to finite linear spaces are presented. At the end of each chapter there is a set of exercises which are designed to test comprehension of the material, and there is also a section of problems for researchers. It will be an invaluable book for researchers in geometry and combinatorics as well as forming an excellent text for graduate students.

In this Tract Professor Moreno develops the theory of algebraic curves over finite fields, their zeta and L-functions, and, for the first time, the theory of algebraic geometric Goppa codes on algebraic curves. Amongst the applications considered are: the problem of counting the number of solutions of equations over finite fields; Bombieri's proof of the Reimann hypothesis for function fields, with consequences for the estimation of exponential sums in one variable; Goppa's theory of error-correcting codes constructed from linear systems on algebraic curves. There is also a new proof of the Tsfasman–Vladut–Zink theorem. The prerequisites needed to follow this book are few, and it can be used for graduate courses for mathematics students. Electrical engineers who need to understand the modern developments in the theory of error-correcting codes will also benefit from studying this work.

This text on control and estimation in distributed parameter systems relates frequency domain techniques to state-space or time domain approaches for infinite-dimensional systems, including design of

Data-Parallel Programming demonstrates that architecture-independent parallel programming is possible by describing in detail how programs written in a high-level SIMD programming language may be comp

This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.

The problem of determining which S-arithmetic groups have a finite presentation is solved for arbitrary linear algebraic groups over finite extension fields of #3. For certain solvable topological gro

This book demonstrates how to formulate the equations of mechanical systems. Providing methods of analysis of complex mechanical systems, the book has a clear focus on efficiency, equipping the reader with knowledge of algorithms that provide accurate results in reduced simulation time.The book uses Kane's method due to its efficiency, and the simple resulting equations it produces in comparison to other methods and extends it with algorithms such as order-nKane's method compensates for the errors of premature linearization, which are often inherent within vibrations modes found in a great deal of public domain softwareDescribing how to build mathematical models of multibody systems with elastic components, the book applies this to systems such as construction cranes, trailers, helicopters, spacecraft, tethered satellites, and underwater vehiclesIt also looks at topics such as vibration, rocket dynamics, simulation of beams, deflection, and matrix formulationFlexible Multibody Dynamics

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences,

Insights into the intelligence throughout the natural and technical environment, in the fabric of our devices and dwellings, in our clothes, and under our skin.Is there a way to understand the materials that surround us not as passive objects, but as other intelligences interacting with our own? In Parallel Minds, expert in materials science and nanotechnology Laura Tripaldi delivers not only detailed insights into the properties and emergent behaviors of matter as revealed by state-of-the-art chemistry, synthetic biology, and nanotech, but also a rich philosophical reflection that crosses the frontier between nature and culture, where the most cutting-edge scientific syntheses resonate with ancient myth. The result is a technomaterial bestiary full of unexpected encounters with “strange minds”―from cobwebs to kevlar and carbon fibre, from centaurs to amoebas to arachnids, from polycephalic slime to resonating plasmons, from viruses to golems. Parallel Minds reveals the intelligence

Rapidly Understand New Domains, So You Can Build Great Software for Them Using Domain Storytelling, you can quickly gain clarity about a new domain's people, tasks, tools, work items, and events, avoi