Krishnan Suresh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Krishnan Suresh has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
Aaditya Chandrasekhar
11 shared publications- Rahul Kumar Padhy
Department of Mechanical Engineering University of Wisconsin-Madison Madison WI USA
7 shared publications - Aaditya Chandrasekhar
Department of Mechanical Engineering Northwestern University Evanston IL USA
6 shared publications - Bhagyashree Prabhune
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
6 shared publications - Saketh Sridhara
University of Wisconsin–Madison Department of Mechanical Engineering
5 shared publications - Kavous Jorabchi
University of Wisconsin at Madison, 2050 Mechanical Engineering Building, 1513 University Avenue, Madison, WI 53706
4 shared publications
Latest Publications
- 27 October 2026
- Published by Elsevier in Computer-Aided Design
- Vol. 203
Optimizing the cross-sections of lattices using variational autoencoders
- 27 October 2026
- Published by Elsevier in Computer-Aided Design
- Vol. 203
Optimizing the cross-sections of lattices using variational autoencoders
- Open Access
- 25 October 2026
- Published by Elsevier in SSRN Electronic Journal
Localized Hybrid Analytical–Finite-Element Thermal Modeling for Laser Powder Bed Fusion
Hybrid analytical--finite-element methods support scan-resolved, part-scale thermal simulation of laser powder bed fusion, but their analytical evaluation cost grows as scan-line contributions accumulate. This work develops a space--time localized hybrid formulation that restricts where and how long each contribution is evaluated analytically. Residual terms and boundary conditions derived from the heat equation allow the finite-element correction to account for the thermal effect of contributions removed from the analytical field.The formulation is assessed using a single-line benchmark against an independent full finite-element solution and multiline comparisons with the conventional hybrid formulation. Localization limits the number of analytical contributions retained while maintaining close agreement with the conventional solution. A comparison with uncompensated temporal truncation demonstrates the importance of the residual correction in retaining the thermal effect of removed contributions. In the 500-line case, analytical and total simulation times are reduced by factors of approximately 25.5 and 3.92, respectively, with a relative nodal 2-norm difference of 0.139%.
- 25 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLocalized Hybrid Analytical–Finite-Element Thermal Modeling for Laser Powder Bed Fusion
Hybrid analytical--finite-element methods support scan-resolved, part-scale thermal simulation of laser powder bed fusion, but their analytical evaluation cost grows as scan-line contributions accumulate. This work develops a space--time localized hybrid formulation that restricts where and how long each contribution is evaluated analytically. Residual terms and boundary conditions derived from the heat equation allow the finite-element correction to account for the thermal effect of contributions removed from the analytical field.The formulation is assessed using a single-line benchmark against an independent full finite-element solution and multiline comparisons with the conventional hybrid formulation. Localization limits the number of analytical contributions retained while maintaining close agreement with the conventional solution. A comparison with uncompensated temporal truncation demonstrates the importance of the residual correction in retaining the thermal effect of removed contributions. In the 500-line case, analytical and total simulation times are reduced by factors of approximately 25.5 and 3.92, respectively, with a relative nodal 2-norm difference of 0.139%.
- Open Access
- 16 September 2026
- Published by Elsevier in SSRN Electronic Journal
Quantum Block Encodings for Periodic Two-Phase Finite Element Operators: 2D Poisson and 2D Elasticity
Quantum algorithms require embedding linear operators into unitaries using block encodings. The costs associated with these block encodings determine whether a quantum speedup is achieved. Efficient \emph{shift decomposition} encodings have been proposed for 2D homogeneous scalar operators. Here, we present exact block encodings for 2D homogeneous elasticity, 2D two-phase bilinear Poisson, and 2D two-phase elasticity periodic finite-element operators. For 2D homogeneous elasticity, the resulting linear combination of unitaries (LCU)has $L = 17$ terms for every Poisson ratio $\nu$ and every mesh resolution, andthe subnormalization is the closed form$\alpha = E(33+\nu)/\bigl[6(1-\nu^{2})\bigr]$, exceeding $\|\mathbf{K}\|_{2}$ by theresolution-independent factor $(33+\nu)/24$.To address two-phase periodic microstructures, we introduce two oracles withdistinct roles: a node-to-element oracle, built from cyclic shifts, that carriesa nodal index to each of the four incident element indices, and a microstructure-specific materialoracle that marks phase membership with a sign. This yields 25 and 57 LCU terms for two-phase Poisson and elasticity, respectively; the latter reduces to 49 at $\nu = 1/3$. The term counts are independent of mesh resolution, volume fraction, and phase contrast. The subnormalizations, provided in closed form, are independent of mesh resolution and volume fraction. In the scalar case, the tight bound $\alpha = \|\mathbf{K}\|_\infty$ is achieved whenever a node lies entirely in the stiffer phase. In the elasticity case that bound is not attained, since the shear couplingcontributes entries of both signs to a row. An open-source implementation is available at \url{https://github.com/UW-ERSL/PyBlockEncode}.- 16 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessQuantum Block Encodings for Periodic Two-Phase Finite Element Operators: 2D Poisson and 2D Elasticity
Quantum algorithms require embedding linear operators into unitaries using block encodings. The costs associated with these block encodings determine whether a quantum speedup is achieved. Efficient \emph{shift decomposition} encodings have been proposed for 2D homogeneous scalar operators. Here, we present exact block encodings for 2D homogeneous elasticity, 2D two-phase bilinear Poisson, and 2D two-phase elasticity periodic finite-element operators. For 2D homogeneous elasticity, the resulting linear combination of unitaries (LCU)has $L = 17$ terms for every Poisson ratio $\nu$ and every mesh resolution, andthe subnormalization is the closed form$\alpha = E(33+\nu)/\bigl[6(1-\nu^{2})\bigr]$, exceeding $\|\mathbf{K}\|_{2}$ by theresolution-independent factor $(33+\nu)/24$.To address two-phase periodic microstructures, we introduce two oracles withdistinct roles: a node-to-element oracle, built from cyclic shifts, that carriesa nodal index to each of the four incident element indices, and a microstructure-specific materialoracle that marks phase membership with a sign. This yields 25 and 57 LCU terms for two-phase Poisson and elasticity, respectively; the latter reduces to 49 at $\nu = 1/3$. The term counts are independent of mesh resolution, volume fraction, and phase contrast. The subnormalizations, provided in closed form, are independent of mesh resolution and volume fraction. In the scalar case, the tight bound $\alpha = \|\mathbf{K}\|_\infty$ is achieved whenever a node lies entirely in the stiffer phase. In the elasticity case that bound is not attained, since the shear couplingcontributes entries of both signs to a row. An open-source implementation is available at \url{https://github.com/UW-ERSL/PyBlockEncode}. - Open Access
- 1 September 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045032
PyEncode: an open-source library for structured quantum state preparation
Quantum algorithms require encoding classical vectors as quantum states, a step known as amplitude encoding. General-purpose routines produce circuits with O ( 2 m ) gates for vectors of length N = 2 m , for an m -qubit register. However, vectors arising in scientific and engineering applications often exhibit mathematical structure that admits far more efficient encoding. Theoretical work over the last decade has established efficient circuits for several structured vector classes, but without open-source implementations. We present PyEncode , an open-source Python library that implements this body of theory in a unified framework. It covers ten exact pattern families: sparse, step, square, Walsh, Fourier, geometric, Hamming, staircase, Dicke , and polynomial . A function encode maps each pattern to a verified Qiskit circuit, with no vector materialization and no approximation; for example, encode(SPARSE([(19, 1.0)]), N = 64) encodes the vector e 19 of length N = 64 . Sparse, step, Walsh, Hamming, and staircase patterns require O ( m ) gates; square and Fourier patterns require O ( m 2 ) ; Dicke states | D k m ⟩ require O ( k ( m − k ) ) , that denotes uniform superpositions over indices of Hamming weight k ; degree- d polynomials require O ( m d + 1 ) . A companion predict_gates function estimates transpiled gate counts without synthesis, and a reverse-lookup utility match_vector identifies which family best fits a given numerical vector. Three composition primitives are supported: SUM for weighted superpositions, PARTITION for ancilla-free composition of disjoint-support patterns, and TENSOR for separable states over disjoint subregisters. For amplitude vectors outside these exact families, PyEncode also provides a matrix product state (MPS) loader, encode_mps for approximate vector encoding. The library is available at https://github.com/UW-ERSL/PyEncode .
- 1 September 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045032
Open AccessPyEncode: an open-source library for structured quantum state preparation
Quantum algorithms require encoding classical vectors as quantum states, a step known as amplitude encoding. General-purpose routines produce circuits with O ( 2 m ) gates for vectors of length N = 2 m , for an m -qubit register. However, vectors arising in scientific and engineering applications often exhibit mathematical structure that admits far more efficient encoding. Theoretical work over the last decade has established efficient circuits for several structured vector classes, but without open-source implementations. We present PyEncode , an open-source Python library that implements this body of theory in a unified framework. It covers ten exact pattern families: sparse, step, square, Walsh, Fourier, geometric, Hamming, staircase, Dicke , and polynomial . A function encode maps each pattern to a verified Qiskit circuit, with no vector materialization and no approximation; for example, encode(SPARSE([(19, 1.0)]), N = 64) encodes the vector e 19 of length N = 64 . Sparse, step, Walsh, Hamming, and staircase patterns require O ( m ) gates; square and Fourier patterns require O ( m 2 ) ; Dicke states | D k m ⟩ require O ( k ( m − k ) ) , that denotes uniform superpositions over indices of Hamming weight k ; degree- d polynomials require O ( m d + 1 ) . A companion predict_gates function estimates transpiled gate counts without synthesis, and a reverse-lookup utility match_vector identifies which family best fits a given numerical vector. Three composition primitives are supported: SUM for weighted superpositions, PARTITION for ancilla-free composition of disjoint-support patterns, and TENSOR for separable states over disjoint subregisters. For amplitude vectors outside these exact families, PyEncode also provides a matrix product state (MPS) loader, encode_mps for approximate vector encoding. The library is available at https://github.com/UW-ERSL/PyEncode .
- Open Access
- 18 August 2026
- Published by Springer Nature in Engineering with Computers
- Vol. 42 (5) , 169
A novel surrogate model for optimizing lattice for desired force-displacement response
Optimizing lattice structures for energy absorption and load-bearing applications necessitates accurately capturing their nonlinear mechanical response under large deformation. However, traditional nonlinear finite element analysis (NL-FEA) can often fail, particularly at higher compression, which creates numerical gaps in the design space, hindering gradient-based optimization algorithms, ultimately resulting in suboptimal designs. We propose here a neural network (NN) surrogate model that is trained on data generated using Abaqus, a commercial FEA solver. A unique feature of the model is that it exploits both fully and partially successful NL-FEA simulations. This significantly improves the surrogate model’s accuracy and predictive coverage across the design space. The resulting model enables efficient, gradient-driven optimization of lattice structures to match a desired force-displacement response. By replacing expensive NL-FEA evaluations, the surrogate model substantially reduces computational cost while maintaining a coefficient of determination ( $$R^2$$ ) of 0.98 in prediction. The effectiveness and versatility of this framework are demonstrated by successfully optimizing $$3 \times 3$$ lattice structures under 40% compression, with the lattice radii as design variables.- 18 August 2026
- Published by Springer Nature in Engineering with Computers
- Vol. 42 (5) , 169
Open AccessA novel surrogate model for optimizing lattice for desired force-displacement response
Optimizing lattice structures for energy absorption and load-bearing applications necessitates accurately capturing their nonlinear mechanical response under large deformation. However, traditional nonlinear finite element analysis (NL-FEA) can often fail, particularly at higher compression, which creates numerical gaps in the design space, hindering gradient-based optimization algorithms, ultimately resulting in suboptimal designs. We propose here a neural network (NN) surrogate model that is trained on data generated using Abaqus, a commercial FEA solver. A unique feature of the model is that it exploits both fully and partially successful NL-FEA simulations. This significantly improves the surrogate model’s accuracy and predictive coverage across the design space. The resulting model enables efficient, gradient-driven optimization of lattice structures to match a desired force-displacement response. By replacing expensive NL-FEA evaluations, the surrogate model substantially reduces computational cost while maintaining a coefficient of determination ( $$R^2$$ ) of 0.98 in prediction. The effectiveness and versatility of this framework are demonstrated by successfully optimizing $$3 \times 3$$ lattice structures under 40% compression, with the lattice radii as design variables. - Open Access
- 19 March 2026
- Published by Elsevier in SSRN Electronic Journal
MOTO: TOPOLOGY OPTIMIZATION FOR LARGE DEFORMATIONS VIA AN IMPLICIT MATERIAL POINT METHOD
The Finite element method (FEM) has long served as the computational backbone for topology optimization (TO). However, for designing structures undergoing large deformations, conventional FEM-based TO often exhibits numerical instabilities due to severe mesh distortions, tangling, and large rotations, consequently leading to convergence failures.To address this challenge, we present a TO framework based on the Material Point Method (MPM). MPM is a hybrid Lagrangian–Eulerian particle method, well-suited for simulating large deformations. In particular, we present an end-to-end differentiable implicit MPM framework for designing structures undergoing quasi-static hyperelastic large deformations. The effectiveness of the approach is demonstrated through validation studies encompassing both single and multi-material designs, including the design of compliant soft robotic grippers. The software accompanying this paper can be accessed at github.com/UW-ERSL/MOTO.
- 19 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMOTO: TOPOLOGY OPTIMIZATION FOR LARGE DEFORMATIONS VIA AN IMPLICIT MATERIAL POINT METHOD
The Finite element method (FEM) has long served as the computational backbone for topology optimization (TO). However, for designing structures undergoing large deformations, conventional FEM-based TO often exhibits numerical instabilities due to severe mesh distortions, tangling, and large rotations, consequently leading to convergence failures.To address this challenge, we present a TO framework based on the Material Point Method (MPM). MPM is a hybrid Lagrangian–Eulerian particle method, well-suited for simulating large deformations. In particular, we present an end-to-end differentiable implicit MPM framework for designing structures undergoing quasi-static hyperelastic large deformations. The effectiveness of the approach is demonstrated through validation studies encompassing both single and multi-material designs, including the design of compliant soft robotic grippers. The software accompanying this paper can be accessed at github.com/UW-ERSL/MOTO.
- Open Access
- 19 February 2026
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 69 (3) , 56
Toflux: a differentiable topology optimization framework for multiphysics fluidic problems
Topology optimization (TO) holds the promise of designing next-generation compact and efficient fluidic devices. However, the inherent complexity of fluid-based TO systems, characterized by multiphysics nonlinear interactions, poses substantial barriers to entry for researchers. Beyond the inherent intricacies of forward simulation models, design optimization is further complicated by the difficulty of computing sensitivities, i.e., gradients. Manual derivation and implementation of sensitivities are often laborious and prone to errors, particularly for non-trivial objectives, constraints, and material models. An alternative solution is automatic differentiation (AD). Although AD has been previously demonstrated for simpler TO problems, extending its use to complex nonlinear multiphysics systems, specifically in fluidic optimization, is key to reducing the entry barrier. To this end, we introduce TOFLUX, a TO framework for flu id devices leveraging the JA X library for high-performance automatic differentiation. The flexibility afforded by AD enables the rapid exploration and evaluation of various objectives and constraints. We illustrate this capability through challenging examples encompassing thermo-fluidic coupling, fluid–structure interaction, and non-Newtonian flows. Additionally, we demonstrate the seamless integration of our framework with neural networks and machine learning methodologies, enabling modern approaches to scientific computing. Ultimately, the framework aims to provide a foundational resource to accelerate research and innovation in fluid-based TO. The software accompanying this educational paper can be accessed at https://github.com/UW-ERSL/TOFLUX .
- 19 February 2026
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 69 (3) , 56
Open AccessToflux: a differentiable topology optimization framework for multiphysics fluidic problems
Topology optimization (TO) holds the promise of designing next-generation compact and efficient fluidic devices. However, the inherent complexity of fluid-based TO systems, characterized by multiphysics nonlinear interactions, poses substantial barriers to entry for researchers. Beyond the inherent intricacies of forward simulation models, design optimization is further complicated by the difficulty of computing sensitivities, i.e., gradients. Manual derivation and implementation of sensitivities are often laborious and prone to errors, particularly for non-trivial objectives, constraints, and material models. An alternative solution is automatic differentiation (AD). Although AD has been previously demonstrated for simpler TO problems, extending its use to complex nonlinear multiphysics systems, specifically in fluidic optimization, is key to reducing the entry barrier. To this end, we introduce TOFLUX, a TO framework for flu id devices leveraging the JA X library for high-performance automatic differentiation. The flexibility afforded by AD enables the rapid exploration and evaluation of various objectives and constraints. We illustrate this capability through challenging examples encompassing thermo-fluidic coupling, fluid–structure interaction, and non-Newtonian flows. Additionally, we demonstrate the seamless integration of our framework with neural networks and machine learning methodologies, enabling modern approaches to scientific computing. Ultimately, the framework aims to provide a foundational resource to accelerate research and innovation in fluid-based TO. The software accompanying this educational paper can be accessed at https://github.com/UW-ERSL/TOFLUX .
- Open Access
- 19 February 2026
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 69 (3) , 54
A latent space approach to multi-material topology optimization
This work presents a novel approach for designing multi-alloy structures by simultaneously optimizing the material and topology. The proposed computational framework employs a material latent space integrated with density-based topology optimization in a two-step process. In the first step, a variational autoencoder (VAE), a type of neural network, maps a database of materials and their properties to a continuous, low-dimensional latent space. In the second step, the latent space is coupled with topology design variables (pseudo-densities) to simultaneously optimize material and topology. A gradient-based optimizer, specifically the method of moving asymptotes (MMA), traverses the latent space to select the material while simultaneously optimizing the topology. Optionally, one can add a penalization term that will drive the latent points towards real materials from the dataset. The framework is illustrated through 2D and 3D numerical examples using up to 20 materials, involving more than a million degrees of freedom.
- 19 February 2026
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 69 (3) , 54
Open AccessA latent space approach to multi-material topology optimization
This work presents a novel approach for designing multi-alloy structures by simultaneously optimizing the material and topology. The proposed computational framework employs a material latent space integrated with density-based topology optimization in a two-step process. In the first step, a variational autoencoder (VAE), a type of neural network, maps a database of materials and their properties to a continuous, low-dimensional latent space. In the second step, the latent space is coupled with topology design variables (pseudo-densities) to simultaneously optimize material and topology. A gradient-based optimizer, specifically the method of moving asymptotes (MMA), traverses the latent space to select the material while simultaneously optimizing the topology. Optionally, one can add a penalization term that will drive the latent points towards real materials from the dataset. The framework is illustrated through 2D and 3D numerical examples using up to 20 materials, involving more than a million degrees of freedom.
- 31 December 2025
- Published by Elsevier in Applied Energy
- Vol. 406
TOMATOES: Topology and material optimization for latent heat thermal energy storage devices
- 31 December 2025
- Published by Elsevier in Applied Energy
- Vol. 406
TOMATOES: Topology and material optimization for latent heat thermal energy storage devices
- Open Access
TOFLUX: A Differentiable Topology Optimization Framework for Multiphysics Fluidic Problems
Topology Optimization (TO) holds the promise of designing next-generation compact and efficient fluidic devices. However, the inherent complexity of fluid-based TO systems, characterized by multiphysics nonlinear interactions, poses substantial barriers to entry for researchers. Beyond the inherent intricacies of forward simulation models, design optimization is further complicated by the difficulty of computing sensitivities, i.e., gradients. Manual derivation and implementation of sensitivities are often laborious and prone to errors, particularly for non-trivial objectives, constraints, and material models. An alternative solution is automatic differentiation (AD). Although AD has been previously demonstrated for simpler TO problems, extending its use to complex nonlinear multiphysics systems, specifically in fluidic optimization, is key to reducing the entry barrier. To this end, we introduce TOFLUX, a TO framework for fluid devices leveraging the JAX library for high-performance automatic differentiation. The flexibility afforded by AD enables the rapid exploration and evaluation of various objectives and constraints. We illustrate this capability through challenging examples encompassing thermo-fluidic coupling, fluid-structure interaction, and non-Newtonian flows. Additionally, we demonstrate the seamless integration of our framework with neural networks and machine learning methodologies, enabling modern approaches to scientific computing. Ultimately, the framework aims to provide a foundational resource to accelerate research and innovation in fluid-based TO. The software accompanying this educational paper can be accessed at github.com/UW-ERSL/TOFLUX.
Open AccessTOFLUX: A Differentiable Topology Optimization Framework for Multiphysics Fluidic Problems
Topology Optimization (TO) holds the promise of designing next-generation compact and efficient fluidic devices. However, the inherent complexity of fluid-based TO systems, characterized by multiphysics nonlinear interactions, poses substantial barriers to entry for researchers. Beyond the inherent intricacies of forward simulation models, design optimization is further complicated by the difficulty of computing sensitivities, i.e., gradients. Manual derivation and implementation of sensitivities are often laborious and prone to errors, particularly for non-trivial objectives, constraints, and material models. An alternative solution is automatic differentiation (AD). Although AD has been previously demonstrated for simpler TO problems, extending its use to complex nonlinear multiphysics systems, specifically in fluidic optimization, is key to reducing the entry barrier. To this end, we introduce TOFLUX, a TO framework for fluid devices leveraging the JAX library for high-performance automatic differentiation. The flexibility afforded by AD enables the rapid exploration and evaluation of various objectives and constraints. We illustrate this capability through challenging examples encompassing thermo-fluidic coupling, fluid-structure interaction, and non-Newtonian flows. Additionally, we demonstrate the seamless integration of our framework with neural networks and machine learning methodologies, enabling modern approaches to scientific computing. Ultimately, the framework aims to provide a foundational resource to accelerate research and innovation in fluid-based TO. The software accompanying this educational paper can be accessed at github.com/UW-ERSL/TOFLUX.