Related papers: From Hopf to Neimark-Sacker bifurcation: a computa…

Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…

Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this…

We consider autonomous Hamiltonian systems and present an algorithm to compute at the same time partially hyperbolic invariant tori (whiskered tori), as well as high-order expansions of their stable and unstable manifolds. Such whiskered…

Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…

The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…

Nonresonant Hopf-Hopf singularity in neutral functional differential equation (NFDE) is considered. An algorithm for calculating the third-order normal form is established by using the formal adjoint theory, center manifold theorem and the…

We explain the setup for using the pde2path libraries for Hopf bifurcation and continuation of branches of periodic orbits and give implementation details of the associated demo directories. See [Uecker, Comm. in Comp. Phys., 2019] for a…

We present theorems which provide the existence of invariant whiskered tori in finite-dimensional exact symplectic maps and flows. The method is based on the study of a functional equation expressing that there is an invariant torus. We…

We propose and study an algorithm for computing a nearest passive system to a given non-passive linear time-invariant system (with much freedom in the choice of the metric defining `nearest', which may be restricted to structured…

The Tucker decomposition expresses a given tensor as the product of a small core tensor and a set of factor matrices. Apart from providing data compression, the construction is useful in performing analysis such as principal component…

Studying 2 degree-of-freedom (DOF) Hamiltonian dynamical systems often involves the computation of stable & unstable manifolds of periodic orbits, due to the homoclinic & heteroclinic connections they can generate. Such study is generally…

We derive a CUR-type factorization for tensors in the Tucker format based on interpolatory decomposition, which we will denote as Higher Order Interpolatory Decomposition (HOID). Given a tensor $\mathcal{X}$, the algorithm provides a set of…

Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…

A selection of algorithms for the rational approximation of matrix-valued functions are discussed, including variants of the interpolatory AAA method, the RKFIT method based on approximate least squares fitting, vector fitting, and a method…

This work investigates a class of non-autonomous $T$-periodic piecewise smooth differential systems and their associated time-$T$ maps. Our main result provides an analytical approach for detecting, within this class of piecewise…

We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…

We present several topics involving the computation of dynamical systems. The emphasis is on work in progress and the presentation is informal -- there are many technical details which are not fully discussed. The topics are chosen to…

We describe a method of computing equivariant and ordinary intersection cohomology of certain varieties with actions of algebraic tori, in terms of structure of the zero- and one-dimensional orbits. The class of varieties to which our…

In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…

The top-k operation, i.e., finding the k largest or smallest elements from a collection of scores, is an important model component, which is widely used in information retrieval, machine learning, and data mining. However, if the top-k…