Content deleted Content added
m →References: Task 17 (BRFA trial): replace deprecated: |last-author-amp= (2× replaced; usage: 2 of 2); empty parameters removed; |
Removed empty section |
||
Line 47:
It is important to note that, while in principle a QSS method of arbitrary order can be used to model a continuous-time system, it is seldom desirable to use methods of order higher than four, as the [[Abel–Ruffini theorem]] implies that the time of the next quantization, <math>t</math>, cannot (in general) be [[Explicit and implicit methods|explicitly solved]] for [[algebraic solution|algebraically]] when the polynomial approximation is of degree greater than four, and hence must be approximated iteratively using a [[root-finding algorithm]]. In practice, QSS2 or QSS3 proves sufficient for many problems and the use of higher-order methods results in little, if any, additional benefit.
==Software implementation==
| |||