In numerical linear algebra, the Bartels-Stewart algorithm is used to numerically solve the Sylvester matrix equation. Developed by R. H. Bartels and G. W. Stewart in 1971, it was the first numerically stable method that could be systematically applied to such equations, transforming the equation into a triangular system by using the real Schur decompositions of its matrices, then solving that system by forward or backward substitution. In 1979 G. Golub, C. Van Loan and S. Nash introduced an improved version known as the Hessenberg-Schur algorithm, but the original method remains a standard approach for solving Sylvester equations of small to moderate size.
Connections
In Field
Source Bartels-Stewart algorithm (Wikipedia)
Sources
Wikipedia: Bartels-Stewart algorithm
Lead sectionQuote, Lead section
In numerical linear algebra, the Bartels-Stewart algorithm is used to numerically solve the Sylvester matrix equation A X − X B = C {\displaystyle AX-XB=C} . Developed by R.H. Bartels and G.W. Stewart in 1971, it was the first numerically stable method that could be systematically applied to solve such equations.
Bartels-Stewart algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, LeadQuote, In Field: Algorithms and Complexity Theory, Lead
In numerical linear algebra, the Bartels-Stewart algorithm is used to numerically solve the Sylvester matrix equation A X − X B = C {\displaystyle AX-XB=C} .
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.