On normwise structured backward errors for the generalized saddle point systems (Q2359409)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On normwise structured backward errors for the generalized saddle point systems |
scientific article; zbMATH DE number 6736565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On normwise structured backward errors for the generalized saddle point systems |
scientific article; zbMATH DE number 6736565 |
Statements
On normwise structured backward errors for the generalized saddle point systems (English)
0 references
28 June 2017
0 references
The author considers the problem of solving generalized saddle point systems. These are systems of linear equations whose coefficient matrix is in the form of a \(2 \times 2\) block matrix whose principal blocks are square and whose off-diagonal blocks are transposes of each other. When the trailing subblock is zero this is a saddle point system. If, in addition, the leading subblock is symmetric, one obtains what is often referred to as a Karush-Kuhn-Tucker system. The author obtains explicit and computable formula for the structured backward errors of the generalized saddle point system. Using numerical examples, it is shown that these expressions are handy in testing the stability of practical algorithms.
0 references
generalized saddle point systems
0 references
strong stability
0 references
structured backward error
0 references
Karush-Kuhn-Tucker system
0 references
numerical examples
0 references
0 references
0 references
0.9123680591583252
0 references
0.9090850949287416
0 references
0.9066900610923768
0 references
0.8993475437164307
0 references
0.8796694278717041
0 references