Related papers: Multi-dimensional summation-by-parts operators for…
The ability to learn polynomials and generalize out-of-distribution is essential for simulation metamodels in many disciplines of engineering, where the time step updates are described by polynomials. While feed forward neural networks can…
The Koopman operator approach provides a powerful linear description of nonlinear dynamical systems in terms of the evolution of observables. While the operator is typically infinite-dimensional, it is crucial to develop finite-dimensional…
Some properties of numerical time integration methods using summation by parts operators and simultaneous approximation terms are studied. These schemes can be interpreted as implicit Runge-Kutta methods with desirable stability properties…
This review paper highlights the main aspects of the development of research related to the solution of extreme problems in the theory of approximation in the spaces ${\mathcal S}^p$ and $B{\mathcal S}^p$ of periodic and almost periodic…
It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are…
This paper introduces generalized Bregman projection algorithms for solving nonlinear split feasibility problems (SF P s) in infinitedimensional Hilbert spaces. The methods integrate Bregman projections, proximal gradient steps, and…
In this paper, we design high order accurate and stable finite difference schemes for the initial-boundary value problem, associated with the magnetic induction equation with resistivity. We use Summation-By-Parts (SBP) finite difference…
The Active Flux method is a numerical method for conservation laws using a combination of cell averages and point values, based on ideas from finite volumes and finite differences. This unusual mix has been shown to work well in many…
One-dimensional function approximation is a fundamental problem in scientific computing and engineering applications. While neural networks possess powerful universal approximation capabilities, their optimization process is often hindered…
Multidimensional population balance models (PBMs) describe chemical and biological processes having a distribution over two or more intrinsic properties (such as size and age, or two independent spatial variables). The incorporation of…
We study four-point correlation functions of half-BPS operators of arbitrary weight for all dimensions d=3,4,5,6 where superconformal theories exist. Using harmonic superspace techniques, we derive the superconformal Ward identities for…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
We discuss finite difference techniques for hyperbolic equations in non-trivial domains, as those that arise when simulating black hole spacetimes. In particular, we construct dissipative and difference operators that satisfy the {\it…
This paper presents a method for calculating Region of Attraction of a target set (not necessarily an equilibrium) for controlled polynomial dynamical systems, using a hierarchy of semidefinite programming problems (SDPs). Our approach…
We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…
This article investigates the convergence properties of s-numbers of certain truncations of bounded linear operators between Banach spaces. We prove a generalized version of a known convergence result for the approximation numbers of…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…
We present a finite-horizon optimization algorithm that extends the established concept of Dual Dynamic Programming (DDP) in two ways. First, in contrast to the linear costs, dynamics, and constraints of standard DDP, we consider problems…
We investigate a new representation of general operators by means of sums of shifted Gabor multipliers. These representations arise by studying the matrix of an operator with respect to a Gabor frame. Each shifted Gabor multiplier…