Related papers: Solving the $KP$ problem with the Global Cartan De…
Quantum optimal control plays a crucial role in the development of quantum technologies, particularly in the design and implementation of fast and accurate gates for quantum computing. Here, we present a method to synthesize gates using the…
Optimization problems over compact Lie groups have been extensively studied due to their broad applications in linear programming and optimal control. This paper analyzes least square problems over a noncompact Lie group, the symplectic…
A series of hybrid quantum-classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems under centralized, distributed, and partially distributed frameworks. In the centralized approach,…
Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching and it is strongly related to the maximum independent set…
Gravitational perturbations in a Kerr black hole background can not be decomposed into simple tensor harmonics in the time domain. Here, we make the mode decomposition only in the azimuthal direction and discuss the resulting…
\textit{Clustering problems} often arise in the fields like data mining, machine learning etc. to group a collection of objects into similar groups with respect to a similarity (or dissimilarity) measure. Among the clustering problems,…
This paper is devoted to the numerical analysis of a control constrained distributed optimal control problem subject to a time fractional diffusion equation with non-smooth initial data. The solutions of state and co-state are decomposed…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
In this work, we propose an adaptive spectral element algorithm for solving nonlinear optimal control problems. The method employs orthogonal collocation at the shifted Gegenbauer-Gauss points combined with very accurate and stable…
We propose a generalization of the so-called rational map ansatz on the Euclidean space $\mathbb{R}^3$, for any compact simple Lie group $G$ such that $G/{\widehat K}\otimes U(1)$ is an Hermitian symmetric space, for some subgroup…
In this paper we propose and partially carry out a program to use $K$-theory to refine the topological realization problem of unstable algebras over the Steenrod algebra. In particular, we establish a suitable form of algebraic models for…
We propose a space-time scheme that combines an unfitted finite element method in space with a discontinuous Galerkin time discretisation for the accurate numerical approximation of parabolic problems with moving domains or interfaces. We…
The Cartan's method of equivalence and moving coframe method has been applied to solve the local equivalence problem for KDV-type equations under the action of a pseudo-group of contact transformations. The structure equations, the sets of…
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…
By [arXiv:1604.00528], a list of possible holonomy algebras for pseudo-Riemannian manifolds with an indecomposable torsion free ${\rm G}_{2}^*$-structure is known. Here indecomposability means that the standard representation of the algebra…
The problem of identifying and reconstructing operators from a diagonal of the Gabor matrix is considered. The framework of Quantum Time--Frequency Analysis is used, wherein this problem is equivalent to the discretisation of the diagonal…
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even…
We propose a hydridizable discontinuous Galerkin (HDG) method for solving the Cahn-Hilliard equation. The temporal discretization can be based on either the backward Euler method or the convex-splitting method. We show that the fully…
We use descent theoretic methods to solve the homotopy limit problem for Hermitian $K$-theory over quasi-compact and quasi-separated base schemes. As another application of these descent theoretic methods, we compute the cellular Picard…
In the context of Galerkin discretizations of a partial differential equation (PDE), the modes of the classical method of Proper Orthogonal Decomposition (POD) can be interpreted as the ansatz and trial functions of a low-dimensional…