Results 31 to 40 of about 2,550,298 (280)
A new Approach for the Modulus-Based Matrix Splitting Algorithms
IEEE Access, 2019 We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it.
Wenpeng Wang +3 more
doaj +1 more source
Diagonal Loading Beamforming Based on Aquila Optimizer
IEEE Access, 2023 Traditional beamforming algorithms are only applicable to ideal environments. When the array antenna receives data under circumstances of small snapshots or large signal-to-noise ratio(SNR), noise eigenvalues of classic sample matrix inversion(SMI) and ...
Chao Liu, Jiaqi Zhen
doaj +1 more source
Multiprecision Algorithms for Computing the Matrix Logarithm
SIAM Journal on Matrix Analysis and Applications, 2018 Two algorithms are developed for computing the matrix logarithm in floating point arithmetic of any specified precision. The backward error-based approach used in the state of the art inverse scaling and squaring algorithms does not conveniently extend ...
Massimiliano Fasi, N. Higham
semanticscholar +1 more source
Computing Minimal Polynomials of Matrices [PDF]
, 2007 We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical implementation. The
Jacobson +4 more
core +3 more sources
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure [PDF]
Journal of Sciences, Islamic Republic of Iran, 2010 The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube
L Jokar
doaj
IEEE Access, 2021 Two M-decomposed based identification algorithms are proposed for large-scale systems in this study. Since the least squares algorithms involve matrix inversion calculation, they can be inefficient for large-scale systems whose information matrices are ...
Yuejiang Ji, Lixin Lv
doaj +1 more source
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry
, 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
Landsberg, J. M., Michałek, Mateusz
openaire +2 more sources
Biased Deep Distance Factorization Algorithm for Top-N Recommendation [PDF]
Jisuanji kexue, 2021 Since traditional matrix factorization algorithms are mostly based on shallow linear models,it is difficult to learn latent factors of users and items at a deep level.When the dataset is sparse,it is inclined to overfitting.To deal with the problem,this ...
QIAN Meng-wei , GUO Yi
doaj +1 more source
Covariance matrix adaptation for the rapid illumination of behavior space [PDF]
Annual Conference on Genetic and Evolutionary Computation, 2019 We focus on the challenge of finding a diverse collection of quality solutions on complex continuous domains. While quality diversity (QD) algorithms like Novelty Search with Local Competition (NSLC) and MAP-Elites are designed to generate a diverse ...
Matthew C. Fontaine +3 more
semanticscholar +1 more source
Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method. [PDF]
, 2019 Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians.
Freeman, C Daniel +5 more
core +2 more sources