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

This study develops identification methods for linear continuous-time symmetric systems, such as electrical network systems, multi-agent network systems, and temperature dynamics in buildings. To this end, we formulate three system…

We present a comprehensive extension of the latent position network model known as the random dot product graph to accommodate multiple graphs -- both undirected and directed -- which share a common subset of nodes, and propose a method for…

The method of Symmetries of Feynman Integrals defines for any Feynman diagram a set of partial differential equations. On some locus in parameter space the equations imply that the diagram can be reduced to a linear combination of simpler…

This paper uses matrix transformations to provide the Autoone-Takagi decomposition of dual complex symmetric matrices and extends it to dual quaternion $\eta$-Hermitian matrices. The LU decomposition of dual matrices is given using the…

We present a full list of all representations of the special linear group $\mathrm{SL}_n$ over the complex numbers with complete intersection invariant ring, completing the classification of Shmelkin. For this task, we combine three…

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…

The spectral decomposition of regular sl_2-invariant R-matrices R(lambda) is studied by means of the method of reduction of the Yang-Baxter equation onto subspaces of a given spin. Restrictions on the possible structure of several highest…

Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…

We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [arXiv:1410.8816] in two ways 1) relaxing the requirement of affineness and 2) extending to fractional optimization problems.…

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…

Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows $n_1$ and the number of columns $n_2$ of the associated adjacency matrix are of different order, existing methods…

We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…

We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…

Matrix seriation, the problem of permuting the rows and columns of a matrix to uncover latent structure, is a fundamental technique in data science, particularly in the visualization and analysis of relational data. Applications span…

The Cauchy matrix approach is developed to solve the SU(2) self-dual Yang--Mills equation. Starting from a Sylvester matrix equation coupled with certain dispersion relation for infinite coordinates, the self-dual Yang--Mills equation under…

In the paper we consider the linear underdetermined system of a special type. Systems of this type appear in non-homogeneous network flow programming problems in the form of systems of constraints and can be characterized as systems with a…

We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees,…

Let $[A]: Y'=AY$ with $A\in \mathrm{M}_n (k)$ be a differential linear system. We say that a matrix $R\in {\cal M}_{n}(\bar{k})$ is a {\em reduced form} of $[A]$ if $R\in \mathfrak{g}(\bar{k})$ and there exists $P\in GL_n (\bar{k})$ such…

This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…