AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (540.6 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The orthogonal reflection method for the numerical solution of linear systems

Wenyue FengHailong Zhu( )
Institute of Statistics and Applied Mathematics, Anhui University of Finance and Economics, Bengbu, China
Show Author Information

Abstract

This paper extends the convergence analysis of the reflection method from the case of 2 equations to the case of n equations. A novel approach called the orthogonal reflection method is also proposed. The orthogonal reflection method comprises two key steps. First, a Householder transformation is employed to derive an equivalent system of equations with an orthogonal coefficient matrix that maintains the same solution set as the original system. Second, the reflection method is applied to efficiently solve this transformed system. Compared with the reflection method, the orthogonal reflection method significantly enhances the convergence speed, especially when the angles are acute between the hyperplanes represented by the linear system. We also derive the convergence rate for it, demonstrating that the orthogonal reflection method is always convergent for an arbitrary point in R n . The necessity of orthogonalization is presented in the form of a theorem in R 2 . When the coefficient matrix has a large condition number, the orthogonal reflection method can still compute relatively accurate numerical solutions rapidly. By comparing with algorithms including Jacobi iteration, Gauss-Seidel iteration, the conjugate gradient method, GMRES, weighted RBAS, and the reflection method on coefficient matrices of 10×10 random matrices, 1000×1000 sparse matrices, and 1000×1000 randomly generated full-rank matrices, the efficiency and robustness of the orthogonal reflection method are demonstrated.

CLC number: 65F10

References

【1】
【1】
 
 
AIMS Mathematics
Pages 12888-12899

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Feng W, Zhu H. The orthogonal reflection method for the numerical solution of linear systems. AIMS Mathematics, 2025, 10(6): 12888-12899. https://doi.org/10.3934/math.2025579

687

Views

19

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 17 March 2025
Revised: 20 May 2025
Accepted: 23 May 2025
Published: 04 June 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)