scientific article; zbMATH DE number 903157

MaRDI QIDQ4885103zbMATH OpenFDO

Authors De-Jun Mu, Guanzhong Dai

Publication date 15 July 1996

zbMATH Keywords

algorithmparallel computationSylvester matrix equationsystolic algorithmSchur canonical formHessenberg-Schur method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Matrix equations and identities (15A24)

Recommendations

• A numerical algorithm for solving the matrix equation \(AX + X^TB = C\)
• Numerical algorithm for solving the matrix equation AX+X^ B=C
• Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
• Numerical algorithms for solving matrix equations AX + BX T = C and AX + BX* = C
• Iterative algorithms for solving the matrix equation \(AXB + CX^{T}D = E\)
• Systolic algorithm for the solution of dense linear equations
• scientific article; zbMATH DE number 5348997
• SYSTOLIC ALGORITHMS FOR THE SOLUTION OF TOEPLITZ MATRICES
• A new algorithm for the symmetric solution of the matrix equations AXB=E and CXD=F
• An iterative algorithm for \(M\) symmetric solutions of the matrix equation \(AXB+CYD=E\)

Cited in

(9)

• Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
• A note about the solution of matrix Sylvester equation
• A systolic algorithm for Riccati and Lyapunov equations
• Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
• A cubic time algorithm for finding the principal solution to Sylvester matrix equations over (max, +)
• scientific article; zbMATH DE number 2080152 (Why is no real title available?)
• A Hessenberg method for the numerical solutions to types of block Sylvester matrix equations
• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Algorithm 904: The SCASY library, parallel solvers for Sylvester-type matrix equations with applications in condition estimation. II

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885103)