Arhik

@jishnub I just did quick check. I actually see an improvement. I will share my findings here. ```julia _ _ _(_)_ | Documentation: https://docs.julialang.org (_) | (_) (_) | _...

same for Array Matrix. ```julia julia> @b zero(Symmetric(A)) 218.341 ns (4.03 allocs: 176.992 bytes) julia> for func in [:zero, #=Any others?=#] for Wrapper in [:Symmetric, :Hermitian, :Adjoint, LowerTriangular, Transpose, UpperHessenberg,...

@jishnub I have a basic question. What qualifies as strided matrix ? 1. A ? 2. view into A ? 3. Any matrix with Stride Arrays interface ? 4. Something...

Another basic question. when you meant strided matrix; the matrix as a parent is strided ? I assumed degrade in performace on the wrapper array with uplo field; and strided...

On a new build with the changes included instead of overloading like above, the performance is better. ```julia julia> @b zero(Symmetric(A)) 185.526 ns (4.04 allocs: 177.347 bytes) julia> @b Symmetric(zero(A))...

On this PR build (I am differentiating build) ```julia julia> @btime zero(UpperTriangular($A)); 116.500 μs (3 allocations: 7.63 MiB) ``` while on nightly build ```julia julia> @btime zero(UpperTriangular($A)); 368.375 μs (3...

Actually variance is high. On nightly build ```julia julia> @benchmark zero(UpperTriangular($A)) BenchmarkTools.Trial: 6617 samples with 1 evaluation. Range (min … max): 296.667 μs … 2.363 ms ┊ GC (min …...

specialization should see more improvement.

Would you like something like this ```julia _zeroinit(A::UpperTriangular) = triu!(similar(A), 0) _zeroinit(A::LowerTriangular) = tril!(similar(A), 0) _zeroinit(A::AbstractMatrix) = zero(A) for func in [:zero, #=Any others?=#] funcinit = Symbol(:_, func, :init) for...

search result is empty on juliapackage for these packages