From 6ad2f2d7582d892a32f6b60c8639e8421907c924 Mon Sep 17 00:00:00 2001
From: Ruizhi Yu <rz.yu@foxmail.com>
Date: Wed, 7 Aug 2024 16:24:11 +0800
Subject: [PATCH] Update sicnm.py

---
 Solverz/solvers/nlaesolver/sicnm.py | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Solverz/solvers/nlaesolver/sicnm.py b/Solverz/solvers/nlaesolver/sicnm.py
index 9686bdf..30dfec3 100644
--- a/Solverz/solvers/nlaesolver/sicnm.py
+++ b/Solverz/solvers/nlaesolver/sicnm.py
@@ -30,8 +30,6 @@ def sicnm(ae: nAE,
                 0&=J(y)z+g(y)
             \end{aligned}
 
-
-
     with $y_0$ being the initial value guess and $z_0=-J(y_0)^{-1}g(y_0)$, where $z$ is an intermediate variable introduced. Then the DAEs are solved by Rodas. SICNM is found to be more robust than the Newton's method, for which the theoretical proof can be found in my paper [1]_. In addition, the non-iterative nature of Rodas guarantees the efficiency.
 
     One can change the rodas scheme according to the ones implemented in the DAE version of Rodas.