Related papers: QQMR: A Structure-Preserving Quaternion Quasi-Mini…
In this paper, we consider the non-Hermitian quaternion linear systems arising from color image restoration and three-dimensional signal filtering problems. For exploring to solve such systems, we present two innovative structure-preserving…
We consider the solution of complex symmetric shifted linear systems. Such systems arise in large-scale electronic structure simulations and there is a strong need for the fast solution of the systems. With the aim of solving the systems…
The main goal of this paper is to propose a new quaternion total variation regularization model for solving linear ill-posed quaternion inverse problems, which arise from three-dimensional signal filtering or color image processing. The…
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…
We introduce two iterative methods, GPBiLQ and GPQMR, for solving unsymmetric partitioned linear systems. The basic mechanism underlying GPBiLQ and GPQMR is a novel simultaneous tridiagonalization via biorthogonality that allows for…
We introduce an iterative method named BiLQ for solving general square linear systems Ax = b based on the Lanczos biorthogonalization process defined by least-norm subproblems, and that is a natural companion to BiCG and QMR. Whereas the…
One of the tasks in color image processing and computer vision is to recover clean data from partial observations corrupted by noise. To this end, robust quaternion matrix completion (QMC) has recently attracted more attention and shown its…
In recent years, quaternion matrix completion (QMC) based on low-rank regularization has been gradually used in image de-noising and de-blurring.Unlike low-rank matrix completion (LRMC) which handles RGB images by recovering each color…
This study is mainly focused on iterative solutions to shifted linear systems arising from a Quantum Chromodynamics (QCD) problem. To solve such system efficiently, we explore a kind of shifted QMRCGstab (SQMRCGstab) methods, which is…
Science and engineering problems frequently require solving a sequence of dual linear systems. Besides having to store only few Lanczos vectors, using the BiConjugate Gradient method (BiCG) to solve dual linear systems has advantages for…
Residual smoothing techniques, which produce a smooth convergence behavior of linear iterative solvers, also form connections between different methods. For example, minimal residual smoothing can transform the residuals of the conjugate…
Estimation of actual errors from the residue in iterative solutions is necessary for efficient solution of large problems when their condition number is much larger than one. Such estimators for conjugate gradient algorithms used to solve…
The computational effort in the calculation of Wilson fermion quark propagators in Lattice Quantum Chromodynamics can be considerably reduced by exploiting the Wilson fermion matrix structure in inversion algorithms based on the…
This study investigates the theoretical and computational aspects of quaternion generalized inverses, focusing on outer inverses and {1,2}-inverses with prescribed range and/or null space constraints. In view of the non-commutative nature…
While there is no lack of efficient Krylov subspace solvers for Hermitian systems, there are few for complex symmetric, skew symmetric, or skew Hermitian systems, which are increasingly important in modern applications including quantum…
For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit…
Block and global Krylov subspace methods have been proposed as methods adapted to the situation where one iteratively solves systems with the same matrix and several right hand sides. These methods are advantageous, since they allow to cast…
A novel framework for a unifying treatment of quaternion valued adaptive filtering algorithms is introduced. This is achieved based on a rigorous account of quaternion differentiability, the proposed I-gradient, and the use of augmented…
Inspired by the fact that the matrix formulated by nonlocal similar patches in a natural image is of low rank, the rank approximation issue have been extensively investigated over the past decades, among which weighted nuclear norm…
This work discusses the Improved Matrix Method and Weighted Residual Method for studying the quasinormal modes (QNMs) of black holes. In the first method, by utilizing Jordan decomposition, the improved matrix method avoids the calculation…