arXiv subjects

Victor Calo

Publications and source records attributed to Victor Calo.

At least 19 recordsLinked to original sources

arXiv2026

Thermodynamic Invariants of Coupled Channels: A Many-Channel Tolman-Ehrenfest Effect

When multiple thermodynamic channels are coupled, single-channel equilibrium conditions fail. Extending the Tolman--Ehrenfest effect to the entropy manifold, we derive the unique $n$-channel invariant $ζ_i T_i = C$, where $ζ_i$ is the holonomy of the Ruppeiner connection. For the granular volume--stress ensemble, Rowe's dilatancy ratio and energy restriction emerge as geometric consequences of the off-diagonal curvature $g_{Vσ}$, and the 60-year puzzle of state-dependent $K_μ$ is resolved: the correction $ζ_V$ reaches $O(1)$ near jamming. The prediction $ζ_Vχ=\mathrm{const}$ across a shear band is experimentally testable.

math-ph↗

arXiv2023

Morphological transitions of block copolymer micelles: implications for isoporous membrane ordering

Isoporous membranes made from diblock copolymers have numerous applications, including water treatment and protein separation, and are successfully produced at a laboratory scale under controlled conditions. However, achieving optimal conditions for membrane preparation remains a challenge due to the complexity of the involved phenomena. Experimental studies have shown that the self-assembly of block copolymers in solution significantly affects the final membrane structure. Despite extensive research, understanding the multiscale phenomena leading to the characteristic morphology is still elusive. We address this gap by using mesoscale computational simulations to investigate the self-assembly of block copolymers in selective solvents, consistent with isoporous membrane preparation. We focus on the interplay between entropic and enthalpic interactions and their effects on the morphology of the micellar aggregates in solution. Our computational results are consistent with experimental evidence, revealing a morphological transition of the aggregates as the polymer concentration and solvent affinity change. We propose different phase parameters to characterize the emergence of monodisperse-spherical micelles in solution and describe the order of crew-cut micelles using a rigid-sphere approximation. Our study provides valuable insights into the self-assembly of diblock copolymers to optimize the preparation of isoporous membranes.

cond-mat.soft↗

arXiv2022

Space-time hp finite elements for heat evolution in laser-based additive manufacturing

The direct numerical simulation of metal additive manufacturing processes such as laser powder bed fusion is challenging due to the vast differences in spatial and temporal scales. Classical approaches based on locally refined finite elements combined with time-stepping schemes can only address the spatial multi-scale nature and provide only limited scaling potential for massively parallel computations. We address these shortcomings in a space-time Galerkin framework where the finite element interpolation also includes the temporal direction. In this setting, we construct four-dimensional meshes that are locally refined towards the laser spot and allow for varying temporal accuracy depending on the position in space. By splitting the mesh into conforming time slabs, we recover a stepwise solution to solve the space-time problem locally in time at this slab; additionally, we can choose time-slab sizes significantly larger than classical time-stepping schemes. As a result, we believe this setting to be well suited for large-scale parallelization. In our work, we use a continuous Galerkin-Petrov formulation of the nonlinear heat equation with an apparent heat capacity model to account for the phase change. We validate our approach by computing the AMB2018-02 benchmark, where we obtain an excellent agreement with the measured melt pool shape. Using the same setup, we demonstrate the performance potential of our approach by hatching a square area with a laser path length of about one meter.

math.NA↗

arXiv2022

A boundary-penalized isogeometric analysis for second-order hyperbolic equations

Explicit time-marching schemes are popular for solving time-dependent partial differential equations; one of the biggest challenges these methods suffer is increasing the critical time-marching step size that guarantees numerical stability. In general, there are two ways to increase the critical step size. One is to reduce the stiffness of the spatially discretized system, while the other is to design time-marching schemes with larger stability regions. In this paper, we focus on the recently proposed explicit generalized-$α$ method for second-order hyperbolic equations and increase the critical step size by reducing the stiffness of the isogeometric-discretized system. In particular, we apply boundary penalization to lessen the system's stiffness. For $p$-th order $C^{p-1}$ isogeometric elements, we show numerically that the critical step size increases by a factor of $\sqrt{\frac{p^2-3p+6}{4}}$, which indicates the advantages of using the proposed method, especially for high-order elements. Various examples in one, two, and three dimensions validate the performance of the proposed technique.

math.NA↗

arXiv2021

Outlier removal for isogeometric spectral approximation with the optimally-blended quadratures

It is well-known that outliers appear in the high-frequency region in the approximate spectrum of isogeometric analysis of the second-order elliptic operator. Recently, the outliers have been eliminated by a boundary penalty technique. The essential idea is to impose extra conditions arising from the differential equation at the domain boundary. In this paper, we extend the idea to remove outliers in the superconvergent approximate spectrum of isogeometric analysis with optimally-blended quadrature rules. We show numerically that the eigenvalue errors are of superconvergence rate $h^{2p+2}$ and the overall spectrum is outlier-free. The condition number and stiffness of the resulting algebraic system are reduced significantly. Various numerical examples demonstrate the performance of the proposed method.

math.NA↗

arXiv2021

A boundary penalization technique to remove outliers from isogeometric analysis on tensor-product meshes

We introduce a boundary penalization technique to improve the spectral approximation of isogeometric analysis (IGA). The technique removes the outliers appearing in the high-frequency region of the approximate spectrum when using the $C^{p-1}, p$-th ($p\ge3$) order isogeometric elements. We focus on the classical Laplacian (Dirichlet) eigenvalue problem in 1D to illustrate the idea and then use the tensor-product structure to generate the stiffness and mass matrices for multiple dimensional problems. To remove the outliers, we penalize the product of the higher-order derivatives from both the solution and test spaces at the domain boundary. Intuitively, we construct a better approximation by weakly imposing features of the exact solution. Effectively, we add terms to the variational formulation at the boundaries with minimal extra computational cost. We then generalize the idea to remove the outliers for the isogeometric analysis to the Neumann eigenvalue problem (for $p\ge2$). The boundary penalization does not change the test and solution spaces. In the limiting case when the penalty goes to infinity, we perform the dispersion analysis of $C^2$ cubic elements for Dirichlet eigenvalue problem and $C^1$ quadratic elements for Neumann eigenvalue problem. We obtain the analytical eigenpairs for the resulting matrix eigenvalue problems. Numerical experiments show optimal convergence rates for the eigenvalues and eigenfunctions of the discrete operator.

math.NA↗

arXiv2020

Phase-field gradient theory

We propose a phase-field theory for enriched continua. To generalize classical phase-field models, we derive the phase-field gradient theory based on balances of microforces, microtorques, and mass. We focus on materials where second gradients of the phase field describe long-range interactions. By considering a nontrivial interaction inside the body, described by a boundary-edge microtraction, we characterize the existence of a microhypertraction field, a central aspect of this theory. On surfaces, we define the surface microtraction and the surface-couple microtraction emerging from internal surface interactions. We explicitly account for the lack of smoothness along a curve on surfaces enclosing arbitrary parts of the domain. In these rough areas, internal-edge microtractions appear. We begin our theory by characterizing these tractions. Next, in balancing microforces and microtorques, we arrive at the field equations. Subject to thermodynamic constraints, we develop a general set of constitutive relations for a phase-field model where its free-energy density depends on second gradients of the phase field. A priori, the balance equations are general and independent of constitutive equations, where the thermodynamics constrain the constitutive relations through the free-energy imbalance. To exemplify the usefulness of our theory, we generalize two commonly used phase-field equations. We propose a 'generalized Swift-Hohenberg equation'-a second-grade phase-field equation-and its conserved version, the 'generalized phase-field crystal equation'-a conserved second-grade phase-field equation. Furthermore, we derive the configurational fields arising in this theory. We conclude with the presentation of a comprehensive, thermodynamically consistent set of boundary conditions.

math-ph↗

arXiv2018

Higher order stable generalized finite element method for the elliptic eigenvalue problem with an interface in 1D

We study the generalized finite element methods (GFEMs) for the second-order elliptic eigenvalue problem with an interface in 1D. The linear stable generalized finite element methods (SGFEM) were recently developed for the elliptic source problem with interfaces. We first generalize SGFEM to arbitrary order elements and establish the optimal error convergence of the approximate solutions for the elliptic source problem with an interface. We then apply the abstract theory of spectral approximation of compact operators to establish the error estimation for the eigenvalue problem with an interface. The error estimations on eigenpairs strongly depend on the estimation of the discrete solution operator for the source problem. We verify our theoretical findings in various numerical examples including both source and eigenvalue problems.

math.NA↗

arXiv2018

Optimal spectral approximation of $2n$-order differential operators by mixed isogeometric analysis

We approximate the spectra of a class of $2n$-order differential operators using isogeometric analysis in mixed formulations. This class includes a wide range of differential operators such as those arising in elliptic, biharmonic, Cahn-Hilliard, Swift-Hohenberg, and phase-field crystal equations. The spectra of the differential operators are approximated by solving differential eigenvalue problems in mixed formulations, which require auxiliary parameters. The mixed isogeometric formulation when applying classical quadrature rules leads to an eigenvalue error convergence of order $2p$ where $p$ is the order of the underlying B-spline space. We improve this order to be $2p+2$ by applying optimally-blended quadrature rules developed in \cite{20,52} and this order is an optimum in the view of dispersion error. We also compare these results with the mixed finite elements and show numerically that mixed isogeometric analysis leads to significantly better spectral approximations.

math.NA↗

arXiv2018

Isogeometric spectral approximation for elliptic differential operators

We study the spectral approximation of a second-order elliptic differential eigenvalue problem that arises from structural vibration problems using isogeometric analysis. In this paper, we generalize recent work in this direction. We present optimally blended quadrature rules for the isogeometric spectral approximation of a diffusion-reaction operator with both Dirichlet and Neumann boundary conditions. The blended rules improve the accuracy and the robustness of the isogeometric approximation. In particular, the optimal blending rules minimize the dispersion error and lead to two extra orders of super-convergence in the eigenvalue error. Various numerical examples (including the Schr$\ddot{\text{o}}$dinger operator for quantum mechanics) in one and three spatial dimensions demonstrate the performance of the blended rules.

math.NA↗

arXiv2017

Dispersion-minimized mass for isogeometric analysis

We introduce the dispersion-minimized mass for isogeometric analysis to approximate the structural vibration which we model as a second-order differential eigenvalue problem. The dispersion-minimized mass reduces the eigenvalue error significantly, from the optimum order of $2p$ to the superconvergence order of $2p+2$ for the $p$-th order isogeometric elements with maximum continuity, which in return leads to more robust of the isogeomectric analysis. We first establish the dispersion error for arbitrary polynomial order isogeometric elements. We derive the dispersion-minimized mass in one dimension by solving a $p$-dimensional local matrix problem for the $p$-th order approximation and then extend it to multiple dimensions on tensor-product grids. We show that the dispersion-minimized mass can also be obtained by approximating the mass matrix using optimally blended quadratures. We generalize the results of optimally blended quadratures from polynomial orders $p=1,\cdots, 7$ that were studied in \cite{calo2017dispersion} to arbitrary polynomial order isogeometric approximations. Various numerical examples validate the eigenvalue and eigenfunction error estimates we derive.

math.NA↗

arXiv2017

Spectral approximation of elliptic operators by the Hybrid High-Order method

We study the approximation of the spectrum of a second-order elliptic differential operator by the Hybrid High-Order (HHO) method. The HHO method is formulated using cell and face unknowns which are polynomials of some degree $k\geq0$. The key idea for the discrete eigenvalue problem is to introduce a discrete operator where the face unknowns have been eliminated. Using the abstract theory of spectral approximation of compact operators in Hilbert spaces, we prove that the eigenvalues converge as $h^{2t}$ and the eigenfunctions as $h^{t}$ in the $H^1$-seminorm, where $h$ is the mesh-size, $t\in [s,k+1]$ depends on the smoothness of the eigenfunctions, and $s>\frac12$ results from the elliptic regularity theory. The convergence rates for smooth eigenfunctions are thus $h^{2k+2}$ for the eigenvalues and $h^{k+1}$ for the eigenfunctions. Our theoretical findings, which improve recent error estimates for Hybridizable Discontinuous Galerkin (HDG) methods, are verified on various numerical examples including smooth and non-smooth eigenfunctions. Moreover, we observe numerically in one dimension for smooth eigenfunctions that the eigenvalues superconverge as $h^{2k+4}$ for a specific value of the stabilization parameter.

math.NA↗

arXiv2017

Efficient mass and stiffness matrix assembly via weighted Gaussian quadrature rules for B-splines

Calabro et al. (2017) changed the paradigm of the mass and stiffness computation from the traditional element-wise assembly to a row-wise concept, showing that the latter one offers integration that may be orders of magnitude faster. Considering a B-spline basis function as a non-negative measure, each mass matrix row is integrated by its own quadrature rule with respect to that measure. Each rule is easy to compute as it leads to a linear system of equations, however, the quadrature rules are of the Newton-Cotes type, that is, they require a number of quadrature points that is equal to the dimension of the spline space. In this work, we propose weighted quadrature rules of Gaussian type which require the minimum number of quadrature points while guaranteeing exactness of integration with respect to the weight function. The weighted Gaussian rules arise as solutions of non-linear systems of equations. We derive rules for the mass and stiffness matrices for uniform $C^1$ quadratic and $C^2$ cubic isogeometric discretizations. Our rules further reduce the number of quadrature points by a factor of $(\frac{p+1}{2p+1})^d$ when compared to Calabro et al. (2017), $p$ being the polynomial degree and $d$ the dimension of the problem, and consequently reduce the computational cost of the mass and stiffness matrix assembly by a similar factor.

math.NA↗

arXiv2017

Spectral approximation properties of isogeometric analysis with variable continuity

We study the spectral approximation properties of isogeometric analysis with local continuity reduction of the basis. Such continuity reduction results in a reduction in the interconnection between the degrees of freedom of the mesh, which allows for large savings in computational requirements during the solution of the resulting linear system. The continuity reduction results in extra degrees of freedom that modify the approximation properties of the method. The convergence rate of such refined isogeometric analysis is equivalent to that of the maximum continuity basis. We show how the breaks in continuity and inhomogeneity of the basis lead to artefacts in the frequency spectra, such as stopping bands and outliers, and present a unified description of these effects in finite element method, isogeometric analysis, and refined isogeometric analysis. Accuracy of the refined isogeometric analysis approximations can be improved by using non-standard quadrature rules. In particular, optimal quadrature rules lead to large reductions in the eigenvalue errors and yield two extra orders of convergence similar to classical isogeometric analysis.

math.NA↗

arXiv2017

Dispersion-minimizing quadrature rules for $C^1$ quadratic isogeometric analysis

We develop quadrature rules for the isogeometric analysis of wave propagation and structural vibrations that minimize the discrete dispersion error of the approximation. The rules are optimal in the sense that they only require two quadrature points per element to minimize the dispersion error [1], and they are equivalent to the optimized blending rules we recently described. Our approach further simplifies the numerical integration: instead of blending two three-point standard quadrature rules, we construct directly a single two-point quadrature rule that reduces the dispersion error to the same order for uniform meshes with periodic boundary conditions. Also, we present a 2.5-point rule for both uniform and non-uniform meshes with arbitrary boundary conditions. Consequently, we reduce the computational cost by using the proposed quadrature rules. Various numerical examples demonstrate the performance of these quadrature rules.

math.NA↗

arXiv2017

Dispersion optimized quadratures for isogeometric analysis

We develop and analyze quadrature blending schemes that minimize the dispersion error of isogeometric analysis up to polynomial order seven with maximum continuity in the span ($C^{p-1}$). The schemes yield two extra orders of convergence (superconvergence) on the eigenvalue errors, while the eigenfunction errors are of optimal convergence order. Both dispersion and spectrum analysis are unified in the form of a Taylor expansion for eigenvalue errors. As a consequence, the schemes increase the accuracy and robustness of isogeometric analysis for wave propagation as well as the differential eigenvalue problems. We analyze the methods' robustness and efficacy and utilize numerical examples to verify our analysis of the performance of the proposed schemes.

math.NA↗

arXiv2016

Dispersion-optimized quadrature rules for isogeometric analysis: modified inner products, their dispersion properties, and optimally blended schemes

This paper introduces optimally-blended quadrature rules for isogeometric analysis and analyzes the numerical dispersion of the resulting discretizations. To quantify the approximation errors when we modify the inner products, we generalize the Pythagorean eigenvalue theorem of Strang and Fix. The proposed blended quadrature rules have advantages over alternative integration rules for isogeometric analysis on uniform and non-uniform meshes as well as for different polynomial orders and continuity of the basis. The optimally-blended schemes improve the convergence rate of the method by two orders with respect to the fully-integrated Galerkin method. The proposed technique increases the accuracy and robustness of isogeometric analysis for wave propagation problems.

math.NA↗

arXiv2015

Optimal quadrature rules for isogeometric analysis

We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. Using the homotopy continuation concept [6] that transforms optimal quadrature rules from source spaces to target spaces, we derive optimal rules for splines generated above finite domains. Starting with the classical Gaussian quadrature for polynomials, which is an optimal rule for a discontinuous odd-degree space, we derive rules for target spaces of higher continuity. We further show how the homotopy methodology handles cases where the source and target rules require different numbers of optimal quadrature points. We demonstrate it by deriving optimal rules for various odd-degree spline spaces, particularly with non-uniform knot sequences and non-uniform multiplicities. We also discuss convergence of our rules to their asymptotic counterparts, that is, the analogues of the midpoint rule of Hughes et al. [34], that are exact and optimal for infinite domains. For spaces of low continuities, we numerically show that the derived rules quickly converge to their asymptotic counterparts as the weights and nodes of a few boundary elements differ from the asymptotic values.

math.NA↗