Search

Although Selberg-type single positive definite symmetric matrices gamma and beta integrals have been evaluated by several authors, see e.g., Askey and Richards [1], Gupta and Kabe [2, 4], Mathai [8], and elsewhere in the vast multivariate statistical analysis literature. However, several other types of Selberg-type integrals appear to have been neglected in the literature. Thus e.g., Selberg-type integrals associated with inverse Wishart densities, inverse multivariate beta densities, their noncentral counterparts, etc, have not been explored as yet. The present paper records Selberg-type generalized quadratic forms gamma and beta integrals. Our methodology is based on hypercomplex (HC) multivariate normal distribution theory, Kabe [6]. [ABSTRACT FROM AUTHOR]

This paper introduces cutting planes that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set S ∩ P , where S is a closed set, and P is a polyhedron. Given an oracle that provides the distance from a point to S, we construct a pure cutting plane algorithm which is shown to converge if the initial relaxation is a polyhedron. These cuts are generated from convex forbidden zones, or S-free sets, derived from the oracle. We also consider the special case of polynomial optimization. Accordingly we develop a theory of outer-product-free sets, where S is the set of real, symmetric matrices of the form x x T . All maximal outer-product-free sets of full dimension are shown to be convex cones and we identify several families of such sets. These families are used to generate strengthened intersection cuts that can separate any infeasible extreme point of a linear programming relaxation efficiently. Computational experiments demonstrate the promise of our approach. [ABSTRACT FROM AUTHOR]

Frieze patterns have been introduced by Coxeter [Acta Arith. 18 (1971), pp. 297–310] in the 1970's and have recently attracted renewed interest due to their close connection with Fomin-Zelevinsky's cluster algebras. Frieze patterns can be interpreted as assignments of values to the diagonals of a triangulated polygon satisfying certain conditions for crossing diagonals (Ptolemy relations). Weak friezes, as introduced by Çanakçı and Jørgensen [Adv. in Appl. Math. 131 (2021), Paper No. 102253], are generalizing this concept by allowing to glue dissected polygons so that the Ptolemy relations only have to be satisfied for crossings involving one of the gluing diagonals. To any frieze pattern one can associate a symmetric matrix using a triangular fundamental domain of the frieze pattern in the upper and lower half of the matrix and putting zeroes on the diagonal. Broline, Crowe and Isaacs [Geometriae Dedicata 3 (1974), pp. 171–176] have found a formula for the determinants of these matrices and their work has later been generalized in various directions by other authors. These frieze pattern determinants are the main focus of our paper. As our main result we show that this determinant behaves well with respect to gluing weak friezes: the determinant is the product of the determinants for the pieces glued, up to a scalar factor coming from the gluing diagonal. Then we give several applications of this result, showing that formulas from the literature, obtained by Broline-Crowe-Isaacs, Baur-Marsh [J. Combin. Theory Ser. A 119 (2012), pp. 1110–1122], Bessenrodt-Holm-Jørgensen [J. Combin. Theory Ser. A 123 (2014), pp. 30–42] and Maldonado [ Frieze matrices and infinite frieze patterns with coefficients , Preprint, arXiv: 2207.04120 , 2022] can all be obtained as consequences of our result. [ABSTRACT FROM AUTHOR]

The purpose of this article is to introduce the readers, especially the researchers, to some topics connected with functions of matrix argument, scaling models, distributions of products and ratios, Bayesian structures, symmetric products and symmetric ratios of matrices, scalar and matrix-variate fractional integrals, functions of matrix argument through entropy optimization, singular matrix-variate gamma and beta functions etc which are currently active so that interested readers can get into these classes of problems for their current research or teaching. Let X be a p × q, p = q matrix of rank p in the real domain. If the function f(X), associated with X, is a function of XX', where a prime denotes the transpose, then such a function appears in a number of different disciplines. This paper examines the recent developments in such matrix-variate functions when X is in the real or complex domain. Connections to Bayes procedures, quantum physics, scalar and matrix texture models in communication and engineering problems, fractional integrals, distributions of symmetric products and symmetric ratios of matrices, singular matrix-variate gamma and beta functions and other related areas are pointed out. Only an overview of the current research in these topics with some illustrative examples are given in this paper. Since the material is summarized from the author's own works, most of the references are author's own papers, and hence similarity index, similarity with author's own works, may be high. The materials also cover some current results which are being published. [ABSTRACT FROM AUTHOR]

In this paper, we study parameter deformations of matrix valued orthogonal polynomials. These deformations are built on the use of certain matrix valued operators which are symmetric with respect to the matrix valued inner product defined by the orthogonality weight. We show that the recurrence coefficients associated with these operators satisfy generalizations of the non-Abelian lattice equations. We provide a Lax pair formulation for these equations, and an example of deformed Hermite-type matrix valued polynomials is discussed in detail. [ABSTRACT FROM AUTHOR]

The rational field Q is highly desired in many applications. Algorithms using the rational number field Q algebraic number fields use only integer arithmetics and are easy to implement. Therefore, studying and designing systems and expansions with coefficients in Q or algebraic number fields is particularly interesting. This paper discusses constructing quasi-tight framelets with symmetry over an algebraic field. Compared to tight framelets, quasi-tight framelets have very similar structures but much more flexibility in construction. Several recent papers have explored the structure of quasi-tight framelets. The construction of symmetric quasi-tight framelets directly applies the generalized spectral factorization of 2 × 2 matrices of Laurent polynomials with specific symmetry structures. We adequately formulate the latter problem and establish the necessary and sufficient conditions for such a factorization over a general subfield F of C , including algebraic number fields as particular cases. Our proofs of the main results are constructive and thus serve as a guideline for construction. We provide several examples to demonstrate our main results. [ABSTRACT FROM AUTHOR]

Matrix factorization is an inference problem that has acquired importance due to its vast range of applications that go from dictionary learning to recommendation systems and machine learning with deep networks. The study of its fundamental statistical limits represents a true challenge, and despite a decade-long history of efforts in the community, there is still no closed formula able to describe its optimal performances in the case where the rank of the matrix scales linearly with its size. In the present paper, we study this extensive rank problem, extending the alternative 'decimation' procedure that was recently introduced by Camilli and Mézard, and carry out a thorough study of its performance. Decimation aims at recovering one column/line of the factors at a time, by mapping the problem into a sequence of neural network models of associative memory at a tunable temperature. The main advantage of decimation is that its theoretical performance can be studied using statistical physics techniques. In this paper we provide the general analysis applying to a large class of compactly supported priors and we show that the replica symmetric free entropy of the neural network models takes a universal form in the low temperature limit. We then study the decimation phase diagrams in two concrete cases, the sparse Ising prior and the uniform prior, for which we show that matrix factorization is theoretically possible when the ration P / N of rank to variable is below a certain threshold. This suggest that a possible route to solving algorithmically the matrix factorization problem could be to find efficient decimation algorithms; in this respect, we show that simple simulated annealing, though being effective for limited signal sizes, is not scalable. [ABSTRACT FROM AUTHOR]

This paper focuses on algorithms for the truncated Takagi factorization of complex symmetric matrices. The problem is formulated as a Riemannian optimization problem on a complex Stiefel manifold and then is converted into a real Riemannian optimization problem on the intersection of the real Stiefel manifold and the quasi-symplectic set. The steepest descent, the Riemannian nonmonotone conjugate gradient, Newton, and hybrid methods are used for solving the problem and they are compared in their performance for the optimization task. Numerical experiments are provided to illustrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we employ a generalization of the Boas–Bellman inequality for inner products, as developed by Mitrinović–Pečarić–Fink, to derive several upper bounds for the 2 p -th power with p ≥ 1 of the numerical radius of the off-diagonal operator matrix 0 A B * 0 for any bounded linear operators A and B on a complex Hilbert space H. While the general matrix is not symmetric, a special case arises when B = A * , where the matrix becomes symmetric. This symmetry plays a crucial role in the derivation of our bounds, illustrating the importance of symmetric structures in operator theory. [ABSTRACT FROM AUTHOR]

We propose a robust randomized indicator method for the reliable detection of eigenvalue existence within an interval for symmetric matrices A. An indicator tells the eigenvalue existence based on some statistical norm estimators for a spectral projector. Previous work on eigenvalue indicators relies on a threshold which is empirically chosen, thus often resulting in under or over detection. In this paper, we use rigorous statistical analysis to guide the design of a robust indicator. Multiple randomized estimators for a contour integral operator in terms of A are analyzed. In particular, when A has eigenvalues inside a given interval, we show that the failure probability (for the estimators to return very small estimates) is extremely low. This enables to design a robust rejection indicator based on the control of the failure probability. We also give a prototype framework to illustrate how the indicator method may be applied numerically for eigenvalue detection and may potentially serve as a new way to design randomized symmetric eigenvalue solvers. Unlike previous indicator methods that only detect eigenvalue existence, the framework also provides a way to find eigenvectors with little extra cost by reusing computations from indicator evaluations. Extensive numerical tests show the reliability of the eigenvalue detection in multiple aspects. [ABSTRACT FROM AUTHOR]

In the present paper, we define and study a new family of holomorphic functions which involve the Bazilevič functions and the λ -pseudo-starlike functions. We establish coefficient estimates for the first four determinants of the symmetric Toeplitz matrices T 2 (2) , T 2 (3) , T 3 (1) and T 3 (2) for the functions in this family. Further, we investigate several special cases and consequences of our results. [ABSTRACT FROM AUTHOR]

Cyclic dominance of species is a potential mechanism for maintaining biodiversity. The author investigates the generalised scenario when the cyclic dominance of three or more interacting species is described by a non-symmetric matrix game that has multiple Nash equilibria. Modified Lotka–Volterra equations are proposed to incorporate the effects of swarming, and the condition for biodiversity is derived. The species are modelled using replicator equations, where each member of the species is assigned a fitness value. The authors show, for the first time, that the ‘swarming effect’ has an important role to play in the maintenance of biodiversity. The authors have also discovered the existence of a critical value of the swarming parameter for a given mobility, above which there is a high probability of existence of biodiversity. [ABSTRACT FROM AUTHOR]

This paper investigates the spectral properties of block circulant matrices with high-order symmetric (or Hermitian) blocks. We analyze cases with dependent or sparse independent entries within these blocks. Additionally, we analyze the distribution of singular values for the product of independent circulant matrices with non-Hermitian blocks. [ABSTRACT FROM AUTHOR]

In this paper, we address the extremal inverse eigenvalue problem for pentadiagonal matrices. We provide sufficient conditions for their existence and realizability through new constructions that consider spectral data of its leading principal submatrices. Finally, we present some examples generated from the algorithmic procedures derived from our results. [ABSTRACT FROM AUTHOR]

Symmetric non-negative matrix factorization (NMF) can naturally capture the embedded clustering structure in the graph representation. It is an important method for linear and nonlinear data clustering applications. However, it is sensitive to the initialization of variables, and the quality of the initialization matrix greatly affects the clustering performance. In semi-supervised clustering, it faces the challenge of learning a more discriminative representation from limited labeled data. This paper introduces a constrained propagation self-adaptive self-supervised non-negative matrix factorization clustering algorithm (CPS³NMF) to solve the above problems. The algorithm propagates finite constraints to unconstrained data points, constructing a similarity matrix imbued with constraint information. The resultant similarity matrix serves the role of a non-negative symmetric matrix decomposition in SNMF and functions as graph regularization for the assignment matrix, fully utilizing the limited constraint information to preserve the geometrical structure of data space. Concurrently, leveraging the sensitivity of initial features in SNMF, the algorithm employs adaptively learned weights to rank the quality of multiple initial matrices. By integrating results from multiple clustering attempts, it progressively enhances the performance of semi-supervised clustering. Experiments on 6 public datasets show that the proposed CPS³NMF algorithm outperforms other state-of-the-art algorithms, proving its effectiveness in semi-supervised clustering. [ABSTRACT FROM AUTHOR]

In this paper, we analytically derive closed-form expressions for the tangency portfolio weights: the fully invested portfolio that maximizes the expected return over the risk-free rate, relative to the volatility of the portfolio return. We explicitly derive this portfolio from a range of underlying return models and show examples where it coincides with different well-known smart beta products. Specifically, we find the closed-form expression for the tangency portfolio weights for a return model with compound symmetric correlation matrix. We also deduce the tangency portfolio weights for the CAPM return model and illustrate in a case study that the estimated tangency portfolio weights may distinctly deviate from the market value weighted portfolio. Furthermore, we show that depending on the return model, the tangency portfolio weights may take a diverse set of shapes; from very diversified to highly concentrated portfolios. [ABSTRACT FROM AUTHOR]

In this paper, we present a statistical approach to evaluate the relationship between variables observed in a two-factors experiment. We consider a three-level model with covariance structure Σ ⊗ Ψ 1 ⊗ Ψ 2 , where Σ is an arbitrary positive definite covariance matrix, and Ψ 1 and Ψ 2 are both correlation matrices with a compound symmetric structure corresponding to two different factors. The Rao's score test is used to test the hypotheses that observations grouped by one or two factors are uncorrelated. We analyze a fermentation process to illustrate the results. Supplementary materials accompanying this paper appear online. [ABSTRACT FROM AUTHOR]

The parameterized block splitting (PBS) is a convergent and efficient iterative method to solve the large complex symmetric linear systems. In this paper, by using PBS iterative technique, the Newton equation is approximately solved, then we establish the modified Newton-PBS iterative method to solve the complex nonlinear systems whose Jacobian matrices are large, sparse, and complex symmetric. Subsequently, the local convergence analysis are explored under appropriate conditions. Ultimately, we apply the new method and several known methods to experimental numerical examples, and experimental results verify the superiority and efficiency of our new method. Especially, in terms of CPU time and iteration steps, our method is obviously better. [ABSTRACT FROM AUTHOR]

Large-scale symmetric and asymmetric matrices have emerged in predicting the relationship between genes and diseases. The emergence of large-scale matrices increases the computational complexity of the problem. Therefore, using low-rank matrices instead of original symmetric and asymmetric matrices can greatly reduce computational complexity. In this paper, we propose an approximation conjugate gradient method for solving the low-rank matrix recovery problem, i.e., the low-rank matrix is obtained to replace the original symmetric and asymmetric matrices such that the approximation error is the smallest. The conjugate gradient search direction is given through matrix addition and matrix multiplication. The new conjugate gradient update parameter is given by the F-norm of matrix and the trace inner product of matrices. The conjugate gradient generated by the algorithm avoids SVD decomposition. The backtracking linear search is used so that the approximation conjugate gradient direction is computed only once, which ensures that the objective function decreases monotonically. The global convergence and local superlinear convergence of the algorithm are given. The numerical results are reported and show the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

For a DC microgrid with constant power loads (CPLs), the existence of a feasible power-flow solution, which is usually difficult to analyze, is a necessary condition for the correct operation of systems. In this paper, the solvability of power-flow equation of DC microgrid with CPLs is analyzed, where a majority of distributed generations (DGs) are under MPPT control while other DGs are under droop control. At first, this paper builds a power-flow mathematical model of the DC microgrid. Secondly, three solvability conditions are proposed with the first one being applied to ensure the power-flow equation has a solution, while the other two applying to ensure the solution within the given voltage deviation. The first analytical condition () is obtained by applying Brouwer fixed-point theorem. Compared with the existing results, this obtained sufficient condition is less conservative. Furthermore, the other two sufficient solvability conditions (and) can guarantee the equilibrium not only exists, but also the voltage deviation is within an acceptable range. Finally, case studies verify the correctness of the proposed theorems. The obtained conditions provide a guidance for establishing a dependable DC microgrid. [ABSTRACT FROM AUTHOR]

The aim of the current paper is to study a partially described inverse eigenvalue problem of a specific symmetric matrix, and prove some properties of such matrix. The problem includes the construction of the matrix by the minimal eigenvalue of all leading principal submatrices and eigenpair (λ (n) 2, x) such that λ (n) 2 is the maximal eigenvalue of the required matrix. We investigate conditions for the solvability of the problem, and finally an algorithm and its numerical results are presented. [ABSTRACT FROM AUTHOR]

Due to properties such as interpolation, smoothness, and spline connections, Hermite subdivision schemes employ fast iterative algorithms for geometrically modeling curves/surfaces in CAGD and for building Hermite wavelets in numerical PDEs. In this paper, we introduce a notion of generalized Hermite (dyadic) subdivision schemes and then we characterize their convergence, smoothness and underlying matrix masks with or without interpolation properties. We also introduce the notion of linear-phase moments for achieving the polynomial-interpolation property. For any given integer m ∈ N , we constructively prove that there always exist convergent smooth generalized Hermite subdivision schemes with linear-phase moments such that their basis vector functions are spline functions in C m (R d) and have linearly independent integer shifts. As by-products, our results resolve convergence, smoothness, and existence of Lagrange, Hermite, or Birkhoff subdivision schemes. Even in dimension one our results significantly generalize and extend many known results on extensively studied univariate Hermite subdivision schemes. To illustrate the theoretical results in this paper, we provide examples of convergent generalized Hermite subdivision schemes with symmetric matrix masks having short support and smooth basis vector functions with or without interpolation property. [ABSTRACT FROM AUTHOR]

In this paper, based on the Takagi–Sugeno fuzzy model approach, a novel output feedback control strategy is developed for a class of continuous-time nonlinear time delay systems via modified repetitive control scheme. The main objective of this paper is to design a fuzzy rule-based modified repetitive controller such that the system output can track any given periodic reference signal even in the presence of periodic disturbances. For this purpose, by employing fuzzy-dependent Lyapunov–Krasovskii functional together with the free-weighting matrix technique, a new set of sufficient conditions is presented in terms of linear matrix inequalities to guarantee the robust stability of the resulting closed-loop system. Based on these conditions and using internal model principle, it is shown that the system output tracks the given reference input within the desired error. Finally, two application-oriented examples are presented to validate the obtained theoretical results in which the proposed control design scheme gives better performance over the existing control scheme. [ABSTRACT FROM AUTHOR]

With the abundance of data, machine learning applications engaged increased attention in the last decade. An attractive approach to robustify the statistical analysis is to preprocess the data through clustering. This paper develops a low-complexity Riemannian optimization framework for solving optimization problems on the set of positive semidefinite stochastic matrices. The low-complexity feature of the proposed algorithms stems from the factorization of the optimization variable $\mathbf {X}=\mathbf {Y}\mathbf {Y}^{\mathrm{T}}$ X = Y Y T and deriving conditions on the number of columns of $\mathbf {Y}$ Y under which the factorization yields a satisfactory solution. The paper further investigates the embedded and quotient geometries of the resulting Riemannian manifolds. In particular, the paper explicitly derives the tangent space, Riemannian gradients and Hessians, and a retraction operator allowing the design of efficient first and second-order optimization methods for the graph-based clustering applications of interest. The numerical results reveal that the resulting algorithms present a clear complexity advantage as compared with state-of-the-art euclidean and Riemannian approaches for graph clustering applications. [ABSTRACT FROM AUTHOR]

In this paper, we prove the existence of infinitely many solutions for the following nonperiodic fractional Hamiltonian system t D ∞ α (- ∞ D t α u) (t) + L (t) u (t) = ∇ W (t , u (t)) , t ∈ R u ∈ H α (R) , where - ∞ D t α and t D ∞ α are left and right Liouville–Weyl fractional derivatives of order 1 2 < α < 1 on the whole axis, respectively, L ∈ C (R , R N 2) is a symmetric matrix valued function unnecessary coercive and W (t , x) ∈ C 1 (R × R N , R) is only locally defined and superquadratic near the origin with respect to x. Our results extend and improve some existing results in the literature. [ABSTRACT FROM AUTHOR]

Similar to cells, bacteria, and other micro-organisms, synthetic chemically active colloids can harness the energy from their environment through a surface chemical reaction and use the energy to self-propel in fluidic environments. In this paper, we study the chemo-mechanical coupling that leads to the self-propulsion of chemically active colloids. The coupling between chemical reactions and momentum transport is a consequence of Onsager reciprocal relations. They state that the velocity and the surface reaction rate are related to mechanical and chemical affinities through a symmetric matrix. A consequence of Onsager reciprocal relations is that if a chemical reaction drives the motion of the colloid, then an external force generates a reaction rate. Here, we investigate Onsager reciprocal relations for a spherical active colloid that catalyzes a reversible surface chemical reaction between two species. We solve the relevant transport equations using a perturbation expansion and numerical simulations to demonstrate the validity of reciprocal relations around the equilibrium. Our results are consistent with previous studies and highlight the key role of solute advection in preserving the symmetry of the Onsager matrix. Finally, we show that Onsager reciprocal relations break down around a nonequilibrium steady state, which has implications for the thermal fluctuations of the active colloids used in experiments. [ABSTRACT FROM AUTHOR]

The article discusses papers published within the issue, including "On the Block Triangular Form of Symmetric Matrices," by Iain Duff and Bora Ucar and "Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization," by Benjamin Recht, Maryann Fazel and Pablo Parrilo.

This paper is concerned with the design of fault detection for sampled-data systems, which are based on multirate sampling, with frequency specifications. A general multirate system is considered in this paper, where not only the inputs and outputs but also their different channels have different sampling rates. The purpose of this paper is to make this residual system with multirate sampling satisfy a given disturbance attenuation level over a restricted frequency range. With the use of the lifting technique, this paper reformulates a single-rate linear time-invariant system, which is equivalent to the multirate time-varying system. For a given restricted frequency range, convex conditions are obtained in designing a required fault detection filter. Then, the restricted frequency ranges problem are also solved specifically via the generalized Kalman–Yakubovic–Popov lemma. Finally, this paper uses a continuous-stirred tank reactor system to illustrate the effectiveness and advantages of the fault detection filter design method. [ABSTRACT FROM AUTHOR]

In this paper, several existing results related to secondary transpose are critically reviewed and a result analogous to spectral decomposition theorem is obtained for a real secondary symmetric matrix. Noting that Moore–Penrose inverse with reference to secondary transpose involution, namely s -g inverse, need not always exist, we explore a few necessary sufficient conditions for the existence of such Moore–Penrose inverse. Further, we provide expressions and determinantal formula to compute the same. [ABSTRACT FROM AUTHOR]

Nowadays, deep representations have gained significant attention due to their outstanding performance in a wide range of tasks. However, the interpretability of deep representations in specific applications poses a significant challenge. For instances where the generated quantity matrices exhibit symmetry, this paper introduces a variant of deep matrix factorization (deep MF) called deep L p smooth symmetric non-negative matrix factorization (DSSNMF), which aims to improve the extraction of clustering structures inherent in complex hierarchical and graphical representations in high-dimensional datasets by improving the sparsity of the factor matrices. We successfully applied DSSNMF to synthetic datasets as well as datasets related to post-traumatic stress disorder (PTSD) to extract several hierarchical communities. Specifically, we identified non-disjoint communities within the partial correlation networks of PTSD psychiatric symptoms, resulting in highly meaningful clinical interpretations. Numerical experiments demonstrate the promising applications of DSSNMF in fields like network analysis and medicine. [ABSTRACT FROM AUTHOR]

Let S be the polynomial ring on the space of non-square generic matrices or the space of odd-sized skew-symmetric matrices, and let I be the determinantal ideal of maximal minors or Pf the ideal of sub-maximal Pfaffians, respectively. Using desingularizations and representation theory of the general linear group we expand upon work of Raicu–Weyman–Witt [Adv. Math. 250 (2014), pp. 596–610] to determine the S-module structures of Ext^j_S(S/I^t, S) and Ext^j_S(S/Pf^t, S), from which we get the degrees of generators of these Ext modules. As a consequence, via graded local duality we answer a question of Wenliang Zhang [J. Pure Appl. Algebra 225 (2021), Paper No. 106789] on the socle degrees of local cohomology modules of the form H^j_\mathfrak {m}(S/I^t). [ABSTRACT FROM AUTHOR]

An n-by-n real symmetric matrix $ H=[h_{i,j}] $ H = [ h i , j ] is said to be a Hankel matrix if $ h_{i,j}=h_{i-1,j+1} $ h i , j = h i − 1 , j + 1 , for each $ i=2,\ldots,n $ i = 2 , ... , n and $ j=1,\ldots,n-1 $ j = 1 , ... , n − 1. The symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list $ \Lambda =\{\lambda _{1},\ldots,\lambda _{n}\} $ Λ = { λ 1 , ... , λ n } of real numbers is the spectrum of an n-by-n symmetric nonnegative matrix H. In this paper, we search for conditions on the list $ \Lambda =\{\lambda _{1},\ldots,\lambda _{n}\} $ Λ = { λ 1 , ... , λ n } for the matrix H to be Hankel. For n = 3, sufficient conditions are established. In particular, a necessary and sufficient condition is obtained if Λ is a list of three nonnegative numbers. Also, if $ \sum _{i=1}^{n}\lambda _{i}=0 $ ∑ i = 1 n λ i = 0 , we give conditions for realizability by a Hankel matrix. Finally, we present a special type of list that can serve as the spectrum of a Hankel nonnegative matrix with positive trace. Several of our results are constructive and provide a Hankel realizing matrix. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a switching for 2-designs, which defines a type of trade. We illustrate this method by applying it to some symmetric (64, 28, 12) designs, showing that the switching introduced in this paper in some cases can be applied directly to orbit matrices. In that way we obtain six new symmetric (64, 28, 12) designs. Further, we show that this type of switching (of trades) can be applied to any symmetric design related to a Bush-type Hadamard matrix and construct symmetric designs with parameters (36, 15, 6) leading to new Bush-type Hadamard matrices of order 36, and symmetric (100, 45, 20) designs yielding Bush-type Hadamard matrices of order 100. [ABSTRACT FROM AUTHOR]

In this paper, a nonlinear random matrix approach is used to analyze the management of swimming place waters, and in this way, an intelligent management model is designed and applied to the actual swimming place waters management. Firstly, some basic small deviation results of the random matrix are presented. Then, several types of small deviation inequalities are obtained for the maximum eigenvalues of independent stochastic semi-positive definite (PSD) matrices. These small deviation inequalities are independent of the matrix dimension, and the results apply to high-dimensional and even infinite-dimensional matrices. For the inverse eigenvalue problem of higher-order doubly random matrices, the conclusion that two symmetric doubly random matrices are combined into a higher-order symmetric doubly random matrix is proved. In other words, the method of constructing new symmetric random matrices using smaller matrices with known spectra is applied to the inverse eigenvalue problem of higher-order symmetric random matrices, and sufficient conditions for the existence of the solution of the inverse eigenvalue problem of higher-order random matrices are derived, avoiding the discussion of the parity of the number of eigenvalues. This paper focuses on realistic management, to explore the standardization of safety management of swimming venues, and is based on modern management theory, risk management theory and methods, using research integration method, fieldwork method, questionnaire survey method, expert interview method, and other research methods, detailing the methods and conclusions of risk identification in safety management of swimming venues, and further exploring the safety management standards of swimming venues on this basis. And, combined with risk management theory, depending on the probability of occurrence and the degree of harm of risk, four basic disposal methods such as risk avoidance, risk control, risk transfer, and risk self-retaining are proposed. [ABSTRACT FROM AUTHOR]

Aiming at the problem of long average delay of traditional UAV emergency communication, a performance optimization method of UAV communication link based on emergency communication environment is proposed. The target tasks in the emergency communication channel are divided into different target task groups. According to the distance between the target tasks in the target task group, the symmetric matrix is constructed, all elements in the symmetric matrix are classified, and the classification results are calculated by ant colony algorithm to construct the emergency communication task scheduling model of UAV. Combined with the emergency communication task scheduling model and the demand, priority, time window, and communication ability of UAV emergency scheduling task, the time delay control of UAV emergency communication is realized with the goal of maximizing the efficiency of UAV task execution, maximizing the completion rate of UAV task execution and minimizing the risk of UAV delay. The experimental results show that the average delay of the three methods also increases. When the system load is 50%, the average delay of common methods is 23 ms, the average delay of traditional methods is 76 ms, the average delay of the method proposed in this paper is 26 ms, and the common average delay is the shortest. When the system load is 99%, the common methods cannot realize emergency communication scheduling due to system load overshoot, and the corresponding average delay cannot be considered, indicating that the common methods are unstable. The average delay of the method proposed in this paper is stable under different system loads and always remains below 40 ms. It is proved that compared with the traditional methods, the method proposed in this paper takes less time for UAV emergency communication and has less average delay under different system loads, so it has better application value. [ABSTRACT FROM AUTHOR]

In this paper, we construct and prove the existence of theoretical solutions to non-isentropic Euler equations with a time-dependent linear damping and Coriolis force in Cartesian form. New exact solutions can be acquired based on this form with examples presented in this paper. By constructing appropriate matrices , and vectors , special cases of exact solutions, where entropy , are obtained. This is the first matrix form solution of non-isentropic Euler equations to the best of the authors' knowledge. [ABSTRACT FROM AUTHOR]

This paper focuses on reducing the computational cost of a GNC Algorithm for deblurring images when dealing with full symmetric Toeplitz block matrices composed of Toeplitz blocks. Such a case is widespread in real cases when the PSF has a vast range. The analysis in this paper centers around the class of gamma matrices, which can perform vector multiplications quickly. The paper presents a theoretical and experimental analysis of how γ -matrices can accurately approximate symmetric Toeplitz matrices. The proposed approach involves adding a minimization step for a new approximation of the energy function to the GNC technique. Specifically, we replace the Toeplitz matrices found in the blocks of the blur operator with γ -matrices in this approximation. The experimental results demonstrate that the new GNC algorithm proposed in this paper reduces computation time by over 20 % compared with its previous version. The image reconstruction quality, however, remains unchanged. [ABSTRACT FROM AUTHOR]

This paper deals with the issue of reliable sliding mode control for descriptor systems with semi-Markov parameters using the Takagi–Sugeno fuzzy model, in which an average dwell time approach is utilized to tackle generic uncertain transition rates (TRs). From the analysis of the inner mechanism of switching singular system, a continuous sliding surface function is proposed. Different from continuity with probability one for stochastic systems, the absolute continuity of system solution is a key point in this paper being ensured for application of the average dwell time approach. Then, the mean-square exponential stability of the obtained sliding mode is analyzed based on two types of uncertain TRs. Moreover, a sliding mode controller is constructed to ensure the reachability condition in finite time. Lastly, the method is verified numerically by a single-link robot arm model. [ABSTRACT FROM AUTHOR]

The adaptive sliding mode control (SMC) problem is addressed for singular semi-Markovian jump systems (S-MJSs) against actuator attacks, in which the transition rates rely on the random sojourn time and are not constant, and the system states are unavailable. Moreover, the vulnerability of control signals transmitted via communication network means that the actuators may receive the attacked control signals. For the sake of reducing the effect of actuator attacks, the neural network technique is used to approximate the false information injected by adversaries. Meanwhile, a sliding mode observer is introduced to estimate the unmeasured states. An adaptive SMC law is proposed to guarantee that the estimation states and errors can reach to the sliding surfaces, and the stochastic admissibility of the singular S-MJSs can be ensured. In the end, an example is applied to illustrate the method in this paper. [ABSTRACT FROM AUTHOR]

The paper deals with the new design procedure for PID-D robust controller with state/output derivative feedback to stabilize the closed-loop system using linear matrix inequality (LMI) and LMI regions with common in the frame of $H_2$ performance quadratic cost functions known as $(Q,S,R)$. The designed robust controller ensures robust properties of the closed loop system for linear time invariant and linear time variant gain scheduled plant descriptor systems. The robust controller design procedure is based on the extended original derivative of Lyapunov function and to obtain the convex conditions with respect to uncertainties, gain scheduled variables, and ensures that proposed new method guarantees less conservativeness to the design procedure we have introduced using the auxiliary matrices. The obtained results should be utilized to design power system stabilizer for synchronous generators and so on. The obtained robust PI-D controller with output and state/output derivative feedback for uncertain polytopic systems ensures that all closed-loop eigenvalues are lying in the defined LMI region. Two examples illustrate the effectiveness of the new design procedure. [ABSTRACT FROM AUTHOR]

This paper is concerned with the event-triggered finite-time control problem for networked switched linear systems by using an asynchronous switching scheme. Not only the problem of finite-time boundedness, but also the problem of input-output finite-time stability is considered in this paper. Compared with the existing event-triggered results of the switched systems, a new type of event-triggered condition is proposed. Sufficient conditions are established to guarantee the event-based asynchronous closed-loop systems are both finite-time bounded and input-output finite-time stable. A set of event-triggered finite-time bounded and input-output finite-time stabilizing controllers are designed under the asynchronous control scheme. It is revealed that the triggered thresholds determine the number of sampling points transmitted to the controller, and the smaller triggered parameters indicate the less-sampled data needed to be transmitted to the controller under the event-triggered scheme. Finally, a boost converter circuit is applied to bring out the advantages of the proposed control scheme. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of reducing the conservatism for stabilization of discrete-time Takagi–Sugeno fuzzy systems via a new extended representation approach. Different from previous slack variable methods, an advanced slack variable method without limitations is proposed for further making good use of available fuzzy weighting functions. Owing to the introduction of extended representations for homogenous polynomials, those strong limitations in recent literature are relaxed and thus the primary and secondary sequences of all normalized fuzzy weighting functions can be mapped to one augmented multi-indexed matrix for each homogeneous polynomial. Therefore, less conservative stabilization conditions can be provided as a result of these effective measures and thus a part of the online computational cost is transferred to the offline implementation. Finally, the benefits of the proposed method are illustrated by means of numerical experiments. [ABSTRACT FROM AUTHOR]

The present paper deals with the external identification of a reciprocal, special passive, 2 n -port network under measurement uncertainties. In the present context, the multiport model is represented by an admittance matrix and the condition that the network is 'reciprocal special passive' refers to the assumption that the real part of the admittance matrix is symmetric and positive-definite. The key point is to reformulate the identification problem as a matrix optimization program over the matrix manifold S + (2 n) × S (2 n) . The optimization problem requires a least-squares criterion function designed to cope with over-determinacy due to the incoherent data pairs whose cardinality exceeds the problem's number of degrees of freedom. The present paper also proposes a numerical solution to such an optimization problem based on the Riemannian-gradient steepest descent method. The numerical results show that the proposed method is effective as long as reasonable measurement error levels and problem sizes are being dealt with. [ABSTRACT FROM AUTHOR]

We investigate the matrix function optimization under the orthonormal constraint on the matrix variable. By introducing an index-notation-arrangement-based chain rule (I-Chain rule), we obtain the gradient of the cost function and propose a revisited orthonormal-constraint-based projected gradient method to locate a minimum of an objective/cost function of matrix variables iteratively subject to orthonormal constraint. To guarantee the convergence the proposed method, existing schemes require the gradient can be represented by the multiplication of a symmetrical matrix and the matrix variable itself. This condition has been relaxed in this paper. New techniques are proposed to establish the convergence property of the iterative algorithm. Simulation results show the effectiveness of our framework. This paper allows more extensive applications of matrix function optimization problems in science and engineering. [ABSTRACT FROM AUTHOR]

This paper focuses on the sliding mode control (SMC) problem of interval type-2 (IT2) fuzzy systems subject to the unmeasurable state and cyberattacks. A key issue is how to design a state observer under the constraint that only the bounds of membership functions are known. To this end, this paper introduces two weighting factors to construct a new membership function. Besides, the concept of input-to-state stability (ISS) is utilized to deal with the residual term resulting from the cyberattacks and external disturbances. The sufficient condition is established such that the sliding mode dynamics and the estimated error dynamics are input-to-state stable. Furthermore, by online estimating the unknown parameters in upper bounds of cyberattacks and external disturbances, an adaptive sliding mode controller is synthesized such that the reachability of the prescribed sliding surface can be guaranteed and the effect of cyberattacks on the system performance can be effectively attenuated. Finally, the validity of the proposed method is illustrated by a mass–spring–damper system. [ABSTRACT FROM AUTHOR]

This paper deals with the impulsive formation control of spacecraft in the presence of constraints on the position vector and time. Determining a set of path constraints can increase the safety and reliability in an impulsive relative motion of spacecraft. Specially, the feasibility problem of the position norm constraints is considered in this paper. Under assumptions, it is proved that if a position vector be reachable, then the reach time and the corresponding time of impulses are unique. The trajectory boundedness of the spacecraft between adjacent impulses are analyzed using the Gerschgorin and the Rayleigh–Ritz theorems as well as a finite form of the Jensen's inequality. Some boundaries are introduced regarding the Jordan–Brouwer separation theorem which are useful in checking the satisfaction of a constraint. Two numerical examples (approximate circular formation keeping and collision-free maneuver) are solved in order to show the applications and visualize the results. [ABSTRACT FROM AUTHOR]

Transformations between abc, stationary dq0 ($\alpha \beta 0$) and rotating dq0 reference-frames are used extensively in the analysis and control of three-phase technologies such as machines and inverters. Previous work on deriving the matrices describing these transformations follows one of two approaches. The first approach derives Clarke's matrix by modifying symmetrical components. Park's matrix can be subsequently found from a rotation matrix. The second approach derives Park's matrix using trigonometric projection by interpreting the transformation as a rotation in the plane of the cross-section of a machine. Then, Clarke's matrix can be found trivially using a reference angle of zero in Park's matrix. This paper presents a third approach to deriving the Clarke and Park transformation matrices: a geometric interpretation. The approach exploits properties of the linear transformation using the Cartesian representation. We introduce the locus diagram of a three-phase quantity and show how these diagrams have applications in power quality. We show that, unlike a phasor diagram, a single locus diagram can fully represent a three-phase system with harmonics. [ABSTRACT FROM AUTHOR]

Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a more general set of convex programs known as semi-definite and second-order cone programs. However, these methods are excessively slow for high dimensions. On the other hand, optimization algorithms on manifolds have shown great abilities in finding solutions to non-convex problems in a reasonable time. This paper suggests using a Riemannian optimization approach to solve a subset of convex optimization problems wherein the optimization variable is a doubly stochastic matrix. Optimization over the set of doubly stochastic matrices is crucial for multiple communications and signal processing applications, especially graph-based clustering. The paper introduces and investigates the geometries of three convex manifolds, namely the doubly stochastic, the symmetric, and the definite multinomial manifolds which generalize the simplex, also known as the multinomial manifold. Theoretical complexity analysis and numerical simulation results testify the efficiency of the proposed method over state-of-the-art algorithms. In particular, they reveal that the proposed framework outperforms conventional generic and specialized approaches, especially in high dimensions. [ABSTRACT FROM AUTHOR]