Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.06312

A numerical investigation of dimensionless numbers characterizing meltpool morphology of the laser powder bed fusion process

Kunal Bhagat·Shiva Rudraraju
View original source ↗Read source document ↗Export metadata ↓

Abstract

Microstructure evolution in metal additive manufacturing (AM) is a complex multi-physics and multi-scale problem. Understanding the impact of AM process conditions on the microstructure evolution and the resulting mechanical properties of the printed part is an active area of research. At the meltpool scale, the thermo-fluidic governing equations have been extensively modeled in the literature to understand the meltpool conditions and the thermal gradients in its vicinity. In many phenomena governed by partial differential equations, dimensional analysis and identification of important dimensionless numbers can provide significant insights into the process dynamics. In this context, a novel strategy using dimensional analysis and the method of linear least squares regression to numerically investigate the thermo-fluidic governing equations of the Laser Powder Bed Fusion AM process is presented in this work. First, the governing equations are solved using the Finite Element Method, and the model predictions are validated by comparing with experimentally estimated cooling rates, and with numerical results from the literature. Then, through dimensional analysis, an important dimensionless quantity - interpreted as a measure of heat absorbed by the powdered material and the meltpool, is identified. This dimensionless measure of heat absorbed, along with classical dimensionless quantities such as Peclet, Marangoni, and Stefan numbers, is used to investigate advective transport in the meltpool for different alloys. Further, the framework is used to study the variations of thermal gradients and the solidification cooling rate. Important correlations linking meltpool morphology and microstructure evolution related variables with classical dimensionless numbers are the key contribution of this work.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kunal Bhagat, Shiva Rudraraju. 2022-12-15. A numerical investigation of dimensionless numbers characterizing meltpool morphology of the laser powder bed fusion process. https://doi.org/10.3390/ma16010094

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↗