Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems
type: Item
instance of: scholarly article
title: Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems
zbMATH Open document ID: 1473.65041
DOI: 10.1155/2014/237808
author: Yu-Chien Li
author: Jen-Yuan Chen
author: David R. Kincaid
published in: Abstract and Applied Analysis
publication date: 2019-02-14T00:00:00Z
review text: Summary: We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sparse symmetric indefinite linear systems. We describe the SYMMLQ and SYMMQR methods, as well as generalizations and modifications of them. Then, we cover the Lanczos/MSYMMLQ and Lanczos/MSYMMQR methods, which arise from a double linear system. We present pseudocodes for these algorithms.
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 7021972
zbMATH Keywords: sparse symmetric indefinite linear systems
zbMATH Keywords: iterative methods
Wikidata QID: Q59036563
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/237808
OpenAlex ID: W2076437358
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Q5689624
cites work: Parallel iterative methods for sparse linear systems
cites work: An overview of MGMRES and LAN/MGMRES methods for solving nonsymmetric linear systems
description: scientific article; zbMATH DE number 7021972