Please use this identifier to cite or link to this item: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/27899
Title: COMPARISON OF REFINEMENT ACCELERATED RELAXATION ITERATIVE TECHNIQUES AND CONJUGATE GRADIENT TECHNIQUE FOR LINEAR SYSTEMS
Authors: Audu, Khadeejah James
Keywords: linear systems, Accelerated Relaxation technique, Refinement techniques,
conjugate gradient, convergence
Issue Date: 5-Sep-2022
Series/Report no.: Volume 58;page 145-152
Abstract: Iterative methods use consecutive approximations to get more accurate results. A comparison of three iterative approaches to solving linear systems of this type 𝑀𝑦=𝐵 is provided in this paper. We surveyed the Refinement Accelerated Relaxation technique, Refinement Extended Accelerated Relaxation technique, and Conjugate Gradient technique, and demonstrated algorithms for each of these approaches in order to get to the solutions more quickly. The algorithms are then transformed into the Python language and used as iterative methods to solve these linear systems. Some numerical investigations were carried out to examine and compare their convergence speeds. Based on performance metrics such as convergence time, number of iterations required to converge, storage, and accuracy, the research demonstrates that the conjugate gradient method is superior to other approaches, and it is important to highlight that the conjugate gradient technique is not stationary. These methods can help in situations that are similar to finite differences, finite element methods for solving partial differential equations, circuit and structural analysis. Based on the results of this study, iteration techniques will be used to help analysts understand systems of linear algebraic equations.
Description: A Conference Proceeding Paper
URI: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/27899
Appears in Collections:Mathematics

Files in This Item:
File Description SizeFormat 
MAN 2022 Proceding Personal Copy.pdf1.69 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.