Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A domain decomposition method for Isogeometric multi-patch problems with inexact local solvers (2001.09626v1)

Published 27 Jan 2020 in math.NA and cs.NA

Abstract: In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit the tensor product structure at the patch level. To this purpose, we extend to the isogeometric framework the so-called All-Floating variant of FETI, that allows us to use the Fast Diagonalization method at the patch level. We construct then a preconditioner for the whole system and prove its robustness with respect to the local mesh-size $h$ and patch-size $H$ (i.e., we have scalability). Our numerical tests confirm the theory and also show a favourable dependence of the computational cost of the method from the spline degree $p$.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Michal Bosy (6 papers)
  2. Monica Montardini (12 papers)
  3. Giancarlo Sangalli (33 papers)
  4. Mattia Tani (17 papers)
Citations (13)

Summary

We haven't generated a summary for this paper yet.