Abstract
This paper illustrates comparison of two methods, which are used for solving systems of linear equations. The aim of the research is to analyze, which method is faster solve this equations and how many iteration required each method for solving. This paper presents some ways to deal with this problem. Also there are analyzed two methods. The first of them minimizes the standard deviation of the next iteration of the solution, the other constructs orthogonal vectors and is theoretically finite method.
| Original language | English |
|---|---|
| Pages (from-to) | 1-4 |
| Number of pages | 4 |
| Journal | CEUR Workshop Proceedings |
| Volume | 1853 |
| Publication status | Published - 2017 |
| Event | 2017 Symposium for Young Scientists in Technology, Engineering and Mathematics, SYSTEM 2017 - Kaunas, Lithuania Duration: 28 Apr 2017 → … |
Keywords
- Analysis
- Comparison
- Conjugate gradient method
- Steepest descent method
ASJC Scopus subject areas
- General Computer Science
Fingerprint
Dive into the research topics of 'Comparison of steepest descent method and conjugate gradient method'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver