A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis
From MaRDI portal
Publication:1663833
DOI10.1016/J.CAMWA.2017.06.013zbMATH Open1475.65177arXiv1705.04384OpenAlexW2615767956MaRDI QIDQ1663833FDOQ1663833
Publication date: 24 August 2018
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Abstract: In the context of isogeometric analysis, we consider two discretization approaches that make the resulting stiffness matrix nonsymmetric even if the differential operator is self-adjoint. These are the collocation method and the recently-developed weighted quadrature for the Galerkin discretization. In this paper, we are interested in the solution of the linear systems arising from the discretization of the Poisson problem using one of these approaches. In [SIAM J. Sci. Comput. 38(6) (2016) pp. A3644--A3671], a well-established direct solver for linear systems with tensor structure was used as a preconditioner in the context of Galerkin isogeometric analysis, yielding promising results. In particular, this preconditioner is robust with respect to the mesh size and the spline degree . In the present work, we discuss how a similar approach can applied to the considered nonsymmetric linear systems. The efficiency of the proposed preconditioning strategy is assessed with numerical experiments on two-dimensional and three-dimensional problems.
Full work available at URL: https://arxiv.org/abs/1705.04384
Recommendations
- Preconditioning for linear systems arising from IgA discretized incompressible Navier-Stokes equations
- Isogeometric preconditioners based on fast solvers for the Sylvester equation
- Non-overlapping domain decomposition solution schemes for structural mechanics isogeometric analysis
- On the computational efficiency of isogeometric methods for smooth elliptic problems using direct solvers
- On the robust solution of an isogeometric discretization of bilaplacian equation by using multigrid methods
Numerical computation using splines (65D07) Boundary value problems for second-order elliptic equations (35J25) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- \textsc{GeoPDEs}: a research tool for isogeometric analysis of PDEs
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Spectral Methods
- On the existence of interpolating projections onto spline spaces
- Isogeometric collocation: cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations
- ISOGEOMETRIC COLLOCATION METHODS
- Isogeometric collocation for elastostatics and explicit dynamics
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Isogeometric Analysis
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- High-Order Methods for Incompressible Fluid Flow
- Collocation at Gaussian Points
- Efficient quadrature for NURBS-based isogeometric analysis
- Title not available (Why is that?)
- Matrix-equation-based strategies for convection-diffusion equations
- Preconditioning by Fast Direct Methods for Nonself-Adjoint Nonseparable Elliptic Equations
- Optimal Equivalent Preconditioners
- Robust and optimal multi-iterative techniques for Iga collocation linear systems
- Reduced Bézier element quadrature rules for quadratic and cubic splines in isogeometric analysis
- Selective and reduced numerical integrations for NURBS-based isogeometric analysis
- A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis
- Direct solution of partial difference equations by tensor product methods
- Spectral Analysis of Hermite Cubic Spline Collocation Systems
- Norms and exclusion theorems
- The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
- Isogeometric preconditioners based on fast solvers for the Sylvester equation
- The variational collocation method
- Optimal quadrature for univariate and tensor product splines
- Overlapping Schwarz preconditioners for isogeometric collocation methods
- Low rank tensor methods in Galerkin-based isogeometric analysis
- An isogeometric collocation method using superconvergent points
- Matrix Generation in Isogeometric Analysis by Low Rank Tensor Approximation
- Fast formation of isogeometric Galerkin matrices by weighted quadrature
- Optimal-order isogeometric collocation at Galerkin superconvergent points
Cited In (7)
- Matrix-free weighted quadrature for a computationally efficient isogeometric \(k\)-method
- Enhanced domain decomposition Schwarz solution schemes for isogeometric collocation methods
- Overlapping Schwarz methods for isogeometric analysis based on generalized B-splines
- Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up
- Overlapping additive Schwarz preconditioners for isogeometric collocation discretizations of linear elasticity
- Efficient Direct Space-Time Finite Element Solvers for Parabolic Initial-Boundary Value Problems in Anisotropic Sobolev Spaces
- Parallel and Robust Preconditioning for Space-Time Isogeometric Analysis of Parabolic Evolution Problems
Uses Software
This page was built for publication: A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663833)
