Results 1 to 10 of about 302,273 (226)
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. For various control optimization problems, the demand for the high-precision and rapid-convergence of matrix inversion algorithm is increasing.
Dongqing Wu +4 more
openaire +2 more sources
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting [PDF]
, 2022 Cache-adaptive algorithms are a class of algorithms that achieve optimal utilization of dynamically changing memory. These memory fluctuations are the norm in today’s multi-threaded shared-memory machines and time-sharing caches. Bender et al.
Nithyanand, Rishab +7 more
core +1 more source
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
, 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
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry
CoRR, 2016 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
Journal of Computational and Applied Mathematics, 1996 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
Matrix black box algorithms - a survey
, 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 ...
Respondek, Jerzy
core +1 more source
The Collected Algorithms of the ACM [PDF]
, 2008 The Collected Algorithms of the ACM (CALGO) is now the longest running journal-published series of algorithms. After placing CALGO in the context of other journal algorithm series, we discuss the factors that we believe have made CALGO the well respected
Hopkins, Tim, Tim Hopkins
core +1 more source
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem [PDF]
, 2006 The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems.
O'Connor, Noel E. +6 more
core +1 more source
Implicit algorithms for eigenvector nonlinearities
, 2022 We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit viewpoint.
Upadhyaya, Parikshit +3 more
core +1 more source
Convergence analysis of structure-preserving doubling algorithms for Riccati-type matrix equations
, 2010 [[abstract]]In this paper, we introduce the doubling transformation, a structure-preserving transformation for symplectic pencils, and present its basic properties.
Lin, WW;Xu, SF
core +1 more source