Publication

Contour parallel milling tool path generation for arbitrary pocket shape using a fast marching method

Related publications (29)

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Leello Tadesse Dadi, Efstratios Panteleimon Skoulakis

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Model reduction of coupled systems based on non-intrusive approximations of the boundary response maps

Jan Sickmann Hesthaven, Niccolo' Discacciati

We propose a local, non -intrusive model order reduction technique to accurately approximate the solution of coupled multi -component parametrized systems governed by partial differential equations. Our approach is based on the approximation of the boundar ...

Elsevier Science Sa2024

Iterative removal of sources to model the turbulent electromotive force

Jennifer Waltraud Schober, Abhijit Bhausaheb Bendre

We describe a novel method to compute the components of dynamo tensors from direct magnetohydrodynamic (MHD) simulations. Our method relies upon an extension and generalization of the standard H & ouml;gbom CLEAN algorithm widely used in radio astronomy to ...

Oxford Univ Press2024

Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates

Vitalijs Zubkovs, Ardemis Anoush Boghossian, Sayyed Hashem Sajjadi, Shang-Jung Wu, Yahya Rabbani

Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...

2024

Randomized flexible GMRES with deflated restarting

Emeric Martin, Laura Grigori

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

Springer2024

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

Nature Portfolio2024

Estimation of the bar stress based on crack width measurements in reinforced concrete structures

Aurelio Muttoni, Enrique Corres Sojo

Estimating the stress of reinforcing bars and its variations in service conditions can be useful to determine the reserve capacity of structures or to assess the risk of fatigue in the reinforcement. This paper investigates the use crack width measurements ...

Ernst & Sohn2024

Lithium tantalate photonic integrated circuits for volume manufacturing

Tobias Kippenberg, Kai Huang, Chen Yang, Mikhail Churaev, Xinru Ji, Yang Chen, Zihan Li, Alisa Davydova, Xi Wang, Junyin Zhang

Electro-optical photonic integrated circuits (PICs) based on lithium niobate (LiNbO3) have demonstrated the vast capabilities of materials with a high Pockels coefficient1,2. They enable linear and high-speed modulators operating at complementary metal–oxi ...

2024

Analytical Model of Single-Sided Linear Induction Motors for High-Speed Applications

André Hodder, Mario Paolone, Lucien André Félicien Pierrejean, Simone Rametti

This article describes a field-based analytical model of single-sided linear induction motors (SLIMs) that explicitly considers the following effects altogether: finite motor length, magnetomotive force mmf space harmonics, slot effect, edge effect, and ta ...

IEEE2024

Related publications (29)

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Leello Tadesse Dadi, Efstratios Panteleimon Skoulakis

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024