Efficient versions of algorithms biconjugate residual (BCR) methods were obtained which required two matrix-vector multiplication per iteration. All the algorithms were including a way of estimating the condition number of coefficient matrix. The final accuracy was assessed not by the iterative computed residual but by checking the exactly computed residual.
(2001). Implementation of different computational variations of biconjugate residual methods [journal article - articolo]. In COMPUTERS & MATHEMATICS WITH APPLICATIONS. Retrieved from http://hdl.handle.net/10446/138873
Implementation of different computational variations of biconjugate residual methods
Vespucci, M. T.;
2001-01-01
Abstract
Efficient versions of algorithms biconjugate residual (BCR) methods were obtained which required two matrix-vector multiplication per iteration. All the algorithms were including a way of estimating the condition number of coefficient matrix. The final accuracy was assessed not by the iterative computed residual but by checking the exactly computed residual.File allegato/i alla scheda:
Non ci sono file allegati a questa scheda.
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo
