Bartels–Stewart algorithm: Difference between revisions

Revision as of 16:42, 27 November 2018

Revision as of 21:58, 15 June 2019

Line 27:

=== Simplifications and special cases ===

In the special case where <math>B=-A^T</math> and <math>C</math> is symmetric, the solution <math>X</math> will also be symmetric. This symmetry can be exploited so that <math>Y</math> is found more efficiently in step 3 of the algorithm<ref name=":0" />.

Line 44 ⟶ 43:

{{Numerical linear algebra}}

[[Category:Algorithms]]

[[Category:Control theory]]

[[Category:Matrices]]

[[Category:Numerical linear algebra]]

{{improve categories|date=November 2018}}