A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices

DOI10.1134/s0965542506120037OpenAlexW2009517582MaRDI QIDQ6200638

Khakim D. Ikramov, Mansour Dana

Publication date: 1 March 2024

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/zvmmf361

zbMATH Keywords

Krylov subspace methodsnormal matricesunitary matricesminimal residual methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• 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
• A fast minimal residual algorithm for shifted unitary matrices
• Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions

This page was built for publication: A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices