New search direction of steepest descent method for solving large linear systems

Joint Authors

Ali, Iyad Ramadan
Fathi, Bayda Ghanim

Source

General Letters in Mathematics

Issue

Vol. 12, Issue 2 (30 Jun. 2022), pp.57-63, 7 p.

Publisher

Refaad Center for Studies and Research

Publication Date

2022-06-30

Country of Publication

Jordan

No. of Pages

7

Main Subjects

Mathematics

Abstract EN

The steepest descent (SD) method is well-known as the simplest method in optimization.

In this paper, we propose a new SD search direction for solving system of linear equations Ax = b.

We also prove that the proposed SD method with exact line search satisfies descent condition and possesses global convergence properties.

This proposed method is motivated by previous work on the SD method by Zubai’ah-Mustafa-Rivaie-Ismail (ZMRI)[2].

Numerical comparisons with a classical SD algorithm and ZMRI algorithm show that this algorithm is very effective depending on the number of iterations (NOI) and CPU time.

American Psychological Association (APA)

Ali, Iyad Ramadan& Fathi, Bayda Ghanim. 2022. New search direction of steepest descent method for solving large linear systems. General Letters in Mathematics،Vol. 12, no. 2, pp.57-63.
https://search.emarefa.net/detail/BIM-1437678

Modern Language Association (MLA)

Ali, Iyad Ramadan& Fathi, Bayda Ghanim. New search direction of steepest descent method for solving large linear systems. General Letters in Mathematics Vol. 12, no. 2 (2022), pp.57-63.
https://search.emarefa.net/detail/BIM-1437678

American Medical Association (AMA)

Ali, Iyad Ramadan& Fathi, Bayda Ghanim. New search direction of steepest descent method for solving large linear systems. General Letters in Mathematics. 2022. Vol. 12, no. 2, pp.57-63.
https://search.emarefa.net/detail/BIM-1437678

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references : p. 63

Record ID

BIM-1437678