11-12-2014 v00

[Krylov_multi.git] / review.txt

diff --git a/review.txt b/review.txt
index 493eb9538fa806e9f18e4b423361b8d874fa4ce6..0c4d434a69b6e3dc20ddab78b2cf38885871a4ef 100644 (file)
--- a/review.txt
+++ b/review.txt
@@ -101,11 +101,15 @@ Reviewer #6: In this paper it says that the Krylov GMRES method is compared with
 ,----
 It is unclear from the paper whether the analysis includes the a comparison of their new method to the method of reference [9]. Does the new method do better than that one or is it similar or worse. 
 `----
 ,----
 It is unclear from the paper whether the analysis includes the a comparison of their new method to the method of reference [9]. Does the new method do better than that one or is it similar or worse. 
 `----

+The experiments in Section 4 show a comparison between the performances of our Krylov multisplitting algorithm and those of GMRES method. As said previously, we consider that GMRES is one of the most used method to solve large-scale sparse linear systems. The method of reference [9] is semi-parallel. In fact the task of the minimization is decoupled from the resolution of the different splittings, such as we could fall on a situation where the minimization cannot be performed until all splittings are solved. In addition, the minimization task of reference [9] is performed in sequential.   
+

 
 ,----
 The paper should be rewritten to clearly explain what is being compared. It seems as if the method in [9] is not included in the comparison. 
 `----
 
 
 ,----
 The paper should be rewritten to clearly explain what is being compared. It seems as if the method in [9] is not included in the comparison. 
 `----
 

+

 ,----
 Was the method of reference [9] implemented by the authors of [9]? How did they do against GMRES?
 `----
 ,----
 Was the method of reference [9] implemented by the authors of [9]? How did they do against GMRES?
 `----

+Authors of [9] have not implemented the method of reference [9]. They have mainly focused on the convergence analysis of various forms of the algorithm [9] and presented results of numerical examples on a sequential computer.