Globalizing the Carleman linear embedding method for nonlinear dynamics

• URL: http://arxiv.org/abs/2510.15715v1
• Date: Fri, 17 Oct 2025 14:59:07 GMT
• Title: Globalizing the Carleman linear embedding method for nonlinear dynamics
• Authors: Ivan Novikau, Ilon Joseph,
• Abstract summary: The Carleman embedding method fails to converge in regions where there are multiple fixed points.<n>We propose three versions of a global piecewise Carleman embedding technique, based on partitioning space into multiple regions.<n>All techniques are numerically tested on multiple integrable and chaotic nonlinear dynamical systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Carleman embedding method is a widely used technique for linearizing a system of nonlinear differential equations, but fails to converge in regions where there are multiple fixed points. We propose and test three different versions of a global piecewise Carleman embedding technique, based on partitioning space into multiple regions where the center and size of the embedding region are chosen to control convergence. The first method switches between local linearization regions of fixed size once the trajectory reaches the boundary of the current linearization chart. During the transition, the embedding is reconstructed within the newly created chart, centered at the transition point. The second method also adapts the chart size dynamically, enhancing accuracy in regions where multiple fixed points are located. The third method partitions the state space using a static grid with precomputed linearization charts of fixed size, making it more suitable for applications that require high speed. All techniques are numerically tested on multiple integrable and chaotic nonlinear dynamical systems demonstrating their applicability for problems that are completely intractable for the standard Carleman embedding method. Simulations of chaotic dynamical systems such as various types of strange attractors demonstrate the power of the adaptive methods, if a sufficiently low tolerance is imposed. Still, the non-adaptive version of the method, with fixed centers and sizes of the linearization charts, can be faster in simulating dynamical systems while providing similar accuracy and may be more appropriate as the basis of algorithms for future quantum computers.

Related papers

• Data-Driven Motion Planning for Uncertain Nonlinear Systems [9.488752723308957]
  This paper proposes a data-driven motion-planning framework for nonlinear systems.<n>An algorithm constructs a sequence of overlapping invariant polytopes.<n>Control gains are interpolated in real time via simplex-based, keeping the state inside the invariant polytopes throughout the motion.
  arXiv  Detail & Related papers  (2025-07-31T20:41:34Z)
• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Go With the Flow: Fast Diffusion for Gaussian Mixture Models [13.836464287004505]
  Schrodinger Bridges (SBs) are diffusion processes that steer in finite time, a given initial distribution to another final one while minimizing a suitable cost functional.<n>We propose an analytic parametrization of a set of feasible policies for solving low-to-dimensional problems.<n>We showcase the potential of this approach in low-to-dimensional problems such as image-to- latent translation in the space of an autoencoder, learning of cellular dynamics using multi-marginal momentum SBs, and various other examples.
  arXiv  Detail & Related papers  (2024-12-12T08:40:22Z)
• Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching [55.28394191394675]
  We develop an adaptive inexact Newton method for equality-constrained nonlinear, nonIBS optimization problems. We demonstrate the superior performance of our method on benchmark nonlinear problems, constrained logistic regression with data from LVM, and a PDE-constrained problem.
  arXiv  Detail & Related papers  (2023-05-28T06:33:37Z)
• Error-Correcting Neural Networks for Two-Dimensional Curvature Computation in the Level-Set Method [0.0]
  We present an error-neural-modeling-based strategy for approximating two-dimensional curvature in the level-set method. Our main contribution is a redesigned hybrid solver that relies on numerical schemes to enable machine-learning operations on demand.
  arXiv  Detail & Related papers  (2022-01-22T05:14:40Z)
• Local Quadratic Convergence of Stochastic Gradient Descent with Adaptive Step Size [29.15132344744801]
  We establish local convergence for gradient descent with adaptive step size for problems such as matrix inversion. We show that these first order optimization methods can achieve sub-linear or linear convergence.
  arXiv  Detail & Related papers  (2021-12-30T00:50:30Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Model reduction for the material point method via learning the deformation map and its spatial-temporal gradients [9.509644638212773]
  The technique approximates the $textitkinematics$ by approximating the deformation map in a manner that restricts deformation trajectories to reside on a low-dimensional manifold. The ability to generate material points also allows for adaptive quadrature rules for stress update.
  arXiv  Detail & Related papers  (2021-09-25T15:45:14Z)
• Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models [0.0]
  We introduce a manifold learning-based method for uncertainty quantification (UQ) in describing systems. The proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
  arXiv  Detail & Related papers  (2021-07-21T00:24:15Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)
• Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
  Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames. We show that our approach significantly improves accuracy, scalability, and robustness against noise.
  arXiv  Detail & Related papers  (2020-06-15T09:15:54Z)
• Neural Subdivision [58.97214948753937]
  This paper introduces Neural Subdivision, a novel framework for data-driven coarseto-fine geometry modeling. We optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. We demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.
  arXiv  Detail & Related papers  (2020-05-04T20:03:21Z)
• Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
  Bilinear pooling achieves great success in fine-grained visual recognition (FGVC) Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features. We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
  arXiv  Detail & Related papers  (2020-03-30T08:40:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.