Results 1 to 10 of about 295,723 (224)
Equivalence of Matrix Pencil and HTLS Ring-Down Electromechanical Mode Identification Algorithms
Matrix pencil and Hankel total least squares (HTLS) are two popular ring-down electro- mechanical mode identification algorithms. The appeal of these algorithms can be attributed to faster execution due to the non-iterative procedure of model order ...
Krishna Rao, K. N. Shubhanga
doaj +3 more sources
GMDS-ZNN Model 3 and its Ten-Instant Discrete Algorithm for Time-Variant Matrix Inversion Compared With Other Multiple-Instant Ones [PDF]
The online time-variant matrix inversion problem has attracted extensive attention and study, because of its considerable appearance and application in scientific research and industrial production.
Dongqing Wu +4 more
doaj +2 more sources
Enhanced Detection Algorithms Based on Eigenvalues and Energy in Random Matrix Theory Paradigm
This paper considers the problem of spectrum sensing in multi-antenna cognitive radio networks. Energy detection (ED) method for spectrum sensing does not require any information of the source signal and channel, as well as it is suitable for detecting ...
Wenjing Zhao +4 more
doaj +3 more sources
Matrix black box algorithms - a survey [PDF]
The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and optimized with respect to their efficiency, due to the essential significance of that operation in ...
Jerzy Respondek
doaj +1 more source
A Nonconvex Method to Low-Rank Matrix Completion
In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 more
doaj +1 more source
To address the problem that traditional spectral clustering algorithms cannot obtain the complete structural information of networks, this paper proposes a spectral clustering community detection algorithm, PMIK-SC, based on the point-wise mutual ...
Yinan Chen, Wenbin Ye, Dong Li
doaj +1 more source
Jordan–Schur Algorithms for Computing the Matrix Exponential
In this paper, two new versions of the Schur algorithm for computing the matrix exponential of an n×n complex matrix A are presented. Instead of the Schur form, these algorithms use the Jordan–Schur form of A.
Petko H. Petkov
doaj +1 more source
Some Method for Constructing Cycles in a Graph
Multidimensional matrices are a powerful tool for solving various fundamental scientific problems and applied scientific and technical problems. As examples of the use of multidimensional matrices in various fields, one can cite the work of the creator ...
Victor Munerman, Daniel Munerman
doaj +1 more source
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful
J. M. Landsberg, Mateusz Michalek
openaire +2 more sources
The problem of finding the greatest common divisor (GCD) of a given polynomial set has interested mathematicians for a very long time and has widespread applications in several branches of control theory, matrix theory, statistics, network theory.
Mitrouli, M +2 more
openaire +3 more sources

