Publication
Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations
Publications associées (58)
A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control
Fabio Zoccolan, Gianluigi Rozza
In this paper we will consider distributed Linear-Quadratic Optimal Control Problems dealing with Advection-Diffusion PDEs for high values of the Peclet number. In this situation, computational instabilities occur, both for steady and unsteady cases. A Str ...
Walter De Gruyter Gmbh2024BPS invariants from p-adic integrals
Dimitri Stelio Wyss, Francesca Carocci, Giulio Orecchia
We define p-adic BPS or pBPS invariants for moduli spaces M-beta,M-chi of one-dimensional sheaves on del Pezzo and K3 surfaces by means of integration over a non-archimedean local field F. Our definition relies on a canonical measure mu can on the F-analyt ...
Cambridge Univ Press2024Over-the-Air Computation via Reconfigurable Intelligent Surface
Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021Computation Of A 30750-Bit Binary Field Discrete Logarithm
Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski
This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...
AMER MATHEMATICAL SOC2021Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations
This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...
2020The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...
ACM2019A central limit theorem for integrals of random waves
Marius Christopher Lemm, Matthew De Courcy-Ireland
We derive a central limit theorem for the mean-square of random waves in the high-frequency limit over shrinking sets. Our proof applies to any compact Riemannian manifold of arbitrary dimension, thanks to the universality of the local Weyl law. The key te ...
2019System and method for performing isogeometric analysis and finite element analysis using h-splines
Michaël Unser, Zsuzsanna Püspöki, Daniel Andreas Schmitter
A method for performing H-spline compatible isogeometric analysis (IGA) on a geometric object, the method being performed on a computer device having a memory, the method including the steps of creating an analysis suitable geometry (ASG) using H-splines f ...
2019On flexible Green function methods for atomistic/continuum coupling
Atomistic/continuum (A/C) coupling schemes have been developed during the past twenty years to overcome the vast computational cost of fully atomistic models, but have not yet reached full maturity to address many problems of practical interest. This work ...
EPFL2018