Results 51 to 60 of about 261,453 (169)
Diagonal Matrix Reduction over Refinement Rings
پژوهشهای ریاضی, 2022 : A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement. Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N if and only if Mm ~Nm for all ...
Marjan Sheibani Abdolyousefi +2 more
doaj
On the locating matrix of a graph and its spectral analysis [PDF]
Computer Science Journal of Moldova, 2017 We introduce a new matrix representation for a graph by defining the locating matrix $\mathbf{Lo}(G)$ of $G$. We define the locating eigenvalues, the locating spectrum, and locating energy of the graph and we calculate them for some standard graphs.
H. N. Ramaswamy +2 more
doaj
Complex & Intelligent SystemsCommunity detection is an important method to analyze the characteristics and structure of community networks, which can excavate the potential links between nodes and further discover subgroups from complex networks.
Zigang Chen +6 more
doaj +1 more source
Least Squares Method and Least Modules Method for Finding Defects in Regular Images
Кібернетика та комп'ютерні технологіїThe article describes methods based on method of least squares (LSM) and the method of least modules (LMM) to search for defects in regular images (regular 3D structures images).
Volodymyr Zhydkov +2 more
doaj +1 more source
Shape factor for regular and irregular matrix blocks in fractured porous media
Petroleum Science, 2019 Describing matrix–fracture interaction is one of the most important factors for modeling natural fractured reservoirs. A common approach for simulation of naturally fractured reservoirs is dual-porosity modeling where the degree of communication between ...
Peyman Rostami +2 more
doaj +1 more source
Regularized $M$-estimators of scatter matrix
IEEE Trans. Signal Process., 2014 In this paper, a general class of regularized $M$-estimators of scatter matrix are proposed which are suitable also for low or insufficient sample support (small $n$ and large $p$) problems. The considered class constitutes a natural generalization of $M$-estimators of scatter matrix (Maronna, 1976) and are defined as a solution to a penalized $M ...
Esa Ollila, David E. Tyler
openaire +2 more sources
The structure of solutions of the matrix linear unilateral polynomial equation with two variables
Karpatsʹkì Matematičnì Publìkacìï, 2017 We investigate the structure of solutions of the matrix linear polynomial equation $A(\lambda)X(\lambda)+B(\lambda)Y(\lambda)=C(\lambda),$ in particular, possible degrees of the solutions.
N.S. Dzhaliuk, V.M. Petrychkovych
doaj +1 more source
The Regular Shorted Matrix and the Hybrid Sum
Advances in Applied Mathematics, 1997 The impedance matrix of the hybrid connection of a pair of \(n\)-port electrical networks is considered. The paper studies a stronger condition than those derived for the parallel or shorted operator. This requires the existence of a certain regular shorted matrix that in turn leads to the regular hybrid sum.
Mitra, S.K., Manjunatha Prasad, K.
openaire +2 more sources
On a version of the spectral excess theorem
Electronic Journal of Graph Theory and Applications, 2020 Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or ...
Miquel Àngel Fiol, Safet Penjic
doaj +1 more source
Efficient Full-Matrix Adaptive Regularization
, 2018 Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix preconditioning methods are prohibitively expensive. We show how to modify full-matrix adaptive regularization in order to make it practical and effective.
Naman Agarwal +6 more
openaire +3 more sources