Related papers: Matrix bordering structure of the Faddeev-Jackiw a…
In the present work it is shown that the family of first-order Lagrangians for the t-J model and the corresponding correlation generating functional previously found can be exactly mapped into the slave-fermion decoupled representation.…
We seek to impose linear, equality constraints in feedforward neural networks. As top layer predictors are usually nonlinear, this is a difficult task if we seek to deploy standard convex optimization methods and strong duality. To overcome…
The development of machine learning in particular and artificial intelligent in general has been strongly conditioned by the lack of an appropriate interface layer between deduction, abduction and induction. In this work we extend…
The aim of this work is to discuss some aspects of the reduction of order formalism in the context of the Fadeev-Jackiw symplectic formalism, both at the classical and the quantum level. We start by reviewing the symplectic analysis in a…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
We present a unified framework for the construction of localized exponential integrators that bypasses the traditional trade-off between the accuracy of global spectral methods and the efficiency of sparse finite differences. By evaluating…
Augmented Lagrangian and optimistic primal--dual methods stabilize equality-constrained optimization through seemingly different mechanisms: the former adds constraint-dependent primal curvature, while the latter adds dual memory. Recent…
In the recent study of Virasoro action on characters, we discovered that it gets especially simple for peculiar linear combinations of the Virasoro operators: particular harmonics of $\hat w$-operators. In this letter, we demonstrate that…
Mixed optimal stopping and stochastic control problems define variational inequalities with non-linear Hamilton-Jacobi-Bellman (HJB) operators, whose numerical solution is notoriously difficult and lack of reliable benchmarks. We first use…
This paper presents a matrix-free approach for implementing the shifted boundary method (SBM) in finite element analysis. The SBM is a versatile technique for solving partial differential equations on complex geometries by shifting boundary…
A new way of encoding a non-self-adjoint Jacobi matrix $J$ by a spectral measure of $|J|$ together with a phase function was described by Pushnitski--\v Stampach in the bounded case. We present another perspective on this correspondence,…
A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel…
In this paper we lay the foundation for a numerical algorithm to simulate high-dimensional coupled FBSDEs under weak coupling or monotonicity conditions. In particular, we prove convergence of a time discretization and a Markovian…
In this paper, we consider a multi-block generalized alternating direction method of multiplier (GADMM) algorithm for minimizing a linearly constrained separable nonconvex and possibly nonsmooth optimization problem. The GADMM generalizes…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…
In this paper we develop symbolic computation algorithms to investigate finiteness of central configurations for the planar $n$-body problem. Our approach is based on Albouy-Kaloshin's work on finiteness of central configurations for the…
We extend the Malitsky-Tam forward-reflected-backward (FRB) splitting method for inclusion problems of monotone operators to nonconvex minimization problems. By assuming the generalized concave Kurdyka-{\L}ojasiewicz (KL) property of a…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
This note aims to study the iteration theory of noncommutative self-maps of bounded matrix convex domains. We prove a version of the Denjoy-Wolff theorem for the row ball and the maximal quantization of the unit ball of $\mathbb{C}^d$. For…
The Faddeev equations for the $\Xi NN$ bound-state problem are solved where the three $S$=$-2$ baryon-baryon interactions of J\"ulich-Bonn-M\"unchen chiral EFT, HAL QCD and Nijmegen ESC08c are used. The $T$-matrix $T_{\Xi N, \Xi N}$…