Algorithm 432
Algorithm 432: Solution of the matrix equation AX + XB = C [F4]. The following programs are a collection of Fortran IV subroutines to solve the matrix equation AX+XB=C(1) where A, B, and C are real matrices of dimensions m×m, n×n, and m×n, respectively. Additional subroutines permit the efficient solution of the equation A T X+XA=C, where C is symmetric. Equation (1) has applications to the direct solution of discrete Poisson equations [W. G. Bickley and J. McNamee, Philos. Trans. R. Soc. Lond., Ser. A 252, 69–131 (1960; Zbl 0092.13001)].
Keywords for this software
References in zbMATH (referenced in 236 articles , 1 standard article )
Showing results 1 to 20 of 236.
Sorted by year (- Bini, Dario A.; Meini, Beatrice; Meng, Jie: Solving quadratic matrix equations arising in random walks in the quarter plane (2020)
- Chan, N. H.; Cheung, Simon K. C.; Wong, Samuel P. S.: Inference for the degree distributions of preferential attachment networks with zero-degree nodes (2020)
- Chen, Minhong; Kressner, Daniel: Recursive blocked algorithms for linear systems with Kronecker product structure (2020)
- Devi, Vinita; Maurya, Rahul Kumar; Singh, Somveer; Singh, Vineet Kumar: Lagrange’s operational approach for the approximate solution of two-dimensional hyperbolic telegraph equation subject to Dirichlet boundary conditions (2020)
- Hached, M.; Jbilou, K.: Numerical methods for differential linear matrix equations via Krylov subspace methods (2020)
- Dehghan, Mehdi; Shirilord, Akbar: The double-step scale splitting method for solving complex Sylvester matrix equation (2019)
- Dehghan, Mehdi; Shirilord, Akbar: A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation (2019)
- Hossain, M. Sumon; Uddin, M. Monir: Iterative methods for solving large sparse Lyapunov equations and application to model reduction of index 1 differential-algebraic-equations (2019)
- Jarlebring, Elias; Poloni, Federico: Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning (2019)
- Kressner, Daniel: A Krylov subspace method for the approximation of bivariate matrix functions (2019)
- Kressner, Daniel; Massei, Stefano; Robol, Leonardo: Low-rank updates and a divide-and-conquer method for linear matrix equations (2019)
- Zadeh, Najmeh Azizi; Tajaddini, Azita; Wu, Gang: Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations (2019)
- Abidi, O.; Jbilou, K.: Balanced truncation-rational Krylov methods for model reduction in large scale dynamical systems (2018)
- Addam, Mohamed; Elbouyahyaoui, Lakhdar; Heyouni, Mohammed: On Hessenberg type methods for low-rank Lyapunov matrix equations (2018)
- Benner, Peter; Goyal, Pawan; Gugercin, Serkan: (\mathcalH_2)-quasi-optimal model order reduction for quadratic-bilinear control systems (2018)
- Cheng, Xiaodong; Scherpen, Jacquelien M. A.: Clustering approach to model order reduction of power networks with distributed controllers (2018)
- Fasi, Massimiliano; Higham, Nicholas J.: Multiprecision algorithms for computing the matrix logarithm (2018)
- Hached, M.; Jbilou, K.: Numerical solutions to large-scale differential Lyapunov matrix equations (2018)
- He, Qixiang; Hou, Liangshao; Zhou, Jieyong: The solution of fuzzy Sylvester matrix equation (2018)
- Hernández-Verón, M. A.; Romero, Natalia: Solving symmetric algebraic Riccati equations with high order iterative schemes (2018)