Jump to content

Daisuke Takahashi (mathematician)

From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Daisuke Takahashi is a professor of computer science at the University of Tsukuba,[1] specializing in high-performance numerical computing.

Education and career

Takahashi received a bachelor's degree in engineering in 1993 and a master's degree in engineering in 1995, both from Toyohashi University of Technology. He completed a Ph.D. in information science from the University of Tokyo in 1999. After working as a researcher at the University of Tokyo and at Saitama University, he joined the University of Tsukuba in 2001.[2]

Research

Takahashi's works include several records of the number of digits of the approximation of Pi.[3] His work on the computation of Pi has inspired his former student Emma Haruka Iwao, who broke a new record on March 14, 2019.[4]

In 2011, he was part of a team from the University of Tsukuba that won the Gordon Bell Prize of the Association for Computing Machinery for their work simulating the quantum states of a nanowire using the K computer.[5]

He is also known for his research on the Fast Fourier transform,[6][7][8] and is one of the developers of the HPC Challenge Benchmark.[9]

References

  1. ^ "Daisuke Takahashi's Home Page". www.hpcs.cs.tsukuba.ac.jp.
  2. ^ "Daisuke Takahashi". IEEE Xplore. Retrieved 2019-12-04.
  3. ^ Hornyak, Tim (August 20, 2009). "Pi-obsessed Japanese reach 2.5 trillion digits". CNET.
  4. ^ "A recipe for beating the record of most-calculated digits of pi". Google. March 14, 2019.
  5. ^ "K computer Research Results Awarded ACM Gordon Bell Prize: Genuine application achieves execution performance of over 3 petaflops". Riken. November 18, 2011.
  6. ^ "FFTE: A Fast Fourier Transform Package". www.ffte.jp.
  7. ^ Aseeri, Samar (June 11, 2018). "State-of-the-Art FFT: Algorithms, Implementations, and Applications". SIAM News.
  8. ^ Aseeri, Samar (April 15, 2019). "Next Generation FFT Algorithms in Theory and Practice: Parallel Implementations, Sparse FFTs, and Applications". SIAM News.
  9. ^ "People". HPC Challenge. Retrieved 2019-12-04.