Abstract
Matrix notation provides a very compact way of describing certain well-defined numerical operations. As such it saves writing and reading effort in written communication about numerical operations. This applies to communication between one human being and another. It also applies to machine-programming. For most computers, there is by now a certain body of established programmes, routines, carrying out specific matrix- and vector operations. Reference to such routines saves programming effort. The use of matrix notation has also facilitated the analysis of numerical problems. This refers in particular to the properties of linear equation-systems. Such facilitation is really a corollary of the reduction in effort. Problems, which were formerly too complicated to grasp, now become manageable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Heesterman, A.R.G. (1983). Matrix Notation. In: Matrices and Simplex Algorithms. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7941-3_2
Download citation
DOI: https://doi.org/10.1007/978-94-009-7941-3_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7943-7
Online ISBN: 978-94-009-7941-3
eBook Packages: Springer Book Archive