A novel hybrid conjugate gradient algorithm constructed from multiple methods

Simple item page
dc.contributor.authorGHOUL, Rayan
dc.contributor.authorDEGAICHI, Nouar
dc.date.accessioned2026-10-20T07:46:27Z
dc.date.issued2026-06-02
dc.description.abstractThis work presents a study of the Conjugate Gradient method for solving large, sparse systems of linear equations. The method relies on constructing a sequence of conjugate directions and determining optimal step sizes to efficiently minimize the associated quadratic function. Its main numerical properties, including convergence behavior and computational efficiency, are examined and discussed.
dc.identifier.urihttps://dspace.univ-tebessa.dz/handle/123456789/293
dc.language.isoen
dc.publisherLarbi Tebessi University-Tebessa
dc.subjectConjugate Gradient
dc.subjectsparse systems
dc.subjectlinear equations
dc.subjectconvergence
dc.subjectnumerical meth- ods.
dc.titleA novel hybrid conjugate gradient algorithm constructed from multiple methods
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A novel hybrid conjugate gradient algorithm constructed from multiple methods.pdf
Size:
1.37 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

05- رياضيات