Rename package to make the Julia lords happy

Author: mcovalt

Project.toml

@@ -1,4 +1,4 @@
-name = "ILU0"
+name = "ILUZero"
 uuid = "88f59080-6952-5380-9ea5-54057fb9a43f"
 version = "0.1.0"
 
@@ -7,7 +7,7 @@ LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
 
 [compat]
-julia = "≥ 1.0"
+julia = "1.0, 2"
 
 [extras]
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"

README.md

@@ -1,6 +1,6 @@
-# ILU0.jl
+# ILUZero.jl
 
-`ILU0.jl` is a Julia implementation of incomplete LU factorization with zero level of fill-in. It allows for non-allocating updates of the factorization. The module is compatible with [ForwardDiff.jl](https://github.com/JuliaDiff/ForwardDiff.jl).
+`ILUZero.jl` is a Julia implementation of incomplete LU factorization with zero level of fill-in. It allows for non-allocating updates of the factorization. The module is compatible with [ForwardDiff.jl](https://github.com/JuliaDiff/ForwardDiff.jl).
 
 ## Requirements
 
@@ -9,10 +9,10 @@
 ## Instalation
 
 ```julia
-julia> Pkg.clone("https://github.com/mcovalt/ILU0.jl.git")
+julia> Pkg.clone("https://github.com/mcovalt/ILUZero.jl.git")
 ```
 
-## Why use ILU0.jl?
+## Why use ILUZero.jl?
 
 You probably shouldn't. Julia's built in factorization methods are much better. Julia uses [SuiteSparse](http://faculty.cse.tamu.edu/davis/suitesparse.html) for sparse matrix factorization which factorizes at about nearly the same speed and results in similarly sized preconditioners which are *much* more robust. In addition, Julia uses heuristics to determine a good factorization scheme for your matrix automatically.
 
@@ -21,7 +21,7 @@ Due to the zero-fill of this package, however, factorization should be a bit fas
 ## How to use
 
 ```julia
-julia> using ILU0
+julia> using ILUZero
 ```
 
 * `LU = ilu0(A)`: Create a factorization based on a sparse matrix `A`
@@ -35,7 +35,7 @@ julia> using ILU0
 ## Performance
 
 ```julia
-julia> using ILU0
+julia> using ILUZero
 julia> using BenchmarkTools, LinearAlgebra, SparseArrays
 julia> A = sprand(1000, 1000, 5 / 1000) + 10I
 julia> fact = @btime ilu0(A)

src/ILU0.jl renamed to src/ILUZero.jl

@@ -1,4 +1,4 @@
-module ILU0
+module ILUZero
 using LinearAlgebra, SparseArrays
 
 import LinearAlgebra.ldiv!, LinearAlgebra.\, SparseArrays.nnz

test/runtests.jl

@@ -1,5 +1,5 @@
 # Start Test Script
-using ILU0, LinearAlgebra, SparseArrays, Test
+using ILUZero, LinearAlgebra, SparseArrays, Test
 
 function cg(A, b; M=I)
     n = size(A, 1)