Nonrecursive Equivalent of the Conjugate Gradient Method without the Need to Restart (CROSBI ID 263560)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Dvornik, Josip ; Lazarević, Damir ; Jaguljnjak Lazarević, Antonia ; Demšić, Marija
engleski
Nonrecursive Equivalent of the Conjugate Gradient Method without the Need to Restart
A simple alternative to the conjugate gradient (CG) method is presented ; this method is developed as a special case of the more general iterated Ritz method (IRM) for solving a system of linear equations. This novel algorithm is not based on conjugacy ; i.e., it is not necessary to maintain overall orthogonalities between various vectors from distant steps. This method is more stable than CG, and restarting techniques are not required. As in CG, only one matrix-vector multiplication is required per step with appropriate transformations. The algorithm is easily explained by energy considerations without appealing to the A-orthogonality in n-dimensional space. Finally, relaxation factor and preconditioning-like techniques can be adopted easily.
Iterated Ritz method ; Conjugate gradient method ; conjugacy ; restart ; preconditioning
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
2019
2019.
7527590
5
objavljeno
1687-8086
1687-8094
10.1155/2019/7527590
Trošak objave rada u otvorenom pristupu
Povezanost rada
Građevinarstvo, Računarstvo, Temeljne tehničke znanosti