Structured Backward Errors of Sparse Generalized Saddle Point Problems with Hermitian Block Matrices
Preprint
Abstract
In this paper, we derive the structured backward error (BE) for a class of generalized saddle point problems (GSPP) by preserving the sparsity pattern and Hermitian structures of the block matrices. Additionally, we construct the optimal backward perturbation matrices for which the structured BE is achieved. Our analysis also examines the structured BE in cases where the sparsity pattern is not maintained. Through numerical experiments, we demonstrate the reliability of the derived structured BEs and the corresponding optimal backward perturbations. Additionally, the derived structured BEs are used to assess the strong backward stability of numerical methods for solving the GSPP.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- An Uzawa-DOS method for solving saddle-point problemsNumerical Algorithms, 2024
- A generalized variant of modified relaxed positive-semidefinite and skew-Hermitian splitting preconditioner for generalized saddle point problemsComputational and Applied Mathematics, 2022
- Backward error analysis and inverse eigenvalue problems for Hankel and Symmetric-Toeplitz structuresApplied Mathematics and Computation, 2021
- A modified parameterized shift-splitting preconditioner for saddle point problemsComputational and Applied Mathematics, 2021
- Structured backward error analysis for generalized saddle point problemsAdvances in Computational Mathematics, 2020
- On normwise structured backward errors for the generalized saddle point systemsCalcolo, 2016
- Structured backward error analysis for sparse polynomial eigenvalue problemsApplied Mathematics and Computation, 2012
- On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problemsJournal of Computational and Applied Mathematics, 2009
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulationsNumerical Linear Algebra with Applications, 2000
- The weak and strong stability of algorithms in numerical linear algebraLinear Algebra and its Applications, 1987