Abstract
Numerical computation enables you to compute solutions to numerical problems, provided you can frame them into the proper format. This requires certain considerations. For example, if you digitize continuous functions, then you are going to introduce certain errors due to the sampling at a finite frequency. Hence, a very accurate result requires very fast sampling rate. In cases when a large data set needs to be computed, it becomes computationally intensive and time consuming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Sandeep Nagar
About this chapter
Cite this chapter
Nagar, S. (2018). Numerical Computing Formalism. In: Introduction to Octave. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3201-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3201-9_9
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3200-2
Online ISBN: 978-1-4842-3201-9
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)