En savoir plus
Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.
A propos de l'auteur
Dorin Andrica is a Professor of Mathematics at the Babe¿-Bolyai University of Cluj Napoca, Romania. He has obtained a PhD in Pure Mathematics in 1992 with a thesis on critical point theory with applications to the geometry of differentiable submanifolds. His interests include differential topology (critical point theory with applications, Morse theory with applications), differential geometry, geometry, Lie groups and Lie algebras with applications in geometric mechanics, number theory, discrete mathematics, and mathematics for competitions. Dorin has co-authored Springer textbooks on various topics in mathematics, as well as problem books for olympiad training.
Ovidiu Bagdasar is an Associate Professor in Mathematics at the University of Derby, United Kingdom. He holds PhDs in Applied Mathematics (University of Nottingham, 2011), and Pure Mathematics (Babe¿-Bolyai University, 2015), the latter with a thesis entitled "On the geometry and applications of complex recurrent sequences". His research is at the boundary between Mathematics and Computer Science, encompassing areas like number theory, optimization, computational, discrete and applied mathematics. He is the author of the SpringerBriefs volume Concise Computer Mathematics Tutorials on Theory and Problems.
Résumé
Adapted from a modular undergraduate course on computational mathematics,
Concise Computer Mathematics
delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.
Texte suppl.
From the reviews:
“The book is ideally suited as an adjunct to a course in computer mathematics or as a refresher for someone with some background in computer mathematics. … The book fulfills its purpose of providing a distilled treatment of the mathematics most commonly used in computer science. It is of most value to computer science students who need a place to find a succinct treatment of the topics covered.” (Marlin Thomas, Computing Reviews, April, 2014)
“Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. … it would be very useful for someone that needs a quick and effective review that includes problems.” (Charles Ashbacher, MAA Reviews, January, 2014)
Commentaire
From the reviews:
"The book is ideally suited as an adjunct to a course in computer mathematics or as a refresher for someone with some background in computer mathematics. ... The book fulfills its purpose of providing a distilled treatment of the mathematics most commonly used in computer science. It is of most value to computer science students who need a place to find a succinct treatment of the topics covered." (Marlin Thomas, Computing Reviews, April, 2014)
"Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. ... it would be very useful for someone that needs a quick and effective review that includes problems." (Charles Ashbacher, MAA Reviews, January, 2014)
