Search

This paper proposes an implicit family of sub-step integration algorithms grounded in the explicit singly diagonally implicit Runge–Kutta (ESDIRK) method. The proposed methods achieve third-order consistency per sub-step, and thus, the trapezoidal rule is always employed in the first sub-step. This paper demonstrates for the first time that the proposed s-sub-step implicit method with s ≤ 6 can reach sth-order accuracy when achieving dissipation control and unconditional stability simultaneously. Hence, this paper develops, analyzes, and compares four cost-optimal high-order implicit algorithms within the present s-sub-step method using three, four, five, and six sub-steps. Each high-order implicit algorithm shares identical effective stiffness matrices to achieve optimal spectral properties. Unlike the published algorithms, the proposed high-order methods do not suffer from the order reduction for solving forced vibrations. Moreover, the novel methods overcome the defect that the authors' previous algorithms require an additional solution to obtain accurate accelerations. Linear and nonlinear examples are solved to confirm the numerical performance and superiority of four novel high-order algorithms. [ABSTRACT FROM AUTHOR]

In this paper the construction of C k basis functions on meshes with hanging nodes for hp -finite element methods is proposed. The construction is limited to axis-parallel, rectangular meshes, which can, however, be of any dimension. The basis functions are composed by using hierarchical tensor product shape functions which are defined on patches of so-called constraining nodes and combine univariate Hermite interpolation polynomials and Gegenbauer polynomials. The paper discusses how to integrate the constructed C k basis functions into the assembling process of stiffness matrices and load vectors by using connectivity matrices. Numerical examples illustrate the applicability of the proposed concept. [ABSTRACT FROM AUTHOR]

The class of generalized S D D 1 (G S D D 1 ) matrices is a new subclass of H -matrices. In this paper, we focus on the subdirect sum of G S D D 1 matrices, and some sufficient conditions to ensure that the subdirect sum of G S D D 1 matrices with strictly diagonally dominant (S D D) matrices is in the class of G S D D 1 matrices are given. Moreover, corresponding examples are given to illustrate our results. The class of generalized matrices is a new subclass of -matrices. In this paper, we focus on the subdirect sum of matrices, and some sufficient conditions to ensure that the subdirect sum of matrices with strictly diagonally dominant matrices is in the class of matrices are given. Moreover, corresponding examples are given to illustrate our results. [ABSTRACT FROM AUTHOR]

We investigate the one-dimensional cutting-stock problem integrated with the lot-sizing problem in the context of paper industries. The production process in paper mill industries consists of producing raw materials characterized by rolls of paper and cutting them into smaller rolls according to customer requirements. Typically, both problems are dealt with in sequence, but if the decisions concerning the cutting patterns and the production of rolls are made together, it can result in better resource management. We investigate Dantzig–Wolfe decompositions and develop column generation techniques to obtain upper and lower bounds for the integrated problem. First, we analyze the classical column generation method for the cutting-stock problem embedded in the integrated problem. Second, we propose the machine decomposition that is compared with the classical period decomposition for the lot-sizing problem. The machine decomposition model and the period decomposition model provide the same lower bound, which is recognized as being better than the linear relaxation of the classical lot-sizing model. To obtain feasible solutions, a rounding heuristic is applied after the column generation method. In addition, we propose a method that combines an adaptive large neighborhood search and column generation method, which is performed on the machine decomposition model. We carried out computational experiments on instances from the literature and on instances adapted from real-world data. The rounding heuristic applied to the first column generation method and the adaptive large neighborhood search combined with the column generation method are efficient and competitive. [ABSTRACT FROM AUTHOR]

In the field of radar target detection, the conventional approach is to employ the range profile energy accumulation method for detecting extended targets. However, this method becomes ineffective when dealing with non-stationary and non-uniform radar clutter scenarios, as well as long-distance targets with weak radar cross sections (RCSs). In such cases, the signal-to-noise ratio (SNR) of the target echo is severely degraded, rendering the energy accumulation detection algorithm unreliable. To address this issue, this paper presents a new extended target detection method based on the maximum eigenvalue of the Hermitian matrix. This method utilizes a detection model that incorporates observed data and employs the likelihood ratio test (LRT) theory to derive the maximum eigenvalue detector at low SNR. Specifically, the detector constructs a matrix using a sliding window block with the available data and then computes the maximum eigenvalue of the covariance matrix. Subsequently, the maximum eigenvalue matrix is transformed into a one-dimensional eigenvalue image, enabling extended target detection through analogy with the energy accumulation detection method. Furthermore, this paper analyzes the proposed extended target detection method from both theoretical and experimental perspectives, validating it through field-measured data. The results obtained from the measured data demonstrate that the method effectively enhances the SNR in low SNR conditions, thereby improving target detection performance. Additionally, the method exhibits robustness across different scattering center targets. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the necessary and sufficient conditions for solving a dual split quaternion matrix equation A X B   =   C , and present the general solution expression when the solvability conditions are met. As an application, we delve into the necessary and sufficient conditions for the existence of a Hermitian solution to this equation by using a newly defined real representation method. Furthermore, we obtain the solutions for the dual split quaternion matrix equations A X   =   C and X B   =   C . Finally, we provide a numerical example to demonstrate the findings of this paper. [ABSTRACT FROM AUTHOR]

This paper considers the Hermitian solutions of a new system of commutative quaternion matrix equations, where we establish both necessary and sufficient conditions for the existence of solutions. Furthermore, we derive an explicit general expression when it is solvable. In addition, we also provide the least squares Hermitian solution in cases where the system of matrix equations is not consistent. To illustrate our main findings, in this paper we present two numerical algorithms and examples. [ABSTRACT FROM AUTHOR]

Dual quaternions have wide applications in automatic differentiation, computer graphics, mechanics, and others. Due to its application in control theory, matrix equation A X B = C has been extensively studied. However, there is currently limited information on matrix equation A X B = C regarding the dual quaternion algebra. In this paper, we provide the necessary and sufficient conditions for the solvability of dual quaternion matrix equation A X B = C , and present the expression for the general solution when it is solvable. As an application, we derive the ϕ -Hermitian solutions for dual quaternion matrix equation A X A ϕ = C , where the ϕ -Hermitian extends the concepts of Hermiticity and η -Hermiticity. Lastly, we present a numerical example to verify the main research results of this paper. [ABSTRACT FROM AUTHOR]

In the paper, we introduce the signless Laplacian A B C -matrix Q ̃ (G) = D ¯ (G) + A ̃ (G) , where D ¯ (G) is the diagonal matrix of A B C -degrees and A ̃ (G) is the A B C -matrix of G. The eigenvalues of the matrix Q ̃ (G) are the signless Laplacian A B C -eigenvalues of G. We give some basic properties of the matrix Q ̃ (G) , which includes relating independence number and clique number with signless Laplacian A B C -eigenvalues. For bipartite graphs, we show that the signless Laplacian A B C -spectrum and the Laplacian A B C -spectrum are the same. We characterize the graphs with exactly two distinct signless Laplacian A B C -eigenvalues. Also, we consider the problem of the characterization of the graphs with exactly three distinct signless Laplacian A B C -eigenvalues and solve it for bipartite graphs and, in some cases, for non-bipartite graphs. We also introduce the concept of the trace norm of the matrix Q ̃ (G) − t r (Q ̃ (G)) n I , called the signless Laplacian A B C -energy of G. We obtain some upper and lower bounds for signless Laplacian A B C -energy and characterize the extremal graphs attaining it. Further, for graphs of order at most 6, we compare the signless Laplacian energy and the A B C -energy with the signless Laplacian A B C -energy and found that the latter behaves well, as there is a single pair of graphs with the same signless Laplacian A B C -energy unlike the 26 pairs of graphs with same signless Laplacian energy and eight pairs of graphs with the same A B C -energy. [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]

In this paper, an improved zeroing neural network (ZNN) model is proposed to obtain the positive definite solutions of the continuous coupled Lyapunov matrix equations (CLMEs) associated with continuous‐time Markovian jump (CMJ) systems. To achieve this, a general ZNN model is established by constructing a matrix‐valued error function. Then, to accelerate the convergence rate of the proposed ZNN model, the latest estimation is introduced to obtain an improved ZNN model. Some convergence conditions have been derived for the presented improved ZNN model through Lyapunov theory. Comparisons among the improved ZNN model and the existing results are conducted to illustrate the advantages of the proposed improved ZNN model in numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, the impulsive synchronization of a class of nonlinear multiple neural networks (MNNs) with multi-delays was considered under a dynamic event-based mechanism. To achieve a more comprehensive synchronization outcome and mitigate the conservativeness of impulsive control due to predetermined time sequences, we integrated a dynamic event-triggered strategy. This approach formed a novel control framework for generalized MNNs, where impulsive inputs were applied only under specific conditions governed by event-triggering rules. Towards the above objectives, the impulsive jumping system, resulting from dynamic component, and matrix measure method were invoked to directly increase the computational simplicity and extensibility of the study. As the outcome, the synchronization criteria for the MNNs could be achieved, and the exponential convergence rate is resolved by considering both the generalized comparison principle regarding impulsive systems and the variable parameter formula. Moreover, Zeno-freeness of the achieved triggering regulation is ensured. Finally, two numerical examples confirmed the validity of the designed approach. [ABSTRACT FROM AUTHOR]

The correlation filter object tracking algorithm has gained extensive attention from scholars in the field of tracking because of its excellent tracking performance and efficiency. However, the mathematical modeling relationships of correlation filter tracking frameworks are unclear. Therefore, many forms of correlation filters are susceptible to confusion and misuse. To solve these problems, we attempted to review various forms of the correlation filter and discussed their intrinsic connections. First, we reviewed the basic definitions of the circulant matrix, convolution, and correlation operations. Then, the relationship among the three operations was discussed. Considering this, four mathematical modeling forms of correlation filter object tracking from the literature were listed, and the equivalence of the four modeling forms was theoretically proven. Then, the fast solution of the correlation filter was discussed from the perspective of the diagonalization property of the circulant matrix and the convolution theorem. In addition, we delved into the difference between the one-dimensional and two-dimensional correlation filter responses as well as the reasons for their generation. Numerical experiments were conducted to verify the proposed perspectives. The results showed that the filters calculated based on the diagonalization property and the convolution property of the cyclic matrix were completely equivalent. The experimental code of this paper is available at https://github.com/110500617/Correlation-filter/tree/main. [ABSTRACT FROM AUTHOR]

Plagued by heterogeneous clutter, it is a serious challenge for airborne radars to detect low-altitude, weak targets. To overcome this problem, a novel matrix information geometry detector for airborne multi-channel radar is proposed in this paper. The proposed detector applies the given steering vector and array structure information to the matrix information geometry detection method so that it can be used for space–time adaptive detection. While improving the detection performance, the matrix information geometry detector's original anti-clutter advantage is enhanced as well. The simulation experiment results indicate that the proposed detector has advantages in several of the properties related to space–time adaptive detection, while its computational complexity does not increase significantly. Moreover, experiment results based on the measured data verify the superior performance of the proposed method. Sea-detecting data-sharing-program data, mountaintop data, and phased-array radar data are employed to verify the performance advantage of the proposed method in heterogeneous clutter and the ability for weak target detection. [ABSTRACT FROM AUTHOR]

This study takes a detailed look at various inequalities related to the Euclidean operator radius. It examines groups of n-tuple operators, studying how they add up and multiply together. It also uncovers a unique power inequality specific to the Euclidean operator radius. The research broadens its scope to analyze how n-tuple operators, when used as parts of 2 × 2 operator matrices, illustrate inequalities connected to the Euclidean operator radius. By using the Euclidean numerical radius and Euclidean operator norm for n-tuple operators, the study introduces a range of new inequalities. These inequalities not only set limits for the addition, multiplication, and Euclidean numerical radius of n-tuple operators but also help in establishing inequalities for the Euclidean operator radius. This process involves carefully examining the Euclidean numerical radius inequalities of 2 × 2 operator matrices with n-tuple operators. Additionally, a new inequality is derived, focusing specifically on the Euclidean operator norm of 2 × 2 operator matrices. Throughout, the research keeps circling back to the idea of finding and understanding symmetries in linear operators and matrices. The paper highlights the significance of symmetry in mathematics and its impact on various mathematical areas. [ABSTRACT FROM AUTHOR]

Intuitionistic fuzzy (IF) β -minimal description operators can deal with noise data in the IF covering-based rough set theory. That is to say, they can be used to find data that we need in IF environments. For an IF β -covering approximation space (i.e., an IF environment) with a high cardinality, it would be tedious and complicated to use IF set representations to calculate them. Therefore, it is necessary to find a quick method to obtain them. In this paper, we present the notion of IF β -maximal description based on the definition of IF β -minimal description, along with the concepts of IF granular matrix and IF reduction. Moreover, we propose matrix calculation methods for IF covering-based rough sets, such as IF β -minimal descriptions, IF β -maximal descriptions, and IF reductions. Firstly, the notion of an IF granular matrix is presented, which is used to calculate IF β -minimal description. Secondly, inspired by IF β -minimal description, we give the notion of IF β -maximal description. Furthermore, the matrix representations of IF β -maximal descriptions are presented. Next, two types of reductions for IF β -covering approximation spaces via IF β -minimal and fuzzy β -minimal descriptions are presented, along with their matrix representations. Finally, the new calculation methods are compared with corresponding set representations by carrying out several experiments. [ABSTRACT FROM AUTHOR]

Transformer has emerged as one of the modern neural networks that has been applied in numerous applications. However, transformers' large and deep architecture makes them computationally and memory-intensive. In this paper, we propose the block g-circulant matrices to replace the dense weight matrices in the feedforward layers of the transformer and leverage the DCT-DST algorithm to multiply these matrices with the input vector. Our test using Portuguese-English datasets shows that the suggested method improves model memory efficiency compared to the dense transformer but at the cost of a slight drop in accuracy. We found that the model Dense-block 1-circulant DCT-DST of 128 dimensions achieved the highest model memory efficiency at 22.14%. We further show that the same model achieved a BLEU score of 26.47%. [ABSTRACT FROM AUTHOR]

We model the folding of ordinary paper via piecewise isometries R2→R3. The collection of crease lines and vertices in the unfolded paper is called the crease pattern. Our results generalize the previously known necessity conditions from the more restrictive case of folding paper flat (into R2); if the crease pattern is foldable, then the product (in a non-intuitive order) of the associated rotational matrices is the identity matrix. This condition holds locally in a multiple vertex crease pattern and can be adapted to a global condition. Sufficiency conditions are significantly harder, and are not known except in the two-dimensional single-vertex case. [Copyright &y& Elsevier]

This paper presents Part I of a two-part series on studying the long-term coexistence states of stochastic generalized Kolmogorov systems with small diffusion. Part I establishes a mathematical framework for approximating the invariant probability measures (IPMs) and density functions (IPDFs) of these systems, while Part II will focus on analyzing their non-autonomous periodic counterparts. Compared with the existing approximation methods available only for systems with non-degenerate linear diffusion, this paper introduces two new and easily implementable approximation methods, the log-normal approximation (LNA) and updated normal approximation (uNA), which can be used for systems with not only non-degenerate but also degenerate diffusion. Moreover, we utilize the Kolmogorov-Fokker-Planck (KFP) operator and matrix algebra to develop algorithms for calculating the associated covariance matrix and verifying its positive definiteness. Our new approximation methods exhibit good accuracy in approximating the IPM and IPDF at both local and global levels, and significantly relaxes the minimal criteria for positive definiteness of the solution of the continuous-type Lyapunov equation. We demonstrate the utility of our methods in several application examples from biology and ecology. [ABSTRACT FROM AUTHOR]

Let G be a simple undirected graph of order n. In this paper, we introduce a new distance matrix called the universal distance matrix of G, denoted as UD (G) and it is defined as UD (G) = αTr (G) + βD(G) + γJ + δI, where Tr (G) is the diagonal matrix whose elements are the vertex transmissions, and D(G) is the distance matrix of G. Here J is the all-ones matrix, and I is the identity matrix and α, β, γ, δ ∈ R and β ̸= 0. This unified definition enables us to derive the spectra of different matrices associated with the distance matrix of graphs. The set of eigenvalues of the universal distance matrix namely, {ρ1, ρ2,.. ., ρn} is known as the universal distance spectrum of G. As a consequence, by taking appropriate values for α, β, γ, δ ∈ R and β ̸= 0, we obtain the eigenvalues of distance matrix, distance Laplacian matrix, distance signless Laplacian matrix, generalized distance matrix, distance Seidal matrix and distance matrices of graph complements. In this paper, we obtain the universal distance spectra of regular graph, join of two regular graphs, joined union of three regular graphs, generalized joined union of n disjoint graphs with one arbitrary graph H using the Schur complement of a block matrix. [ABSTRACT FROM AUTHOR]

This paper proposes a method to generate a synthetic rating matrix based on user's rational behavior, with the aim of generating a large-scale rating matrix at low cost. Collaborative filtering is one of the major techniques for recommender systems, which is widely used because it can recommend items using only a history of ratings given to the items by users. However, collaborative filtering has some problems such as the cold-start problem and the sparsity problem, both of which are caused by the shortage of ratings in a database (rating matrix). This problem is particularly serious for services that have just started operation or do not have a large number of users. The proposed method generates a rating matrix without missing values using users' rating probabilities, which are obtained from the distribution of their actual ratings. The final synthetic rating matrix is generated after adjusting its sparsity by introducing missing values. The validity of the proposed method is evaluated by comparing the synthetic rating matrix in terms of the similarity of the distribution of several statistics with that of the real data. The synthetic rating matrix is also evaluated by applying it to recommendation to actual users. The experimental results show that the proposed method can generate the synthetic rating matrix that has similar statistics to the real data, and recommendation models trained with the synthetic data achieve comparable recall to that trained with the real data when using the real data as test data. Based on the results of these experiments, this paper also tries to generate the synthetic rating matrix that contains richer information than the real data by increasing the number of users or reducing the sparsity of the rating matrix. The results of these experiments show the possibility that increasing the information contained in a rating matrix could improve recall. [ABSTRACT FROM AUTHOR]

We use Regev's double centralizer theorem from [7] to study invariants of matrices with group actions. This theory then has applications to trace identities and Poincaré series. [ABSTRACT FROM AUTHOR]

This paper mainly studies the least-squares solutions of matrix equation A X B = C under a semi-tensor product. According to the definition of the semi-tensor product, the equation is transformed into an ordinary matrix equation. Then, the least-squares solutions of matrix-vector and matrix equations respectively investigated by applying the derivation of matrix operations. Finally, the specific form of the least-squares solutions is given. [ABSTRACT FROM AUTHOR]

Aiming at addressing the security and efficiency challenges during image transmission, an efficient image cryptosystem utilizing difference matrix and genetic algorithm is proposed in this paper. A difference matrix is a typical combinatorial structure that exhibits properties of discretization and approximate uniformity. It can serve as a pseudo-random sequence, offering various scrambling techniques while occupying a small storage space. The genetic algorithm generates multiple ciphertext images with strong randomness through local crossover and mutation operations, then obtains high-quality ciphertext images through multiple iterations using the optimal preservation strategy. The whole encryption process is divided into three stages: first, the difference matrix is generated; second, it is utilized for initial encryption to ensure that the resulting ciphertext image has relatively good initial randomness; finally, multiple rounds of local genetic operations are used to optimize the output. The proposed cryptosystem is demonstrated to be effective and robust through simulation experiments and statistical analyses, highlighting its superiority over other existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the clique polynomial method (CPM) is proposed for the numerical solution of Singular Lane-Emden type equations. A new operational matrix of integration concerning clique polynomials of the complete graph has been generated in its generalized representation. This operational matrix is applied to differential equations and is transformed into a system of algebraic equations that can be solved efficiently with the help of Newton's iterative solver. The efficiency of the developed method is revealed by considering illustrative examples, and the obtained results are compared favorably with the corresponding exact solution and errors. [ABSTRACT FROM AUTHOR]

This paper proposes explicit solutions for the algebraic Riccati matrix equation. For single‐input systems in controllable canonical form, the explicit Hermitian solutions of the non‐homogeneous Riccati equation are obtained using the entries of the system matrix, the closed‐loop system matrix, and the weighting matrix. The unknown entries of the closed‐loop system matrix are solved by scalar quadratic equations. For a homogeneous Riccati equation with a zero weighting matrix, the explicit solutions are proposed analytically in terms of the system eigenvalues. The advantages of the explicit solutions are threefold: first, if the system is controllable, the solution is directly given and the invariant subspaces of the Hamiltonian matrix are not required; second, if the system is near singularity, the explicit solution has higher numerical precision compared with the solution computed by numerical algorithms; third, for a real system in the controllable canonical form, the non‐negativity can be analysed for the explicit almost stabilizing solution. [ABSTRACT FROM AUTHOR]

The paper presents several results concerning the complexity of calculations in the model of vector addition chains. A refinement of N. Pippenger's upper bound is obtained for the complexity of the class of integer matrices with the constraint on the size of the coefficients as up to . Next, we establish an asymptotically tight bound on the complexity of сomputation of the number in the base of powers of . Based on generalized Sidon sequences, constructive examples of integer sets of cardinality are constructed: sets, with polynomial size of elements, having the complexity for any and sets, with the size of the elements, having the complexity . [ABSTRACT FROM AUTHOR]

The superposition of two independent Markovian arrival processes (MAPs) is also a Markovian arrival process of which the Markovian representation is given as the Kronecker sum of the transition rate matrices of the component processes. The moments of stationary intervals of the superposition can be obtained by differentiating the Laplace transform (LT) given in terms of the transition rate matrices. In this paper, we propose a streamlined procedure to determine the minimal LT of the merged process in terms of the minimal LT coefficients of the component processes. Combined with the closed-form transformation between moments and LT coefficients, our result enables us to determine the moments of the superposed process based on the moments of the component processes. The main contribution is that the whole procedure can be implemented without explicit Markovian representations. In order to transform the minimal LT coefficients of the component processes into the minimal LT representation of the merged process, we also introduce another minimal representation. A numerical example is provided to illustrate the procedure. [ABSTRACT FROM AUTHOR]

This paper deals with Fredholm properties of the one-sided coupled operator matrix M = A B 0 D I 0 L I by means of generalized Schur factorization and the associated space decompositions. For λ ∈ C , some sufficient conditions are given for λ - M to be Fredholm (resp. left or right Fredholm), and these conclusions are further used to determine the essential spectra of a delay equation and a wave equation with acoustic boundary conditions. [ABSTRACT FROM AUTHOR]

In recent years, the tropical polynomial factorization problem, the tropical matrix decomposition problem, and the tropical multivariate quadratic equation solving problem have been proved to be NP-hard. Some asymmetric cryptographic systems based on tropical semirings have been proposed, but most of them are insecure and have been successfully attacked. In this paper, a new key exchange protocol and a new encryption protocol are proposed based on the difficulty of finding the multiple exponentiation problem of the tropical Jones matrices. The analysis results indicate that our protocol can resist various existing attacks. The complexity of attacking an MEP by adversaries is raised due to the larger number of combinations in the tropical Jones matrices compared to regular matrix polynomials. Furthermore, the index semiring is the non-negative integer cyclic matrix semiring, leading to a higher efficiency in key generation. [ABSTRACT FROM AUTHOR]

This paper presents a numerical method based on an operational matrix of Legendre polynomials for resolving the class of time fractional diffusion (TFD) equations. The operational matrix of fractional order derivatives of the Legendre polynomials is derived as a product of matrices. The collocation method together with the operational matrix of Legendre polynomials are employed to transform the TFD equations into a set of algebraic equations. The perturbation method is applied to show the stability of the discussed method. The accuracy of the suggested method is validated using numerical experiments. The solution obtained by this method is in excellent agreement with the exact solution for the integer order of derivatives and is more precise than the solution obtained by the existing method in which Bernstein polynomials are taken as the basis polynomials. [ABSTRACT FROM AUTHOR]

In this paper, we deal with the construction of symmetric matrix whose corresponding graph is connected and unicyclic using some pre-assigned spectral data. Spectral data for the problem consist of the smallest and the largest eigenvalues of each leading principal submatrices. Inverse eigenvalue problem (IEP) with this set of spectral data is generally known as the extremal IEP. We use a standard scheme of labeling the vertices of the graph, which helps in getting a simple relation between the characteristic polynomials of each leading principal submatrix. Sufficient condition for the existence of the solution is obtained. The proof is constructive, hence provides an algorithmic procedure for finding the required matrix. Furthermore, we provide the condition under which the same problem is solvable when two particular entries of the required matrix satisfy a linear relation. [ABSTRACT FROM AUTHOR]

The goods collection and delivery process often relates to distribution logistics problems. The task is to deliver goods from warehouses to customers under specific circumstances. Efforts to optimize the process are largely aimed at reducing overall costs of goods transportation. Among the prominent algorithms for solving the basic type of the delivery (or collection) problem, which includes a single depot and a homogeneous vehicle fleet, is the algorithm developed by Clarke and Wright in 1964. This algorithm minimizes transportation costs by maximizing the savings achieved through merging multiple routes into one. This paper primarily aims to solve the pickup and delivery problem where the goods must be delivered and empty packaging collected in a single process. The request of a customer can be routed from the depot or from another customer. Similarly, the destination of the request may be the depot or another customer. Unlike the original version of the Clarke and Wright algorithm, the initial routes are created to satisfy delivery orders, and therefore, the same customer can occur in multiple routes. Consequently, a situation may arise in which two routes containing one or more common vertices must be combined during the calculation. Furthermore, these vertices need not be the outermost vertices of the routes. This situation cannot be addressed by using the original version of the Clarke and Wright algorithm, and that is why we propose its modification. Merging routes through inner vertices means that the cost savings depend on the configurations of the routes, and therefore, they cannot be calculated a priori. Instead, the dynamic savings matrix must be used. [ABSTRACT FROM AUTHOR]

In this paper, by using the structure properties of algebras and the technique of matrix operation, we investigate the structure of local Lie triple derivations on triangular algebras. Under some mild conditions, we prove that each local Lie triple derivation of triangular algebras can be expressed as the sum of a derivation and a linear map from the triangular algebra to its center that vanishes at Lie triple products. Finally, we apply the main result to the problem of characterizing local Lie triple derivations on an upper triangular matrix algebra. [ABSTRACT FROM AUTHOR]

This paper introduces a method for determinant computation in square matrices. Our approach utilized recursion and the Schur formula to partition the matrix into submatrices. Determinant calculations were performed using the condensation method. To evaluate its computational ef- ficiency, we conducted a floating-point operation per second (FLOPS) analysis, using FLOPS to compare the efficiency of all reduction methods. Pseudocode was provided to demonstrate the computational efficiency of our method in terms of flops and execution time for square matrix determinant calculations. [ABSTRACT FROM AUTHOR]

Methods for interval priority weight estimation from a crisp pairwise comparison matrix were proposed in the interval analytic hierarchy process assuming the vagueness of human evaluation. The interval priority weights estimated by the conventional method do not reflect the intrinsic vagueness in the given pairwise comparison matrix (PCM). This paper proposes parameter-free methods based on minimal conceivable ranges for estimating interval priority weights from a crisp pairwise comparison matrix. The estimated interval priority weight vectors are required to satisfy (1) the potential reproducibility, (2) the normality, and (3) the preservation of the perfect consistent data. Estimation methods of interval priority weights are proposed based on the minimum possible range. We show those proposed methods satisfy the required three properties. The estimation problem of interval priority weights potentially has multiple solutions with which the associated interval PCMs are identical to one another. To make the further investigation simpler, we use an interval priority weight vector among multiple solutions such that the sum of the center values of interval priority weights is one. We compare the estimation methods of interval priority weights from the viewpoint of estimation accuracy by numerical experiments. Namely, by generating crisp pairwise comparison matrices randomly under true interval PCMs, we evaluate the accuracies of the estimated interval priority weight vectors by comparing the true interval priority weight vectors. [ABSTRACT FROM AUTHOR]

This paper establishes the linear algebra of the (r, β)-Stirling matrix. Along the way, this paper derives various identities, such as its factorization and relationship to the Pascal matrix and the Stirling matrix of the second kind. Additionally, this paper develops a natural extension of the Vandermonde matrix, which can be used to study and evaluate successive power sums of arithmetic progressions. [ABSTRACT FROM AUTHOR]

In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible. [ABSTRACT FROM AUTHOR]

The 1925 paper "On quantum mechanics" by M. Born and P. Jordan, and the sequel "On quantum mechanics II" by M. Born, W. Heisenberg, and P. Jordan, developed Heisenberg's pioneering theory into the first complete formulation of quantum mechanics. The Born and Jordan paper is the subject of the present article. This paper introduced matrices to physicists. We discuss the original postulates of quantum mechanics, present the two-part discovery of the law of commutation, and clarify the origin of Heisenberg's equation. We show how the 1925 proof of energy conservation and Bohr's frequency condition served as the gold standard with which to measure the validity of the new quantum mechanics. [ABSTRACT FROM AUTHOR]

Computer-assisted photometric determination of chemical compounds in paper matrices (chromatographic paper circles 10 mm in diameter) is described. A device with a video camera attached to a computer was developed for image density measurements. Matrices containing certified neutral-density glass filters and Congo Red in different concentrations were used. It was shown that the digital recording and computer-assisted photometric analysis of matrix images can be used for determining analyte concentrations in the matrices and assessing the optical homogeneity of these matrices. The advantages and areas of application the method were discussed. [ABSTRACT FROM AUTHOR]

This paper introduces (graded) skew cellular algebras, which generalise Graham and Lehrer's cellular algebras. We show that all of the main results from the theory of cellular algebras extend to skew cellular algebras and we develop a "cellular algebra Clifford theory" for the skew cellular algebras that arise as fixed point subalgebras of cellular algebras. As an application of this general theory, the main result of this paper proves that the Hecke algebras of type G(\ell,p,n) are graded skew cellular algebras. In the special case when p = 2 this implies that the Hecke algebras of type G(\ell,2,n) are graded cellular algebras. The proofs of all of these results rely, in a crucial way, on the diagrammatic Cherednik algebras of Webster and Bowman. Our main theorem extends Geck's result that the one parameter Iwahori-Hecke algebras are cellular algebras in two ways. First, our result applies to all cyclotomic Hecke algebras in the infinite series in the Shephard-Todd classification of complex reflection groups. Secondly, we lift cellularity to the graded setting. As applications of our main theorem, we show that the graded decomposition matrices of the Hecke algebras of type G(\ell,p,n) are unitriangular, we construct and classify their graded simple modules and we prove the existence of "adjustment matrices" in positive characteristic. [ABSTRACT FROM AUTHOR]

In this study, we introduce a system called Matrix Researcher2vec (MResearcher2vec) which generates researcher embedding vectors from their papers and research projects in researchmap and KAKENHI databases. The system includes data on 276,841 researchers, 6,161,592 papers, and research projects. Utilizing natural language processing techniques, the MResearcher2vec model extracts researcher vectors from the papers and research project summaries of KAKENHI grant recipients. The similarity between reseachers is then computed to visualize inter-researcher relationships. The machine learning results have been integrated into a web service, providing a novel approach for academic relationship mining. It can be applied in the matching of research contents and researchers in evaluation of industry-government-academia collaboration and joint research. It contributes in four aspects: (1) exchanges between researchers, (2) creation of opportunities for researchers and companies to connect, (3) further promotion of interdisciplinary research, and (4) reduction of lost opportunities for research institutions to acquire talents. [ABSTRACT FROM AUTHOR]

Abstract: An integrated model for ranking scientific publications together with authors and journals recently presented in [Bini, Del Corso, Romani, ETNA 2008] is closely analyzed. The model, which relies on certain adjacency matrices and obtained from the relations of citation, authorship and publication, provides the ranking by means of the Perron vector of a stochastic matrix obtained by combining and . Some perturbation theorems concerning the Perron vector previously introduced by the authors are extended to more general cases and a counterexample to a property previously addressed by the authors is presented. The theoretical results confirm the consistency and effectiveness of our model. Some paradigmatic examples are reported together with some results obtained on a real set of data. [Copyright &y& Elsevier]

Let k be a field of characteristic 0, and let f : kn→kn be a polynomial map with components of the form fi=xi+hi, where the hi are monomials. If the Jacobian determinant of the map f is a nonzero constant, then f is a tame automorphism. If, in addition, each hi is either constant or of degree 2 or more, then f is linearly triangularizable. [Copyright &y& Elsevier]

Community structure is a significant characteristic of complex networks, and community detection has valuable applications in network structure analysis. Non-negative matrix factorization (NMF) is a key set of algorithms used to solve the community detection issue. Nevertheless, the localization of feature vectors in the adjacency matrix, which represents the characteristics of complex network structures, frequently leads to the failure of NMF-based approaches when the data matrix has a low density. This paper presents a novel algorithm for detecting sparse network communities using non-negative matrix factorization (NMF). The algorithm utilizes local feature vectors to represent the original network topological features and learns regularization matrices. The resulting feature matrices effectively reveal the global structure of the data matrix, demonstrating enhanced feature expression capabilities. The regularized data matrix resolves the issue of localized feature vectors caused by sparsity or noise, in contrast to the adjacency matrix. The approach has superior accuracy in detecting community structures compared to standard NMF-based community detection algorithms, as evidenced by experimental findings on both simulated and real-world networks. [ABSTRACT FROM AUTHOR]

We study various perturbations and their holographic interpretation for non-Abelian T-dual of AdS5 × S5 where the T-duality is applied along the SU(2) of AdS5. This paper focuses on two types of perturbations, namely the scalar and the vector fields on NATD of AdS5 × S5. For scalar perturbations, the corresponding solutions could be categorised into two classes. For one of these classes of solutions, we build up the associated holographic dictionary where the asymptotic radial mode sources scalar operators for the (0 + 1)d matrix model. These scalar operators correspond to either a marginal or an irrelevant deformation of the dual matrix model at strong coupling. We calculate the two point correlation between these scalar operators and explore their high as well as low frequency behaviour. We also discuss the completion of these geometries by setting an upper cut-off along the holographic axis and discuss the corresponding corrections to the scalar correlators in the dual matrix model. Finally, we extend our results for vector perturbations where we obtain asymptotic solutions for a particular class of modes. These are further used to calculate the boundary charge density at finite chemical potential. [ABSTRACT FROM AUTHOR]

It is important to establish solid mathematical knowledge throughout the education period. Matrices are important mathematical objects commonly used in many diverse disciplines, including mathematics, engineering, and science. Most problems encountered in such disciplines are represented by mathematical models with various types of matrices, and solved through some applications of matrix algebra. Although simple or advanced operations of matrices can be performed by using modern programming languages, it usually results in a large fragment of code with a low level of readability due to a complicated sequence of control statements. On the other hand, special-purpose languages handle these operations via library functions, presenting poor integration with other programming environments, and less programming flexibility and practice. This paper addresses the design and development of a programming language, called MxPL, which supports matrix-related mathematics with the provision of some basic structures and functions. Firstly, a grammar that is compatible with the usual notations of matrices is constructed and the parser is produced. Then, the code verifier and interpreter for MxPL programs are implemented. Some code examples are presented to illustrate the performance of several sophisticated matrix operations. The comparative analysis of MxPL is conducted with modern programming languages based on language features. [ABSTRACT FROM AUTHOR]

If H ν = (ν n , k) n , k ≥ 0 is the matrix with entries ν n , k = ∫ [ 0 , ∞) t n + k n ! d ν (t) , where ν is a nonnegative Borel measure on the interval [ 0 , ∞) , the matrix H ν acts on the space of all entire functions f (z) = ∑ n = 0 ∞ a n z n and induces formally the operator in the following way: H ν (f) (z) = ∑ n = 0 ∞ (∑ k = 0 ∞ ν n , k a k) z n. In this paper, for 0 < p ≤ ∞ , we classify for which measures the operator H ν (f) is well defined on F p and also gets an integral representation, and among them we characterize those for which H ν is a bounded (resp., compact) operator between F p and F ∞ . [ABSTRACT FROM AUTHOR]

We identify the class of real square invertible matrices A for which the signs of the diagonal entries of A-1 match those of A, and begin their study. We say such matrices have the inverse diagonal property (IDP). This class includes many important classes: the positive definite matrices, the M-matrices, the totally positive matrices and some variants, the P-matrices, the diagonally dominant and H-matrices and their inverse classes, as well as triangular matrices. This class is closed under any real invertible diagonal multiplication on either the right or the left. So questions about this class can be reduced to the case of positive diagonal entries. Other basic properties are given. One theme is what conditions need be added to the IDP to insure membership in a familiar class. For example, the positive definite matrices are characterized as certain IDP matrices with special conditions on certain particular principal minors. The tridiagonal case is highlighted. Certain specially simple conditions on such matrices are mentioned that ensure them to be P-matrices, positive definite matrices or M-matrices. We also note that recent results about the invertibility of weakly diagonally dominant matrices are used. Examples are given throughout the paper. [ABSTRACT FROM AUTHOR]

The index of a signed graph is the largest eigenvalue of its adjacency matrix. Let Un,k,4 be the set of all signed complete graphs of order n whose negative edges induce a unicyclic graph of order k and girth at least 4. In this paper, we identify the signed graphs achieving the maximum index in the class Un,k,4. [ABSTRACT FROM AUTHOR]