A new modified conjugate gradient coefficient for solving system of linear equations

Bibliographic Details
Format: Restricted Document
_version_ 1860799654792265728
building INTELEK Repository
collection Online Access
collectionurl https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
date 2017-10-17 12:10:04
eventvenue Vistana City Centre Kuantan, Pahang
format Restricted Document
id 6869
institution UniSZA
originalfilename 1492-01-FH03-FIK-17-10483.jpg
person norman
recordtype oai_dc
resourceurl https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6869
spelling 6869 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6869 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 765 1434 2017-10-17 12:10:04 1434x765 47 47 1492-01-FH03-FIK-17-10483.jpg UniSZA Private Access A new modified conjugate gradient coefficient for solving system of linear equations Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations 1st International Conference on Applied and Industrial Mathematics and Statistics 2017, ICoAIMS 2017 Vistana City Centre Kuantan, Pahang
spellingShingle A new modified conjugate gradient coefficient for solving system of linear equations
summary Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations
title A new modified conjugate gradient coefficient for solving system of linear equations
title_full A new modified conjugate gradient coefficient for solving system of linear equations
title_fullStr A new modified conjugate gradient coefficient for solving system of linear equations
title_full_unstemmed A new modified conjugate gradient coefficient for solving system of linear equations
title_short A new modified conjugate gradient coefficient for solving system of linear equations
title_sort new modified conjugate gradient coefficient for solving system of linear equations