Fix resize issue

Author: ErikQQY

lib/BoundaryValueDiffEqFIRK/src/firk.jl

@@ -444,19 +444,19 @@ function __expand_cache!(cache::FIRKCacheExpand)
     Nₙ = length(cache.mesh)
     __resize!(cache.k_discrete, Nₙ - 1, cache.M, cache.TU)
     __resize!(cache.y, Nₙ, cache.M, cache.TU)
-    __resize!(cache.y₀, Nₙ, cache.M, cache.TU)
+    __resize!(cache.y₀.u, Nₙ, cache.M, cache.TU)
     __resize!(cache.residual, Nₙ, cache.M, cache.TU)
-    __resize!(cache.defect, Nₙ - 1, cache.M)
+    __resize!(cache.defect.u, Nₙ - 1, cache.M)
     return cache
 end
 
 function __expand_cache!(cache::FIRKCacheNested)
     Nₙ = length(cache.mesh)
     __resize!(cache.k_discrete, Nₙ - 1, cache.M)
     __resize!(cache.y, Nₙ, cache.M)
-    __resize!(cache.y₀, Nₙ, cache.M)
+    __resize!(cache.y₀.u, Nₙ, cache.M)
     __resize!(cache.residual, Nₙ, cache.M)
-    __resize!(cache.defect, Nₙ - 1, cache.M)
+    __resize!(cache.defect.u, Nₙ - 1, cache.M)
     return cache
 end
 
@@ -579,7 +579,7 @@ function __perform_firk_iteration(cache::Union{FIRKCacheExpand, FIRKCacheNested}
             # We construct a new mesh to equidistribute the defect
             mesh, mesh_dt, _, info = mesh_selector!(cache)
             if info == ReturnCode.Success
-                __resize!(cache.y₀, length(cache.mesh), cache.M, cache.TU)
+                __resize!(cache.y₀.u, length(cache.mesh), cache.M, cache.TU)
                 for (i, m) in enumerate(cache.mesh)
                     interp_eval!(cache.y₀.u[i], cache, m, mesh, mesh_dt)
                 end

lib/BoundaryValueDiffEqFIRK/src/utils.jl

@@ -1,4 +1,4 @@
-function BoundaryValueDiffEqCore.__resize!(x::AbstractVector{<:AbstractArray}, n, _, TU::FIRKTableau{false})
+function BoundaryValueDiffEqCore.__resize!(x::AbstractVector{<:AbstractArray}, n, _, TU) #::FIRKTableau{false}) # TODO: remove the TU argument and just use s = length(TU.c)
     (; s) = TU
     N = (n - 1) * (s + 1) + 1 - length(x)
     N == 0 && return x

lib/BoundaryValueDiffEqMIRK/src/mirk.jl

@@ -249,12 +249,12 @@ match the length of the new mesh.
 function __expand_cache!(cache::MIRKCache{iip, T, use_both}) where {iip, T, use_both}
     Nₙ = length(cache.mesh)
     __resize!(cache.k_discrete, Nₙ - 1, cache.M)
-    __resize!(cache.k_interp, Nₙ - 1, cache.M)
+    __resize!(cache.k_interp.u, Nₙ - 1, cache.M)
     __resize!(cache.y, Nₙ, cache.M)
-    __resize!(cache.y₀, Nₙ, cache.M)
-    __resize!(cache.residual, Nₙ, cache.M)
-    __resize!(cache.errors, ifelse(use_both, 2 * (Nₙ - 1), (Nₙ - 1)), cache.M)
-    __resize!(cache.new_stages, Nₙ - 1, cache.M)
+    __resize!(cache.y₀.u, Nₙ, cache.M)
+    __resize!(cache.residual.u, Nₙ, cache.M)
+    __resize!(cache.errors.u, ifelse(use_both, 2 * (Nₙ - 1), (Nₙ - 1)), cache.M)
+    __resize!(cache.new_stages.u, Nₙ - 1, cache.M)
     return cache
 end
 
@@ -336,7 +336,7 @@ function __perform_mirk_iteration(cache::MIRKCache, abstol, adaptive::Bool, cont
             mesh, mesh_dt, _, info = mesh_selector!(cache, controller)
             if info == ReturnCode.Success
                 (length(mesh) < length(cache.mesh)) &&
-                    __resize!(cache.y₀, length(cache.mesh), cache.M)
+                    __resize!(cache.y₀.u, length(cache.mesh), cache.M)
                 for (i, m) in enumerate(cache.mesh)
                     interp_eval!(cache.y₀.u[i], cache, m, mesh, mesh_dt)
                 end