Natisni
Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
An Isogeometric Tearing and Interconnecting (IETI) method for solving high order partial differential equations over planar multi-patch geometries
Mario Kapl, Aljaž Kosmač, Vito Vitrih, 2026, izvirni znanstveni članek

Opis: We present a novel method for solving high-order partial differential equations (PDEs) over planar multi-patch geometries with possibly extraordinary vertices demonstrated on the basis of the polyharmonic equation of order m, m ≥ 1, which is a particular linear elliptic PDE of order 2m. Our approach is based on the concept of Isogeometric Tearing and Interconnecting (IETI) and allows to couple the numerical solution of the PDE with Cs-smoothness, , across the edges of the multi-patch geometry. The proposed technique relies on the use of a particular class of multi-patch geometries, called bilinear-like Gs multi-patch parameterizations, to represent the multi-patch domain. The coupling between the neighboring patches is done via the use of Lagrange multipliers and leads to a saddle point problem, which can be solved first by a small dual problem for a subset of the Lagrange multipliers followed by local, parallelizable problems on the single patches for the coefficients of the numerical solution. Several numerical examples for the polyharmonic equation of order m = 1, m = 2 and m = 3, i.e. for the Poisson’s, the biharmonic and the triharmonic equation, respectively, are shown to demonstrate the potential of our IETI method for solving high-order problems over planar multi-patch geometries with possibly extraordinary vertices.
Ključne besede: isogeometric analysis, Galerkin method, C^s-smoothness, Tearing and Interconnecting, multi-patch domain, polyharmonic equation
Objavljeno v RUP: 02.02.2026; Ogledov: 145; Prenosov: 4
.pdf Celotno besedilo (6,42 MB)
Gradivo ima več datotek! Več...

3.
A ▫$C^s$▫-smooth mixed degree and regularity isogeometric spline space over planar multi-patch domains
Mario Kapl, Aljaž Kosmač, Vito Vitrih, 2026, izvirni znanstveni članek

Opis: We construct over a given bilinear multi-patch domain a novel $C^s$-smooth mixed degree and regularity isogeometric spline space, which possesses the degree $p=2s+1$ and regularity $r=s$ in a small neighborhood around the edges and vertices, and the degree~$\widetilde{p} \leq p$ with regularity $\widetilde{r} = \widetilde{p}-1 \geq r$ in all other parts of the domain. Our proposed approach relies on the technique Kapl and Vitrih (2021), which requires for the $C^s$-smooth isogeometric spline space a degree at least $p=2s+1$ on the entire multi-patch domain. Similar to Kapl and Vitrih (2021), the $C^s$-smooth mixed degree and regularity spline space is generated as the span of basis functions that correspond to the individual patches, edges and vertices of the domain. The reduction of degrees of freedom for the functions in the interior of the patches is achieved by introducing an appropriate mixed degree and regularity underlying spline space over $[0,1]^2$ to define the functions on the single patches. We further extend our construction with a few examples to the class of bilinear-like $G^8$ multi-patch parameterizations (Kapl and Vitrih (2018); Kapl and Vitrih (2021)), which enables the design of multi-patch domains having curved boundaries and interfaces. Finally, the great potential of the $C^8$-smooth mixed degree and regularity isogeometric spline space for performing isogeometric analysis is demonstrated by several numerical examples of solving two particular high order partial differential equations, namely the biharmonic and triharmonic equation, via the isogeometric Galerkin method.
Ključne besede: isogeometric analysis, Galerkin method, C^s-smoothness, mixed degree and regularity spline space, multi-patch domain
Objavljeno v RUP: 01.07.2025; Ogledov: 710; Prenosov: 4
.pdf Celotno besedilo (3,76 MB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.01 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici