Daisuke Takahashi (mathematician)

{{Short description|Japanese computer scientist}}

Daisuke Takahashi is a professor of computer science at the University of Tsukuba,{{Cite web|url=http://www.hpcs.cs.tsukuba.ac.jp/~daisuke/|title=Daisuke Takahashi's Home Page|website=www.hpcs.cs.tsukuba.ac.jp}} 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.{{cite web|url=https://ieeexplore.ieee.org/author/37284290600|title=Daisuke Takahashi|work=IEEE Xplore|accessdate=2019-12-04}}

Research

Takahashi's works include several records of the number of digits of the approximation of Pi.{{Cite web|url=https://www.cnet.com/news/pi-obsessed-japanese-reach-2-5-trillion-digits/|title=Pi-obsessed Japanese reach 2.5 trillion digits|first=Tim|last=Hornyak|website=CNET|date=August 20, 2009}} His work on the computation of Pi has inspired his former student Emma Haruka Iwao, who broke a new record on March 14, 2019.{{Cite web|url=https://blog.google/products/google-cloud/most-calculated-digits-pi/|title=A recipe for beating the record of most-calculated digits of pi|date=March 14, 2019|website=Google}}

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.{{cite web|url=https://www.riken.jp/en/news_pubs/news/2011/20111118/|title=K computer Research Results Awarded ACM Gordon Bell Prize: Genuine application achieves execution performance of over 3 petaflops|publisher=Riken|date=November 18, 2011}}

He is also known for his research on the Fast Fourier transform,{{Cite web|url=http://www.ffte.jp/|title=FFTE: A Fast Fourier Transform Package|website=www.ffte.jp}}{{cite magazine|url=https://sinews.siam.org/Details-Page/state-of-the-art-fft-algorithms-implementations-and-applications|magazine=SIAM News|title=State-of-the-Art FFT: Algorithms, Implementations, and Applications|first=Samar|last=Aseeri|date=June 11, 2018}}{{cite magazine|url=https://sinews.siam.org/Details-Page/next-generation-fft-algorithms-in-theory-and-practice-parallel-implementations-sparse-ffts-and-applications|magazine=SIAM News|title=Next Generation FFT Algorithms in Theory and Practice: Parallel Implementations, Sparse FFTs, and Applications|first=Samar|last=Aseeri|date=April 15, 2019}} and is one of the developers of the HPC Challenge Benchmark.{{cite web|url=https://icl.utk.edu/hpcc/people/index.html|title=People|work=HPC Challenge|accessdate=2019-12-04}}

References