If A is any complex-valued matrix, is there a more efficient way of computing A + adjoint(A) in-place than the following ? function hermitian(A, A_tmp) adjoint!(A_tmp, A) A .+= A_tmp end Benchmarking with using LinearAlgebra using BenchmarkTools const N = 200 A = rand(ComplexF64, N, N) A_tmp…

This simpler version would be as fast as Dan’s solution: function hermitian!(A) (N = size(A,1)) == size(A,2) || error("Matrix must be square") @inbounds for i = 1:N, j = i:N A[i, j] = A[i, j] + A[j, i]' A[j, i] = A[i, j]' end end

Efficient and in-place computation of A + adjoint(A)

General Usage Performance

uniment January 24, 2023, 2:45am 10

Somebody came up with a really clever solution to this problem, it just needs to be fleshed out and implemented