Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators (Q3988977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 33644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators |
scientific article; zbMATH DE number 33644 |
Statements
Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators (English)
0 references
28 June 1992
0 references
parallel algorithms
0 references
condition number estimation
0 references
shared memory algorithms
0 references
quasi-triangular Sylvester equations
0 references
performance
0 references
0.8055748343467712
0 references
0.785854697227478
0 references
0.7681642770767212
0 references
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.
0 references