# Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation

@article{Sangalli2016IsogeometricPB, title={Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation}, author={Giancarlo Sangalli and Mattia Tani}, journal={SIAM J. Sci. Comput.}, year={2016}, volume={38} }

We consider large linear systems arising from the isogeometric discretization of the Poisson problem on a single-patch domain. The numerical solution of such systems is considered a challenging task, particularly when the degree of the splines employed as basis functions is high. We consider a preconditioning strategy which is based on the solution of a Sylvester-like equation at each step of an iterative solver. We show that this strategy, which fully exploits the tensor structure that…

## Figures and Tables from this paper

## 70 Citations

PRECONDITIONERS FOR ISOGEOMETRIC ANALYSIS BASED ON SOLVERS FOR SYLVESTER EQUATION

- Mathematics, Computer Science
- 2016

A preconditioning strategy which is based on the solution of a Sylvesterlike equation at each step of an iterative solver, which fully exploits the tensor structure that underlies isogeometric problems, is robust with respect to both mesh size and spline degree.

A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis

- Computer ScienceComput. Math. Appl.
- 2017

Robust isogeometric preconditioners for the Stokes system based on the Fast Diagonalization method

- Computer ScienceComputer Methods in Applied Mechanics and Engineering
- 2018

A comparison of block preconditioners for isogeometric analysis discretizations of the incompressible Navier–Stokes equations

- Computer ScienceInternational Journal for Numerical Methods in Fluids
- 2021

The experiments show that the block preconditioners can be successfully applied to the systems arising from high continuity IgA, moreover, that the high continuity can bring some benefits in this context.

Matrix-free iterative solvers for isogeometric analysis

- Computer Science
- 2018

The overall strategy of IGA is discussed, which is very beneficial in terms of both memory and computational cost, and it is shown that memory required is practically independent of p and that the cost depends on p only mildly.

Isogeometric BDDC deluxe preconditioners for linear elasticity

- Computer Science, MathematicsMathematical Models and Methods in Applied Sciences
- 2018

The theory of Balancing Domain Decomposition by Constraints is extended to problems of linear elasticity in three dimensions, previously fully developed only for scalar elliptic problems in the plane.

ISOGEOMETRIC ANALYSIS FOR 2D AND 3D MHD SUBPROBLEMS: SPECTRAL SYMBOL AND FAST ITERATIVE SOLVERS

- Computer Science
- 2018

This talk focuses on a parameter-dependent curl-div subproblem and it is discretized using isogeometric analysis based on tensor product B-splines and applies the theory of (multilevel block) Toeplitz and generalized locally ToEplitz sequences to design fast iterative solvers for the corresponding linear systems.

Matrix-free weighted quadrature for a computationally efficient isogeometric k-method

- Computer ScienceComputer Methods in Applied Mechanics and Engineering
- 2018

BPX preconditioners for isogeometric analysis using analysis-suitable T-splines

- Computer ScienceIMA Journal of Numerical Analysis
- 2018

Two Bramble-Pasciak-Xu (BPX) preconditioners are developed: the first on the basis of local smoothing only for the functions affected by a newly added edge by bisection and the second after adding all the edges of the same level, which prove that both methods have optimal complexity.

A two level method for isogeometric discretizations

- Computer ScienceArXiv
- 2020

A two-level method such that a discretization of order $p$ is considered in the first level whereas the second level consists of a linear or quadratic discretizations, which is efficient and robust with respect to the spline degree $p$.

## References

SHOWING 1-10 OF 45 REFERENCES

Overlapping Schwarz Methods for Isogeometric Analysis

- Computer ScienceSIAM J. Numer. Anal.
- 2012

An an overlapping Schwarz preconditioner for elliptic problems discretized with isogeometric analysis is constructed, showing in particular that the resulting algorithm is scalable and its convergence rate depends linearly on the ratio between subdomain and „overlap sizes” for fixed polynomial degree $p$ and regularity of the basis functions.

Robust and optimal multi-iterative techniques for IgA Galerkin linear systems

- Computer Science
- 2015

The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements

- Computer ScienceSIAM J. Sci. Comput.
- 2013

This paper studies how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form, and provides theoretical estimates for the increase in cost of the matrix-vector product and for the construction and application of black-box preconditioners.

Isogeometric analysis : CAD, finite elements, NURBS, exact geometry and mesh refinement

- Mathematics
- 2005

Mathematical analysis of variational isogeometric methods*

- Computer Science, MathematicsActa Numerica
- 2014

This review paper collects several results that form part of the theoretical foundation of isogeometric methods. We analyse variational techniques for the numerical resolution of PDEs based on…

The cost of continuity: A study of the performance of isogeometric finite elements using direct solvers

- Computer Science
- 2012