System of Equations
Chapter
First Online:
- 928 Downloads
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.
Copyright information
© Springer Nature Singapore Pte Ltd. 2019