Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
seminars [2026-09-15] – [Introduction to OSCAR] Martin Zieglerseminars [2026-09-16] (current) – [Introduction to OSCAR] Martin Ziegler
Line 21: Line 21:
   * Sehun Park (KAIST)   * Sehun Park (KAIST)
  
-Currently Real computation become the important topic on various field. To solve part of the problem of the Real Computation, few computing tools such as julia and module OSCAR is made. In this presentation, the presenter will talk about the information about the julia program and the OSCAR module, by becoming familiar by the examples which inclues the sequential prefix iteration.+The bit-cost of processing (say, continuous) real functions is exponentially more expensive than of single real numbers, but parallelizes well using Prefix Sum. 
 +We introduce the open-source computer algebra system OSCAR and our first programming steps in Julia, including examples including Prefix Sum.
 ====Extensions of the skein algorithm for link polynomials 2==== ====Extensions of the skein algorithm for link polynomials 2====
   * March 10, 9h KST   * March 10, 9h KST