Results 11 to 20 of about 23,727,129 (258)
Matrix black box algorithms - a survey [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2022 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 +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]
IEEE Access, 2020 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 +3 more sources
A Testability Strategy Optimization Method Under Multi-Valued Dependency Condition Based on Deep Reinforcement Learning [PDF]
EntropyThe multi-valued dependency matrix (MVD matrix) is an important testability modeling approach, which can deliver more comprehensive testability information than the traditional dependency matrix (D-matrix).
Chao Zhang +5 more
doaj +2 more sources
Equivalence of Matrix Pencil and HTLS Ring-Down Electromechanical Mode Identification Algorithms
IEEE Access, 2023 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 +1 more source
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication [PDF]
, 2023 Karppa & Kaski (2019) proposed a novel ``broken or ``opportunistic matrix multiplication algorithm, based on a variant of Strassen\u27s algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.
Harris, David G.
core +1 more source
Structured matrix methods for computations on Bernstein basis polynomials [PDF]
, 2013 This thesis considers structure preserving matrix methods for computations on Bernstein polynomials whose coefficients are corrupted by noise. The ill-posed operations of greatest common divisor computations and polynomial division are considered, and it
Yang, Ning
core +5 more sources
Efficiency Comparison of Algorithms for Finding Determinants Via Permutations
Muthanna Journal of Pure Science, 2021 Determiners have been used extensively in a selection of applications throughout history. It also biased many areas of mathematics such as linear algebra.
Lugen M. Zake Sheet
doaj +1 more source
A Nonconvex Method to Low-Rank Matrix Completion
IEEE Access, 2022 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
Entropy, 2023 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
, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of sizes (Formula presented.) respectively, where (Formula presented.) is equal to (Formula presented.).
Lingas, Andrzej, +2 more
core +2 more sources