相关论文: On the linear equation method for the subduction p…

The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…

In this paper, we study distributed methods for solving a Sylvester equation in the form of AX+XB=C for matrices A, B, C$\in R^{n\times n}$ with X being the unknown variable. The entries of A, B and C (called data) are partitioned into a…

We decompose a matrix Y into a sum of bilinear terms in a stepwise manner, by considering Y as a mapping from a finite dimensional Banach space into another finite dimensional Banach space. We provide transition formulas, and represent them…

Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…

Implementation of many statistical methods for large, multivariate data sets requires one to solve a linear system that, depending on the method, is of the dimension of the number of observations or each individual data vector. This is…

We study solutions of the Yang-Baxter equation on a tensor product of an arbitrary finite-dimensional and an arbitrary infinite-dimensional representations of the rank one symmetry algebra. We consider the cases of the Lie algebra sl_2, the…

Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical overlaps with other rows indicate set intersections and their…

We present generalizations of the spin Sutherland systems obtained earlier by Blom and Langmann and by Polychronakos in two different ways: from SU(n) Yang--Mills theory on the cylinder and by constraining geodesic motion on the N-fold…

Hitchin's twistor treatment of Schlesinger's equations is extended to the general isomonodromic deformation problem. It is shown that a generic linear system of ordinary differential equations with gauge group SL(n,C) on a Riemann surface X…

If supersymmetric particles are discovered, an important problem will be to determine how supersymmetry has been broken. At collider energies, supersymmetry breaking can be parameterised by soft supersymmetry breaking parameters. Several…

We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations by combining low-rank stochastic…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…

Many relevant applications of group theoretical methods to physical problems are related, in some manner, to classification schemes by means of symmetry groups. In these schemes, irreducible representations of a Lie group have to be…

We present and analyze fully discrete Nystr\"om methods for the solution of three classes of well conditioned boundary integral equations for the solution of two dimensional scattering problems by homogeneous dielectric scatterers.…

In the work of Varchenko, Zagier, Thibon, and Reiner, Saliola, Welker, linear algebraic properties of the multiplication map on the group algebra of the group algebra element are studied, which is the sum over all permutations weighted by…

Graph is a highly generic and diverse representation, suitable for almost any data processing problem. Spectral graph theory has been shown to provide powerful algorithms, backed by solid linear algebra theory. It thus can be extremely…

Classical model reduction techniques project the governing equations onto linear subspaces of the high-dimensional state-space. For problems with slowly decaying Kolmogorov-n-widths such as certain transport-dominated problems, however,…

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

Motivated by recent findings on the derivation of parametric non-involutive solutions of the Yang-Baxter equation we reconstruct the underlying algebraic structures, called near braces. Using the notion of the near braces we produce new…