Efficient tensor-based approach to solving linear systems involving Kronecker sum of matrices
Ahmad Y. Al-Dweik, Abdallah Sayyed-Ahmad
TL;DR
The paper develops a tensor-based direct solver for linear systems formed by Kronecker sums, establishing a link to Sylvester and Sylvester tensor equations. By leveraging eigendecompositions or Schur factorizations, the authors derive a compact formula that computes the solution as a tensor transform of the right-hand side, scaled by an explicit inverse weight tensor C. They provide explicit solutions for 2D and 3D discrete Poisson problems and a 2D convection–diffusion system, including detailed complexity analyses and numerical experiments demonstrating superior scalability over traditional methods. The approach offers a principled, high-dimensional solver with guaranteed uniqueness under spectral-sum conditions and broad applicability to Dirichlet-posed Poisson-like problems.
Abstract
A novel tensor-based formula for solving the linear systems involving Kronecker sum is proposed. Such systems are directly related to the matrix and tensor forms of Sylvester equation. The new tensor-based formula demonstrates the well-known fact that a Sylvester tensor equation has a unique solution if the sum of spectra of the matrices does not contain zero. We have showcased the effectiveness of the method by efficiently solving the 2D and 3D discretized Poisson equations, as well as the 2D steady-state convection-diffusion equation, on a rectangular domain with Dirichlet boundary conditions. The results suggest that this approach is well-suited for high-dimensional problems.
