Results 1 to 10 of about 2,550,298 (280)
Much Faster Algorithms for Matrix Scaling [PDF]
We develop several efficient algorithms for the classical Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent.
Zeyuan Allen-Zhu +3 more
semanticscholar +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
Quantum-inspired algorithms in practice [PDF]
We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for ...
Juan Miguel Arrazola +3 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
New Bounds for Matrix Multiplication: from Alpha to Omega [PDF]
The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou FOCS'2023], the new method introduces several new ingredients that ...
V. V. Williams +3 more
semanticscholar +1 more source
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 +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
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds [PDF]
The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and column updates. It is the main subroutine behind the best algorithms for many dynamic problems whose complexity is not yet well-understood, such as ...
Jan van den Brand +2 more
semanticscholar +1 more source
Decomposition of matrix product states into shallow quantum circuits [PDF]
Tensor networks (TNs) are a family of computational methods built on graph-structured factorizations of large tensors, which have long represented state-of-the-art methods for the approximate simulation of complex quantum systems on classical computers ...
Manuel S. Rudolph +4 more
semanticscholar +1 more source
Particle Image Velocimetry for MATLAB: Accuracy and enhanced algorithms in PIVlab
PIVlab is a free toolbox and app for MATLAB ® . It is used to perform Particle Image Velocimetry (PIV) with image data: A light sheet illuminates particles that are suspended in a fluid.
W. Thielicke, René Sonntag
semanticscholar +1 more source

