Search results for "Discrete Structures"
Items we need to order for you

R 275.00

R 4,572.00

R 1,221.00

Discrete and Algebraic Structures
This textbook presents the topics typically covered in a standard course on discrete structures. It is aimed at students of computer science and mathematics (teaching degree and Bachelor's/Master's) and is designed to accompany lectures, for self-study, and for exam preparation.Through explanatory introductions to definitions, numerous examples, counterexamples, diagrams, cross-references, and outlooks, the authors manage to present the wide range of topics concisely and comprehensibly.Numerous exercises facilitate the deepening of the material. Due to its compact presentation of all important discrete and algebraic structures and its extensive index, the book also serves as a reference for mathematicians, computer scientists, and natural scientists.Contents: From propositional and predicate logic to sets and combinatorics, numbers, relations and mappings, graphs, to the rich spectrum of algebraic structures, and a brief introduction to category theory. Additional chapters include rings and modules as well as matroids.This book is a translation of the second German edition. The translation was done with the help of artificial intelligence. A subsequent human revision was done primarily in terms of content, so the book may read stylistically differently from a conventional translation.
R 2,198.00

Fuzzy Discrete Structures
This ambitious exposition by Malik and Mordeson on the fuzzification of discrete structures not only supplies a solid basic text on this key topic, but also serves as a viable tool for learning basic fuzzy set concepts "from the ground up" due to its unusual lucidity of exposition. While the entire presentation of this book is in a completely traditional setting, with all propositions and theorems provided totally rigorous proofs, the readability of the presentation is not compromised in any way; in fact, the many ex cellently chosen examples illustrate the often tricky concepts the authors address. The book's specific topics - including fuzzy versions of decision trees, networks, graphs, automata, etc. - are so well presented, that it is clear that even those researchers not primarily interested in these topics will, after a cursory reading, choose to return to a more in-depth viewing of its pages. Naturally, when I come across such a well-written book, I not only think of how much better I could have written my co-authored monographs, but naturally, how this work, as distant as it seems to be from my own area of interest, could nevertheless connect with such. Before presenting the briefest of some ideas in this direction, let me state that my interest in fuzzy set theory (FST) has been, since about 1975, in connecting aspects of FST directly with corresponding probability concepts. One chief vehicle in carrying this out involves the concept of random sets.
R 3,034.68

Fundamental Discrete Structures
This book serves as a core text in discrete mathematics. It discusses topics such as symbolic logic, enumerative combinatorics, algebraic structures, graph theory, and related applications to computer science and other allied subjects. The presentation of related concepts is suitable for sophomore, junior, and senior-level undergraduate students. Exercises provided at the end of each chapter are designed to help the reader have an active learning experience throughout the study.
R 3,114.00

Random Discrete Structures
The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps. This volume also focuses on discrete probability and its connections with the theory of algorithms. Classical topics in discrete mathematics are represented as are expositions that condense and make readable some recent work on Markov chains, potential theory and the second moment method. This volume is suitable for mathematicians and students.
R 4,645.17

Spectra of Discrete Structures
Addressing the active and challenging field of spectral theory, this book develops the general theory of spectra of discrete structures, on graphs, simplicial complexes, and hypergraphs. In fact, hypergraphs have long been neglected in mathematical research, but due to the discovery of Laplace operators that can probe their structure, and their manifold applications from chemical reaction networks to social interactions, they now constitute one of the hottest topics of interdisciplinary research. The authors' analysis of spectra of discrete structures embeds intuitive and easily visualized examples, which are often quite subtle, within a general mathematical framework. They highlight novel research on Cheeger type inequalities which connect spectral estimates with the geometry, more precisely the cohesion, of the underlying structure. Establishing mathematical foundations and demonstrating applications, this book will be of interest to graduate students and researchers in mathematics working on the spectral theory of operators on discrete structures.
R 3,147.54

Ramsey Theory for Discrete Structures
This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century.The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the role of parameter sets. It presents several examples of structures that can be interpreted in terms of parameter sets and features the most fundamental Ramsey-type results for parameter sets: Hales-Jewett's theorem and Graham-Rothschild¹s Ramsey theorem as well as their canonical versions and several applications. Next, the book steps back to the most basic structure, to sets. It reviews classic results as well as recent progress on Ramsey numbers and the asymptotic behavior of classical Ramsey functions. In addition, it presents product versions of Ramsey's theorem, a combinatorial proof of the incompleteness of Peano arithmetic, provides a digression to discrepancy theory and examines extensions of Ramsey's theorem to larger cardinals. The next part of the book features an in-depth treatment of the Ramsey problem for graphs and hypergraphs. It gives an account on the existence of sparse and restricted Ramsey theorem's using sophisticated constructions as well as probabilistic methods. Among others it contains a proof of the induced Graham-Rothschild theorem and the random Ramsey theorem. The book closes with a chapter on one of the recent highlights of Ramsey theory: a combinatorial proof of the density Hales-Jewett theorem.This book provides graduate students as well as advanced researchers with a solid introduction and reference to the field.
R 1,548.14

Ramsey Theory for Discrete Structures
This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century.The book first presents a detailed discussion of the roots of Ramsey theory before offering a thorough discussion of the role of parameter sets. It presents several examples of structures that can be interpreted in terms of parameter sets and features the most fundamental Ramsey-type results for parameter sets: Hales-Jewett's theorem and Graham-Rothschild¹s Ramsey theorem as well as their canonical versions and several applications. Next, the book steps back to the most basic structure, to sets. It reviews classic results as well as recent progress on Ramsey numbers and the asymptotic behavior of classical Ramsey functions. In addition, it presents product versions of Ramsey's theorem, a combinatorial proof of the incompleteness of Peano arithmetic, provides a digression to discrepancy theory and examines extensions of Ramsey's theorem to larger cardinals. The next part of the book features an in-depth treatment of the Ramsey problem for graphs and hypergraphs. It gives an account on the existence of sparse and restricted Ramsey theorem's using sophisticated constructions as well as probabilistic methods. Among others it contains a proof of the induced Graham-Rothschild theorem and the random Ramsey theorem. The book closes with a chapter on one of the recent highlights of Ramsey theory: a combinatorial proof of the density Hales-Jewett theorem.This book provides graduate students as well as advanced researchers with a solid introduction and reference to the field.
R 1,547.24

Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 1,557.97

Discrete Structural Optimization
The engineering design of structures and machines consists often in finding the best solution among a finite number of feasible decisions. This volume comprises problems and solution methods for discrete structural optimization. Exact, approximate and heuristic methods are presented applying deterministic and stochastic approaches.
R 3,122.61

Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 2,365.27


R 2,849.00

Monotone Structure in Discrete-Event Systems
Information previously available only in journal articles and research papers has been brought together in this outstanding text. Uses the unifying theme of monotone structure to transcend the two-perspective approach to DES--one stressing logical/qualitative issues and the other temporal/quantitative analysis--to encompass elements from both. Features notes and references at the end of each chapter.
R 8,204.00

Discrete Geometry and Mathematical Morphology
This book constitutes the refereed proceedings of the Third International Joint Conference on Discrete Geometry and Mathematical Morphology, DGMM 2024, held in Florence, Italy during April 15–18, 2024.The 34 full papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: Digital Geometry - Models, Transforms, and Visualization; Computational Aspects of Discrete Structures and Tilings; Learning Based Morphology; Hierarchical and Graph-Based Models, Analysis and Segmentation; Discrete and Combinatorial Topology; and Mathematical Morphology and Digital Geometry for Applications.
R 5,861.00

IUTAM Symposium on Discretization Methods in Structural Mechanics
The JUT AMlIACM Symposium on Discretization Methods in Structural Mechanics was nd th held in Vienna, Austria, from 2 to 6 June 1997. The site of the Symposium was the "Theatersaal" of the Austrian Academy of Sciences. The Symposium was attended by 71 persons from 23 countries. In addition, several Austrian graduate students and research associates participated in the meeting. In the 5-day Symposium a total of 48 papers were presented. All of them were invited and accorded equal weight in the programme. The following topics were covered: • Error-controlled adaptivity of finite element methods • Large deformations and buckling, including inelastic deformations • Inelastic brittle or ductile localization, phase transition and system failure, resulting from monotonic, cyclic or impact loading • Sensitivity analysis and inverse problems with special emphasis on identification of material parameters • Development of linear and nonlinear finite element methods for thin-walled structures and composites • Implicit integration schemes for nonlinear dynamics • Coupling of rigid and deformable structures; fluid-structures and acoustic-structure interaction • Competitive numerical methods (finite element methods, boundary element methods, coupling ofthese two methods) • Identification of material and structural data. Comments on details of the treatment of these topics are contained in the Concluding Remarks. The Editors would like to express their appreciation to E. Stein who has prepared these Concluding Remarks.
R 4,669.74

Dry Stone Retaining Structures
Dry stone retaining structures are structures made of individual decimeter stone blocks in contact. One advantage of this construction technology lies in the weak amount of embodied energy required for their construction, and uses only local materials. This technology may be a positive answer to the challenges brought by sustainable policies in civil engineering. Many of these structures are older than one hundred years and sustain damage due to ageing; this places the owners in front of a challenging issue. Usual scientific tools cannot address the specific behavior of such structures. Due to the discrete nature of the system, a large amount of energy can be dissipated at contact level before failure of the structure. The shape, arrangement and possible breakage of blocks may play a major role in their overall behavior, specific to these structures. This book brings an overview of the DEM technique to model the behavior of discrete civil engineering structures. Physical models, modeling and site measurements are all explored, helping the civil engineer evaluate the behavior of unique structures.
R 2,943.00

Pearls of Discrete Mathematics
Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics.Each chapter begins with a mathematical teaser to engage readers and includes a particularly surprising, stunning, elegant, or unusual result. The author covers the upward extension of Pascal’s triangle, a recurrence relation for powers of Fibonacci numbers, ways to make change for a million dollars, integer triangles, the period of Alcuin’s sequence, and Rook and Queen paths and the equivalent Nim and Wythoff’s Nim games. He also examines the probability of a perfect bridge hand, random tournaments, a Fibonacci-like sequence of composite numbers, Shannon’s theorems of information theory, higher-dimensional tic-tac-toe, animal achievement and avoidance games, and an algorithm for solving Sudoku puzzles and polycube packing problems. Exercises ranging from easy to challenging are found in each chapter while hints and solutions are provided in an appendix.With over twenty-five years of teaching experience, the author takes an organic approach that explores concrete problems, introduces theory, and adds generalizations as needed. He delivers an absorbing treatment of the basic principles of discrete mathematics.
R 3,825.06

Discrete Optimization in Architecture
This book is comprised of two parts, both of which exploremodular systems: Pipe-Z (PZ) and Truss-Z (TZ), respectively. It presents severalmethods of creating PZ and TZ structures subjected to discrete optimization.The algorithms presented employ graph-theoretic and heuristic methods. Theunderlying idea of both systems is to create free-form structures using theminimal number of types of modular elements. PZ is more conceptual, as it formssingle-branch mathematical knots with a single type of module. Conversely, TZis a skeletal system for creating free-form pedestrian ramps and ramp networksamong any number of terminals in space. In physical space, TZ uses two types ofmodules that are mirror reflections of each other. The optimization criteriadiscussed include: the minimal number of units, maximal adherence to the givenguide paths, etc.
R 1,972.42

Discrete Optimization in Architecture
This book explores the extremely modular systems that meet two criteria: they allow the creation of structurally sound free-form structures, and they are comprised of as few types of modules as possible. Divided into two parts, it presents Pipe-Z (PZ) and Truss-Z (TZ) systems. PZ is more fundamental and forms spatial mathematical knots by assembling one type of unit (PZM). The shape of PZ is controlled by relative twists of a sequence of congruent PZMs. TZ is a skeletal system for creating free-form pedestrian ramps and ramp networks among any number of terminals in space. TZ structures are composed of four variations of a single basic unit subjected to affine transformations (mirror reflection, rotation and combination of both).
R 2,241.82

R 4,782.00

Discrete, Finite and Lie Groups
In a self contained and exhaustive work the author covers Group Theory in its multifaceted aspects, treating its conceptual foundations in a proper logical order. First discrete and finite group theory, that includes the entire chemical-physical field of crystallography is developed self consistently, followed by the structural theory of Lie Algebras with a complete exposition of the roots and Dynkin diagrams lore. A primary on Fibre-Bundles, Connections and Gauge fields, Riemannian Geometry and the theory of Homogeneous Spaces G/H is also included and systematically developed.
R 2,827.00

R 367.00

Discrete Mathematics
Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach to this broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individualtailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemath containing hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The book is carefully structured, coherent and comprehensive, and is the ideal text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory, coding theory and abstract algebra.
R 4,061.00

Discrete Geometry and Mathematical Morphology
This book constitutes the refereed proceedings of the 4th International Joint Conference on Discrete Geometry and Mathematical Morphology, DGMM 2025, held in Groningen, The Netherlands, during November 3-6, 2025. The 37 full papers included in this book were carefully reviewed and selected from 52 submissions. They were organized in topical sections as follows: Discrete Geometry - Models, Transforms, and Visualization; Computational Aspects of Discrete Structures and Tilings; Discrete and Combinatorial Topology; Hierarchical and Graph-Based Models, Analysis and Segmentation; Algorithms; Morphological Filters, PDEs and Multivariate Morphology; Mathematical Morphology and Digital Geometry for Applications.
R 5,457.28

Advances in Discrete Differential Geometry
This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.The authors take a closer look at discrete models in differentialgeometry and dynamical systems. Their curves are polygonal, surfacesare made from triangles and quadrilaterals, and time is discrete.Nevertheless, the difference between the corresponding smooth curves,surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, and on pure mathematics and its practical applications. The interaction of these facets is demonstrated by concrete examples, including discrete conformal mappings, discrete complex analysis, discrete curvatures and special surfaces, discrete integrable systems, conformal texture mappings in computer graphics, and free-form architecture.This richly illustrated book will convince readers that this new branch of mathematics is both beautiful and useful. It will appeal to graduate students and researchers in differential geometry, complex analysis, mathematical physics, numerical methods, discrete geometry, as well as computer graphics and geometry processing.
R 2,015.00

Discrete Mathematics
Taking an approach to the subject that is suitable for a broad readership, Discrete Mathematics: Proofs, Structures, and Applications, Third Edition provides a rigorous yet accessible exposition of discrete mathematics, including the core mathematical foundation of computer science. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined later in the book. This edition preserves the philosophy of its predecessors while updating and revising some of the content. New to the Third EditionIn the expanded first chapter, the text includes a new section on the formal proof of the validity of arguments in propositional logic before moving on to predicate logic. This edition also contains a new chapter on elementary number theory and congruences. This chapter explores groups that arise in modular arithmetic and RSA encryption, a widely used public key encryption scheme that enables practical and secure means of encrypting data. This third edition also offers a detailed solutions manual for qualifying instructors.Exploring the relationship between mathematics and computer science, this text continues to provide a secure grounding in the theory of discrete mathematics and to augment the theoretical foundation with salient applications. It is designed to help readers develop the rigorous logical thinking required to adapt to the demands of the ever-evolving discipline of computer science.
R 6,760.27

Data Structures
This text is intended for the one-term course in data structures with the following prerequisites: mastery of a high-level programming language, preferably Pascal, and finite or discrete mathematics. Each basic concept is introduced first through numerous examples and followed by advanced material allowing maximum flexibility in structuring the course. Through the use of data structures, the author has included coverage of the following related topics: recursion, pattern recognition, and dynamic programming. Extensive examples, over 300 exercises, 400 figures and tables, and 80 working algorithms contribute to student learning.
R 9,635.45

Advances in Discrete Differential Geometry
This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.The authors take a closer look at discrete models in differentialgeometry and dynamical systems. Their curves are polygonal, surfacesare made from triangles and quadrilaterals, and time is discrete.Nevertheless, the difference between the corresponding smooth curves,surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, and on pure mathematics and its practical applications. The interaction of these facets is demonstrated by concrete examples, including discrete conformal mappings, discrete complex analysis, discrete curvatures and special surfaces, discrete integrable systems, conformal texture mappings in computer graphics, and free-form architecture.This richly illustrated book will convince readers that this new branch of mathematics is both beautiful and useful. It will appeal to graduate students and researchers in differential geometry, complex analysis, mathematical physics, numerical methods, discrete geometry, as well as computer graphics and geometry processing.
R 2,198.00

R 456.00

Topology Design of Structures
This book contains the edited version of lectures and contributed papers presented at the NA TO ADV ANCED RESEARCH WORKSHOP ON TOPOLOGY OPTIMIZATION OF STRUCTURES, held at Hotel do Mar, Sesimbra, Portugal, 20 June to 26 June, 1992, and organised by the Mathematical Institutc, The Technical University of Denmark and bv CEMUL-Center of Mechanics and Materials of the Techmcal University of Lisbon, Fifty participants from' fourteen countries attended the workshop, This book is organiLed in ten parts, each one addressing a sub field of topology optimiIalion, its relations to materials modelling and its implementation: Part 1- Topology design of discrete structures. Part II - Discrete design and sclection problems. Part III - The homogenization method for topology design. Part IV - AlternatiYC methods for topology design of continuum structures. Part V - Boundary shape design meth(xis. Part VI- Rela\.ation and optimal shape design. Part VII - EtTectiw media theory and optimal design. Part VIII - Extending the scope of topology design. Part IX- Topology design in a computer-aided design environment .. Parl X- Aspects of topology design.
R 9,010.79

Discrete Mathematics for Data Science
Discrete Mathematics for Data Science provides an early course in both Data Science and Discrete Mathematics, focusing on how a deeper understanding of the former can unlock a more effective implementation of the latter. Students of Data Science come from a variety of disciplines, with Business, Statistics, Computer Science, Economics, and Psychology among the departments offering courses on the subject. Therefore, for many students, Data Science is considered a means of insight into a particular field of interest, with the study of its underlying discrete mathematics not a primary objective.This book covers the topics of Discrete Mathematical Structures relevant to students of Data Science, offering a relevant and gentle introduction to both the theoretical and practical elements required to be a successful data scientist. The relaxed, accessible style makes it a perfect textbook for undergraduates.Features• Numerous exercises and examples.• Ideal as a textbook for a Discrete Mathematics course for data science and computer science students.• Source code and solutions provided as a supplementary resource.
R 3,015.28

Classical and Discrete Differential Geometry
This book introduces differential geometry and cutting-edge findings from the discipline by incorporating both classical approaches and modern discrete differential geometry across all facets and applications, including graphics and imaging, physics and networks.With curvature as the centerpiece, the authors present the development of differential geometry, from curves to surfaces, thence to higher dimensional manifolds; and from smooth structures to metric spaces, weighted manifolds and complexes, and to images, meshes and networks. The first part of the book is a differential geometric study of curves and surfaces in the Euclidean space, enhanced while the second part deals with higher dimensional manifolds centering on curvature by exploring the various ways of extending it to higher dimensional objects and more general structures and how to return to lower dimensional constructs. The third part focuses on computational algorithms in algebraic topology and conformal geometry, applicable for surface parameterization, shape registration and structured mesh generation.The volume will be a useful reference for students of mathematics and computer science, as well as researchers and engineering professionals who are interested in graphics and imaging, complex networks, differential geometry and curvature.
R 2,820.55

Discrete Variational Derivative Method
Nonlinear Partial Differential Equations (PDEs) have become increasingly important in the description of physical phenomena. Unlike Ordinary Differential Equations, PDEs can be used to effectively model multidimensional systems. The methods put forward in Discrete Variational Derivative Method concentrate on a new class of "structure-preserving numerical equations" which improves the qualitative behaviour of the PDE solutions and allows for stable computing. The authors have also taken care to present their methods in an accessible manner, which means that the book will be useful to engineers and physicists with a basic knowledge of numerical analysis. Topics discussed include:"Conservative" equations such as the Korteweg–de Vries equation (shallow water waves) and the nonlinear Schrödinger equation (optical waves) "Dissipative" equations such as the Cahn–Hilliard equation (some phase separation phenomena) and the Newell-Whitehead equation (two-dimensional Bénard convection flow)Design of spatially and temporally high-order schemasDesign of linearly-implicit schemasSolving systems of nonlinear equations using numerical Newton method libraries
R 7,595.40

Connecting Discrete Mathematics and Computer Science
Computer science majors taking a non-programming-based course like discrete mathematics might ask 'Why do I need to learn this?' Written with these students in mind, this text introduces the mathematical foundations of computer science by providing a comprehensive treatment of standard technical topics while simultaneously illustrating some of the broad-ranging applications of that material throughout the field. Chapters on core topics from discrete structures – like logic, proofs, number theory, counting, probability, graphs – are augmented with around 60 'computer science connections' pages introducing their applications: for example, game trees (logic), triangulation of scenes in computer graphics (induction), the Enigma machine (counting), algorithmic bias (relations), differential privacy (probability), and paired kidney transplants (graphs). Pedagogical features include 'Why You Might Care' sections, quick-reference chapter guides and key terms and results summaries, problem-solving and writing tips, 'Taking it Further' asides with more technical details, and around 1700 exercises, 435 worked examples, and 480 figures.
R 3,133.00


Introduction to Matrix Methods of Structural Analysis
This textbook provides a comprehensive introduction to matrix methods of structural analysis, framed within a discrete modeling approach that is well-suited for digital computation. Two principal procedures—namely, the Matrix Force Method and the Matrix Displacement Method—are thoroughly illustrated for one-dimensional structural systems. Among them, the Matrix Displacement Method is more widely adopted, owing to its straightforward extension to two- and three-dimensional structures.The book demonstrates how displacements, taken as the primary variables, enable the formation of local element stiffness matrices in the Direct Stiffness Method. In this latter approach, individual element contributions are assembled into a system-level representation, permitting the modeling of virtually any complex structure. This direct stiffness methodology underpins the development of today’s general-purpose finite element programs, offering both breadth and depth to structural analysis.Features Establishes discrete structural modeling as the basis of finite element methods, which are now the industry standard for structural analysis. Provides a step-by-step explanation of the Force Method, the Displacement Method, and the Direct Stiffness Method for 1D members—such as beams, trusses, plane frames, grillages, and space frames—ensuring a clear and accessible learning experience. Highlights Berkeley’s approach to representing joints by employing rigid nodes within a nodal network of interconnected 1D, 2D, or 3D deformable members. Offers an illustrative extension through the MAIL (Matrix Analysis Interpretive Language), which enriches analysis examples, exercises, and problems.Targeted at senior undergraduate and graduate students in structural engineering, this book serves as an essential prerequisite for the Finite Element Analysis of Structures.
R 2,857.00

Operations Research and Discrete Analysis
This book contains translations of papers from the second volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe- rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was titled Sibirskil Zhurnal Issledovaniya Oper- atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (Discrete Analysis and Operations Research). The aim of this journal is to bring together research papers in different areas of discrete mathematics and computer science. The journal DiskretnYl Analiz i Issledovanie Operatsil covers the following fields: * discrete optimization * synthesis and complexity * discrete structures and * of control systems extremal problems * automata * combinatorics * graphs * control and reliability * game theory and its of discrete devices applications * mathematical models and * coding theory methods of decision making * scheduling theory * design and analysis * functional systems theory of algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length.The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation.
R 3,045.85

Computational Modelling of Concrete and Concrete Structures
Computational Modelling of Concrete and Concrete Structures contains the contributions to the EURO-C 2026 conference (March 9-12, 2026, Seefeld in Tirol, Austria).The papers review and discuss research advancements and assess the applicability and robustness of methods and models for the analysis and design of concrete, fibre-reinforced, and prestressed concrete structures, as well as masonry structures. Recent developments encompass data-driven approaches, artificial intelligence, and machine learning methods, as well as novel discretization techniques, probabilistic models, and an increasing focus on microstructural aspects in a multi-scale and multi-physics context. Additionally, there is a noticeable trend towards material-scale innovations, including the use of more eco-efficient binders, new fibres, and 3D-printable concretes, along with life-cycle-oriented models that address the aging and durability of both new and existing concrete infrastructure.Overall computational robustness, mathematical and mechanical rigour, and the quality of predictions and have further increased, accompanied by careful model validation based on respective experimental programmes. The book will serve as an important reference for both academics and professionals, stimulating new research directions in the field of computational modelling of concrete and its application to the analysis of concrete structures.EURO-C 2026 is the ninth edition of the EURO-C conference series after Innsbruck 1994, Bad Gastein 1998, St. Johann im Pongau 2003, Mayrhofen 2006, Schladming 2010, St. Anton am Arlberg 2014, Bad Hofgastein 2018, and Vienna 2022. The overarching focus of the conferences is on computational methods and numerical models for the analysis of concrete and concrete structures.
R 12,679.85

Advances in Structural Optimization
Advances in Structural Optimization presents the techniques for a wide set of applications, ranging from the problems of size and shape optimization (historically the first to be studied) to topology and material optimization. Structural models are considered that use both discrete and finite elements. Structural materials can be classical or new. Emerging methods are also addressed, such as automatic differentiation, intelligent structures optimization, integration of structural optimization in concurrent engineering environments, and multidisciplinary optimization. For researchers and designers in industries such as aerospace, automotive, mechanical, civil, nuclear, naval and offshore. A reference book for advanced undergraduate or graduate courses on structural optimization and optimum design.
R 1,591.06

Deterministic Numerical Modeling of Soil Structure Interaction
In order to describe soil–structure interaction in various situations (nonlinear, static, dynamic, hydro-mechanical couplings), this book gives an overview of the main modeling methods developed in geotechnical engineering. The chapters are centered around: the finite element method (FEM), the finite difference method (FDM), and the discrete element method (DEM). Deterministic Numerical Modeling of Soil–Structure Interaction allows the reader to explore the classical and well-known FEM and FDM, using interface and contact elements available for coupled hydro-mechanical problems.Furthermore, this book provides insight on the DEM, adapted for interaction laws at the grain level. Within a classical finite element framework, the concept of macro-element is introduced, which generalizes constitutive laws of SSI and is particularly straightforward in dynamic situations. Finally, this book presents the SSI, in the case of a group of structures, such as buildings in a town, using the notion of metamaterials and a geophysics approach.
R 5,795.00

Discrete Mathematics for Computer Science
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbersJon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.
R 9,979.81












































