default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShin'ichi Oishi
- > Home > Persons > Shin'ichi Oishi
Publications
- 2020
[j39]Atsushi Minamihata, Takeshi Ogita, Siegfried M. Rump
, Shin'ichi Oishi:
Modified error bounds for approximate solutions of dense linear systems. J. Comput. Appl. Math. 369 (2020)- 2016
- [j29]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
- [j28]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
Improvement of error-free splitting for accurate matrix multiplication. J. Comput. Appl. Math. 288: 127-140 (2015) - 2013
- [j25]Atsushi Minamihata, Kouta Sekine, Takeshi Ogita, Shin'ichi Oishi:
Fast Verified Solutions of Sparse Linear Systems with H-matrices. Reliab. Comput. 19(2): 127-141 (2013) - 2012
- [j23]Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi:
A robust algorithm for geometric predicate by error-free determinant transformation. Inf. Comput. 216: 3-13 (2012) - [j22]Katsuhisa Ozaki, Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi:
Fast algorithms for floating-point interval matrix multiplication. J. Comput. Appl. Math. 236(7): 1795-1814 (2012) - [j21]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
- [j20]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) - [j19]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) - [j18]Naoya Yamanaka, Masahide Kashiwagi, Shin'ichi Oishi, Takeshi Ogita:
A Note on a Verified Automatic Integration Algorithm. Reliab. Comput. 15(2): 156-167 (2011) - 2010
- [j17]Shinya Miyajima, Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi:
Fast Verification for All Eigenpairs in Symmetric Positive Definite Generalized Eigenvalue Problems. Reliab. Comput. 14: 24-45 (2010) - 2008
- [j15]Naoya Yamanaka, Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi:
A parallel algorithm for accurate dot product. Parallel Comput. 34(6-8): 392-410 (2008) - [j14]Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi:
Accurate Floating-Point Summation Part I: Faithful Rounding. SIAM J. Sci. Comput. 31(1): 189-224 (2008) - [j13]Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi:
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest. SIAM J. Sci. Comput. 31(2): 1269-1302 (2008) - 2005
- [j10]Takeshi Ogita, Shin'ichi Oishi:
Fast Inclusion of Interval Matrix Multiplication. Reliab. Comput. 11(3): 191-205 (2005) - [j9]Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi:
Accurate Sum and Dot Product. SIAM J. Sci. Comput. 26(6): 1955-1988 (2005) - [c3]Shinya Miyajima, Takeshi Ogita, Shin'ichi Oishi:
Fast Verification for Respective Eigenvalues of Symmetric Matrix. CASC 2005: 306-317 - 2003
- [j5]Takeshi Ogita, Shin'ichi Oishi, Yasunori Ushiro:
Computation of Sharp Rigorous Componentwise Error Bounds for the Approximate Solutions of Systems of Linear Equations. Reliab. Comput. 9(3): 229-239 (2003)
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-04-24 23:06 CEST 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:
