Abstract
Fundamental differences between discrete-time balanced stochastic truncation (BST) and its continuous-time counterpart are shown to preclude a straightforward application of bilinear mappings for directly generalizing existing continuous-time error bounds. Nevertheless, discrete-time BST is shown to satisfy precisely the same Lk error bound as continuous-time BST, although the discrete-time derivations are somewhat more complex.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
