Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Linear algebra for computational sciences and engineering
Neri F., Springer International Publishing, New York, NY, 2016. 464 pp. Type: Book (978-3-319403-39-7)
Date Reviewed: May 24 2017

Algebra is applied in many computing technologies and related fields (such as, for instance, networking). For me, the closest examples contain: quantum computing, network routing, and error-control coding. In this book, Ferrante Neri elaborates on this algebraic background, providing a very good starting point for undergraduate students who wish to gain a basic understanding of the theories behind the most exciting parts of contemporary information technology (IT) technologies.

The book covers all of the classical aspects of linear algebra: matrices (chapter 1), systems of linear equations (chapter 2), geometric vectors (chapter 3), complex numbers (chapter 4), preliminaries of geometric algebra (chapter 5), overview of basic algebraic structures such as groups and rings (chapter 7), vector spaces (chapter 8), and linear mappings (chapter 10). The material related to linear algebra is appended with a short introduction to set theory in chapter 1, computational complexity in chapter 10, as well as graph theory in chapter 11.

As Neri’s work is a self-contained textbook, everything is explained from scratch and all of the chapters finish with exercises to test the reader’s understanding of just the presented material. While I like Neri’s approach, I would expect a way of lecturing more resembling, for example, Moon’s presentation of mathematical background for signal processing [1] or Trivedi in his handbook on stochastic modeling necessary in the reliability or queueing theory adopted for computational sciences [2]. While the mathematical fields are different in these three books, I think that the mode of lecture where the mathematical background is explained first and then the engineering applications are presented in some of today’s most prominent computer science examples is most effective for a contemporary engineering student having a utilitarian rather than essential way of learning things. While I sympathize with the latter philosophy of teaching, I am aware of the limited attractiveness of a book following it. On the other hand, in the case of Neri’s work, some examples of this kind are present; for example, Huffman coding and Polish notations are shown in chapter 10. Additionally, there is a whole chapter (12) devoted to solving electrical circuits with respect to linear algebra methods. However, as a practicing lecturer on mathematical applications in engineering, I would like to see, for instance, more examples related to the areas mentioned in the first paragraph of my review.

Reviewer:  Piotr Cholda Review #: CR145293 (1708-0505)
1) Moon, T. K.; Stirling, W. C. Mathematical methods and algorithms for signal processing. Prentice Hall, Upper Saddle River, NJ, 2000.
2) Trivedi, K. S. Probability and statistics with reliability, queuing, and computer science applications (2nd ed.). Wiley, Hoboken, NJ, 2016.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Numerical Linear Algebra (G.1.3 )
 
 
Mathematics And Statistics (J.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Numerical Linear Algebra": Date
Exploiting fast matrix multiplication within the level 3 BLAS
Higham N. ACM Transactions on Mathematical Software 16(4): 352-368, 2000. Type: Article
Aug 1 1991
Fundamentals of matrix computations
Watkins D., John Wiley & Sons, Inc., New York, NY, 1991. Type: Book (9780471614142)
Jun 1 1992
Computational methods for linear control systems
Petkov P., Christov N., Konstantinov M., Prentice Hall International (UK) Ltd., Hertfordshire, UK, 1991. Type: Book (9780131618039)
Jun 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy