arXiv subjects

Annie Cuyt

Publications and source records attributed to Annie Cuyt.

9 recordsLinked to original sources

arXiv2026

Approximation by short exponential sums with geometric error decay based on Gauss quadrature

We present new short exponential sum approximations of length $N$ for $f_1(x)=\frac{1}{a+x}$ with $a>0$ on $[0, \infty)$ and for $f_2(x)= {\mathrm e}^{-x^2/2σ}$ with $σ>0$ on ${\mathbb R}$ with geometric error decay $ρ^{-2N}$ for user-defined $N \ge 2$ and $ρ>1$. The approximations are built over consecutive intervals $[b_j, \, b_{j+1}) \subset [0, \infty)$, $j \in {\mathbb N}_{0}$, with interval lengths that depend on $ρ$ and grow exponentially for $f_1$ and are equidistant for $f_2$. All parameters determining the exponential sum approximations on $[b_j, \, b_{j+1})$ are easily computed from the initial parameters on $[b_0, \, b_{1})$, ensuring numerical stability. Our method is based on Gauss-Laguerre and Gauss-Hermite quadrature, respectively, applied to suitable parametric integral representations of $f_1$ and $f_2$. This technique ensures consistent relative errors across all intervals. Using the obtained exponential sum approximations, we achieve highly accurate approximations of $\log(x)$ on $[1,\infty)$ and of the error function $\mathrm{erf}(x)$ with predictable geometric error decay. Numerical examples for $N=8$ and $N=10$ clearly illustrate the theoretical error estimates.

math.NA↗

arXiv2024

Mechanism Design Optimization through CAD-Based Bayesian Optimization and Quantified Constraints

This research delves into optimizing mechanism design, with an emphasis on the energy efficiency and the expansive design possibilities of reciprocating mechanisms. It investigates how to efficiently integrate Computer-Aided Design (CAD) simulations with Bayesian Optimization (BO) and a constrained design space, aiming to enhance the design optimization process beyond the confines of traditional kinematic and dynamic analysis. The study sets out to create a novel optimization framework that merges CAD simulations with a BO strategy. Initially, the feasibility of a mechanism design is assessed through CAD-motion simulations, which gauge its practicality. Upon deeming a design feasible, an evaluation via CAD-motion simulations is conducted to ascertain the objective value. This research proposes utilizing non-parametric Gaussian processes for crafting a surrogate model of the objective function, considering the design space's static and dynamic constraints. The findings reveal that the introduced CAD-based Bayesian Optimization framework adeptly identifies optimal design parameters that minimize root mean square (RMS) torque while complying with predetermined constraints. This method markedly diminishes the complexity seen in analytical approaches, rendering it adaptable to intricate mechanisms and practicable for machine builders. The framework evidences the utility of integrating constraints in the optimization process, showing promise for attaining globally optimal designs efficiently. A case study on an emergency ventilator, with three design parameters, demonstrates a 71% RMS torque reduction after 255 CAD-based evaluations, underscoring the approach's effectiveness and its potential for refining mechanism design optimization.

eess.SY↗

arXiv2023

Multiscale matrix pencils for separable reconstruction problems

The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the nonlinear parameters. The matrix pencil method, which reformulates the problem statement into a generalized eigenvalue problem for the nonlinear parameters and a structured linear system for the linear parameters, is generally considered as the more stable method to solve the problem computationally. In Section 2 the matrix pencil associated with the classical complex exponential fitting or sparse interpolation problem is summarized and the concepts of dilation and translation are introduced to obtain matrix pencils at different scales. Exponential analysis was earlier generalized to the use of several polynomial basis functions and some operator eigenfunctions. However, in most generalizations a computational scheme in terms of an eigenvalue problem is lacking. In the subsequent Sections 3--6 the matrix pencil formulation, including the dilation and translation paradigm, is generalized to more functions. Each of these periodic, polynomial or special function classes needs a tailored approach, where optimal use is made of the properties of the parameterized elementary or special function used in the sparse interpolation problem under consideration. With each generalization a structured linear matrix pencil is associated, immediately leading to a computational scheme for the nonlinear and linear parameters, respectively from a generalized eigenvalue problem and one or more structured linear systems. Finally, in Section 7 we illustrate the new methods.

math.NA↗

arXiv2022

CAD Based Design Optimization of Four-bar Mechanisms: a coronaventilator case study

Design optimization of mechanisms is a promising research area as it results in more energy-efficient machines without compromising performance. However, machine builders do not actually use the design methods described in the literature as these algorithms require too much theoretical analysis. Moreover, the design synthesis approaches in the literature predominantly utilize heuristic optimizers leading to suboptimal local minima. This research introduces a convenient optimization workflow allowing wide industrial adoption, while guaranteeing to reveal the global optimum. To guarantee that we find the global optimum, a mathematical expression of the constraints describing the feasible region of possible designs is of great importance. Therefore, kinematic analysis of the point-to-point (PTP) planar four-bar mechanism is discussed to obtain the static and dynamic constraints. Within the feasible region, objective value samples are generated through CAD multi-body software. These motion simulations determine the required torque to fulfill the movement for a certain combination of design parameters. Sparse interpolation techniques allow minimizing the required amount of samples and thus CAD simulations. Moreover, this interpolation of simulation results enables the representation of the objective in a mathematical description without in-depth analytical design analysis by the machine designer. Subsequently, the mathematical expression of the objective allows global optimizers to find a global optimal design within the feasible design space. In a case study of a coronaventilator mechanism with three design parameters (DP's), 1870 CAD motion simulations from which only 618 are used to build a model allowed to reduce the RMS torque of the mechanism by 67%.

eess.SY↗

arXiv2022

Energy Optimal Point-to-Point Motion Profile Optimization

Position-controlled systems driving repetitive tasks are of significant importance in industrial machinery. The electric actuators used in these systems are responsible for a large part of the global energy consumption, indicating that major savings can be made in this field. In this context, motion profile optimization is a very cost-effective solution as it allows for more energy-efficient machines without additional hardware investments or adaptions. In particular, mono-actuated mechanisms with position-dependent system properties have received considerable attention in literature. However, the current state-of-the-art methods often use unbounded design parameters to describe the motion profile. This both increases the computational complexity and hampers the search for a global optimum. In this paper, Chebyshev polynomials are used to describe the motion profile. Moreover, the exact bounds on the Chebyshev design parameters are derived. This both seriously reduces the computational complexity and limits the design space, allowing the application of a global optimizer such as the genetic algorithm. Experiments validate the added value of the chosen approach. In this study, it is found that the energy consumption can be reduced by 62.9% compared to a standard reference motion profile.

eess.SY↗

arXiv2020

VEXPA: Validated EXPonential Analysis through regular sub-sampling

We present a procedure that adds a number of desirable features to standard exponential analysis algorithms, among which output reliability, a divide-and-conquer approach, the automatic detection of the exponential model order, robustness against some outliers, and the possibility to parallelize the analysis. The key enabler for these features is the introduction of uniform sub-Nyquist sampling through decimation of the dense signal data. We actually make use of possible aliasing effects to recondition the problem statement rather than that we avoid aliasing. In Section 2 the standard exponential analysis is described, including a sensitivity analysis. In Section 3 the ingredients for the new approach are collected, of which good use is made in Section 4 where we essentially bring everything together in what we call VEXPA. Some numerical examples of the new procedure illustrate in Section 5 that the additional features are indeed realized and that VEXPA is a valuable add-on to any stand-alone exponential analysis. While returning a lot of additional output, it maintains a favourable comparison to the CRLB of the underlying method, for which we here choose a matrix pencil method. Moreover, the output reliability of VEXPA is similar to that of atomic norm minimization, whereas its computational complexity is far less.

math.NA↗

arXiv2018

How to get high resolution results from sparse and coarsely sampled data

Sampling a signal below the Shannon-Nyquist rate causes aliasing, meaning different frequencies to become indistinguishable. It is also well-known that recovering spectral information from a signal using a parametric method can be ill-posed or ill-conditioned and therefore should be done with caution. We present an exponential analysis method to retrieve high-resolution information from coarse-scale measurements, using uniform downsampling. We exploit rather than avoid aliasing. While we loose the unicity of the solution by the downsampling, it allows to recondition the problem statement and increase the resolution. Our technique can be combined with different existing implementations of multi-exponential analysis (matrix pencil, MUSIC, ESPRIT, APM, generalized overdetermined eigenvalue solver, simultaneous QR factorization,...) and so is very versatile. It seems to be especially useful in the presence of clusters of frequencies that are difficult to distinguish from one another.

math.NA↗

arXiv2017

Multivariate Exponential Analysis from the Minimal Number of Samples

The problem of multivariate exponential analysis or sparse interpolation has received a lot of attention, especially with respect to the number of samples required to solve it unambiguously. In this paper we show how to bring the number of samples down to the absolute minimum of $(d+1)n$ where $d$ is the dimension of the problem and $n$ is the number of exponential terms. To this end we present a fundamentally different approach for the multivariate problem statement. We combine a one-dimensional exponential analysis method such as ESPRIT, MUSIC, the matrix pencil or any Prony-like method, with some linear systems of equations because the multivariate exponents are inner products and thus linear expressions in the parameters.

math.NA↗

arXiv2017

A hybrid Fourier-Prony method

The FFT algorithm that implements the discrete Fourier transform is considered one of the top ten algorithms of the $20$th century. Its main strengths are the low computational cost of $\mathcal{O}(n \log n$) and its stability. It is one of the most commonly used algorithms to analyze signals with a dense frequency representation. In recent years there has been an increasing interest in sparse signal representations and a need for algorithms that exploit such structure. We propose a new technique that combines the properties of the discrete Fourier transform with the sparsity of the signal. This is achieved by integrating ideas of Prony's method into Fourier's method. The resulting technique has the same frequency resolution as the original FFT algorithm but uses fewer samples and can achieve a lower computational cost. Moreover, the proposed algorithm is well suited for a parallel implementation.

math.NA↗