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

We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…

We extend our recent work on set-theoretic solutions of the Yang-Baxter or braid relations with new results about their automorphism groups, strong twisted unions of solutions and multipermutation solutions. We introduce and study graphs of…

Thanks to its great potential in reducing both computational cost and memory requirements, combining sketching and Krylov subspace techniques has attracted a lot of attention in the recent literature on projection methods for linear…

Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…

We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

Biclustering, also called co-clustering, block clustering, or two-way clustering, involves the simultaneous clustering of both the rows and columns of a data matrix into distinct groups, such that the rows and columns within a group display…

A fundamental result by L. Solomon in algebraic combinatorics and representation theory states that Mackey formulas for products of characters of a symmetric group, or equivalently the computation of tensor products of representations…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

This paper investigates structure-preserving $H_2$-optimal model order reduction (MOR) for linear systems with quadratic outputs. Within a Petrov-Galerkin projection framework, the $H_2$-optimal MOR problem is first formulated as an…

Lie symmetry group method is applied to study the Telegraph equation. The symmetry group and its optimal system are given, and group invariant solutions associated to the symmetries are obtained. Finally the structure of the Lie algebra…

We introduce and compare new compression approaches to obtain regularized solutions of large linear systems which are commonly encountered in large scale inverse problems. We first describe how to approximate matrix vector operations with a…

Graph labeling problems have been widely studied in the last decades and have a vast area of application. In this work, we study the recently introduced S-labeling problem, in which the nodes get labeled using labels from 1 to |V | and for…

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…

Multi-robot systems of increasing size and complexity are used to solve large-scale problems, such as area exploration and search and rescue. A key decision in human-robot teaming is dividing a multi-robot system into teams to address…

Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the branch-and-bound algorithm. Symmetry may induce large search trees with multiple…