Skip to content

Commit

Permalink
Add scale, scale! and copy! for triangular matrices
Browse files Browse the repository at this point in the history
  • Loading branch information
mfasi committed Aug 27, 2015
1 parent b6654a7 commit ef20861
Show file tree
Hide file tree
Showing 2 changed files with 70 additions and 6 deletions.
70 changes: 64 additions & 6 deletions base/linalg/triangular.jl
Original file line number Diff line number Diff line change
Expand Up @@ -33,8 +33,6 @@ for t in (:LowerTriangular, :UnitLowerTriangular, :UpperTriangular, :UnitUpperTr
return $t(B)
end

copy{T,S}(A::$t{T,S}) = $t{T,S}(copy(A.data))

big(A::$t) = $t(big(A.data))

real{T<:Real}(A::$t{T}) = A
Expand Down Expand Up @@ -107,10 +105,10 @@ function full!{T,S}(A::UnitUpperTriangular{T,S})
B
end

getindex{T,S}(A::UnitLowerTriangular{T,S}, i::Integer, j::Integer) = i == j ? one(T) : (i > j ? A.data[i,j] : zero(A.data[i,j]))
getindex{T,S}(A::LowerTriangular{T,S}, i::Integer, j::Integer) = i >= j ? A.data[i,j] : zero(A.data[i,j])
getindex{T,S}(A::UnitUpperTriangular{T,S}, i::Integer, j::Integer) = i == j ? one(T) : (i < j ? A.data[i,j] : zero(A.data[i,j]))
getindex{T,S}(A::UpperTriangular{T,S}, i::Integer, j::Integer) = i <= j ? A.data[i,j] : zero(A.data[i,j])
getindex{T,S}(A::UnitLowerTriangular{T,S}, i::Integer, j::Integer) = i == j ? one(T) : (i > j ? A.data[i,j] : zero(A.data[j,i]))
getindex{T,S}(A::LowerTriangular{T,S}, i::Integer, j::Integer) = i >= j ? A.data[i,j] : zero(A.data[j,i])
getindex{T,S}(A::UnitUpperTriangular{T,S}, i::Integer, j::Integer) = i == j ? one(T) : (i < j ? A.data[i,j] : zero(A.data[j,i]))
getindex{T,S}(A::UpperTriangular{T,S}, i::Integer, j::Integer) = i <= j ? A.data[i,j] : zero(A.data[j,i])

function setindex!(A::UpperTriangular, x, i::Integer, j::Integer)
if i > j
Expand Down Expand Up @@ -283,6 +281,66 @@ function -(A::UnitUpperTriangular)
UpperTriangular(Anew)
end

# copy and scale
function copy!{T<:Union{UpperTriangular, UnitUpperTriangular}}(A::T, B::T)
n = size(B,1)
for j = 1:n
for i = 1:(isa(B, UnitUpperTriangular)?j-1:j)
@inbounds A[i,j] = B[i,j]
end
end
return A
end
function copy!{T<:Union{LowerTriangular, UnitLowerTriangular}}(A::T, B::T)
n = size(B,1)
for j = 1:n
for i = (isa(B, UnitLowerTriangular)?j+1:j):n
@inbounds A[i,j] = B[i,j]
end
end
return A
end
copy{S<:AbstractTriangular{BigFloat}}(A::S) = S(copy(A.data))

function scale!{T<:Union{UpperTriangular, UnitUpperTriangular}}(A::UpperTriangular, B::T, c::Number)
n = chksquare(B)
for j = 1:n
if isa(B, UnitUpperTriangular)
@inbounds A[j,j] = c
end
for i = 1:(isa(B, UnitUpperTriangular)?j-1:j)
@inbounds A[i,j] = c * B[i,j]
end
end
end
function scale!{T<:Union{LowerTriangular, UnitLowerTriangular}}(A::LowerTriangular, B::T, c::Number)
n = chksquare(B)
for j = 1:n
if isa(B, UnitLowerTriangular)
@inbounds A[j,j] = c
end
for i = (isa(B, UnitLowerTriangular)?j+1:j):n
@inbounds A[i,j] = c * B[i,j]
end
end
end

for (t1, t2) in ([:UnitLowerTriangular, :LowerTriangular],
[:UnitUpperTriangular, :UpperTriangular])
@eval begin
function scale!{T,S<:Number}(A::$(t1){T}, c::S)
D = $(t2)(Array(promote_type(T,S), size(A)...));
scale!(D,A,c);
return D
end
function scale!{T,S<:Number}(A::$(t2){T}, c::S)
D = $(t2)(Array(promote_type(T,S), size(A)...));
scale!(D,A,c);
return D
end
end
end

# Binary operations
+(A::UpperTriangular, B::UpperTriangular) = UpperTriangular(A.data + B.data)
+(A::LowerTriangular, B::LowerTriangular) = LowerTriangular(A.data + B.data)
Expand Down
6 changes: 6 additions & 0 deletions test/linalg/triangular.jl
Original file line number Diff line number Diff line change
Expand Up @@ -125,6 +125,12 @@ for elty1 in (Float32, Float64, Complex64, Complex128, BigFloat, Int)
@test full(-A1) == -full(A1)

# Binary operations
@test copy(A1) == A1
@test copy(A1.') == A1.'
@test scale(A1,0.5) == 0.5*A1
@test scale(A1,0.5im) == 0.5im*A1
@test scale(A1.',0.5) == 0.5*A1.'
@test scale(A1.',0.5im) == 0.5im*A1.'
@test A1*0.5 == full(A1)*0.5
@test 0.5*A1 == 0.5*full(A1)
@test A1/0.5 == full(A1)/0.5
Expand Down

0 comments on commit ef20861

Please sign in to comment.