A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers

DOI10.1553/etna_vol54s370zbMath1464.65040arXiv2009.06954OpenAlexW3157477177MaRDI QIDQ2035860

Volker Mehrmann, Murat Manguoglu

Publication date: 25 June 2021

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.06954

zbMATH Keywords

Krylov subspace methodsymmetrizerskew-symmetrizershifted skew-symmetric systemskew-Lanczos method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (1)

Structured shifts for skew-symmetric matrices

Uses Software

• HSL
• PARDISO
• SparseMatrix
• SYM-ILDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
• Linear port-Hamiltonian systems on infinite-dimensional spaces.
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Decomposition of a symmetric matrix
• Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications
• Linear port-Hamiltonian descriptor systems
• A new pivoting strategy for Gaussian elimination
• A parallel multithreaded sparse triangular linear system solver
• Structure preserving approximation of dissipative evolution problems
• A breakdown-free block conjugate gradient method
• Algorithm for solving shifted skew-symmetric linear system
• On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
• Preconditioning Highly Indefinite and Nonsymmetric Matrices
• The university of Florida sparse matrix collection
• SYM-ILDL
• Iterative Solution of Skew-Symmetric Linear Systems
• Recycling Krylov Subspaces for Sequences of Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
• Port-Hamiltonian Differential-Algebraic Systems
• Port-Hamiltonian Systems Theory: An Introductory Overview
• A Robust Iterative Scheme for Symmetric Indefinite Systems
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Absolute Value Preconditioning for Symmetric Indefinite Linear Systems
• Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems

This page was built for publication: A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers