Galerkin and Petrov-Galerkin methods for linear matrix equations inherit the optimality properties known for linear systems, with new error bounds and a structure-preserving constraint.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations
Galerkin and Petrov-Galerkin methods for linear matrix equations inherit the optimality properties known for linear systems, with new error bounds and a structure-preserving constraint.