default search action
Katsuyoshi Ohara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Shinichi Tajima, Katsusuke Nabeshima
, Katsuyoshi Ohara, Yoko Umeta:
Computing Holonomic D-Modules Associated to a Family of Non-isolated Hypersurface Singularities via Comprehensive Gröbner Systems of PBW Algebra. Math. Comput. Sci. 17(1): 6 (2023) - [i6]Ari Dwi Hartanto, Katsuyoshi Ohara:
An F5 Algorithm for Tropical Gröbner Bases in the Weyl Algebras. CoRR abs/2312.14419 (2023) - 2022
- [i5]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials. CoRR abs/2209.04807 (2022) - 2020
- [j5]Katsuyoshi Ohara, Shinichi Tajima:
An Algorithm for Computing Grothendieck Local Residues II: General Case. Math. Comput. Sci. 14(2): 483-496 (2020)
2010 – 2019
- 2019
- [j4]Katsuyoshi Ohara, Shinichi Tajima:
An Algorithm for Computing Grothendieck Local Residues I: Shape Basis Case. Math. Comput. Sci. 13(1-2): 205-216 (2019) - 2018
- [j3]Katsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima:
Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic D-modules. J. Symb. Comput. 89: 146-170 (2018) - [i4]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials. CoRR abs/1801.08437 (2018) - [i3]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials. CoRR abs/1811.09149 (2018) - 2016
- [c4]Katsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima:
Comprehensive Gröbner Systems in Rings of Differential Operators, Holonomic D-modules and B-functions. ISSAC 2016: 349-356 - 2015
- [i2]Katsuyoshi Ohara, Nobuki Takayama:
Pfaffian Systems of A-Hypergeometric Systems II - Holonomic Gradient Method. CoRR abs/1505.02947 (2015) - 2014
- [c3]Katsuyoshi Ohara, Shinichi Tajima, Akira Terui
Developing Linear Algebra Packages on Risa/Asir for Eigenproblems. ICMS 2014: 321-324 - [c2]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui
An Extension and Efficient Calculation of the Horner's Rule for Matrices. ICMS 2014: 346-351 - [c1]Tamio Koyama, Hiromasa Nakayama, Katsuyoshi Ohara, Tomonari Sei
Software Packages for Holonomic Gradient Method. ICMS 2014: 706-712 - 2013
- [j2]Tomonari Sei
Properties and applications of Fisher distribution on the rotation group. J. Multivar. Anal. 116: 440-455 (2013) - 2011
- [j1]Hiromasa Nakayama, Kenta Nishiyama, Masayuki Noro, Katsuyoshi Ohara, Tomonari Sei
Holonomic gradient descent and its application to the Fisher-Bingham integral. Adv. Appl. Math. 47(3): 639-658 (2011) - 2010
- [i1]Tomonari Sei, Nobuki Takayama, Akimichi Takemura, Hiromasa Nakayama, Kenta Nishiyama, Masayuki Noro, Katsuyoshi Ohara:
Holonomic Gradient Descent and its Application to Fisher-Bingham Integral. CoRR abs/1005.5273 (2010)
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-04-24 22:56 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: