Results 21 to 30 of about 1,819 (238)
Limits of Latin squares, Discrete Analysis 2023:8, 66 pp. There has been a great deal of work over the last fifteen to twenty years on the theme of continuous limits of discrete combinatorial objects. In particular, any sequence of graphs of increasing
Frederik Garbe +3 more
doaj +1 more source
Combined Matrix of a Tridiagonal Toeplitz Matrix
In this work, combined matrices of tridiagonal Toeplitz matrices are studied. The combined matrix is known as the Relative Gain Array in control theory.
Begoña Cantó +2 more
doaj +1 more source
We consider a distributed constrained optimization problem over graphs, where cost function of each agent is private. Moreover, we assume that the graphs are time-varying and directed.
Junlong Zhu +5 more
doaj +1 more source
On a fine localization of the Mathieu azimuthal numbers by Cassini ovals
The study is devoted to numerical and analytical problems concerning generating periodic and antiperiodic solutions of the angular (circumferential) Mathieu equation obtained for the circumferential harmonics of an elliptic cylinder.
Yuri Nikolaevich Radayev +1 more
doaj +1 more source
Stability Conditions in Multiple-Input Multiple-Output Systems
This paper investigates the stabilization of unstable third-order Multiple-Input Multiple-Output (MIMO) systems whose interaction structure is described by a doubly stochastic combined matrix, also known as the Relative Gain Array (RGA).
Macarena Boix, Begoña Cantó
doaj +1 more source
Spectra universally realizable by doubly stochastic matrices
A list of complex numbers Λ = { λ1, . . . , λn} is said to be realizable if it is the spectrum of an entrywise nonnegative matrix, and universally realizable if there exists a nonnegative matrix with spectrum Λ for each Jordan canonical form associated ...
Collao Macarena +2 more
doaj +1 more source
Variations in the sub-defect of doubly substochastic matrices
The sub-defect of a doubly stochastic matrix AA, denoted as sd(A)=⌈n−sum(A)⌉sd\left(A)=\lceil n-{\rm{sum}}\left(A)\rceil , is defined as the minimum number of rows and columns required to be added to transform the doubly substochastic matrix into a ...
Cao Lei +2 more
doaj +1 more source
Frobenius normal forms of doubly stochastic matrices
An elementary proof of a fundamental result on doubly stochastic matrices in Frobenius normal form is given. This result is used to establish several well-known results concerning permutations, including a theorem due to Ruffini.
Paparella Pietro
doaj +1 more source
An asymptotic approximation for the permanent of a doubly stochastic matrix [PDF]
One ...
openaire +2 more sources
Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix [PDF]
A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players' actions to/from the other local players according to a gossip ...
Farzad Salehisadaghiani, Lacra Pavel
openaire +4 more sources

