SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix

DOI10.1007/s10092-006-0112-xzbMath1162.65326OpenAlexW2008213682MaRDI QIDQ879742

Khakim D. Ikramov, Heike Fassbender

Publication date: 9 May 2007

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-006-0112-x

zbMATH Keywords

GMRES algorithmGeneralized Krylov sequenceNormal matrixRayleigh-Ritz projectionSYMMLQ algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Unnamed Item
• Unnamed Item
• On a condensed form for normal matrices under finite sequences of elementary unitary similarities
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Exclusion and Inclusion Regions for the Eigenvalues of a Normal Matrix
• A Hermitian Lanczos Method for Normal Matrices
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Orthogonal polyanalytic polynomials and normal matrices
• A fast minimal residual algorithm for shifted unitary matrices
• Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions

This page was built for publication: SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix