Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.08131

Numerical Design of Distributive Mixing Elements

Sebastian Hube·Marek Behr·Stefanie Elgeti·Malte Schön·Jana Sasse·Christian Hopmann
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a novel shape-optimization technique for the design of mixing elements in single-screw extruders. Extruders enable the continuous production of constant-cross-section profiles. Equipped with one or several screw-shaped rotors, extruders transport polymer particles towards the outlet. Due to shear heating, melting is induced and a melt stream is created, which can be further processed. While many variants of multi-screw extruders exist, a significant share of all extrusion machines is made up of single-screw extruders due to their comparatively low operating costs and complexity. While the reduced complexity yields economic benefits, single-screw extruders' mixing capabilities, i.e., their ability to produce a melt with a homogeneous material and temperature distribution, suffer compared to multi-screw extruders. To compensate for this shortcoming, so-called mixing elements are added to the screw to enhance mixing by recurring flow reorientations. In view of the largely unintuitive flow characteristics of polymer melts, we present an optimization framework that allows designing these mixing elements numerically based on finite-element simulations of the melt flow. To reduce the computational demand required by shape optimization of a complete mixing section, we only focus on the shape optimization of a single mixing element. This paper presents advances in three aspects of numerical design: (1) A combination of free-form deformation and surface splines is presented, allowing to parameterize the mixing element's shape by very few variables. (2) The combination of this concept with a linear-elasticity-based mesh update method to deform the computational domain without the need for remeshing is demonstrated. (3) A simple yet robust and sensitive objective formulation to assess distributive mixing in laminar flows based on a measure for the interfacial area is proposed.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebastian Hube, Marek Behr, Stefanie Elgeti, Malte Schön, Jana Sasse, Christian Hopmann. 2021-08-18. Numerical Design of Distributive Mixing Elements. https://doi.org/10.1016/j.finel.2022.103733

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗