Development of a general‐purpose parallel finite element method for analyzing earthquake engineering problems

Motoyama, Hiroki; Sawada, Masataka; Hotta, Wataru; Haba, Kazumoto; Otsuka, Yasuyuki; Akiba, Hiroshi; Hori, Muneo

doi:10.1002/eqe.3551

Cited by 4 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implemented a rigorous joint element for modeling the slip behavior of faults and a symplectic time integration method with a Hamiltonian formulation using the opensource FEM software FrontISTR [16] to develop a numerical tool for fault displacement simulation [17].…”

Section: Fem For the Fault Displacement Problemmentioning

confidence: 99%

Predictive Simulation for Surface Fault Occurrence Using High-Performance Computing

2022

View full text Add to dashboard Cite

Numerical simulations based on continuum mechanics are promising methods for the estimation of surface fault displacements. We developed a parallel finite element method program to perform such simulations and applied the program to reproduce the 2016 Kumamoto earthquake, where surface rupture was observed. We constructed an analysis model of the 5 × 5 × 1 km domain, including primary and secondary faults, and inputted the slip distribution of the primary fault, which was obtained through inversion analysis and the elastic theory of dislocation. The simulated slips on the surface were in good agreement with the observations. We then conducted a predictive simulation by inputting the slip distributions of the primary fault, which were determined using a strong ground motion prediction method for an earthquake with a specified source fault. In this simulation, no surface slip was induced in the sub-faults. A large surface slip area must be established near a sub-fault to induce the occurrence of a slip on the surface.

show abstract

Section: Fem For the Fault Displacement Problemmentioning

confidence: 99%

Predictive Simulation for Surface Fault Occurrence Using High-Performance Computing

2022

View full text Add to dashboard Cite

show abstract

“…The DDDM solver outperforms a successive symmetric overrelaxation (SSOR) preconditioned solver, which we assume is a standard solver, as will be discussed in Section 6.3. Also, in an article [27], an elastic seismic response analysis of an NPP building installed on the ground consisting of one million DOFs with hexahedral and plate elements involving 2700 steps for 54 seconds took 1.1 hours using the DDDM solver. In contrast, the SSOR solver took 13.8 hours.…”

Section: Introductionmentioning

confidence: 99%

Deflated Domain Decomposition Method for Structural Problems

Akiba

2023

Preprint

View full text Add to dashboard Cite

A fast and stable solver algorithm for structural problems is presented. The distance between the eigenvector of the constrained stiffness matrix and the unconstrained matrix is discussed. The coarse motions are close to the kernel of the unconstrained matrix. This relates to using lower-frequency deformation modes to construct an iterative solver algorithm through domain decomposition expressing near-rigid-body motions, deflation algorithms, and two-level algorithms. We remove the coarse space from the solution space, and the iteration space is handed over to the fine space. Our solver is parallelized, and the solver thus has two sets of domain decomposition. One decomposition is for generating the coarse space, and the other is for parallelization. The basic framework of the solver is the parallel conjugate gradient (CG) method on the fine space. The CG method and the simplest domain decomposition method are compared to explain the adoption of the CG method as the basic framework. Benchmark tests are conducted using elastic static analysis for thin plate models. A comparison with the standard CG solver results shows the high-speed performance and remarkable stability of the new solver.

show abstract

Deflated domain decomposition method for structural problems

Akiba

2024

J Eng Math

View full text Add to dashboard Cite

The paper presents a fast and stable solver algorithm for structural problems. The point is the distance between the eigenvector of the constrained stiffness matrix and the unconstrained matrix. The coarse motions are close to the kernel of the unconstrained matrix. We use lower-frequency deformation modes to construct an iterative solver algorithm through domain decomposition expressing near-rigid-body motions, deflation algorithms, and two-level algorithms. We remove the coarse space from the solution space and hand over the iteration space to the fine space. Our solver is parallelized, and the solver thus has two sets of domain decomposition. One decomposition generates the coarse space, and the other is for parallelization. The basic framework of the solver is the parallel conjugate gradient (CG) method on the fine space. We use the CG method for the basic framework instead of the (simplest) domain decomposition method. We conducted benchmark tests using elastic static analysis for thin plate models. A comparison with the standard CG solver results shows the new solver’s high-speed performance and remarkable stability.

show abstract

Development of a general‐purpose parallel finite element method for analyzing earthquake engineering problems

Cited by 4 publications

References 21 publications

Predictive Simulation for Surface Fault Occurrence Using High-Performance Computing

Predictive Simulation for Surface Fault Occurrence Using High-Performance Computing

Deflated Domain Decomposition Method for Structural Problems

Deflated domain decomposition method for structural problems

Contact Info

Product

Resources

About