Skip to main navigation Skip to search Skip to main content

Discrete least square method for nonmatching mesh problems

  • Jae Hoon Choi
  • , Byung Chai Lee
  • , Gi Dong Sim*
  • *Corresponding author for this work
  • Korea Advanced Institute of Science and Technology

Research output: Contribution to journalJournal articlepeer-review

Abstract

This research presents a novel algorithm designed to address nonmatching mesh problems. The key feature of the algorithm is its explicit definition of an interface force on nonmatching interfaces. The displacement at the nonmatching mesh is formulated as a function of the interface force, which is determined through the implementation of displacement continuity conditions using the least square method. Notably, this method offers simplicity and robustness, as it eliminates the necessity for integration at the nonmatching mesh. Numerical examples are provided to assess the algorithm's performance, demonstrating its potential applicability to a wide array of problems involving nonmatching meshes, including domain decomposition and parallel computation.

Original languageEnglish
Pages (from-to)1-25
Number of pages25
JournalMathematics and Computers in Simulation
Volume239
DOIs
StatePublished - 2026.01

Keywords

  • Finite element analysis
  • Interface
  • Least square method
  • Mortar method
  • Nonmatching mesh

Fingerprint

Dive into the research topics of 'Discrete least square method for nonmatching mesh problems'. Together they form a unique fingerprint.

Cite this