Related papers: Matrix bordering structure of the Faddeev-Jackiw a…
Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…
Based on the ideas of Optimal Control, we introduce the new basic characteristic of a bracket generating distribution, the Jacobi symbol. In contrast to the classical Tanaka symbol, the set of Jacobi symbols is discrete and classifiable. We…
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…
We develop numerical methods for elliptic systems governed by partial segregation constraints, in which three nonnegative components are required to have a vanishing pointwise product throughout the domain. This constraint enforces that at…
Differential-algebraic equations (DAEs) have been used in modeling various dynamical systems in science and engineering. Several preprocessing methods for DAEs, such as consistent initialization and index reduction, use structural…
For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…
This work presents a non-intrusive surrogate modeling scheme based on machine learning technology for predictive modeling of complex systems, described by parametrized time-dependent PDEs. For these problems, typical finite element…
The main focus of this paper is the study of efficient multigrid methods for large linear systems with a particular saddle-point structure. Indeed, when the system matrix is symmetric, but indefinite, the variational convergence theory that…
We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…
We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate gradient…
In this contribution, a finite element scheme to impose mixed boundary conditions without introducing Lagrange multipliers is presented for hyperbolic systems described as port-Hamiltonian systems. The strategy relies on finite element…
In this paper, we consider a nonconvex optimization problem with nonlinear equality constraints. We assume that both, the objective function and the functional constraints are locally smooth. For solving this problem, we propose a…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
A well-known method for completing low-rank matrices based on convex optimization has been established by Cand{\`e}s and Recht. Although theoretically complete, the method may not entirely solve the low-rank matrix completion problem. This…
In this paper, we develop a structure-preserving discretization of the Lagrangian framework for electromagnetism, combining techniques from variational integrators and discrete differential forms. This leads to a general family of…
Dynamic Bayesian networks have been well explored in the literature as discrete-time models: however, their continuous-time extensions have seen comparatively little attention. In this paper, we propose the first constraint-based algorithm…
We deduce the constraint structure and subsequently quantize a free particle system residing on a torus satisfying the geometric constraint $(r-a)=0$, within the framework of modified Faddeev-Jackiw formalism. Further, we reformulate the…
In this paper we consider a nonconvex optimization problem with nonlinear equality constraints. We assume that both, the objective function and the functional constraints, are locally smooth. For solving this problem, we propose a…
In this work, we propose staggered FDTD schemes based on the correction function method (CFM) to discretize Maxwell's equations with embedded perfect electric conductor (PEC) boundary conditions. The CFM uses a minimization procedure to…