default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoya Sakakibara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Koya Sakakibara
, Yuuki Shimizu:
Numerical Analysis of the Plateau Problem by the Method of Fundamental Solutions. J. Sci. Comput. 100(1): 2 (2024)- [i9]Koya Sakakibara:
Well-conditioned dipole-type method of fundamental solutions: derivation and its mathematical analysis. CoRR abs/2408.00212 (2024) - 2023
- [i8]Keiichi Morikuni, Koya Sakakibara, Asuka Takatsu:
Error estimate for regularized optimal transport problems via Bregman divergence. CoRR abs/2309.11666 (2023) - [i7]Katsuyuki Ishi, Yoshihito Kohsaka, Nobuhito Miyake, Koya Sakakibara:
A threshold-type algorithm to the gradient flow of the Canham-Helfrich functional. CoRR abs/2311.13155 (2023) - 2022
- [j7]Hiroshi Matano, Yoichiro Mori, Mitsunori Nara, Koya Sakakibara:
Asymptotic Behavior of Fronts and Pulses of the Bidomain Model. SIAM J. Appl. Dyn. Syst. 21(1): 616-649 (2022) - [i6]Tomoya Kemmochi, Yuto Miyatake, Koya Sakakibara:
Structure-preserving numerical methods for constrained gradient flows of planar closed curves with explicit tangential velocities. CoRR abs/2208.00675 (2022) - [i5]Koya Sakakibara, Yuuki Shimizu:
Numerical analysis for the Plateau problem by the method of fundamental solutions. CoRR abs/2212.06508 (2022) - 2021
- [j6]Koya Sakakibara, Yuto Miyatake:
A fully discrete curve-shortening polygonal evolution law for moving boundary problems. J. Comput. Phys. 424: 109857 (2021) - [i4]Hiroshi Matano, Yoichiro Mori, Mitsunori Nara, Koya Sakakibara:
Asymptotic behavior of fronts and pulses of the bidomain model. CoRR abs/2105.00169 (2021) - [i3]Koya Sakakibara, Yusaku Shimoji, Shigetoshi Yazaki:
A simple numerical method for Hele-Shaw type problems by the method of fundamental solutions. CoRR abs/2105.14811 (2021) - 2020
- [j5]Yoshikazu Giga, Koya Sakakibara, Kazutoshi Taguchi, Masaaki Uesaka:
A new numerical scheme for discrete constrained total variation flows and its convergence. Numerische Mathematik 146(1): 181-217 (2020)
2010 – 2019
- 2019
- [j4]Koya Sakakibara, Shigetoshi Yazaki:
Structure-preserving numerical scheme for the one-phase Hele-Shaw problems by the method of fundamental solutions. Comput. Math. Methods 1(6) (2019) - [j3]Ken-Ichi Nakamura, Koya Sakakibara, Shigetoshi Yazaki:
Numerical approach to three-dimensional model of cellular electrophysiology by the method of fundamental solutions. JSIAM Lett. 11: 17-20 (2019) - [i2]Koya Sakakibara:
Bidirectional numerical conformal mapping based on the dipole simulation method. CoRR abs/1907.10266 (2019) - [i1]Koya Sakakibara, Yuto Miyatake:
A fully discrete curve-shortening polygonal evolution law for moving boundary problems. CoRR abs/1912.00545 (2019) - 2017
- [j2]Koya Sakakibara, Shigetoshi Yazaki:
On invariance of schemes in the method of fundamental solutions. Appl. Math. Lett. 73: 16-21 (2017) - [j1]Koya Sakakibara, Shigetoshi Yazaki:
Method of fundamental solutions with weighted average condition and dummy points. JSIAM Lett. 9: 41-44 (2017)
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-09-09 01:18 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:
