Comparison of four numerical algorithms for solving the Liapunov matrix equation† (Q5577947): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207177008905898
+Normal rank
@@ Property / OpenAlex ID @@
+W2004421509
@@ Property / OpenAlex ID: W2004421509 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
+Normal rank
@@ Property / cites work @@
+A Finite Series Solution of the Matrix Equation $AX - XB = C$
+Normal rank
@@ Property / cites work @@
+Q3290963
@@ Property / cites work: Q3290963 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix calculations for Liapunov quadratic forms
@@ Property / cites work: Matrix calculations for Liapunov quadratic forms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3241210
@@ Property / cites work: Q3241210 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5577947