typos

[musvaage]

I can submit a pull if these replacement strings look good.

Alternatively
broadcast
columns
provided
similar
transposed
unnecessary

$ grep -nr Altenatively SparseArrays.jl
SparseArrays.jl/src/linalg.jl:1416:inv(A::AbstractSparseMatrixCSC) = error("The inverse of a sparse matrix can often be dense and can cause the computer to run out of memory. If you are sure you have enough memory, please either convert your matrix to a dense matrix, e.g. by calling `Matrix` or if `A` can be factorized, use `\\` on the dense identity matrix, e.g. `A \\ Matrix{eltype(A)}(I, size(A)...)` restrictions of `\\` on sparse lhs applies. Altenatively, `A\\b` is generally preferable to `inv(A)*b`")
$ grep -nr broacast SparseArrays.jl
SparseArrays.jl/src/higherorderfns.jl:114:# as n-by-one sparse matrices which, though technically incorrect, is how broacast[!] views
$ grep -nr coulms SparseArrays.jl
SparseArrays.jl/test/sparsematrix_constructors_indexing.jl:1393:             (swapcols!, 2, 3), # Test swapping coulms of unequal length
$ grep -nr proveded SparseArrays.jl
SparseArrays.jl/src/solvers/umfpack.jl:416:is proveded or `q` is `nothing`, UMFPACK's default is used. If the permutation is not zero based, a
$ grep -nr simlar SparseArrays.jl
SparseArrays.jl/src/solvers/umfpack.jl:278:# Not using simlar helps if the actual needed size has changed as it would need to be resized again
$ grep -nr tranposed SparseArrays.jl
SparseArrays.jl/test/sparsematrix_constructors_indexing.jl:1080:    # `isstored` for adjoint and tranposed matrices:
$ grep -nr unecessary SparseArrays.jl
SparseArrays.jl/src/solvers/cholmod.jl:407:# The ifelse here may be unecessary.
$ 

cartesian furthermore could begin with a capital letter

$ grep -nr cartesian SparseArrays.jl
SparseArrays.jl/docs/src/index.md:125:[`findall(!iszero, x)`](@ref) returns the cartesian indices of non-zero entries in `x`
$ 

[ViralBShah]

Please do. Much appreciated.