From 57ca6ad322411214ea5f4b9d5c366c41d5891ea8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Nicol=C3=A1s=20Barnafi?= <nabw91@gmail.com>
Date: Tue, 25 Jun 2024 00:17:48 -0400
Subject: [PATCH] .

---
 src/QRupdate.jl | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/QRupdate.jl b/src/QRupdate.jl
index 27b81e8..d0e627c 100644
--- a/src/QRupdate.jl
+++ b/src/QRupdate.jl
@@ -231,7 +231,7 @@ vector.
 function qraddrow(R::AbstractMatrix{T}, a::AbstractMatrix{T}) where {T}
 
     n = size(R,1)
-    @inbounds @simd for k in 1:n
+    @inbounds for k in 1:n
         G, r = givens( R[k,k], a[k], 1, 2 )
         B = G * [ reshape(R[k,k:n], 1, n-k+1)
                   reshape(a[:,k:n], 1, n-k+1) ]
@@ -271,7 +271,7 @@ function qrdelcol(R::AbstractMatrix{T}, k::Int) where {T}
         G, y = givens(R[j+1,j], R[k,j], 1, 2)
         R[j+1,j] = y
         if j<n && G.s != 0
-            @inbounds @simd for i in j+1:n
+            @inbounds for i in j+1:n
                 tmp = G.c*R[j+1,i] + G.s*R[k,i]
                 R[k,i] = G.c*R[k,i] - conj(G.s)*R[j+1,i]
                 R[j+1,i] = tmp
@@ -303,13 +303,13 @@ function qrdelcol!(A::AbstractMatrix{T},R::AbstractMatrix{T}, k::Int) where {T}
 
 
     for j in k:(n-1)                # Forward sweep to reduce k-th row to zeros
-        G, y = givens(R[j+1,j], R[k,j], 1, 2)
-        R[j+1,j] = y
+        @inbounds G, y = givens(R[j+1,j], R[k,j], 1, 2)
+        @inbounds R[j+1,j] = y
         if j<n && G.s != 0
             for i in j+1:n
-                tmp = G.c*R[j+1,i] + G.s*R[k,i]
-                R[k,i] = G.c*R[k,i] - conj(G.s)*R[j+1,i]
-                R[j+1,i] = tmp
+                @inbounds tmp = G.c*R[j+1,i] + G.s*R[k,i]
+                @inbounds R[k,i] = G.c*R[k,i] - conj(G.s)*R[j+1,i]
+                @inbounds R[j+1,i] = tmp
             end
         end
     end
@@ -319,7 +319,7 @@ function qrdelcol!(A::AbstractMatrix{T},R::AbstractMatrix{T}, k::Int) where {T}
         for i in k:j
             @inbounds R[i,j] = R[i+1, j]
         end
-        R[j+1,j] = 0
+        @inbounds R[j+1,j] = 0
     end
 end