scholarly journals Generalized matrix spectral factorization and quasi-tight framelets with a minimum number of generators

2020 ◽  
Vol 89 (326) ◽  
pp. 2867-2911 ◽  
Author(s):  
Chenzhe Diao ◽  
Bin Han
Keyword(s):  
Spectral Factorization ◽  
Number Of Generators ◽  
Minimum Number ◽  
Generalized Matrix ◽  
Matrix Spectral Factorization

scholarly journals Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization

2019 ◽  
Vol 39 (4) ◽  
pp. 2006-2041
Author(s):  
Vasil Kolev ◽  
Todor Cooklev ◽  
Fritz Keinert
Keyword(s):  
Spectral Factorization ◽  
Matrix Spectral Factorization

scholarly journals Commutator Length of Finitely Generated Linear Groups

2008 ◽  
Vol 2008 ◽  
pp. 1-5
Author(s):  
Mahboubeh Alizadeh Sanati
Keyword(s):  
Finite Group ◽  
Upper Bound ◽  
Quadratic Polynomial ◽  
Linear Groups ◽  
Number Of Generators ◽  
Derived Subgroup ◽  
Finite Linear Group ◽  
Minimum Number ◽  
Commutator Length ◽  
Finite Linear

The commutator length “” of a group is the least natural number such that every element of the derived subgroup of is a product of commutators. We give an upper bound for when is a -generator nilpotent-by-abelian-by-finite group. Then, we give an upper bound for the commutator length of a soluble-by-finite linear group over that depends only on and the degree of linearity. For such a group , we prove that is less than , where is the minimum number of generators of (upper) triangular subgroup of and is a quadratic polynomial in . Finally we show that if is a soluble-by-finite group of Prüffer rank then , where is a quadratic polynomial in .

scholarly journals A New Method of Matrix Spectral Factorization

2011 ◽  
Vol 57 (4) ◽  
pp. 2318-2326 ◽  
Author(s):  
G Janashia ◽  
E Lagvilava ◽  
L Ephremidze
Keyword(s):  
New Method ◽  
Spectral Factorization ◽  
Matrix Spectral Factorization

The multi-region index of a knot

2020 ◽  
Vol 29 (04) ◽  
pp. 2050022
Author(s):  
Sarah Goodhill ◽  
Adam M. Lowrance ◽  
Valeria Munoz Gonzales ◽  
Jessica Rattray ◽  
Amelia Zeh
Keyword(s):  
Lower Bound ◽  
Crossing Number ◽  
Number Of Generators ◽  
Branched Cover ◽  
Minimum Number

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the minimum number of generators of the first homology of the double branched cover of [Formula: see text] over the knot is strictly less than the multi-region index. Our proof of this lower bound uses Goeritz matrices.

scholarly journals Growth sequences of finite semigroups

1987 ◽  
Vol 43 (1) ◽  
pp. 16-20 ◽  
Author(s):  
James Wiegold ◽  
H. Lausch
Keyword(s):  
Real Number ◽  
Finite Semigroup ◽  
Piecewise Linear ◽  
The Other ◽  
Direct Power ◽  
Growth Sequence ◽  
Group Of Units ◽  
Number Of Generators ◽  
Finite Semigroups ◽  
Minimum Number

AbstractThe growth sequence of a finite semigroup S is the sequence {d(Sn)}, where Sn is the nth direct power of S and d stands for minimum generating number. When S has an identity, d(Sn) = d(Tn) + kn for all n, where T is the group of units and k is the minimum number of generators of S mod T. Thus d(Sn) is essentially known since d(Tn) is (see reference 4), and indeed d(Sn) is then eventually piecewise linear. On the other hand, if S has no identity, there exists a real number c > 1 such that d(Sn) ≥ cn for all n ≥ 2.

scholarly journals On the Algorithmization of Janashia-Lagvilava Matrix Spectral Factorization Method

2018 ◽  
Vol 64 (2) ◽  
pp. 728-737 ◽  
Author(s):  
Lasha Ephremidze ◽  
Faisal Saied ◽  
Ilya Matvey Spitkovsky
Keyword(s):  
Factorization Method ◽  
Spectral Factorization ◽  
Matrix Spectral Factorization

scholarly journals Pinning Decision in Interconnected Systems with Communication Disruptions under Multi-Agent Distributed Control Topology

2021 ◽  
Vol 2 (1) ◽  
pp. 18-36
Author(s):  
Samson S. Yu ◽  
Tat Kei Chau
Keyword(s):  
Decision Making ◽  
Transient Stability ◽  
Frequency Control ◽  
Automatic Generation ◽  
Distributed Generators ◽  
Number Of Generators ◽  
Minimum Number ◽  
Multi Agent ◽  
Active Communication ◽  
System Topology

In this study, we propose a decision-making strategy for pinning-based distributed multi-agent (PDMA) automatic generation control (AGC) in islanded microgrids against stochastic communication disruptions. The target microgrid is construed as a cyber-physical system, wherein the physical microgrid is modeled as an inverter-interfaced autonomous grid with detailed system dynamic formulation, and the communication network topology is regarded as a cyber-system independent of its physical connection. The primal goal of the proposed method is to decide the minimum number of generators to be pinned and their identities amongst all distributed generators (DGs). The pinning-decisions are made based on complex network theories using the genetic algorithm (GA), for the purpose of synchronizing and regulating the frequencies and voltages of all generator bus-bars in a PDMA control structure, i.e., without resorting to a central AGC agent. Thereafter, the mapping of cyber-system topology and the pinning decision is constructed using deep-learning (DL) technique, so that the pinning-decision can be made nearly instantly upon detecting a new cyber-system topology after stochastic communication disruptions. The proposed decision-making approach is verified using a 10-generator, 38-bus microgrid through time-domain simulation for transient stability analysis. Simulations show that the proposed pinning decision making method can achieve robust frequency control with minimum number of active communication channels.

scholarly journals On explicit Wiener–Hopf factorization of 2 × 2 matrices in a vicinity of a given matrix

2020 ◽  
Vol 476 (2238) ◽  
pp. 20200027 ◽  
Author(s):  
L. Ephremidze ◽  
I. Spitkovsky
Keyword(s):  
Numerical Simulations ◽  
Matrix Function ◽  
Factorization Method ◽  
Spectral Factorization ◽  
Engineering Applications ◽  
Partial Indices ◽  
Matrix Spectral Factorization

As it is known, the existence of the Wiener–Hopf factorization for a given matrix is a well-studied problem. Severe difficulties arise, however, when one needs to compute the factors approximately and obtain the partial indices. This problem is very important in various engineering applications and, therefore, remains to be subject of intensive investigations. In the present paper, we approximate a given matrix function and then explicitly factorize the approximation regardless of whether it has stable partial indices. For this reason, a technique developed in the Janashia–Lagvilava matrix spectral factorization method is applied. Numerical simulations illustrate our ideas in simple situations that demonstrate the potential of the method.

Sign in / Sign up

Export Citation Format

Share Document