| Linearly implicit structure-preserving schemes for Hamiltonian systems S Eidnes, L Li, S Sato Journal of Computational and Applied Mathematics 387, 112489, 2021 | 24 | 2021 |
| A novel discrete variational derivative method using``average-difference methods'' D Furihata, S Sato, T Matsuo JSIAM Letters 8, 81-84, 2016 | 14 | 2016 |
| A Lyapunov-type theorem for dissipative numerical integrators with adaptive time-stepping S Sato, T Matsuo, H Suzuki, D Furihata SIAM Journal on Numerical Analysis 53 (6), 2505-2518, 2015 | 9 | 2015 |
| Scalar auxiliary variable approach for conservative/dissipative partial differential equations with unbounded energy functionals T Kemmochi, S Sato BIT Numerical Mathematics 62 (3), 903-930, 2022 | 7 | 2022 |
| Stability and convergence of a conservative finite difference scheme for the modified Hunter–Saxton equation S Sato BIT Numerical Mathematics 59 (1), 213-241, 2019 | 7 | 2019 |
| A unified discretization framework for differential equation approach with Lyapunov arguments for convex optimization K Ushiyama, S Sato, T Matsuo Advances in Neural Information Processing Systems 36, 26092-26120, 2023 | 6 | 2023 |
| On spatial discretization of evolutionary differential equations on the periodic domain with a mixed derivative S Sato, T Matsuo Journal of Computational and Applied Mathematics 358, 221-240, 2019 | 4 | 2019 |
| Constructing invariant-preserving numerical schemes based on Poisson and Nambu brackets Y Sugibuchi, T Matsuo, S Sato JSIAM Letters 10, 53-56, 2018 | 4 | 2018 |
| Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices S Sato JSIAM Letters 7, 49-52, 2015 | 4 | 2015 |
| High-order linearly implicit schemes conserving quadratic invariants S Sato, Y Miyatake, JC Butcher Applied Numerical Mathematics 187, 71-88, 2023 | 3 | 2023 |
| Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors S Sato Algorithmica 77 (3), 815--835, 2016 | 3 | 2016 |
| An analysis on the asymptotic behavior of multistep linearly implicit schemes for the Duffing equation S Sato, T Matsuo, D Furihata JSIAM Letters 7, 45-48, 2015 | 3 | 2015 |
| Deriving efficient optimization methods based on stable explicit numerical methods K Ushiyama, S Sato, T Matsuo JSIAM Letters 14, 29-32, 2022 | 2 | 2022 |
| Essential convergence rate of ordinary differential equations appearing in optimization K Ushiyama, S Sato, T Matsuo JSIAM Letters 14, 119-122, 2022 | 2 | 2022 |
| A robust numerical integrator for the short pulse equation near criticality S Sato, K Oguma, T Matsuo, BF Feng Journal of Computational and Applied Mathematics 361, 343-365, 2019 | 2 | 2019 |
| Linear gradient structures and discrete gradient methods for conservative/dissipative differential-algebraic equations S Sato BIT Numerical Mathematics 59 (4), 1063-1091, 2019 | 2 | 2019 |
| A self-adaptive moving mesh method for the short pulse equation via its hodograph link to the sine-Gordon equation S Sato, K Oguma, T Matsuo, BF Feng arXiv preprint arXiv:1607.05790, 2016 | 2 | 2016 |
| A norm-preserving self-adaptive moving mesh integrator for the short pulse equation S Sato, T Matsuo, BF Feng 数理解析研究所講究録, 82-91, 2016 | 2 | 2016 |
| A novel interpretation of Nesterov's acceleration via variable step-size linear multistep methods R Nozawa, S Sato, T Matsuo arXiv preprint arXiv:2404.10238, 2024 | | 2024 |
| Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients K Ushiyama, S Sato, T Matsuo Numerical Algorithms, 1-32, 2024 | | 2024 |
Takayasu MatsuoThe University of Tokyo在 mist.i.u-tokyo.ac.jp 的电子邮件经过验证
