Krylov methods for low-rank commuting generalized Sylvester equations
From MaRDI portal
Publication:3120335
DOI10.1002/nla.2176OpenAlexW2606763702MaRDI QIDQ3120335
Giampaolo Mele, Davide Palitta, Emil Ringh, Elias Jarlebring
Publication date: 1 March 2019
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02167
projection methodsiterative solversmatrix equationKrylov subspacegeneralized Sylvester equationlow-rank commutation
Iterative numerical methods for linear systems (65F10) Applications of variational problems to control theory (58E25) Matrix and operator functional equations (39B42) Chains (nests) of projections or of invariant subspaces, integrals along chains, etc. (47A46)
Related Items
The extended block Arnoldi method for solving generalized differential Sylvester equations, Solving Rank-Structured Sylvester and Lyapunov Equations, Matrix equation solving of PDEs in polygonal domains using conformal mappings, Greedy low-rank algorithm for spatial connectome regression, On the convergence of Krylov methods with low-rank truncations, Residual-based iterations for the generalized Lyapunov equation, Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations, Matrix equation techniques for certain evolutionary partial differential equations, An iterative algorithm for robust simulation of the Sylvester matrix differential equations
