activity
20202026
most citedA generalized vertical coordinate transformation based on SPH(2) for efficient free surface flow simulations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

6 papers

cs.CE2026

A hybrid s-version isogeometric strategy for dynamic crack propagation in 2D and 3D problems

Tianyu He, Kosei Kurosaki, Naoki Morita +2

A hybrid s-version of isogeometric analysis (hS-IGA) strategy is proposed for accurate and efficient evaluation of near-crack fracture quantities in dynamic crack propagation analy…

math.NA20261 cited

A generalized vertical coordinate transformation based on SPH(2) for efficient free surface flow simulations

Shujiro Fujioka, Kumpei Tsuji, Naoto Mitsume +1

We propose three new particle methods that improve computational efficiency by introducing a generalized Vertical Coordinate Transformation (VCT) for free surface flow problems wit…

math.NA2026

Metagraph-Based Domain-Decomposed Galerkin Reduced-Order Model

Kyohei Shintate, Naoki Morita, Shigeki Kaneko +2

This study proposes a metagraph-based domain-decomposed Galerkin reduced-order model (MBDD-G-ROM) for distributed-memory parallel reduced-order analysis of large-scale problems. Th…

math.NA2026

Domain-decomposed parallelization of B-spline based s-version of the finite element method via generalized graph abstraction

Nozomi Magome, Naoki Morita, Shigeki Kaneko +1

The s-version of the finite element method (SFEM) enables locally high-resolution analysis by superimposing independently defined finite element meshes. However, domain-decomposed…

cs.LG2024

Graph Neural PDE Solvers with Conservation and Similarity-Equivariance

Masanobu Horie, Naoto Mitsume

Utilizing machine learning to address partial differential equations (PDEs) presents significant challenges due to the diversity of spatial domains and their corresponding state co…

cs.LG2020

Isometric Transformation Invariant and Equivariant Graph Convolutional Networks

Masanobu Horie, Naoki Morita, Toshiaki Hishinuma +2

Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solvin…