• altavir

    altavir

    3 years ago
    @thomasnield I've finished almost everything and it looks really fine. The last stumbling block is percentile statistics. The commons-math uses rather complicated algorithm (some variant of nearest-rank method). But there are simpler methods. Do you have an understanding, how it should work?
    altavir
    thomasnield
    2 replies
    Copy to Clipboard
  • breandan

    breandan

    3 years ago
    @altavir Have you thought about using F-bounded quantification in your algebra? It’s a nice way to get concrete types out of an abstract structure while only defining behavior once on the most generic type. For example, try to define an extension function
    buffer.min()
    over an arbitrary buffer whose elements are subtypes of
    Comparable
    where
    min()
    returns a specific type (i.e. not a
    Comparable
    )? Can you implement it using a single function?
    breandan
    altavir
    21 replies
    Copy to Clipboard
  • m

    Micah Church

    3 years ago
    I'm having difficulties with getting gradle to use the kmath repository, I have followed the steps for the dependency and repository as provided by the link but I cant seem to find the right Tag to put there
    m
    altavir
    23 replies
    Copy to Clipboard
  • m

    Micah Church

    3 years ago
    Where could I find documentation for initialization of the Buffer structure? Edit never mind I'm pretty sure I'll figure it out soon
    m
    altavir
    5 replies
    Copy to Clipboard
  • m

    Micah Church

    3 years ago
    I'm not really sure if this would be something for this project, I know when it comes to large matrices simple operations like dot product, transposition etc can be very slow due to the number of elements. A while back was looking into cache oblivious algorithms, so in the case of matrix multiplication it would divide the matrix into smaller block matrices that would at run time determine the optimal size to put data into the caches of the cpu, these oblivious algorithms, some search algorithms as well, ran at nearly constant speed in terms of effiencey regardless of the dimensions. Like I said not sure if it would be something for hear or elsewhere but attempting to implement some on intensive algorithms may be useful. For instance I know that tensorflow at points can be very slow just due to tensor operations
    m
    altavir
    8 replies
    Copy to Clipboard
  • m

    Micah Church

    3 years ago
    I keep getting an error related to Import scientifik.kmath.transform its saying it's an unresolved reference, everything else is imported and works fine
    m
    altavir
    17 replies
    Copy to Clipboard
  • m

    Micah Church

    3 years ago
    Due to my limited familiarity with Kotlin, and Java in general I think it would be in everyone's best interest if I attempted to start in on the documentation of what is already implemented. This way i waste as little of everyone's time as is possible. It would also be good for my familiarity with the language. I will attempt and a documentation of something that isnt documented as well as at least one example. If it alright with you I could send an example one and based on your input kind of go my own way from there. Then I could let you know at the end when I'm done with say documenting Complex. Please let me know what you think of this for I dont want to bother anyone with rudimentary questions, in the meantime I will also try to get the aformentioned stuff done that I am already working on namely the checking of the fourier transform
    m
    altavir
    3 replies
    Copy to Clipboard
  • thomasnield

    thomasnield

    3 years ago
    Presentation proposal for KotlinConf submitted.
    thomasnield
    altavir
    8 replies
    Copy to Clipboard
  • thomasnield

    thomasnield

    3 years ago
    @altavir I am going to resume my use case for kmath hopefully this week. I kind of want to learn how to build MIP solvers from scratch (minus the matrix work which kmath will do) so I can create hybrid optimization models at work. I've got a massive, critical project at work using simulated annealing, and it seems to work great. But I want to explore linear/integer programming solutions and see if I can avoid 3rd party solvers by using my own heuristics and hybrid models.
    thomasnield
    altavir
    4 replies
    Copy to Clipboard
  • b

    bjonnh

    3 years ago
    As soon as matrix stuff is here, I'll give it a try for my spin simulator.
    b
    altavir
    3 replies
    Copy to Clipboard