Sökning: "s-step biconjugate gradient methods"
Hittade 1 uppsats innehållade orden s-step biconjugate gradient methods.
1. A study of the s-step biconjugate gradient method
Kandidat-uppsats, Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/MatematikcentrumSammanfattning : In this thesis we will examine how to solve linear systems using the s-step biconjugate gradient algorithm, which is an iterative method based on the Krylov subspaces. It is useful especially when we have a large and sparse matrix. LÄS MER
Resultatsidor:
1