Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with \operatorname{sep}^{ - 1} Estimators

From MaRDI portal
Publication:3988977





Coarse grain message passing and shared memory algorithms for solving quasi-triangular Sylvester equations are discussed. The emphasis is on computing reliable estimates of the \(sep^{-1}\) function. Estimates based on the Frobenius norm and the \(\ell\)-norm are presented. Accuracy, efficiency and reliability results are also given. The applicability of the estimators to both the shared memory and distributed memory paradigms are described. Some performance results are given to show the overall reliability of both estimators and to show that the Frobenius-norm based estimator is to be preferred since it has a much better efficiency both in sequential and parallel settings.











This page was built for publication: Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988977)