arXiv subjects

Gianmarco Manzini

Publications and source records attributed to Gianmarco Manzini.

At least 19 recordsLinked to original sources

arXiv2026

A higher order pressure-stabilized virtual element formulation for the Stokes-Poisson-Boltzmann equations

Electrokinetic phenomena in nanopore sensors and microfluidic devices require accurate simulation of coupled fluid-electrostatic interactions in geometrically complex domains with irregular boundaries and adaptive mesh refinement. We develop an equal-order virtual element method for the Stokes--Poisson--Boltzmann equations that naturally handles general polygonal meshes, including meshes with hanging nodes, without requiring special treatment or remeshing. The key innovation is a residual-based pressure stabilization scheme derived by reformulating the Laplacian drag force in the momentum equation as a weighted advection term involving the nonlinear Poisson--Boltzmann equation, thereby eliminating second-order derivative terms while maintaining theoretical rigor. Well-posedness of the coupled stabilized problem is established using the Banach and Brouwer fixed-point theorems under sufficiently small data assumptions, and optimal a priori error estimates are derived in the energy norm with convergence rates of order $\mathcal{O}(h^k)$ for approximation degree $k \geq 1$. Numerical experiments on diverse polygonal meshes -- including distorted elements, non-convex polygons, Voronoi tessellations, and configurations with hanging nodes -- confirm optimal convergence rates, validating theoretical predictions. Applications to electro-osmotic flows in nanopore sensors with complex obstacle geometries illustrate the method's practical utility for engineering simulations. Compared to Taylor--Hood finite element formulations, the equal-order approach simplifies implementation through uniform polynomial treatment of all fields and offers native support for general polygonal elements.

math.NA↗

arXiv2026

Conforming and non-conforming virtual element methods for the biharmonic Steklov eigenvalue problem with minimum regularity

In this work, we analyze the conforming and $C^0$-non-conforming Virtual Element Method for a fourth-order Steklov eigenvalue problem on a generally shaped, possibly nonconvex, polygonal domain. By employing an {\it enriching } operator, we derive the convergence analysis using the discrete $H^2$ seminorm, and the $H^1$ and $L^2$ norms. We use the Babuška--Osborn spectral theory \cite{BO} to prove that the numerical scheme approximates the spectrum without introducing any spurious eigenvalue. Moreover, we derive the optimal order of convergence for eigenfunctions and double order for eigenvalues. We assess the performance of the method on several numerical tests using different families of polygonal meshes.

math.NA↗

arXiv2025

The low-rank tensor-train finite difference method for three-dimensional parabolic equations

This paper presents a numerical framework for the low-rank approximation of the solution to three-dimensional parabolic problems. The key contribution of this work is the tensorization process based on a tensor-train reformulation of the second-order accurate finite difference method. We advance the solution in time by combining the finite difference method with an explicit and implicit Euler method and with the Crank-Nicolson method. We solve the linear system arising at each time step from the implicit and semi-implicit time-marching schemes through a matrix-free preconditioned conjugate gradient (PCG) method, appositely designed to exploit the separation of variables induced by the tensor-train format. We assess the performance of our method through extensive numerical experimentation, demonstrating that the tensor-train design offers a robust and highly efficient alternative to the traditional approach. Indeed, the usage of this type of representation leads to massive time and memory savings while guaranteeing almost identical accuracy with respect to the traditional one. These features make the method particularly suitable to tackle challenging high-dimensional problems.

math.NA↗

arXiv2025

A Fast, Accurate and Oscillation-free Spectral Collocation Solver for High-dimensional Transport Problems

Transport phenomena-describing the movement of particles, energy, or other physical quantities-are fundamental in various scientific disciplines, including nuclear physics, plasma physics, astrophysics, engineering, and the natural sciences. However, solving the associated seven-dimensional transport equations poses a significant computational challenge due to the curse of dimensionality. We introduce the Tensor Train Superconsistent Spectral (T${^2}$S${^2}$) solver to address this challenge, integrating Spectral Collocation for exponential convergence, Superconsistency for stabilization in transport-dominated regimes, and Tensor Train format for substantial data compression. T${^2}$S${^2}$ enforces a dimension-wise superconsistent condition compatible with tensor structures, achieving extremely low compression ratios, in the order of $(10^{-12})$, while preserving spectral accuracy. Numerical experiments on linear problems demonstrate that T${^2}$S${^2}$ can solve high-dimensional transport problems in minutes on standard hardware, making previously intractable problems computationally feasible. This advancement opens new avenues for efficiently and accurately modeling complex transport phenomena.

math.NA↗

arXiv2025

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the two-dimensional linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. Our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented, which includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method's performance in the numerical approximation of three representative test cases.

math.NA↗

arXiv2024

The eXtended Virtual Element Method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The XVEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method's accuracy on various mesh families, demonstrating optimal convergence rates in the $L^2$- and $H^1$-norms on fractured or L-shaped domains.

math.NA↗

arXiv2024

Mesh Optimization for the Virtual Element Method: How Small Can an Agglomerated Mesh Become?

We present an optimization procedure for generic polygonal or polyhedral meshes, tailored for the Virtual Element Method (VEM). Once the local quality of the mesh elements is analyzed through a quality indicator specific to the VEM, groups of elements are agglomerated to optimize the global mesh quality. The resulting discretization is significantly lighter: we can remove up to 80$\%$ of the mesh elements, based on a user-set parameter, thus reducing the number of faces, edges, and vertices. This results in a drastic reduction of the total number of degrees of freedom associated with a discrete problem defined over the mesh with the VEM, in particular, for high-order formulations. We show how the VEM convergence rate is preserved in the optimized meshes, and the approximation errors are comparable with those obtained with the original ones. We observe that the optimization has a regularization effect over low-quality meshes, removing the most pathological elements. This regularization effect is evident in cases where the original meshes cause the VEM to diverge, while the optimized meshes lead to convergence. We conclude by showing how the optimization of a real CAD model can be used effectively in the simulation of a time-dependent problem.

math.NA↗

arXiv2024

The Tensor-Train Stochastic Finite Volume Method for Uncertainty Quantification

The stochastic finite volume method offers an efficient one-pass approach for assessing uncertainty in hyperbolic conservation laws. Still, it struggles with the curse of dimensionality when dealing with multiple stochastic variables. We introduce the stochastic finite volume method within the tensor-train framework to counteract this limitation. This integration, however, comes with its own set of difficulties, mainly due to the propensity for shock formation in hyperbolic systems. To overcome these issues, we have developed a tensor-train-adapted stochastic finite volume method that employs a global WENO reconstruction, making it suitable for such complex systems. This approach represents the first step in designing tensor-train techniques for hyperbolic systems and conservation laws involving shocks.

math.NA↗

arXiv2024

Tensor Network Space-Time Spectral Collocation Method for Time Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of Partial Differential Equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultrafast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for solution of the time dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time dependent PDEs often use finite difference for time, and a spectral scheme for the spatial dimensions, which leads to slow linear convergence. Spectral collocation space-time methods show exponential convergence, however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to very high compression of linear operators from terabytes to kilobytes in TT-format, and tens of thousands times speedup when compared to full grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

math.NA↗

arXiv2023

High-order finite element method for atomic structure calculations

We introduce \texttt{featom}, an open source code that implements a high-order finite element solver for the radial Schrödinger, Dirac, and Kohn-Sham equations. The formulation accommodates various mesh types, such as uniform or exponential, and the convergence can be systematically controlled by increasing the number and/or polynomial order of the finite element basis functions. The Dirac equation is solved using a squared Hamiltonian approach to eliminate spurious states. To address the slow convergence of the $κ=\pm1$ states due to divergent derivatives at the origin, we incorporate known asymptotic forms into the solutions. We achieve a high level of accuracy ($10^{-8}$ Hartree) for total energies and eigenvalues of heavy atoms such as uranium in both Schrödinger and Dirac Kohn-Sham solutions. We provide detailed convergence studies and computational parameters required to attain commonly required accuracies. Finally, we compare our results with known analytic results as well as the results of other methods. In particular, we calculate benchmark results for atomic numbers ($Z$) from 1 to 92, verifying current benchmarks. We demonstrate significant speedup compared to the state-of-the-art shooting solver \texttt{dftatom}. An efficient, modular Fortran 2008 implementation, is provided under an open source, permissive license, including examples and tests, wherein particular emphasis is placed on the independence (no global variables), reusability, and generality of the individual routines.

physics.atom-ph↗

arXiv2023

Tensor Networks for Solving Realistic Time-independent Boltzmann Neutron Transport Equation

Tensor network techniques, known for their low-rank approximation ability that breaks the curse of dimensionality, are emerging as a foundation of new mathematical methods for ultra-fast numerical solutions of high-dimensional Partial Differential Equations (PDEs). Here, we present a mixed Tensor Train (TT)/Quantized Tensor Train (QTT) approach for the numerical solution of time-independent Boltzmann Neutron Transport equations (BNTEs) in Cartesian geometry. Discretizing a realistic three-dimensional (3D) BNTE by (i) diamond differencing, (ii) multigroup-in-energy, and (iii) discrete ordinate collocation leads to huge generalized eigenvalue problems that generally require a matrix-free approach and large computer clusters. Starting from this discretization, we construct a TT representation of the PDE fields and discrete operators, followed by a QTT representation of the TT cores and solving the tensorized generalized eigenvalue problem in a fixed-point scheme with tensor network optimization techniques. We validate our approach by applying it to two realistic examples of 3D neutron transport problems, currently solved by the PARallel TIme-dependent SN (PARTISN) solver. We demonstrate that our TT/QTT method, executed on a standard desktop computer, leads to a yottabyte compression of the memory storage, and more than 7500 times speedup with a discrepancy of less than 1e-5 when compared to the PARTISN solution.

math.NA↗

arXiv2023

A $C^1$-conforming arbitrary-order two-dimensional virtual element method for the fourth-order phase-field equation

We present a two-dimensional conforming virtual element method for the fourth-order phase-field equation. Our proposed numerical approach to the solution of this high-order phase-field (HOPF) equation relies on the design of an arbitrary-order accurate, virtual element space with $C^1$ global regularity. Such regularity is guaranteed by taking the values of the virtual element functions and their full gradient at the mesh vertices as degrees of freedom. Attaining high-order accuracy requires also edge polynomial moments of the trace of the virtual element functions and their normal derivatives. In this work, we detail the scheme construction, and prove its convergence by deriving error estimates in different norms. A set of representative test cases allows us to assess the behavior of the method.

math.NA↗

arXiv2022

The Virtual Element Method for the 3D Resistive Magnetohydrodynamic model

We present a four-field Virtual Element discretization for the time-dependent resistive Magnetohydrodynamics equations in three space dimensions, focusing on the semi-discrete formulation. The proposed method employs general polyhedral meshes and guarantees velocity and magnetic fields that are divergence free up to machine precision. We provide a full convergence analysis under suitable regularity assumptions, which is validated by some numerical tests.

math.NA↗

arXiv2022

Energy-conserving explicit and implicit time integration methods for the multi-dimensional Hermite-DG discretization of the Vlasov-Maxwell equations

We study the conservation properties of the Hermite-discontinuous Galerkin (Hermite-DG) approximation of the Vlasov-Maxwell equations. In this semi-discrete formulation, the total mass is preserved independently for every plasma species. Further, an energy invariant exists if central numerical fluxes are used in the DG approximation of Maxwell's equations, while a dissipative term is present when upwind fluxes are employed. In general, traditional temporal integrators might fail to preserve invariants associated with conservation laws during the time evolution. Hence, we analyze the capability of explicit and implicit Runge-Kutta (RK) temporal integrators to preserve such invariants. Since explicit RK methods can only ensure preservation of linear invariants but do not provide any control on the system energy, we consider modified explicit RK methods in the family of relaxation Runge-Kutta methods (RRK). These methods can be tuned to preserve the energy invariant at the continuous or semi-discrete level, a distinction that is important when upwind fluxes are used in the discretization of Maxwell's equations since upwind provides a numerical source of energy dissipation that is not present when central fluxes are used. We prove that the proposed methods are able to preserve the energy invariant and to maintain the semi-discrete energy dissipation (if present) according to the discretization of Maxwell's equations. An extensive set of numerical experiments corroborates the theoretical findings. It also suggests that maintaining the semi-discrete energy dissipation when upwind fluxes are used leads to an overall better accuracy of the method relative to using upwind fluxes while forcing exact energy conservation.

math.NA↗

arXiv2022

Mesh Quality Agglomeration algorithm for the Virtual Element Method applied to Discrete Fracture Networks

We propose a quality-based optimization strategy to reduce the total number of degrees of freedom associated to a discrete problem defined over a polygonal tessellation with the Virtual Element Method. The presented Quality Agglomeration algorithm relies only on the geometrical properties of the problem polygonal mesh, agglomerating groups of neighboring elements. We test this approach in the context of fractured porous media, in which the generation of a global conforming mesh on a Discrete Fracture Network leads to a considerable number of unknowns, due to the presence of highly complex geometries and the significant size of the computational domains. We show the efficiency and the robustness of our approach, applied independently on each fracture for different network configurations, exploiting the flexibility of the Virtual Element Method in handling general polygonal elements.

math.NA↗

arXiv2022

A fourth-order phase-field fracture model: Formulation and numerical solution using a continuous/discontinuous Galerkin method

Modeling crack initiation and propagation in brittle materials is of great importance to be able to predict sudden loss of load-carrying capacity and prevent catastrophic failure under severe dynamic loading conditions. Second-order phase-field fracture models have gained wide adoption given their ability to capture the formation of complex fracture patterns, e.g. via crack merging and branching, and their suitability for implementation within the context of the conventional finite element method. Higher-order phase-field models have also been proposed to increase the regularity of the exact solution and thus increase the spatial convergence rate of its numerical approximation. However, they require special numerical techniques to enforce the necessary continuity of the phase field solution. In this paper, we derive a fourth-order phase-field model of fracture in two independent ways; namely, from Hamilton's principle and from a higher-order micromechanics-based approach. The latter approach is novel, and provides a physical interpretation of the higher-order terms in the model. In addition, we propose a continuous/discontinuous Galerkin (C/DG) method for use in computing the approximate phase-field solution. This method employs Lagrange polynomial shape functions to guarantee $C^0$-continuity of the solution at inter-element boundaries, and enforces the required $C^1$ regularity with the aid of additional variational and interior penalty terms in the weak form. The phase-field equation is coupled with the momentum balance equation to model dynamic fracture problems in hyper-elastic materials. Two benchmark problems are presented to compare the numerical behavior of the C/DG method with mixed finite element methods.

math.NA↗

arXiv2022

Nonnegative Canonical Tensor Decomposition with Linear Constraints: nnCANDELINC

There is an emerging interest in tensor factorization applications in big-data analytics and machine learning. To speed up the factorization of extra-large datasets, organized in multidimensional arrays (aka tensors), easy to compute compression-based tensor representations, such as Tucker and Tensor Train formats, are used to approximate the initial large-tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, additional constraints often need to be imposed, which lead us to Canonical decomposition with linear constraints (CANDELINC), a Canonical Polyadic Decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a pre-processing step, which leads to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank to its Tucker core and comparing the real-valued to the nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real-world examples.

math.NA↗

arXiv2021

Conforming virtual element approximations of the two-dimensional Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that extends the finite element method to polytopal meshes. In this paper, we present two different conforming virtual element formulations for the numerical approximation of the Stokes problem that work on polygonal meshes.The velocity vector field is approximated in the virtual element spaces of the two formulations, while the pressure variable is approximated through discontinuous polynomials. Both formulations are inf-sup stable and convergent with optimal convergence rates in the $L^2$ and energy norm. We assess the effectiveness of these numerical approximations by investigating their behavior on a representative benchmark problem. The observed convergence rates are in accordance with the theoretical expectations and a weak form of the zero-divergence constraint is satisfied at the machine precision level.

math.NA↗