Search results

The Kronecker product of matrices plays a central role in mathematics and in applications found in engineering and theoretical physics. These applications are signal processing, statistical physics, quantum groups and quantum computers. This book provides a comprehensive introduction to the Kronecker product of matrices together with its software implementation in C++ using an object-oriented design.

This book is a continuation of Theory of Matroids (also edited by Neil White), and again consists of a series of related surveys that have been contributed by authorities in the area. The volume begins with three chapters on coordinatisations, followed by one on matching theory. The next two deal with transversal and simplicial matroids. These are followed by studies of the important matroid invariants. The final chapter deals with matroids in combinatorial optimisation, a topic of much current...

Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phylogenetic networks and tight spans. Based on a natural conceptual framework, the book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, quartet systems and metrics. Such encodings provide useful options for analyzing and manipulating phyloge...

This book constitutes the refereed proceedings of the Third International Workshop on Applied Parallel Computing, PARA'96, held in Lyngby, Denmark, in August 1996. The volume presents revised full versions of 45 carefully selected contributed papers together with 31 invited presentations. The papers address all current aspects of applied parallel computing relevant for industrial computations. The invited papers review the most important numerical algorithms and scientific applications on severa...

Free Mathematica 10 Update Included! Now available from www.wiley.com/go/magrab Updated material includes: - Creating regions and volumes of arbitrary shape and determining their properties: arc length, area, centroid, and area moment of inertia - Performing integrations, solving equations, and determining the maximum and minimum values over regions of arbitrary shape - Solving numerically a class of linear second order partial differential equations in regions of arbitrary shape using finite el...

This volume is a collection of survey papers in combinatorics that have grown out of lectures given in the workshop on Probabilistic Combinatorics at the Paul Erdös Summer Research Center in Mathematics in Budapest. The papers, reflecting the many facets of modern-day combinatorics, will be appreciated by specialists and general mathematicians alike: assuming relatively little background, each paper gives a quick introduction to an active area, enabling the reader to learn about the fundamental...

It is the first text that in addition to standard convergence theory treats other necessary ingredients for successful numerical simulations of physical systems encountered by every practitioner. The book is aimed at users with interests ranging from application modeling to numerical analysis and scientific software development. It is strongly influenced by the authors research in in space physics, electrical and optical engineering, applied mathematics, numerical analysis and professional softw...

Linear Algebra for Engineers and Scientists Using Matlab(r): International Edition, 1/e For a one-semester introductory course. Although the text has been developed in the context of engineering and physical science, it is also suitable for computer science students, math majors, and other quantitative fields. The most carefully written and clearest written text in linear algebra, motivates students in applied areas by placing linear algebra in context through current applications, anecdotes a...

This volume stems from a workshop held for the Applied Combinatorics program in March 1988. The central idea of the workshop was the recent interplay of the classical analysis of q-series, and the combinatorial analysis of partitions of integers. Many related topics were discussed, including orthogonal polynomials, the Macdonald conjectures for root systems, and related integrals. Those people interested in combinatorial enumeration and special functions will find this volume of interest. Recent...

This is an introductory book on discrete statistical distributions and its applications.It discusses only those that are widely used in the applications of probability and statistics in everyday life. The purpose is to give a self-contained introduction to classical discrete distributions in statistics. Instead of compiling the important formulas (which are available in many other textbooks), we focus on important applications of each distribution in various applied fields like bioinformatics, g...

Systematically teaches key paradigmic algorithm design methods Provides a deep insight into randomization

This book equips the student with essential intellectual tools that are needed from the very beginning of university studies in computing. These consist of abilities and skills - to pass from a concrete problem to an abstract representation, reason with the abstract structure coherently and usefully, and return with booty to the specific situation. The most basic and useful concepts needed come from the worlds of sets (with also their employment as relations and functions), structures (notably t...

What is the "most uniform" way of distributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? Such questions are treated in geometric discrepancy theory. The book is an accessible and lively introduction to this area, with numerous exercises and illustrations. In separate, more specialized parts, it also provides a comprehensive guide to recent research. Including a wide variety of mathematical techniques (from harmonic analysis, combinat...

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes", and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles,...

A dynamic module is a special kind of machine code library that can be loaded at run-time like MuPAD library packages. Dynamic modules allow users to integrate simple C/C++ functions as well as complete software packages into MuPAD and to use them as regular MuPAD functions. They give users direct access to internal methods and data structures of MuPAD and allow it to be extended with almost any desired feature. Programming and creating dynamic modules is facilitated by the MuPAD Application Pro...

This book traces a remarkable path of mathematical connections through seemingly disparate topics. Frustrations with a 1940's electro-mechanical computer at a premier research laboratory begin this story. Subsequent mathematical methods of encoding messages to ensure correctness when transmitted over noisy channels led to discoveries of extremely efficient lattice packings of equal-radius balls, especially in 24-dimensional space. In turn, this highly symmetric lattice, with each point neighbour...

This volume contains the proceedings of theSecondInternationalConferenceon MathematicalKnowledgeManagement (MKM 2003), held 16-18 February 2003 in Bertinoro, Italy. Mathematical Knowledge Management is an exciting new ?eld at the int- section between mathematics and computer science. We need e?cient, new te- niques, based on sophisticated formal mathematics and software technology, to exploit the enormous knowledge available in current mathematical sources and to organize mathematical knowledge...

This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2011, CT-RSA 2011, held in San Francisco, CA, USA, in February 2011. The 24 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 79 submissions. The papers are organized in topical sections on secure two-party computation, cryptographic primitives, side channel attacks, authenticated key agreement, proofs of security, block ciphers, security notion...