Linear Algebra for Computational Sciences and Engineering

Ferrante Neri received a Master's degree and a PhD in Electrical Engineering from the Technical University of Bari, Italy, in 2002 and 2007 respectively. In 2007, he also received a PhD in Scientific Computing and Optimization from University of Jyväskylä, Finland. From the latter institution, he received the DSc degree in Computational Intelligence in 2010.  He was appointed Assistant Professor at the Department of Mathematical Information Technology at the University  of Jyväskylä, Finland in 2007, and in 2009  as a Research Fellow with Academy of Finland. Dr Neri moved to De Montfort University, United Kingdom in 2012, where he was appointed Reader in Computational Intelligence and in 2013, promoted to Full Professor of Computational Intelligence Optimisation. Since 2019 Ferrante Neri moved to the School of Computer Science, University of Nottingham, United Kingdom. Ferrante Neri’s teaching expertise lies in mathematics for computer science. He has  a specific long lasting experience in teaching linear and abstract algebra. His research interests include algorithmics, hybrid heuristic-exact optimisation, scalability in optimisation and large scale problems.

• 1. Basic Mathematical Thinking.- 2. Matrices.- 3. Systems of Linear Equations.- 4. Geometric Vectors.- 5. Complex Numbers and Polynomials.-  6. An Introduction to Geometric Algebra and Conics.- 7. An Overview of Algebraic Structures.- 8. Vector Spaces.- 9. An Introduction to Inner Product Spaces: Euclidean Spaces.- 10. Linear Mappings.- 11. An Introduction to Computational Complexity.- 12. Graph Theory.- 13. Applied Linear Algebra: Electrical Networks.- A. non-linear Algebra: An Introduction to Boolean Algebra.- Proofs of Theorems that Require Further Knowledge of Mathematics.- Appendix. Solutions to the Exercises.

“The book is well written, structured, and very intuitive. Every concept is thoroughly introduced and theorems are rigorously proved. Definitions and proofs are explained in a clear and friendly way.” (Ctirad Matonoha, zbMATH 1442.15001, 2020)