Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.11226

A Scalable Approach for Transient Thermal Modeling of Automotive Power Electronics

Neelakantan Padmanabhan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Efficient thermal management is critical for the reliability and performance of power electronics systems in automotive applications. This work presents a computationally efficient modeling approach for transient thermal simulation of power electronic systems, with a focus on inverter modules using multiple MOSFETs mounted on a printed circuit board assembly (PCBA). A case study of an inverter module comprising six MOSFETs arranged as high-side and low-side pairs for a three phases system mounted on a PCBA, attached to a heat sink is considered. Computational fluid dynamic (CFD) simulations in Ansys Icepak are performed considering different heat transfer mechanisms, including natural convection, forced convection at constant velocity, and forced convection with varying flow velocity. A transient thermal model is developed using the Lumped Parameter Linear Superposition (LPLSP) method, a hybrid approach that combines lumped parameter modeling with the principle of linear superposition to capture transient thermal behavior efficiently. Temperatures of the components from the simulations are compared with temperatures from the LPLSP model and temperatures from a Linear Time Invariant (LTI) based reduced order model (ROM) developed for this system. It is observed that the LPLSP model is able to model a wide range of use cases very accurately with error of less than 5 %. This method enables rapid thermal performance evaluation of power electronics systems that have very fast transients in component level power dissipation and variations in ambient conditions, making it particularly well-suited for early-stage design iterations and long-duration mission profile simulations. The approach offers a practical path to reducing development cycles for automotive power electronics design.

Explore related subjects

math.NAcs.NAcs.SYeess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neelakantan Padmanabhan. 2026-05-28. A Scalable Approach for Transient Thermal Modeling of Automotive Power Electronics. https://doi.org/10.4271/2025-01-5073

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↗