Abstrakt
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.
| Język oryginału | angielski |
|---|---|
| Strony (od–do) | 1-4 |
| Liczba stron | 4 |
| Czasopismo | CEUR Workshop Proceedings |
| Tom | 1853 |
| Status publikacji | Opublikowano - 2017 |
| Wydarzenie | 2017 Symposium for Young Scientists in Technology, Engineering and Mathematics, SYSTEM 2017 - Kaunas, Litwa Czas trwania: 28 kwi 2017 → … |
Obszary tematyczne ASJC Scopus
- Informatyka ogólna
Fingerprint
Zanurz się w tematy badawcze publikacji „Comparison of steepest descent method and conjugate gradient method”. Razem tworzą niepowtarzalny odcisk palca.Cytowanie
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver