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 252 articles , 1 standard article )
Showing results 1 to 20 of 252.
Sorted by year (- Hernández-Verón, M. A.; Romero, N.: Solving Wiener-Hopf problems via an efficient iterative scheme (2022)
- Liu, Zhongyun; Zhang, Fang; Ferreira, Carla; Zhang, Yulin: On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations (2022)
- Li, Yanpeng; Jiang, Yaolin; Yang, Ping: Model order reduction of port-Hamiltonian systems with inhomogeneous initial conditions via approximate finite-time Gramians (2022)
- Petkov, Petko H.; Konstantinov, Mihail M.: The numerical Jordan form (2022)
- Delkhosh, Mehdi; Parand, Kourosh: A new computational method based on fractional Lagrange functions to solve multi-term fractional differential equations (2021)
- Feng, Yu-Ye; Wu, Qing-Biao; Xie, Zhe-Wei: Lopsided DSS iteration method for solving complex Sylvester matrix equation (2021)
- Langer, Ulrich; Zank, Marco: Efficient direct space-time finite element solvers for parabolic initial-boundary value problems In anisotropic Sobolev spaces (2021)
- Li, Sheng-Kun; Wang, Mao-Xiao; Liu, Gang: A global variant of the COCR method for the complex symmetric Sylvester matrix equation (AX+XB=C) (2021)
- Massei, Stefano; Robol, Leonardo: Rational Krylov for Stieltjes matrix functions: convergence and pole selection (2021)
- Palitta, Davide: Matrix equation techniques for certain evolutionary partial differential equations (2021)
- 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)
- Fasi, Massimiliano; Iannazzo, Bruno: Substitution algorithms for rational matrix equations (2020)
- Hached, M.; Jbilou, K.: Numerical methods for differential linear matrix equations via Krylov subspace methods (2020)
- Kürschner, Patrick; Freitag, Melina A.: Inexact methods for the low rank solution to large scale Lyapunov equations (2020)
- Lui, S. H.; Nataj, Sarah: Chebyshev spectral collocation in space and time for the heat equation (2020)
- Palitta, Davide; Simoncini, Valeria: Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations (2020)
- Sadek, El. Mostafa; Bentbib, Abdeslem Hafid; Sadek, Lakhlifa; Talibi Alaoui, Hamad: Global extended Krylov subspace methods for large-scale differential Sylvester matrix equations (2020)