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

Two inversion-free direct algorithms for computing a solution of the linear system \(AX+XB=C\) are proposed by triangularizing a Hessenberg matrix. The algorithms have an in-built consistency check and are capable of pruning redundant rows and converting the resulting matrix into a full row rank matrix. An error-free implementation of the solution \(X\) is presented making use of multiple modulus residue arithmetic and parallelization of the algorithms is discussed. Several examples of application of those algorithms are given.