Silvano Pitassi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Silvano Pitassi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ruben Specogna
EMC Lab, University of Udine, Udine, Italy
9 shared publications - Francesco Trevisan
Polytechnic Department of Engineering and Architecture University of Udine EMCLab via delle scienze 206 33100 Udine Italy
4 shared publications - Riccardo Ghiloni
Dipartimento di Matematica Università di Trento Via Sommarive 14 I-38123 Povo Trento Italy
4 shared publications - Antonino Vacalebre
EMCLab, DPIA, University of Udine, Udine, Italy
1 shared publication - Daniele Antonio Di Pietro
IMAG Univ Montpellier CNRS Montpellier France
1 shared publication - Francesco Trevisan
EMC Lab, University of Udine, Udine, Italy
1 shared publication
Latest Publications
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. PP (00189464) , 1
Treatment of curved faces with the generalized dual complex
We present a new geometry-based numerical method that converges on grids with curved (i.e., non-planar) faces. Notably, it employs only one degree of freedom (DoF) per curved face. This is achieved by introducing a novel generalized dual grid, which is not constructed via barycentric subdivision, as in standard discrete geometric approaches, but is instead derived directly from the geometry of the curved faces. Crucially, the generalized dual grid is used in the numerical scheme in the same way as the standard barycentric one. As a result, all the foundational principles of geometric methods remain applicable to our new numerical approach.
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. PP (00189464) , 1
Treatment of curved faces with the generalized dual complex
We present a new geometry-based numerical method that converges on grids with curved (i.e., non-planar) faces. Notably, it employs only one degree of freedom (DoF) per curved face. This is achieved by introducing a novel generalized dual grid, which is not constructed via barycentric subdivision, as in standard discrete geometric approaches, but is instead derived directly from the geometry of the curved faces. Crucially, the generalized dual grid is used in the numerical scheme in the same way as the standard barycentric one. As a result, all the foundational principles of geometric methods remain applicable to our new numerical approach.
- Open Access
The curved Mimetic Finite Difference method: allowing grids with curved faces
We present a new mimetic finite difference method for diffusion problems that converges on grids with \textit{curved} (i.e., non-planar) faces. Crucially, it gives a symmetric discrete problem that uses only one discrete unknown per curved face. The principle at the core of our construction is to abandon the standard definition of local consistency of mimetic finite difference methods. Instead, we exploit the novel and global concept of $P_{0}$-consistency. Numerical examples confirm the consistency and the optimal convergence rate of the proposed mimetic method for cubic grids with randomly perturbed nodes as well as grids with curved boundaries.
Open AccessThe curved Mimetic Finite Difference method: allowing grids with curved faces
We present a new mimetic finite difference method for diffusion problems that converges on grids with \textit{curved} (i.e., non-planar) faces. Crucially, it gives a symmetric discrete problem that uses only one discrete unknown per curved face. The principle at the core of our construction is to abandon the standard definition of local consistency of mimetic finite difference methods. Instead, we exploit the novel and global concept of $P_{0}$-consistency. Numerical examples confirm the consistency and the optimal convergence rate of the proposed mimetic method for cubic grids with randomly perturbed nodes as well as grids with curved boundaries.
- 15 June 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 490
The curved mimetic finite difference method: Allowing grids with curved faces
- 15 June 2023
- Published by Elsevier in Journal of Computational Physics
- Vol. 490
The curved mimetic finite difference method: Allowing grids with curved faces
- Open Access
- 24 May 2023
- Published by Springer Nature in Calcolo
- Vol. 60 (2) , 1-25
Cohomology of the discrete de Rham complex on domains of general topology
In this work we prove that, for a general polyhedral domain of $$\mathbb {R}^3$$ , the cohomology spaces of the discrete de Rham complex of Di Pietro and Droniou (Found Comput Math 23:85–164, 2023, https://doi.org/10.1007/s10208-021-09542-8) are isomorphic to those of the continuous de Rham complex. This is, to the best of our knowledge, the first result of this kind for a fully computable arbitrary-order complex built from a general polyhedral mesh.- 24 May 2023
- Published by Springer Nature in Calcolo
- Vol. 60 (2) , 1-25
Open AccessCohomology of the discrete de Rham complex on domains of general topology
In this work we prove that, for a general polyhedral domain of $$\mathbb {R}^3$$ , the cohomology spaces of the discrete de Rham complex of Di Pietro and Droniou (Found Comput Math 23:85–164, 2023, https://doi.org/10.1007/s10208-021-09542-8) are isomorphic to those of the continuous de Rham complex. This is, to the best of our knowledge, the first result of this kind for a fully computable arbitrary-order complex built from a general polyhedral mesh. - 24 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
A Novel Family of Inductance Matrix Compression Techniques
Integral methods for the solution of eddy current problems are very appealing since they avoid the meshing of the insulating regions. Yet, their main shortcoming is that they require the assembly and storage of a fully populated stiffness matrix K. To reduce the memory footprint and to enable a fast matrix construction, low-rank approximations techniques-like the Adaptive Cross Approximation (ACA)-have been considered a major breakthrough in the field. This paper presents a novel family of compression techniques that is enabled by a novel explicit factorization of the inductance matrix. Such a novel family exhibits orders of magnitude speedup and memory consumption with respect to state-of-the-art techniques. In particular, the aim of this paper is to compare for the first time the memory occupation, computation time and accuracy of the solution obtained with different compression techniques.
- 24 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
A Novel Family of Inductance Matrix Compression Techniques
Integral methods for the solution of eddy current problems are very appealing since they avoid the meshing of the insulating regions. Yet, their main shortcoming is that they require the assembly and storage of a fully populated stiffness matrix K. To reduce the memory footprint and to enable a fast matrix construction, low-rank approximations techniques-like the Adaptive Cross Approximation (ACA)-have been considered a major breakthrough in the field. This paper presents a novel family of compression techniques that is enabled by a novel explicit factorization of the inductance matrix. Such a novel family exhibits orders of magnitude speedup and memory consumption with respect to state-of-the-art techniques. In particular, the aim of this paper is to compare for the first time the memory occupation, computation time and accuracy of the solution obtained with different compression techniques.
- Open Access
- 27 June 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 466, 111404
Inverting the discrete curl operator: A novel graph algorithm to find a vector potential of a given vector field
- 27 June 2022
- Published by Elsevier in Journal of Computational Physics
- Vol. 466, 111404
Open AccessInverting the discrete curl operator: A novel graph algorithm to find a vector potential of a given vector field
- 22 February 2022
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 392
Foundations of volume integral methods for eddy current problems
- 22 February 2022
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 392
Foundations of volume integral methods for eddy current problems
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 57 (6) , 1-4
New Magic Formula Demonstration Shows Unexpected Features of Geometrically Defined Matrices for Polyhedral Grids
Magic formulas are the geometric identities at the root of modern compatible schemes for polyhedral grids. We present rigorous yet elementary proofs of the magic formulas originating from Stokes theorem. The proofs enlighten new fundamental aspects of the mass matrices produced with the magic formulas. First, the construction of the mass matrices works for an unexpectedly broad type of mesh cells. Second, they show that dual nodes can be arbitrarily positioned thus extending the construction of the dual barycentric grid.
- 19 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 57 (6) , 1-4
New Magic Formula Demonstration Shows Unexpected Features of Geometrically Defined Matrices for Polyhedral Grids
Magic formulas are the geometric identities at the root of modern compatible schemes for polyhedral grids. We present rigorous yet elementary proofs of the magic formulas originating from Stokes theorem. The proofs enlighten new fundamental aspects of the mass matrices produced with the magic formulas. First, the construction of the mass matrices works for an unexpectedly broad type of mesh cells. Second, they show that dual nodes can be arbitrarily positioned thus extending the construction of the dual barycentric grid.
- Open Access
- 19 February 2021
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 377, 113699
Explicit geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids
- 19 February 2021
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 377, 113699
Open AccessExplicit geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids
- Open Access
Explicit geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids
The geometric reinterpretation of the Finite Element Method (FEM) shows that Raviart Thomas and Nedelec mass matrices map from degrees of freedoms (DoFs) attached to geometric elements of a tetrahedral grid to DoFs attached to the barycentric dual grid. The algebraic inverses of the mass matrices map DoFs attached to the barycentric dual grid back to DoFs attached to the corresponding primal tetrahedral grid, but they are of limited practical use since they are dense. In this paper we present a new geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids and possibly anisotropic materials, debunking the conventional wisdom that the barycentric dual grid prohibits a sparse representation for inverse mass matrices. In particular, we provide a unified framework for the construction of both edge and face mass matrices and their sparse inverses. Such a unifying principle relies on novel geometric reconstruction formulas, from which, according to a well established design strategy, local mass matrices are constructed as the sum of a consistent and a stabilization term. A major difference with the approaches proposed so far is that the consistent term is defined geometrically and explicitly, that is, without the necessity of computing the inverses of local matrices. This provides a sensible speedup and an easier implementation. We use these new sparse inverse mass matrices to discretize a three dimensional Poisson problem, providing the comparison between the results obtained by various formulations on a benchmark problem with analytical solution.
Open AccessExplicit geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids
The geometric reinterpretation of the Finite Element Method (FEM) shows that Raviart Thomas and Nedelec mass matrices map from degrees of freedoms (DoFs) attached to geometric elements of a tetrahedral grid to DoFs attached to the barycentric dual grid. The algebraic inverses of the mass matrices map DoFs attached to the barycentric dual grid back to DoFs attached to the corresponding primal tetrahedral grid, but they are of limited practical use since they are dense. In this paper we present a new geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids and possibly anisotropic materials, debunking the conventional wisdom that the barycentric dual grid prohibits a sparse representation for inverse mass matrices. In particular, we provide a unified framework for the construction of both edge and face mass matrices and their sparse inverses. Such a unifying principle relies on novel geometric reconstruction formulas, from which, according to a well established design strategy, local mass matrices are constructed as the sum of a consistent and a stabilization term. A major difference with the approaches proposed so far is that the consistent term is defined geometrically and explicitly, that is, without the necessity of computing the inverses of local matrices. This provides a sensible speedup and an easier implementation. We use these new sparse inverse mass matrices to discretize a three dimensional Poisson problem, providing the comparison between the results obtained by various formulations on a benchmark problem with analytical solution.