Gl‐QFOM and Gl‐QGMRES: Two Efficient Algorithms for Quaternion Linear Systems With Multiple Right‐Hand Sides

ABSTRACT In this paper, we propose the global quaternion full orthogonalization (Gl‐QFOM) and global quaternion generalized minimum residual (Gl‐QGMRES) methods, which are built upon global orthogonal and oblique projections onto a quaternion matrix Krylov subspace for solving quaternion linear systems with multiple right‐hand sides. We first develop the global quaternion Arnoldi procedure to preserve the quaternion Hessenberg form during the iterations. We then establish the convergence analysis of the proposed methods and show how to apply them to solve the Sylvester quaternion matrix equation. Numerical examples are provided to illustrate the effectiveness of our methods compared with the traditional Gl‐FOM and Gl‐GMRES iterations for the real representations of the original linear systems.

Authors

Institutions

Publication Details

Journal
Numerical Linear Algebra with Applications
Published
2025-02-01
DOI
https://doi.org/10.1002/nla.70008
Citations
5
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
7.52

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Gl‐QFOM and Gl‐QGMRES: Two Efficient Algorithms for Quaternion Linear Systems With Multiple Right‐Hand Sides

Tao Li, Xin‐Fang Zhang, Qing‐Wen Wang
5 citations
Numerical Linear Algebra with Applications
Matrix Theory and Algorithms
7.52
article

Gl‐QFOM and Gl‐QGMRES: Two Efficient Algorithms for Quaternion Linear Systems With Multiple Right‐Hand Sides

Tao Li, Xin‐Fang Zhang, Qing‐Wen Wang
article en
5 citations

Abstract

ABSTRACT In this paper, we propose the global quaternion full orthogonalization (Gl‐QFOM) and global quaternion generalized minimum residual (Gl‐QGMRES) methods, which are built upon global orthogonal and oblique projections onto a quaternion matrix Krylov subspace for solving quaternion linear systems with multiple right‐hand sides. We first develop the global quaternion Arnoldi procedure to preserve the quaternion Hessenberg form during the iterations. We then establish the convergence analysis of the proposed methods and show how to apply them to solve the Sylvester quaternion matrix equation. Numerical examples are provided to illustrate the effectiveness of our methods compared with the traditional Gl‐FOM and Gl‐GMRES iterations for the real representations of the original linear systems.

Numerical Linear Algebra with ApplicationsVol. 32(1)
Shanghai University (CN), Hainan University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hainan Province, Hainan University
Openalex Percentile: Top 3%
Matrix Theory and Algorithms
7.52
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.