Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.20269

The Isogeometric Fast Fourier-based Diagonalization method

Monica Montardini·Stefan Takacs·Mattia Tani
View original source ↗Read source document ↗Export metadata ↓

Abstract

The construction of robust solvers for linear systems obtained from the discretization of partial differential equations using Isogeometric Analysis is challenging since the condition number of the system matrix not only grows with the reciprocal square of the grid size (for second order problems), but also exponentially with the spline degree. The Fast Diagonalization method allows the construction of a preconditioner that is robust both in grid size and spline degree. Although this method is efficient in practice, its computational complexity is superlinear in the number of degrees of freedom. In this work, we construct a variant of the Fast Diagonalization method that can exploit the Fast Fourier Transformation. Note that, because of boundary effects, a Fourier Transformation cannot diagonalize the overall problem. We circumvent this issue using a stable splitting of the spline space. The resulting preconditioner is still robust with respect to the grid size and spline degree and can be realized with a computational complexity that grows almost linearly with the number of degrees of freedom.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Monica Montardini, Stefan Takacs, Mattia Tani. 2025-12-23. The Isogeometric Fast Fourier-based Diagonalization method. https://arxiv.org/abs/2512.20269

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗