update performance

docs/src/manual/2.performance.md

@@ -82,7 +82,7 @@ BenchmarkTools.Trial: 32 samples with 1 evaluation.
 
 ## Trade-off between Performance and Memory
 
-For algorithms not implemented in `TypedMatrices.jl`, the approach in `TypedMatrices.jl` trades performance off for—potentially substantial—memory savings. For example, generating the variable `a`, which is of type `Cauchy`, only requires **63.229 μs** and **114.16 KiB** of memory, while generating `b`, which is the same matrix but has type `Matrix`, requires **3.862 ms** and **7.74 MiB** of memory. And once generated, storing `b` requires 500,000 times more memory than storing `a`.
+For algorithms not implemented in `TypedMatrices.jl`, the package trades performance off for—potentially substantial—memory savings. For example, generating the variable `a`, which is of type `Cauchy`, only requires **63.229 μs** and **114.16 KiB** of memory, while generating `b`, which is the same matrix but has type `Matrix`, requires **3.862 ms** and **7.74 MiB** of memory. And once generated, storing `b` requires 500,000 times more memory than storing `a`.
 
 ```julia-repl
 julia> @benchmark a = Cauchy{Float64}(1000)