Monica Montardini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Monica Montardini has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Giancarlo Sangalli
Department of Mathematics University of Pavia IMATI-CNR 27100 Pavia Italy
9 shared publications - Mattia Tani
Dipartimento di Matematica "F. Casorati" Università di Pavia Via A. Ferrata 5 27100 Pavia Italy
6 shared publications Giancarlo Sangalli
Dipartimento di Matematica "F. Casorati" Università di Pavia Via A. Ferrata 1 27100 Pavia Italy
2 shared publicationsMattia Tani
2 shared publications- Daniele Prada
IMATI “E. Magenes”, CNR, Pavia, Italy
1 shared publication - Filippo Remonato
NTNU
1 shared publication
Latest Publications
- Open Access
- 12 February 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (1) , 12
Space-time isogeometric method for a nonlocal parabolic problem
In the present work, we focus on the space-time isogeometric discretization of a parabolic problem with a nonlocal diffusion coefficient. The existence and uniqueness of the solution for the continuous space-time variational formulation are proven. We prove the existence of the discrete solution and also establish the a priori error estimate for the space-time isogeometric scheme. The non-linear system is linearized through Picard’s method, and a suitable preconditioner for the linearized system is provided. Finally, to confirm the theoretical findings, the results of some numerical experiments are presented.
- 12 February 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (1) , 12
Open AccessSpace-time isogeometric method for a nonlocal parabolic problem
In the present work, we focus on the space-time isogeometric discretization of a parabolic problem with a nonlocal diffusion coefficient. The existence and uniqueness of the solution for the continuous space-time variational formulation are proven. We prove the existence of the discrete solution and also establish the a priori error estimate for the space-time isogeometric scheme. The non-linear system is linearized through Picard’s method, and a suitable preconditioner for the linearized system is provided. Finally, to confirm the theoretical findings, the results of some numerical experiments are presented.
- Open Access
The Isogeometric Fast Fourier-based Diagonalization method
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.
Open AccessThe Isogeometric Fast Fourier-based Diagonalization method
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.
- Open Access
- 6 April 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 189, 86-108
A low-rank solver for conforming multipatch Isogeometric Analysis
- 6 April 2025
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 189, 86-108
Open AccessA low-rank solver for conforming multipatch Isogeometric Analysis
- Open Access
- 3 April 2025
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 441
Space–time Isogeometric Analysis of cardiac electrophysiology
- 3 April 2025
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 441
Open AccessSpace–time Isogeometric Analysis of cardiac electrophysiology
- Open Access
The virtual element method on polygonal pixel-based tessellations
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains obtained as the union of squared elements out of a uniform structured mesh, such as the one that naturally arises when the domain is issued from an image. We show, both theoretically and numerically, that resorting to the use of polygonal elements allows to satisfy, for any order, the assumptions required for the stability of the method, thus allowing to fully exploit the potential of higher order methods, the efficiency of which is ensured by a novel static condensation strategy acting on the edges of the decomposition.
Open AccessThe virtual element method on polygonal pixel-based tessellations
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains obtained as the union of squared elements out of a uniform structured mesh, such as the one that naturally arises when the domain is issued from an image. We show, both theoretically and numerically, that resorting to the use of polygonal elements allows to satisfy, for any order, the assumptions required for the stability of the method, thus allowing to fully exploit the potential of higher order methods, the efficiency of which is ensured by a novel static condensation strategy acting on the edges of the decomposition.
- Open Access
- 3 October 2023
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 417
A low-rank isogeometric solver based on Tucker tensors
- 3 October 2023
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 417
Open AccessA low-rank isogeometric solver based on Tucker tensors
- Open Access
A low-rank isogeometric solver based on Tucker tensors
We propose an isogeometric solver for Poisson problems that combines i)low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated Preconditioned Conjugate Gradient solver to keep the rank of the iterates low, and iii) a novel low-rank preconditioner, based on the Fast Diagonalization method where the eigenvector multiplication is approximated by the Fast Fourier Transform. Although the proposed strategy is written in arbitrary dimension, we focus on the three-dimensional case and adopt the Tucker format for low-rank tensor representation, which is well suited in low dimension. We show by numerical tests that this choice guarantees significant memory saving compared to the full tensor representation. We also extend and test the proposed strategy to linear elasticity problems.
Open AccessA low-rank isogeometric solver based on Tucker tensors
We propose an isogeometric solver for Poisson problems that combines i)low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated Preconditioned Conjugate Gradient solver to keep the rank of the iterates low, and iii) a novel low-rank preconditioner, based on the Fast Diagonalization method where the eigenvector multiplication is approximated by the Fast Fourier Transform. Although the proposed strategy is written in arbitrary dimension, we focus on the three-dimensional case and adopt the Tucker format for low-rank tensor representation, which is well suited in low dimension. We show by numerical tests that this choice guarantees significant memory saving compared to the full tensor representation. We also extend and test the proposed strategy to linear elasticity problems.
- Open Access
An efficient solver for space-time isogeometric Galerkin methods for parabolic problems
In this work we focus on the preconditioning of a Galerkin space-time isogeometric discretization of the heat equation. Exploiting the tensor product structure of the basis functions in the parametric domain, we propose a preconditioner that is the sum of Kronecker products of matrices and that can be efficiently applied thanks to an extension of the classical Fast Diagonalization method. The preconditioner is robust w.r.t. the polynomial degree of the spline space and the time required for the application is almost proportional to the number of degrees-of-freedom, for a serial execution. By incorporating some information on the geometry parametrization and on the equation coefficients, we keep high efficiency with non-trivial domains and variable thermal conductivity and heat capacity coefficients.
Open AccessAn efficient solver for space-time isogeometric Galerkin methods for parabolic problems
In this work we focus on the preconditioning of a Galerkin space-time isogeometric discretization of the heat equation. Exploiting the tensor product structure of the basis functions in the parametric domain, we propose a preconditioner that is the sum of Kronecker products of matrices and that can be efficiently applied thanks to an extension of the classical Fast Diagonalization method. The preconditioner is robust w.r.t. the polynomial degree of the spline space and the time required for the application is almost proportional to the number of degrees-of-freedom, for a serial execution. By incorporating some information on the geometry parametrization and on the equation coefficients, we keep high efficiency with non-trivial domains and variable thermal conductivity and heat capacity coefficients.
- Open Access
A domain decomposition method for Isogeometric multi-patch problems with inexact local solvers
In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit the tensor product structure at the patch level. To this purpose, we extend to the isogeometric framework the so-called All-Floating variant of FETI, that allows us to use the Fast Diagonalization method at the patch level. We construct then a preconditioner for the whole system and prove its robustness with respect to the local mesh-size $h$ and patch-size $H$ (i.e., we have scalability). Our numerical tests confirm the theory and also show a favourable dependence of the computational cost of the method from the spline degree $p$.Open AccessA domain decomposition method for Isogeometric multi-patch problems with inexact local solvers
In Isogeometric Analysis, the computational domain is often described as multi-patch, where each patch is given by a tensor product spline/NURBS parametrization. In this work we propose a FETI-like solver where local inexact solvers exploit the tensor product structure at the patch level. To this purpose, we extend to the isogeometric framework the so-called All-Floating variant of FETI, that allows us to use the Fast Diagonalization method at the patch level. We construct then a preconditioner for the whole system and prove its robustness with respect to the local mesh-size $h$ and patch-size $H$ (i.e., we have scalability). Our numerical tests confirm the theory and also show a favourable dependence of the computational cost of the method from the spline degree $p$. - Open Access
- 24 September 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (323) , 1193-1227
Space–time least–squares isogeometric method and efficient solver for parabolic problems
In this paper, we propose a space-time least-squares isogeometric method to solve parabolic evolution problems, well suited for high-degree smooth splines in the space-time domain. We focus on the linear solver and its computational efficiency: thanks to the proposed formulation and to the tensor-product construction of space-time splines, we can design a preconditioner whose application requires the solution of a Sylvester-like equation, which is performed efficiently by the fast diagonalization method. The preconditioner is robust w.r.t. spline degree and mesh size. The computational time required for its application, for a serial execution, is almost proportional to the number of degrees-of-freedom and independent of the polynomial degree. The proposed approach is also well-suited for parallelization.
- 24 September 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (323) , 1193-1227
Open AccessSpace–time least–squares isogeometric method and efficient solver for parabolic problems
In this paper, we propose a space-time least-squares isogeometric method to solve parabolic evolution problems, well suited for high-degree smooth splines in the space-time domain. We focus on the linear solver and its computational efficiency: thanks to the proposed formulation and to the tensor-product construction of space-time splines, we can design a preconditioner whose application requires the solution of a Sylvester-like equation, which is performed efficiently by the fast diagonalization method. The preconditioner is robust w.r.t. spline degree and mesh size. The computational time required for its application, for a serial execution, is almost proportional to the number of degrees-of-freedom and independent of the polynomial degree. The proposed approach is also well-suited for parallelization.