SearcharxivSearch

arXiv subjects

Adrian Butscher

Publications and source records attributed to Adrian Butscher.

At least 19 recordsLinked to original sources

Physics-informed Reduced Order Modeling of Time-dependent PDEs via Differentiable Solvers

Reduced-order modeling (ROM) of time-dependent and parameterized differential equations aims to accelerate the simulation of complex high-dimensional systems by learning a compact latent manifold representation that captures the characteristics of the solution fields and their time-dependent dynamics. Although high-fidelity numerical solvers generate the training datasets, they have thus far been excluded from the training process, causing the learned latent dynamics to drift away from the discretized governing physics. This mismatch often limits generalization and forecasting capabilities. In this work, we propose Physics-informed ROM ($\Phi$-ROM) by incorporating differentiable PDE solvers into the training procedure. Specifically, the latent space dynamics and its dependence on PDE parameters are shaped directly by the governing physics encoded in the solver, ensuring a strong correspondence between the full and reduced systems. Our model outperforms state-of-the-art data-driven ROMs and other physics-informed strategies by accurately generalizing to new dynamics arising from unseen parameters, enabling long-term forecasting beyond the training horizon, maintaining continuity in both time and space, and reducing the data cost. Furthermore, $\Phi$-ROM learns to recover and forecast the solution fields even when trained or evaluated with sparse and irregular observations of the fields, providing a flexible framework for field reconstruction and data assimilation. We demonstrate the framework's robustness across various PDE solvers and highlight its broad applicability by providing an open-source JAX implementation that is readily extensible to other PDE systems and differentiable solvers, available at https://phi-rom.github.io.

cs.LG

Physics-based simulation ontology: an ontology to support modelling and reuse of data for physics-based simulation

The current work presents an ontology developed for physics-based simulation in engineering design, called Physics-based Simulation Ontology (PSO). The purpose of the ontology is to assist in modelling the physical phenomenon of interest in a veridical manner, while capturing the necessary and reusable information for physics-based simulation solvers. The development involved extending an existing upper ontology, Basic Formal Ontology (BFO), to define lower-level terms of PSO. PSO has two parts: PSO-Physics, which consists of terms and relations used to model physical phenomena based on the perspective of classical mechanics involving partial differential equations, and PSO-Sim, which consists of terms used to represent the information artefacts that are about the physical phenomena modelled with PSO-Physics. The former terms are used to model the physical phenomenon of interest independent of solver-specific interpretations, which can be reused across different solvers, while the latter terms are used to instantiate solver-specific input data. A case study involving two simulation solvers was conducted to demonstrate this capability of PSO. Discussion around the benefits and limitations of using BFO for the current work is also provided, which should be valuable for any future work that extends an existing upper ontology to develop ontologies for engineering applications.

cs.AI

Configuration Design of Mechanical Assemblies using an Estimation of Distribution Algorithm and Constraint Programming

A configuration design problem in mechanical engineering involves finding an optimal assembly of components and joints that realizes some desired performance criteria. Such a problem is a discrete, constrained, and black-box optimization problem. A novel method is developed to solve the problem by applying Bivariate Marginal Distribution Algorithm (BMDA) and constraint programming (CP). BMDA is a type of Estimation of Distribution Algorithm (EDA) that exploits the dependency knowledge learned between design variables without requiring too many fitness evaluations, which tend to be expensive for the current application. BMDA is extended with adaptive chi-square testing to identify dependencies and Gibbs sampling to generate new solutions. Also, repair operations based on CP are used to deal with infeasible solutions found during search. The method is applied to a vehicle suspension design problem and is found to be more effective in converging to good solutions than a genetic algorithm and other EDAs. These contributions are significant steps towards solving the difficult problem of configuration design in mechanical engineering with evolutionary computation.

cs.NE

mPOLICE: Provable Enforcement of Multi-Region Affine Constraints in Deep Neural Networks

Deep neural networks are increasingly used in safety-critical domains such as robotics and scientific modeling, where strict adherence to output constraints is essential. Methods like POLICE, which are tailored for single convex regions, face challenges when extended to multiple disjoint regions, often leading to constraint violations or unwanted affine behavior across regions. This paper proposes mPOLICE, a new approach that generalizes POLICE to provably enforce affine constraints over multiple disjoint convex regions. At its core, mPOLICE assigns distinct neuron activation patterns to each constrained region, enabling localized affine behavior and avoiding unintended generalization. This is implemented through a layer-wise optimization of the network parameters. Additionally, we introduce a training algorithm that incorporates mPOLICE into conventional deep learning pipelines, balancing task-specific performance with constraint enforcement using periodic sign pattern enforcement. We validate the flexibility and effectiveness of mPOLICE through experiments across various applications, including safety-critical reinforcement learning, implicit 3D shape representation with geometric constraints, and fluid dynamics simulations with boundary condition enforcement. Importantly, mPOLICE incurs no runtime overhead during inference, making it a practical and reliable solution for constraint handling in deep neural networks.

cs.LG

A low order, torsion deformable spatial beam element based on the absolute nodal coordinate formulation and Bishop frame

Heretofore, the Serret-Frenet frame has been the ubiquitous choice for analyzing the elastic deformations of beam elements. It is well known that this frame is undefined at the inflection points and straight segments of the beam where its curvature is zero, leading to singularities and errors in their numerical analysis. On the other hand, there exists a lesser-known frame called Bishop which does not have the caveats of the Serret-Frenet frame and is well-defined everywhere along the beam centerline. Leveraging the Bishop frame, in this paper, we propose a new spatial, singularity-free low-order beam element based on the absolute nodal coordinate formulation for both small and large deformation applications. This element, named ANCF14, has a constant mass matrix and can capture longitudinal, transverse (bending) and torsional deformations. It is a two-noded element with 7 degrees of freedom per node, which are global nodal coordinates, nodal slopes and their cross-sectional rotation about the centerline. The newly developed element is tested through four complex benchmarks. Comparing the ANCF14 results with theoretical and numerical results provided in other studies confirms the efficiency and accuracy of the proposed element.

cs.CE

Design optimization of dynamic flexible multibody systems using the discrete adjoint variable method

The design space of dynamic multibody systems (MBSs), particularly those with flexible components, is considerably large. Consequently, having a means to efficiently explore this space and find the optimum solution within a feasible timeframe is crucial. It is well known that for problems with several design variables, sensitivity analysis using the adjoint variable method extensively reduces the computational costs. This paper presents the novel extension of the discrete adjoint variable method to the design optimization of dynamic flexible MBSs. The extension involves deriving the adjoint equations directly from the discrete, rather than the continuous, equations of motion. This results in a system of algebraic equations that is computationally less demanding to solve compared to the system of differential algebraic equations produced by the continuous adjoint variable method. To describe the proposed method, it is integrated with a numerical time-stepping algorithm based on geometric variational integrators. The developed technique is then applied to the optimization of MBSs composed of springs, dampers, beams and rigid bodies, considering both geometrical (e.g., positions of joints) and non-geometrical (e.g., mechanical properties of components) design variables. To validate the developed methods and show their applicability, three numerical examples are provided.

math.OC

Optimal Design of Vehicle Dynamics Using Gradient-Based, Mixed-Fidelity Multidisciplinary Optimization

In automotive engineering, designing for optimal vehicle dynamics is challenging due to the complexities involved in analysing the behaviour of a multibody system. Typically, a simplified set of dynamics equations for only the key bodies of the vehicle such as the chassis and wheels are formulated while reducing their degrees of freedom. In contrast, one could employ high-fidelity multibody dynamics simulation and include more intricate details such as the individual suspension components while considering full degrees of freedom for all bodies; however, this is more computationally demanding. Also, for gradient-based design optimization, computing adjoints for different objective functions can be more challenging for the latter approach, and often not feasible if an existing multibody dynamics solver is used. We propose a mixed-fidelity multidisciplinary approach, in which a simplified set of dynamics equations are used to model the whole vehicle while incorporating a high-fidelity multibody suspension module as an additional coupled discipline. We then employ MAUD (modular analysis and unified derivatives) to combine analytical derivatives based on the dynamics equations and finite differences obtained using an existing multibody solver. Also, we use a collocation method for time integration, which solves for both the system trajectory and optimal design variables simultaneously. The benefits of our approach are shown in an experiment conducted to find optimal vehicle parameters that optimize ride comfort and driving performance considering vertical vehicle dynamics.

eess.SY

Advancing Fluid-Based Thermal Management Systems Design: Leveraging Graph Neural Networks for Graph Regression and Efficient Enumeration Reduction

In this research, we developed a graph-based framework to represent various aspects of optimal thermal management system design, with the aim of rapidly and efficiently identifying optimal design candidates. Initially, the graph-based framework is utilized to generate diverse thermal management system architectures. The dynamics of these system architectures are modeled under various loading conditions, and an open-loop optimal controller is employed to determine each system's optimal performance. These modeled cases constitute the dataset, with the corresponding optimal performance values serving as the labels for the data. In the subsequent step, a Graph Neural Network (GNN) model is trained on 30% of the labeled data to predict the systems' performance, effectively addressing a regression problem. Utilizing this trained model, we estimate the performance values for the remaining 70% of the data, which serves as the test set. In the third step, the predicted performance values are employed to rank the test data, facilitating prioritized evaluation of the design scenarios. Specifically, a small subset of the test data with the highest estimated ranks undergoes evaluation via the open-loop optimal control solver. This targeted approach concentrates on evaluating higher-ranked designs identified by the GNN, replacing the exhaustive search (enumeration-based) of all design cases. The results demonstrate a significant average reduction of over 92% in the number of system dynamic modeling and optimal control analyses required to identify optimal design scenarios.

eess.SY

Extracting Design Knowledge from Optimization Data: Enhancing Engineering Design in Fluid Based Thermal Management Systems

As mechanical systems become more complex and technological advances accelerate, the traditional reliance on heritage designs for engineering endeavors is being diminished in its effectiveness. Considering the dynamic nature of the design industry where new challenges are continually emerging, alternative sources of knowledge need to be sought to guide future design efforts. One promising avenue lies in the analysis of design optimization data, which has the potential to offer valuable insights and overcome the limitations of heritage designs. This paper presents a step toward extracting knowledge from optimization data in multi-split fluid-based thermal management systems using different classification machine learning methods, so that designers can use it to guide decisions in future design efforts. This approach offers several advantages over traditional design heritage methods, including applicability in cases where there is no design heritage and the ability to derive optimal designs. We showcase our framework through four case studies with varying levels of complexity. These studies demonstrate its effectiveness in enhancing the design of complex thermal management systems. Our results show that the knowledge extracted from the configuration design optimization data provides a good basis for more general design of complex thermal management systems. It is shown that the objective value of the estimated optimal configuration closely approximates the true optimal configuration with less than 1 percent error, achieved using basic features based on the system heat loads without involving the corresponding optimal open loop control (OLOC) features. This eliminates the need to solve the OLOC problem, leading to reduced computation costs.

eess.SY

Multi-split configuration design for fluid-based thermal management systems

High power density systems require efficient cooling to maintain their thermal performance. Despite this, as systems get larger and more complex, human practice and insight may not suffice to determine the desired thermal management system designs. To this end, a framework for automatic architecture exploration is presented in this article for a class of single-phase, multi-split cooling systems. For this class of systems, heat generation devices are clustered based on their spatial information, and flow-split are added only when required and at the location of heat devices. To generate different architectures, candidate architectures are represented as graphs. From these graphs, dynamic physics models are created automatically using a graph-based thermal modeling framework. Then, an optimal fluid flow distribution problem is solved by addressing temperature constraints in the presence of exogenous heat loads to achieve optimal performance. The focus in this work is on the design of general multi-split heat management systems. The architectures discussed here can be used for various applications in the domain of configuration design. The multi-split algorithm can produce configurations where splitting can occur at any of the vertices. The results presented include 3 categories of cases and are discussed in detail.

eess.SY

A subtractive manufacturing constraint for level set topology optimization

We present a method for enforcing manufacturability constraints in generated parts such that they will be automatically ready for fabrication using a subtractive approach. We primarily target multi-axis CNC milling approaches but the method should generalize to other subtractive methods as well. To this end, we take as user input: the radius of curvature of the tool bit, a coarse model of the tool head and optionally a set of milling directions. This allows us to enforce the following manufacturability conditions: 1) surface smoothness such that the radius of curvature of the part does not exceed the milling bit radius, 2) orientation such that every part of the surface to be milled is visible from at least one milling direction, 3) accessibility such that every surface patch can be reached by the tool bit without interference with the tool or head mount. We will show how to efficiently enforce the constraint during level set-based topology optimization modifying the advection velocity such that at each iteration the topology optimization maintains a descent optimization direction and does not violate any of the manufacturability conditions. This approach models the actual subtractive process by carving away material accessible to the machine at each iteration until a local optimum is achieved.

cs.CE

Continuous-Flow Graph Transportation Distances

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized approximations. Motivated by fluid flow-based transportation on $\mathbb{R}^n$, however, this paper introduces an alternative definition of optimal transportation between distributions over graph vertices. This new distance still satisfies the triangle inequality but has better scaling and a connection to continuous theories of transportation. It is constructed by adapting a Riemannian structure over probability distributions to the graph case, providing transportation distances as shortest-paths in probability space. After defining and analyzing theoretical properties of our new distance, we provide a time discretization as well as experiments verifying its effectiveness.

cs.OH

A General Framework for Bilateral and Mean Shift Filtering

We present a generalization of the bilateral filter that can be applied to feature-preserving smoothing of signals on images, meshes, and other domains within a single unified framework. Our discretization is competitive with state-of-the-art smoothing techniques in terms of both accuracy and speed, is easy to implement, and has parameters that are straightforward to understand. Unlike previous bilateral filters developed for meshes and other irregular domains, our construction reduces exactly to the image bilateral on rectangular domains and comes with a rigorous foundation in both the smooth and discrete settings. These guarantees allow us to construct unconditionally convergent mean-shift schemes that handle a variety of extremely noisy signals. We also apply our framework to geometric edge-preserving effects like feature enhancement and show how it is related to local histogram techniques.

cs.GR

CMC Surfaces in Riemannian Manifolds Condensing to a Compact Network of Curves

A sequence of constant mean curvature surfaces $Σ_j$ with mean curvature $H_j \to \infty$ in a three-dimensional manifold $M$ condenses to a compact and connected graph $Γ$ consisting of a finite union of curves if $Σ_j$ is contained in a tubular neighbourhood of $Γ$ of size $\mathcal O(1/H_j)$ for every $j \in \N$. This paper gives sufficient conditions on $Γ$ for the existence of a sequence of compact, embedded constant mean curvature surfaces condensing to $Γ$. The conditions are: each curve in $γ$ is a critical point of a functional involving the scalar curvature of $M$ along $γ$; and each curve must satisfy certain regularity, non-degeneracy and boundary conditions. When these conditions are satisfied, the surfaces $Σ_j$ can be constructed by gluing together small spheres of radius $2/H_j$ positioned end-to-end along the edges of $Γ$.

math.DG

A Gluing Construction for Prescribed Mean Curvature

The gluing technique is used to construct hypersurfaces in Euclidean space having approximately constant prescribed mean curvature. These surfaces are perturbations of unions of finitely many spheres of the same radius assembled end-to-end along a line segment. The condition on the existence of these hypersurfaces is the vanishing of the sum of certain integral moments of the spheres with respect the prescribed mean curvature function.

math.DG

Constant Mean Curvature Hypersurfaces Condensing to Geodesic Segments and Rays in Riemannian Manifolds

We construct examples of compact and one-ended constant mean curvature surfaces with large mean curvature in Riemannian manifolds with axial symmetry by gluing together small spheres positioned end-to-end along a geodesic. Such surfaces cannot exist in Euclidean space, but we show that the gradient of the ambient scalar curvature acts as a `friction term' which permits the usual analytic gluing construction to be carried out.

math.DG

Hamiltonian Stationary Lagrangian Tori in Kaehler Manifolds

A Hamiltonian stationary Lagrangian submanifold of a Kaehler manifold is a Lagrangian submanifold whose volume is stationary under Hamiltonian variations. We find a sufficient condition on the curvature of a Kaehler manifold of real dimension four that guarantees the existence of a family of small Hamiltonian stationary Lagrangian tori.

math.DG

Constant Mean Curvature Hypersurfaces in the (n+1)-Sphere by Gluing Spherical Building Blocks

The techniques developed by Butscher in arXiv:math/0703469 for constructing constant mean curvature (CMC) hypersurfaces in the (n+1)-sphere by gluing together spherical building blocks are generalized to handle less symmetric initial configurations. The outcome is that the approximately CMC hypersurface obtained by gluing the initial configuration together can be perturbed into an exactly CMC hypersurface only when certain global geometric conditions are met. These `balancing conditions' are analogous to those that must be satisfied in the `classical' context of gluing constructions of CMC hypersurfaces in Euclidean space, although they are more restrictive in the (n+1)-sphere case. An example of an initial configuration is given which demonstrates this fact; and another example of an initial configuration is given which possesses no symmetries at all.

math.DG