Skip to content

Questions & Design Decisions

olof3 edited this page Jun 11, 2020 · 1 revision

Design Decisions

Bartels-Stewart algorithm

The implementaiton is intended to be simple and fast. However in order to maintain readability, a few small optimizations have not been persued, for example:

  • Symmetry is not exploited when solving diagonal entries of Lyapuniv equations
  • Could use one more in-place multiplication in the top level functions
  • Small savings could be possible when compting UQU' where Q is symmetric, see [1]
  • Could make the triangular solve methods accepts various combinations of upper/lower Schur matrices to avoid transposition but this seems to add quite a bit of code for quite a small gain.

Some other questions

  • What convention for signs and tranposes?
  • Should error checking be done after each block solve or at the end of the algorithm?

Questions

  • What are good naming conventions of the functions?
  • What are the best sign conventions?
Clone this wiki locally