相关论文: A parallel multigrid solver for multi-patch Isogeo…
We present an isogeometric framework based on collocation to construct a $C^2$-smooth approximation of the solution of the Poisson's equation over planar bilinearly parameterized multi-patch domains. The construction of the used globally…
We present and analyze a new space-time parallel multigrid method for parabolic equations. The method is based on arbitrarily high order discontinuous Galerkin discretizations in time, and a finite element discretization in space. The key…
Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as…
We consider and discretize a mixed formulation for linear elasticity with weakly imposed symmetry in two and three dimensions. Whereas existing methods mainly deal with simplicial or polygonal meshes, we take advantage of isogeometric…
Algebraic multigrid (AMG) solvers and preconditioners are some of the fastest numerical methods to solve linear systems, particularly in a parallel environment, scaling to hundreds of thousands of cores. Most AMG methods and theory assume a…
Algebraic multigrid (AMG) is often an effective solver for symmetric positive definite (SPD) linear systems resulting from the discretization of general elliptic PDEs, or the spatial discretization of parabolic PDEs. However, convergence…
We present an isogeometric collocation method for solving the biharmonic equation over planar bilinearly parameterized multi-patch domains. The developed approach is based on the use of the globally $C^4$-smooth isogeometric spline space…
The paper is concerned with locally stabilized space-time IgA approximations to initial boundary value problems of the parabolic type. Originally, similar schemes (but weighted with a global mesh parameter) was presented and studied by U.…
This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a new developed…
In this paper, we present the isogeometric least-squares collocation (IGA-L) method, which determines the numerical solution by making the approximate differential operator fit the real differential operator in a least-squares sense. The…
In this paper we consider a new version of the dual-primal isogeometric tearing and interconnecting (IETI-DP) method for solving large-scale linear systems of algebraic equations arising from discontinuous Galerkin (dG) isogeometric…
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set…
We propose a new discontinuous Galerkin Isogeometric Analysis (IgA) technique for the numerical solution of elliptic diffusion problems in computational domains decomposed into volumetric patches with non-matching interfaces. Due to an…
One key feature of isogeometric analysis is that it allows smooth shape functions. Indeed, when isogeometric spaces are constructed from $p$-degree splines (and extensions, such as NURBS), they enjoy up to $C^{p-1}$ continuity within each…
We present an isogeometric method for Kirchhoff-Love shell analysis of shell structures with geometries composed of multiple patches and which possibly possess extraordinary vertices, i.e. vertices with a valency different to four. The…
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a…
A seamless integration of neural networks with Isogeometric Analysis (IGA) was first introduced in [1] under the name of Hierarchical Deep-learning Neural Network (HiDeNN) and has systematically evolved into Isogeometric Convolution HiDeNN…
Trimming techniques are efficient ways to generate complex geometries in Computer-Aided Design(CAD). In this paper, an improved isogeometric analysis(IGA) method for trimmed geometries is proposed. We will show that the proposed method…
Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display excellent parallelization properties. Since current architecture trends are favoring regular compute…
The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for…