Abstract
The problem of computing n unknowns from a system of n equations, where \(n>1\) is fundamentally important in numerical computations. Often n is large—of the order of 10, 100 or even 1000. Thus, an algorithm for root finding must be capable of treating cases of large n and must possess low complexity, in order to debar excessive computational time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Bose, S.K. (2019). System of Equations. In: Numerical Methods of Mathematics Implemented in Fortran. Forum for Interdisciplinary Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-13-7114-1_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-7114-1_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-7113-4
Online ISBN: 978-981-13-7114-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)