Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations

DOI10.1016/0096-3003(92)90128-NzbMath0766.65041OpenAlexW1991092013MaRDI QIDQ1206820

Gary W. Howell, Syamal K. Sen

Publication date: 1 April 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(92)90128-n

zbMATH Keywords

parallel computationmatrix equationHessenberg matrixmultiple modulus residue arithmetictriangularization algorithmserror-free implementationinversion-free direct algorithms

Mathematics Subject Classification ID

Related Items (1)

Open problems in computational linear algebra

Cites Work

• Error-free matrix symmetrizers and equivalent symmetric matrices
• Numerical solution of \(A^ tS + SA + Q = 0\).
• The Arithmetic of the Digital Computer: A New Approach
• A Hessenberg-Schur method for the problem AX + XB= C
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Comparison of four numerical algorithms for solving the Liapunov matrix equation†
• Error estimates for the solution of linear algebraic systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations