Abstract

Within the simulation community, it is often believed that integration is the limiting factor to program performance and run-time efficiency when simulating large-scale continuous feedback systems. Much attention is given to selection of the best approximation technique (e.g., Euler, Runge-Kutta, Adams-Bashforth). However, performance is shown to be up to six times more sensitive to impact on nonlinear function generation due to computational complexities associated with one- and two-dimensional table-look-up algorithms. Such algorithms utilize linear interpolation and sequential search that when combined, produce a number of approaches to algorithm construction. Algorithms and associated data structures have been formulated in contrasting general-purpose languages to illustrate stylistic differences and for direct application in nonlinear simulation of lumped-parameter systems.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.