PDF

Description

We discuss and improve prior formulations of Quantized-State System simulation, an alternate class of algorithms to the traditional time-stepping algorithms used for the numerical solution of initial-value problems. We illustrate that the computation of higher-order derivatives in an initial-value problem can be performed in multiple ways, and we present improvements that allow QSS solutions to more closely match analytic solutions. We also show that the problem of backward QSS (BQSS) can be ill-posed, and we propose modifications to existing methods to allow for well-defined solutions. Finally, we discuss the implications of these approaches on the efficiency of a solver, and the trade-offs they naturally impose on the result.

Details

Files

Statistics

from
to
Export
Download Full History