Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14676
For citation please use:
Main Title: A robust iterative scheme for symmetric indefinite systems
Author(s): Manguğlu, Murat
Mehrmann, Volker
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15903
http://dx.doi.org/10.14279/depositonce-14676
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We propose a two-level nested preconditioned iterative scheme for solving sparse linear systems of equations in which the coefficient matrix is symmetric and indefinite with relatively small number of negative eigenvalues. The proposed scheme consists of an outer Minimum Residual (MINRES) iteration, preconditioned by an inner Conjugate Gradient (CG) iteration in which CG can be further preconditioned. The robustness of the proposed scheme is illustrated by solving indefinite linear systems that arise in the solution of quadratic eigenvalue problems in the context of model reduction methods for finite element models of disk brakes as well as on other problems that arise in a variety of applications.
Subject(s): symmetric indefinite systems
Krylov subspace method
sparse linear systems
deflation
preconditioned minimum residual method
preconditioned conjugate gradient method
Issue Date: 27-Sep-2018
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 65F10 Iterative methods for linear systems
65F15 Eigenvalues, eigenvectors
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2018, 08
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
ManM18_ppt.pdf
Format: Adobe PDF | Size: 522.02 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.