朱莉娅的半环矢量产品不起作用

Mar*_*ler 6 julia

我正在尝试在Julia(0.6.2)中实现max-plus半环代数,遵循本文:

http://www.mit.edu/~kepner/pubs/JuliaSemiring_HPEC2013_Paper.pdf

max-plus数字的类型定义和所有相关运算符的定义,直接来自上面提到的论文,如下:

# define max-plus number type

immutable MPNumber{T} <: Number 
  val::T
end

+(a::MPNumber, b::MPNumber) = MPNumber(max(a.val, b.val))

*(a::MPNumber, b::MPNumber) = MPNumber(a.val + b.val)

show(io::IO, k::MPNumber) = show(io, k.val)

zero{T}(::MPNumber{T}) = MPNumber(typemin(T))

one{T}(::MPNumber{T}) = MPNumber(zero(T))

promote_rule{T<:Number}(::Type{MPNumber}, ::Type{T}) = MPNumber

mparray(A::Array) = map(MPNumber, A)

array{T}(A::Array{MPNumber{T}}) = map(x->x.val, A)
Run Code Online (Sandbox Code Playgroud)

max-plus加法和乘法的基本测试工作正常,例如

MPNumber(1) + MPNumber(1)
Run Code Online (Sandbox Code Playgroud)

MPNumber(1)按预期给出.如文中所示,Max-plus矩阵求幂也像魅力一样:

A = mparray(Array([[1, 2] [3, 4]]))
A*A
Run Code Online (Sandbox Code Playgroud)

2×2 Array{MPNumber{Int64},2}:
 MPNumber{Int64}(5)  MPNumber{Int64}(7)
 MPNumber{Int64}(6)  MPNumber{Int64}(8)
Run Code Online (Sandbox Code Playgroud)

但是,当我尝试将max-plus向量与max-plus矩阵相乘时,

A = mparray(Array([[1, 2] [3, 4]]))
x = mparray([1, 2])

A*x
Run Code Online (Sandbox Code Playgroud)

我收到以下错误:

MethodError: Cannot `convert` an object of type Int64 to an object of type MPNumber{Int64}
This may have arisen from a call to the constructor MPNumber{Int64}(...) since type constructors fall back to convert methods.

Stacktrace:
 [1] generic_matvecmul!(::Array{MPNumber{Int64},1}, ::Char, ::Array{MPNumber{Int64},2}, ::Array{MPNumber{Int64},1}) at ./linalg/matmul.jl:434
 [2] Ac_mul_B(::Array{MPNumber{Int64},1}, ::Array{MPNumber{Int64},2}) at ./linalg/rowvector.jl:227
Run Code Online (Sandbox Code Playgroud)

我对朱莉娅来说还是比较陌生的,所以我很难弄清楚这里出了什么问题以及如何修复它.任何帮助将非常感激.

Bog*_*ski 7

这是在Julia 0.6.2下测试的.使用以下代码:

struct MPNumber{T} <: Number
  val::T
end
Base.:+(a::MPNumber, b::MPNumber) = MPNumber(max(a.val, b.val))
Base.:*(a::MPNumber, b::MPNumber) = MPNumber(a.val + b.val)
Base.show(io::IO, k::MPNumber) = show(io, k.val)
Base.zero(::MPNumber{T}) where T = MPNumber(typemin(T))
Base.one(::MPNumber{T}) where T = MPNumber(zero(T))
Base.zero(::Type{MPNumber{T}}) where T = MPNumber(typemin(T))
Base.one(::Type{MPNumber{T}}) where T = MPNumber(zero(T))
mparray(A::Array) = map(MPNumber, A)
Run Code Online (Sandbox Code Playgroud)

(我建议你从这部分开始,因为转换和促销更加棘手,不需要你的目的).

注意到关键部分是我Base通过Base.在它们之前预先扩展来扩展函数.对于+*您需要:在函数名称之前另外使用.

现在你可以运行你想要的一切:

julia> MPNumber(1) + MPNumber(1)
1

julia> A = mparray(Array([[1, 2] [3, 4]]))
2×2 Array{MPNumber{Int64},2}:
 1  3
 2  4

julia> A*A
2×2 Array{MPNumber{Int64},2}:
 5  7
 6  8

julia> A = mparray(Array([[1, 2] [3, 4]]))
2×2 Array{MPNumber{Int64},2}:
 1  3
 2  4

julia> x = mparray([1, 2])
2-element Array{MPNumber{Int64},1}:
 1
 2

julia> A*x
2-element Array{MPNumber{Int64},1}:
 5
 6
Run Code Online (Sandbox Code Playgroud)

如所想.

编辑:我已经在您的代码中制作zeroone定义更完整,并遵循标准要求.