Related papers: An efficient and easy-to-extend Matlab code of the…
This work presents a multilevel approach to large--scale topology optimization accounting for linearized buckling criteria. The method relies on the use of preconditioned iterative solvers for all the systems involved in the linear buckling…
Multi-directional 3D printing has the capability of decreasing or eliminating the need for support structures. Recent work proposed a beam-guided search algorithm to find an optimized sequence of plane-clipping, which gives volume…
Scientific computing programs often undergo aggressive compiler optimization to achieve high performance and efficient resource utilization. While performance is critical, we also need to ensure that these optimizations are correct. In this…
The method of fundamental solutions (MFS) is known to be effective for solving 3D Laplace and Stokes Dirichlet boundary value problems in the exterior of a large collection of simple smooth objects. Here we present new scalable MFS…
We present a novel randomized block coordinate descent method for the minimization of a convex composite objective function. The method uses (approximate) partial second-order (curvature) information, so that the algorithm performance is…
Additive manufacturing is a free-form manufacturing technique in which parts are built in a layer-by-layer manner. Laser powder bed fusion is one of the popular techniques used to fabricate metal parts. However, it induces residual stress…
Modal decomposition techniques are showing a fast growth in popularity for their good properties as data-driven tools. There are several modal decomposition techniques, yet Proper Orthogonal Decomposition (POD) and Dynamic Mode…
Current optical coherent transponders technology is driving data rates towards 1 Tb/s/{\lambda}and beyond. This trend requires both high-performance coded modulation schemes and efficient implementation of the forward-error-correction (FEC)…
The rapid growth of 3D content from modern reconstruction and generative pipelines, such as neural rendering and large-scale 3D asset generation, has led to an abundance of dense, noisy, and often non-manifold meshes. While these…
The Spreading Projection Algorithm for Rapid K-space samplING, or SPARKLING, is an optimization-driven method that has been recently introduced for accelerated 2D T2*-w MRI using compressed sensing. It has then been extended to address 3D…
Disordered molecular systems such as amorphous catalysts, organic thin films, electrolyte solutions, and water are at the cutting edge of computational exploration today. Traditional simulations of such systems at length-scales relevant to…
Dynamic mode decomposition (DMD) is a recently developed tool for the analysis of the behavior of complex dynamical systems. In this paper, we will propose an extension of DMD that exploits low-rank tensor decompositions of potentially…
In this study, an efficient reanalysis strategy for dynamic topology optimization is proposed. Compared with other related studies, an online successive dynamic reanalysis method and POD-based approximate dynamic displacement strategy are…
Dynamic mode decomposition (DMD) has become a powerful data-driven method for analyzing the spatiotemporal dynamics of complex, high-dimensional systems. However, conventional DMD methods are limited to matrix-based formulations, which…
In this article, the convergence of a hybrid numerical method introduced in Daripa and Dutta (J. Comput. Phys., 335:249-282, 2017) has been established. This method integrates a discontinuous finite element method with a modified method of…
We propose a demonstration-efficient strategy to compress a computationally expensive Model Predictive Controller (MPC) into a more computationally efficient representation based on a deep neural network and Imitation Learning (IL). By…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
This paper provides a simple, compact and efficient 90-line pedagogical MATLAB code for topology optimization using hexagonal elements (honeycomb tessellation). Hexagonal elements provide nonsingular connectivity between two juxtaposed…
Many optimization problems arising in high-dimensional statistics decompose naturally into a sum of several terms, where the individual terms are relatively simple but the composite objective function can only be optimized with iterative…
The article addresses morphological approaches to design of modular systems. The following methods are briefly described: (i) basic version of morphological analysis (MA), (ii) modification of MA as method of closeness to ideal point(s),…