dpsanders

dpsanders

using IntervalConstraintProgramming
using IntervalArithmetic
using ModelingToolkit

"Cs is a list of contractors"
function pave(Cs, working::Vector{IntervalBox{N,T}}, ϵ, bisection_point=nothing) where {N,T}

    boundary = SubPaving{N,T}()

    while !isempty(working)

dpsanders

using TaylorSeries, StaticArrays, ForwardDiff


f( (x, y) ) = x^2 + 5x*y + 2y^2

H = zeros(2, 2)

t = Taylor1(2)

dpsanders

dpsanders

test_package = ""

if VERSION <= v"0.6"
    using Base.Test
    test_package = "Base.Test"
else
    using Test
    test_package = "Test"
end

dpsanders

Latency Comparison Numbers
--------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

dpsanders

dpsanders

Plotting

Last Update: 12.12.2014
Offline Version

Contents

• Translating
• Basic Plot
• Plot Annotation

dpsanders

# 0.4 ONLY

type MultidimFunction
    components::Vector{Function}
end

Base.getindex(f::MultidimFunction, i::Integer) = f.components[i]

Base.call(f::MultidimFunction, x) = (T=eltype(x); T[f_i(x) for f_i in f.components])

dpsanders