Algorithm 705

swMATH8105MaRDI QIDQ20119FDOQ20119

Author name not available (Why is that?)

Described by source

• Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB ^T + CXD ^T = E

Cited In (13)

• Solution of the Sylvester matrix equation AXB ^T + CXD ^T = E
• The ubiquitous Kronecker product
• Recursive blocked algorithms for solving triangular systems—Part II
• On the numerical solution of large-scale sparse discrete-time Riccati equations
• Title not available (Why is that?)
• Remark on algorithm 705
• Computational Methods for Linear Matrix Equations
• On estimating the separation between \((A, B)\) and \((C, D)\) associated with the generalized Sylvester equation \(A X D - B X C = E\)
• Solving a quadratic matrix equation by newton's method with exact line searches
• Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
• Least-Squares Approximate Solution of Overdetermined Sylvester Equations
• Title not available (Why is that?)
• Numerical solution and perturbation theory for generalized Lyapunov equations

This page was built for software: Algorithm 705