Accelerating the convergence of Newton's method for the Yang-Baxter like matrix equation

This article explores the application of exact line search and successive over-relaxation techniques to enhance the convergence of Newton method in solving the Yang-Baxter matrix equation for nontrivial numerical solutions. Moreover, the normwise, mixed, and componentwise condition numbers are derived to assess the sensitivity of solutions. Numerical experiments demonstrate that the exact line search method significantly improves convergence speed, particularly for larger matrices, by reducing both the number of iterations and residuals more effectively than the successive over-relaxation technique. Furthermore, the mixed and componentwise condition numbers consistently yield values close to one, indicating that the Yang-Baxter equation is well-conditioned. In contrast, the relatively high normwise condition numbers suggest an increased sensitivity to perturbations.

Authors

Publication Details

Journal
Heliyon
Published
2025-02-01
DOI
https://doi.org/10.1016/j.heliyon.2025.e42425
Citations
4
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
6.02
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating the convergence of Newton's method for the Yang-Baxter like matrix equation

Chacha Stephen Chacha
4 citations
Heliyon
Matrix Theory and Algorithms
6.02
article

Accelerating the convergence of Newton's method for the Yang-Baxter like matrix equation

Chacha Stephen Chacha
article en
4 citations

Abstract

This article explores the application of exact line search and successive over-relaxation techniques to enhance the convergence of Newton method in solving the Yang-Baxter matrix equation for nontrivial numerical solutions. Moreover, the normwise, mixed, and componentwise condition numbers are derived to assess the sensitivity of solutions. Numerical experiments demonstrate that the exact line search method significantly improves convergence speed, particularly for larger matrices, by reducing both the number of iterations and residuals more effectively than the successive over-relaxation technique. Furthermore, the mixed and componentwise condition numbers consistently yield values close to one, indicating that the Yang-Baxter equation is well-conditioned. In contrast, the relatively high normwise condition numbers suggest an increased sensitivity to perturbations.

HeliyonVol. 11(3)
Openalex Percentile: Top 4%
Matrix Theory and Algorithms
6.02
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.