Related papers: Multiple timescales and the parametrisation method…
The computational singular perturbation (CSP) method is an algorithm which iteratively approximates slow manifolds and fast fibers in multiple-timescale dynamical systems. Since its inception due to Lam and Goussis, the convergence of the…
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm \cite{FP22} works under variable external conditions and generates continuous motions of the system to…
In this paper, we construct and analyze a multiscale (finite element) method for parabolic problems with heterogeneous dynamic boundary conditions. As origin, we consider a reformulation of the system in order to decouple the discretization…
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…
In this paper, we present a generalization of the parameterization method, introduced by Cabr\'{e}, Fontich and De la Llave, to center manifolds associated to non-hyperbolic fixed points of discrete dynamical systems. As a byproduct, we…
We present a geometric algorithm for obtaining consistent solutions to systems of partial differential equations, mainly arising from singular covariant first-order classical field theories. This algorithm gives an intrinsic description of…
Slow-fast dynamical systems, i.e., singularly or non-singularly perturbed dynamical systems possess slow invariant manifolds on which trajectories evolve slowly. Since the last century various methods have been developed for approximating…
We consider slow-fast systems of differential equations, in which both the slow and fast variables are perturbed by noise. When the deterministic system admits a uniformly asymptotically stable slow manifold, we show that the sample paths…
In this work we present a variant of the fast multipole method (FMM) for efficiently evaluating standard layer potentials on geometries with complex coordinates in two and three dimensions. The complex scaled boundary integral method for…
Boundary integral methods are highly suited for problems with complicated geometries, but require special quadrature methods to accurately compute the singular and nearly singular layer potentials that appear in them. This paper presents a…
This paper establishes the iteration-complexity of proximal bundle methods for solving hybrid (i.e., a blend of smooth and nonsmooth) weakly convex composite optimization (HWC-CO) problems. This is done in a unified manner by considering a…
This work focuses on the development of a self adjusting multirate strategy based on an implicit time discretization for the numerical solution of hyperbolic equations, that could benefit from different time steps in different areas of the…
We present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the…
Synchronization in a group of linear time-invariant systems is studied where the coupling between each pair of systems is characterized by a different output matrix. Simple methods are proposed to generate a (separate) linear coupling gain…
We develop a geometric framework that characterizes the synchronization problem --- the problem of consistently registering or aligning a collection of objects. The theory we formulate characterizes the cohomological nature of…
In this document, we deal with the stabilization problem of slow-fast systems (or singularly perturbed Ordinary Differential Equations) at a non-hyperbolic point. The class of systems studied here have the following properties: 1) they have…
The spectral bundle method proposed by Helmberg and Rendl is well established for solving large-scale semidefinite programs (SDP) thanks to its low per iteration computational complexity and strong practical performance. In this paper, we…
The Computational Singular Perturbation (CSP) method of Lam and Goussis is an iterative method to reduce the dimensionality of systems of ordinary differential equations with multiple time scales. In [J. Nonlin. Sci., to appear], the…
This paper investigates model-order reduction methods for geometrically nonlinear structures. The parametrisation method of invariant manifolds is used and adapted to the case of mechanical systems expressed in the physical basis, so that…
Slow manifolds are important geometric structures in the state spaces of dynamical systems with multiple time scales. This paper introduces an algorithm for computing trajectories on slow manifolds that are normally hyperbolic with both…