4,714 research outputs found
Matrix-free weighted quadrature for a computationally efficient isogeometric -method
The -method is the isogeometric method based on splines (or NURBS, etc.)
with maximum regularity. When implemented following the paradigms of classical
finite element methods, the computational resources required by the method
are prohibitive even for moderate degree. In order to address this issue, we
propose a matrix-free strategy combined with weighted quadrature, which is an
ad-hoc strategy to compute the integrals of the Galerkin system. Matrix-free
weighted quadrature (MF-WQ) speeds up matrix operations, and, perhaps even more
important, greatly reduces memory consumption. Our strategy also requires an
efficient preconditioner for the linear system iterative solver. In this work
we deal with an elliptic model problem, and adopt a preconditioner based on the
Fast Diagonalization method, an old idea to solve Sylvester-like equations. Our
numerical tests show that the isogeometric solver based on MF-WQ is faster than
standard approaches (where the main cost is the matrix formation by standard
Gaussian quadrature) even for low degree. But the main achievement is that,
with MF-WQ, the -method gets orders of magnitude faster by increasing the
degree, given a target accuracy. Therefore, we are able to show the
superiority, in terms of computational efficiency, of the high-degree
-method with respect to low-degree isogeometric discretizations. What we
present here is applicable to more complex and realistic differential problems,
but its effectiveness will depend on the preconditioner stage, which is as
always problem-dependent. This situation is typical of modern high-order
methods: the overall performance is mainly related to the quality of the
preconditioner
Maximum-principle preserving space-time isogeometric analysis
In this work we propose a nonlinear stabilization technique for
convection-diffusion-reaction and pure transport problems discretized with
space-time isogeometric analysis. The stabilization is based on a
graph-theoretic artificial diffusion operator and a novel shock detector for
isogeometric analysis. Stabilization in time and space directions are performed
similarly, which allow us to use high-order discretizations in time without any
CFL-like condition. The method is proven to yield solutions that satisfy the
discrete maximum principle (DMP) unconditionally for arbitrary order. In
addition, the stabilization is linearity preserving in a space-time sense.
Moreover, the scheme is proven to be Lipschitz continuous ensuring that the
nonlinear problem is well-posed. Solving large problems using a space-time
discretization can become highly costly. Therefore, we also propose a
partitioned space-time scheme that allows us to select the length of every time
slab, and solve sequentially for every subdomain. As a result, the
computational cost is reduced while the stability and convergence properties of
the scheme remain unaltered. In addition, we propose a twice differentiable
version of the stabilization scheme, which enjoys the same stability properties
while the nonlinear convergence is significantly improved. Finally, the
proposed schemes are assessed with numerical experiments. In particular, we
considered steady and transient pure convection and convection-diffusion
problems in one and two dimensions
A parallel multigrid solver for multi-patch Isogeometric Analysis
Isogeometric Analysis (IgA) is a framework for setting up spline-based
discretizations of partial differential equations, which has been introduced
around a decade ago and has gained much attention since then. If large spline
degrees are considered, one obtains the approximation power of a high-order
method, but the number of degrees of freedom behaves like for a low-order
method. One important ingredient to use a discretization with large spline
degree, is a robust and preferably parallelizable solver. While numerical
evidence shows that multigrid solvers with standard smoothers (like Gauss
Seidel) does not perform well if the spline degree is increased, the multigrid
solvers proposed by the authors and their co-workers proved to behave optimal
both in the grid size and the spline degree. In the present paper, the authors
want to show that those solvers are parallelizable and that they scale well in
a parallel environment.Comment: The first author would like to thank the Austrian Science Fund (FWF)
for the financial support through the DK W1214-04, while the second author
was supported by the FWF grant NFN S117-0
- …