default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaisuke Furihata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c1]Haoyu Chu, Yuto Miyatake, Wenjun Cui, Shikui Wei, Daisuke Furihata:
Structure-Preserving Physics-Informed Neural Networks with Energy or Lyapunov Structure. IJCAI 2024: 3872-3880- [i4]Haoyu Chu, Yuto Miyatake, Wenjun Cui, Shikui Wei, Daisuke Furihata:
Structure-Preserving Physics-Informed Neural Networks With Energy or Lyapunov Structure. CoRR abs/2401.04986 (2024) - 2023
- [j10]Tomoya Kitano, Yuto Miyatake, Daisuke Furihata:
A modified model for topic detection from a corpus and a new metric evaluating the understandability of topics. JSIAM Lett. 15: 121-124 (2023) - [i3]Tomoya Kitano, Yuto Miyatake, Daisuke Furihata:
A modified model for topic detection from a corpus and a new metric evaluating the understandability of topics. CoRR abs/2306.04941 (2023) - 2022
- [j9]Kosuke Akita, Yuto Miyatake, Daisuke Furihata:
Composing a surrogate observation operator for sequential data assimilation. JSIAM Lett. 14: 123-126 (2022) - [i2]Kosuke Akita, Yuto Miyatake, Daisuke Furihata:
Composing a surrogate observation operator for sequential data assimilation. CoRR abs/2201.12514 (2022) - 2020
- [i1]Makoto Okumura
, Takeshi Fukao, Daisuke Furihata, Shuji Yoshikawa:
A second-order accurate structure-preserving scheme for the Cahn-Hilliard equation with a dynamic boundary condition. CoRR abs/2007.08355 (2020)
2010 – 2019
- 2018
- [j8]Daisuke Furihata, Mihály Kovács, Stig Larsson, Fredrik Lindgren:
Strong Convergence of a Fully Discrete Finite Element Approximation of the Stochastic Cahn-Hilliard Equation. SIAM J. Numer. Anal. 56(2): 708-731 (2018) - 2017
- [j7]Hiroki Kojima, Takayasu Matsuo, Daisuke Furihata:
Some discrete inequalities for central-difference type operators. Math. Comput. 86(306): 1719-1739 (2017) - 2016
- [j6]Daisuke Furihata, Shun Sato, Takayasu Matsuo:
A novel discrete variational derivative method using "average-difference methods". JSIAM Lett. 8: 81-84 (2016) - 2015
- [j5]Shun Sato, Takayasu Matsuo, Daisuke Furihata:
An analysis on the asymptotic behavior of multistep linearly implicit schemes for the Duffing equation. JSIAM Lett. 7: 45-48 (2015) - [j4]Shun Sato, Takayasu Matsuo, Hideyuki Suzuki, Daisuke Furihata:
A Lyapunov-Type Theorem for Dissipative Numerical Integrators with Adaptive Time-Stepping. SIAM J. Numer. Anal. 53(6): 2505-2518 (2015) - 2014
- [j3]Takayasu Matsuo, Daisuke Furihata:
A stabilization of multistep linearly implicit schemes for dissipative systems. J. Comput. Appl. Math. 264: 38-48 (2014) - 2011
- [j2]Yuto Miyatake, Takayasu Matsuo, Daisuke Furihata:
Conservative finite difference schemes for the modified Camassa-Holm equation. JSIAM Lett. 3: 37-40 (2011)
2000 – 2009
- 2001
- [j1]Daisuke Furihata:
A stable and conservative finite difference scheme for the Cahn-Hilliard equation. Numerische Mathematik 87(4): 675-699 (2001)
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-10-21 20:31 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:
