Fine‐grain task‐parallel algorithms for matrix factorizations and inversion on many‐threaded CPUs
Concurrency and Computation: Practice and Experience, Volume 35, Issue 27, 10 December 2023., 2023 Abstract We extend a two‐level task partitioning previously applied to the inversion of dense matrices via Gauss–Jordan elimination to the more challenging QR factorization as well as the initial orthogonal reduction to band form found in the singular value decomposition.
Sandra Catalán +4 more
wiley +1 more source
Energy based methods applied in mechanics by using the extended Noether's formalism
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, Volume 103, Issue 12, December 2023., 2023 Abstract Physical systems are modeled by field equations; these are coupled, partial differential equations in space and time. Field equations are often given by balance equations and constitutive equations, where the former are axiomatically given and the latter are thermodynamically derived.
Bilen Emek Abali
wiley +1 more source
Homomorphic Model Selection for Data Analysis in an Encrypted Domain
Applied Sciences, 2020 Secure computation, a methodology of computing on encrypted data, has become a key factor in machine learning. Homomorphic encryption (HE) enables computation on encrypted data without leaking any information to untrusted servers.
Mi Yeon Hong, Joon Soo Yoo, Ji Won Yoon
doaj +1 more source
Finiteness theorems on elliptical billiards and a variant of the dynamical Mordell–Lang conjecture
Proceedings of the London Mathematical Society, Volume 127, Issue 5, Page 1268-1337, November 2023., 2023 Abstract We offer some theorems, mainly finiteness results, for certain patterns in elliptical billiards, related to periodic trajectories; these seem to be the first finiteness results in this context. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in (0,π)$(0,\pi )$, there are only finitely many ...
Pietro Corvaja, Umberto Zannier
wiley +1 more source
Using graphics processors to accelerate the computation of the matrix inverse [PDF]
, 2011 We study the use of massively parallel architectures for computing a matrix inverse. Two different algorithms are reviewed, the traditional approach based on Gaussian elimination and the Gauss-Jordan elimination alternative, and several high ...
Ezzatti, Pablo +2 more
core +1 more source
Designing an efficient test pattern generator using input reduction with linear operations [PDF]
, 2018 Advances in fabrication technology have resulted in more complicated systems, being used in ever increasing numbers of applications. The large increase in transistor counts versus the number of pins on the chip has made VLSI testing much harder than ever
Lee, Kangjoo
core +1 more source
Trading Off Performance for Energy in Linear Algebra Operations with Applications in Control Theory
CLEI Electronic Journal, 2014 We analyze the performance-power-energy balance of a conventional Intel Xeon mul- ticore processor and two low-power architectures –an Intel Atom processor and a sys- tem with a quad-core ARM Cortex A9+NVIDIA Quadro 1000M– using a high perfor- mance ...
Peter Benner +3 more
doaj +1 more source
Uplink Multiuser MIMO Detection Scheme with Reduced Computational Complexity [PDF]
, 2015 The wireless communication systems with multiple antennas have recently received significant attention due to their higher capacity and better immunity to fading channels as compared to single antenna systems.
Cho, S., Park, S. K.
core +2 more sources
Reduced complexity and latency for a massive MIMO system using a parallel detection algorithm
ICT Express, 2017 In recent years, massive MIMO systems have been widely researched to realize high-speed data transmission. Since massive MIMO systems use a large number of antennas, these systems require huge complexity to detect the signal.
Shoichi Higuchi, Chang-Jun Ahn
doaj +1 more source
Execute Elementary Row and Column Operations on the Partitioned Matrix to Compute M-P Inverse A†
Abstract and Applied Analysis, 2014 We first study the complexity of the algorithm presented in Guo and Huang (2010). After that, a new explicit formula for computational of the Moore-Penrose inverse A† of a singular or rectangular matrix A.
Xingping Sheng
doaj +1 more source