default search action
Katsuhisa Ozaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j13]Takeshi Terao, Katsuhisa Ozaki:
Method for verifying solutions of sparse linear systems with general coefficients. Appl. Math. Comput. 490: 129204 (2025) - 2024
- [j12]Hiroyuki Ootomo
, Katsuhisa Ozaki, Rio Yokota
DGEMM on integer matrix multiplication unit. Int. J. High Perform. Comput. Appl. 38(4): 297-313 (2024) - [j11]Yuki Uchino, Takeshi Terao, Katsuhisa Ozaki:
Acceleration of iterative refinement for singular value decomposition. Numer. Algorithms 95(2): 979-1009 (2024) - [i4]Sora Sawai, Kazuaki Tanaka, Katsuhisa Ozaki, Shin'ichi Oishi:
Polygonal Sequence-driven Triangulation Validator: An Incremental Approach to 2D Triangulation Verification. CoRR abs/2401.08242 (2024) - [i3]Takeshi Terao, Katsuhisa Ozaki:
Method for Verifying Solutions of Sparse Linear Systems with General Coefficients. CoRR abs/2406.02033 (2024) - [i2]Yuki Uchino, Katsuhisa Ozaki, Toshiyuki Imamura:
Performance Enhancement of the Ozaki Scheme on Integer Matrix Multiplication Unit. CoRR abs/2409.13313 (2024) - 2023
- [i1]Hiroyuki Ootomo, Katsuhisa Ozaki, Rio Yokota:
DGEMM on Integer Matrix Multiplication Unit. CoRR abs/2306.11975 (2023) - 2022
- [j10]Katsuhisa Ozaki
Generation of test matrices with specified eigenvalues using floating-point arithmetic. Numer. Algorithms 90(1): 241-262 (2022) - [c6]Daichi Mukunoki
Infinite-Precision Inner Product and Sparse Matrix-Vector Multiplication Using Ozaki Scheme with Dot2 on Manycore Processors. PPAM (1) 2022: 40-54 - 2021
- [c5]Daichi Mukunoki
Conjugate Gradient Solvers with High Accuracy and Bit-wise Reproducibility between CPU and GPU using Ozaki scheme. HPC Asia 2021: 100-109 - [c4]Daichi Mukunoki
Accurate Matrix Multiplication on Binary128 Format Accelerated by Ozaki Scheme. ICPP 2021: 78:1-78:11 - 2020
- [j9]Takeo Hoshi
An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations. J. Comput. Appl. Math. 376: 112830 (2020) - [j8]Takeshi Terao, Katsuhisa Ozaki, Takeshi Ogita:
LU-Cholesky QR algorithms for thin QR decomposition. Parallel Comput. 92: 102571 (2020) - [c3]Daichi Mukunoki
DGEMM Using Tensor Cores, and Its Accurate and Reproducible Versions. ISC 2020: 230-248
2010 – 2019
- 2019
- [c2]Daichi Mukunoki
Reproducible BLAS Routines with Tunable Accuracy Using Ozaki Scheme for Many-Core Architectures. PPAM (1) 2019: 516-527 - 2018
- [c1]Shuntaro Ichimura, Takahiro Katagiri, Katsuhisa Ozaki, Takeshi Ogita, Toru Nagai:
Threaded Accurate Matrix-Matrix Multiplications with Sparse Matrix-Vector Multiplications. IPDPS Workshops 2018: 1093-1102 - 2016
- [j7]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
Error-free transformation of matrix multiplication with a posteriori validation. Numer. Linear Algebra Appl. 23(5): 931-946 (2016) - 2015
- [j6]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
Improvement of error-free splitting for accurate matrix multiplication. J. Comput. Appl. Math. 288: 127-140 (2015) - 2012
- [j5]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
A robust algorithm for geometric predicate by error-free determinant transformation. Inf. Comput. 216: 3-13 (2012) - [j4]Katsuhisa Ozaki, Takeshi Ogita, Siegfried M. Rump
Fast algorithms for floating-point interval matrix multiplication. J. Comput. Appl. Math. 236(7): 1795-1814 (2012) - [j3]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi, Siegfried M. Rump
Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications. Numer. Algorithms 59(1): 95-118 (2012) - 2011
- [j2]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
An algorithm for automatically selecting a suitable verification method for linear systems. Numer. Algorithms 56(3): 363-382 (2011) - [j1]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
Tight and efficient enclosure of matrix multiplication by using optimized BLAS. Numer. Linear Algebra Appl. 18(2): 237-248 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: