Search arXivSearch

arXiv · 2506.11946

A visco-plastic constitutive model for accurate densification and shape predictions in powder metallurgy hot isostatic pressing

Abstract

Powder metallurgy hot isostatic pressing (PM-HIP) is an advanced manufacturing process that produces near net shape parts with high material utilization and uniform microstructures. Despite being used frequently to produce small-scale components, the application of PM-HIP to large-scale components is limited due to inadequate understanding of its complex mechanisms that cause unpredictable post-HIP shape distortions. A computational model can provide necessary information about the intermediate and final stages of the HIP process that can help understand it better and make accurate predictions. Generally, two types of computational models are employed for PM-HIP simulations, namely, plastic and visco-plastic models. Between these, the plastic model is preferred due to its cheaper calibration approach requiring less experimental data. However, the plastic model sometimes produces incorrect predictions when slight variations of the HIP conditions are encountered in practical situations. Therefore, this work presents a visco-plastic model that addresses these limitations of the plastic model. A novel modified calibration approach is employed for the visco-plastic model that utilizes less experimental data than existing approaches. With the new approach, the data requirement is same for both plastic and visco-plastic models. This also enables a quantitative comparison of plastic and visco-plastic models, which have been only qualitatively compared in the past. When calibrated with the same experimental data, both the models are found to produce similar results. The calibrated visco-plastic model is applied to several complex geometries, and the predictions are found to be in good agreement with experimental observations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Subrato Sarkar, Jason R Mayeur, KPK Ajjarapu, Fred A List III, Soumya Nag, Ryan R Dehoff. 2025-06-13. A visco-plastic constitutive model for accurate densification and shape predictions in powder metallurgy hot isostatic pressing. https://doi.org/10.1016/j.powtec.2025.121526

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

KEEP EXPLORING

Related papers

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

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

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