- Solve linear equation systems optionally with RecursiveFactorization.jl.

- Project.toml: Changed DiffRules from "~1.0" to "1", since issue with "1.2.1" (leading to an error in runtests) seems to be fixed.
- Project.toml: Added version 1 of MonteCarloMeasurements.
- Updated used packages.
- Tutorial slightly improved.

Author: MartinOtter

Manifest.toml

@@ -138,9 +138,9 @@ uuid = "8ba89e20-285c-5b6f-9357-94700520ee1b"
 
 [[Distributions]]
 deps = ["ChainRulesCore", "DensityInterface", "FillArrays", "LinearAlgebra", "PDMats", "Printf", "QuadGK", "Random", "SparseArrays", "SpecialFunctions", "Statistics", "StatsBase", "StatsFuns", "Test"]
-git-tree-sha1 = "dc6f530de935bb3c3cd73e99db5b4698e58b2fcf"
+git-tree-sha1 = "380dab663ca4234c4ec91340c3211c5e73374612"
 uuid = "31c24e10-a181-5473-b8eb-7969acd0382f"
-version = "0.25.31"
+version = "0.25.32"
 
 [[DocStringExtensions]]
 deps = ["LibGit2"]
@@ -313,9 +313,9 @@ uuid = "a63ad114-7e13-5084-954f-fe012c677804"
 
 [[MonteCarloMeasurements]]
 deps = ["Distributed", "Distributions", "LinearAlgebra", "MacroTools", "Random", "RecipesBase", "Requires", "SLEEFPirates", "StaticArrays", "Statistics", "StatsBase", "Test"]
-git-tree-sha1 = "cdc1eb7c5a1154c15dfe7368f1ca1f693dc40202"
+git-tree-sha1 = "d9dc441d5a0393ee80aea49d0fb13281d7cc7c91"
 uuid = "0987c9cc-fe09-11e8-30f0-b96dd679fdca"
-version = "0.10.4"
+version = "1.0.3"
 
 [[MozillaCACerts_jll]]
 uuid = "14a3606d-f60d-562e-9121-12d972cd8159"
@@ -408,9 +408,9 @@ deps = ["Serialization"]
 uuid = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
 
 [[RecipesBase]]
-git-tree-sha1 = "44a75aa7a527910ee3d1751d1f0e4148698add9e"
+git-tree-sha1 = "a4425fe1cde746e278fa895cc69e3113cb2614f6"
 uuid = "3cdcf5f2-1ef4-517c-9805-6587b60abb01"
-version = "1.1.2"
+version = "1.2.0"
 
 [[RecursiveFactorization]]
 deps = ["LinearAlgebra", "LoopVectorization", "Polyester", "StrideArraysCore", "TriangularSolve"]
@@ -516,9 +516,9 @@ version = "0.33.13"
 
 [[StatsFuns]]
 deps = ["ChainRulesCore", "InverseFunctions", "IrrationalConstants", "LogExpFunctions", "Reexport", "Rmath", "SpecialFunctions"]
-git-tree-sha1 = "385ab64e64e79f0cd7cfcf897169b91ebbb2d6c8"
+git-tree-sha1 = "bedb3e17cc1d94ce0e6e66d3afa47157978ba404"
 uuid = "4c63d2b9-4356-54db-8cca-17b64c39e42c"
-version = "0.9.13"
+version = "0.9.14"
 
 [[StrideArraysCore]]
 deps = ["ArrayInterface", "CloseOpenIntervals", "IfElse", "LayoutPointers", "ManualMemory", "Requires", "SIMDTypes", "Static", "ThreadingUtilities"]

Project.toml

@@ -18,7 +18,7 @@ Unitful = "1986cc42-f94f-5a68-af5c-568840ba703d"
 DataFrames = "1, 0.22, 0.21, 0.20, 0.19"
 DiffRules = "1"
 Measurements = "2"
-MonteCarloMeasurements = "0.10, 0.9"
+MonteCarloMeasurements = "1, 0.10, 0.9"
 OrderedCollections = "1"
 RecursiveFactorization = "0.2, 0.1"
 TimerOutputs = "0.5"

docs/src/index.md

@@ -83,6 +83,21 @@ julia> ]add Unitful, Measurements, MonteCarloMeasurements, Distributions
 
 ## Release Notes
 
+### Version 0.7.6
+
+- Solve linear equation systems optionally with [RecursiveFactorization.jl](https://github.com/YingboMa/RecursiveFactorization.jl) 
+  instead of the default `lu!(..)` and `ldiv!(..)`.
+
+- Project.toml: Changed DiffRules from "~1.0" to "1", since issue with "1.2.1" 
+  (leading to an error in runtests) seems to be fixed.
+  
+- Project.toml: Added version 1 of MonteCarloMeasurements.
+  
+- Updated used packages.
+
+- Tutorial slightly improved.
+
+
 ### Version 0.7.5
 
 - Added a restriction, so that DiffRules 1.0.2 is used, instead of 1.2.1 (which leads to an error in the test suite).

src/EquationAndStateInfo.jl

@@ -59,13 +59,13 @@ const niter_max = 20  # Maximum number of fixed-point iterations to solve A*x =
 """
     leq = LinearEquations{FloatType}(vTear_names::Vector{String},  vTear_lengths::Vector{Int},
                                      nResiduals::Int, A_is_constant::Bool;
-                                     nxRecursiveFactorization = 0)
+                                     useRecursiveFactorizationUptoSize = 0)
 
 Define linear equation system "A*x=b" with `length(x) = sum(vTear_lengths)`.
 If `A_is_constant = true` then `A` is a matrix that is constant after
 initialization. 
 
-If length(x) <= nxRecursiveFactorization, then linear equation systems will be solved with
+If length(x) <= useRecursiveFactorizationUptoSize, then linear equation systems will be solved with
 `RecursiveFactorization.jl` instead of the default `lu!(..)` and `ldiv!(..)`.
 
 For details of its usage for code generation see [`LinearEquationsIteration`](@ref).
@@ -97,24 +97,24 @@ mutable struct LinearEquations{FloatType <: Real}
     # Constructed during initialization
     residual_unitRanges::Vector{UnitRange{Int}} # residuals[residual_unitRanges[i]] = residual_value[i], if residual is a vector
     residual_indices::Vector{Int}               # residuals[residual_indices[i]] = residual_value[i], if residual is a scalar
-    recursiveFactorization::Bool                # = true, if RecursiveFactorization.jl shall be used to solve the linear equation system
+    useRecursiveFactorization::Bool             # = true, if RecursiveFactorization.jl shall be used to solve the linear equation system
 
     luA::LU{FloatType,Array{FloatType,2}}       # lu-Decomposition of A
 
     function LinearEquations{FloatType}(vTear_names::Vector{String}, vTear_lengths::Vector{Int},
                                         nResiduals::Int, A_is_constant::Bool;
-                                        nxRecursiveFactorization::Int = 0) where {FloatType <: Real}
+                                        useRecursiveFactorizationUptoSize::Int = 0) where {FloatType <: Real}
         @assert(length(vTear_names) > 0)
         @assert(length(vTear_names) == length(vTear_lengths))
         nx = sum(vTear_lengths)
         @assert(nx > 0)
         state = -1
-        recursiveFactorization = nx <= nxRecursiveFactorization
+        useRecursiveFactorization = nx <= useRecursiveFactorizationUptoSize
 
         new(A_is_constant, vTear_names, vTear_lengths, zeros(FloatType,nx), nResiduals, 
             zeros(FloatType,nx,nx), zeros(FloatType,nx), fill(0,nx), zeros(FloatType,nx),
             Vector{Any}(undef,nResiduals), -4, -1, niter_max, false, String[], String[],
-            fill(0:0,nResiduals), fill(0,nResiduals), recursiveFactorization)
+            fill(0:0,nResiduals), fill(0,nResiduals), useRecursiveFactorization)
     end
 end
 LinearEquations(args...) = LinearEquations{Float64}(args...)

src/ModiaBase.jl

@@ -9,8 +9,8 @@ Main module of ModiaBase.
 module ModiaBase
 
 const path    = dirname(dirname(@__FILE__))   # Absolute path of package directory
-const Version = "0.7.2-dev"
-const Date    = "2021-04-19"
+const Version = "0.7.2"
+const Date    = "2021-11-23"
 
 #println("\nImporting ModiaBase Version $Version ($Date)")