Results 1 to 10 of about 3,814,069 (243)
Buildings, 2022 Inaccurate mass estimates have been recognized as an important source of uncertainty in structural identification, especially for large-scale structures with old ages.
Shiyu Wang, Ying Lei
doaj +3 more sources
On the structure of the fundamental subspaces of acyclic matrices with 0 in the diagonal
The American Journal of Combinatorics, 2023 A matrix is called acyclic if replacing the diagonal entries with \(0\), and the nonzero diagonal entries with \(1\), yields the adjacency matrix of a forest.
Daniel Jaume, Adrian Pastine
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
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix [PDF]
SIAM Journal on Matrix Analysis and Applications, 2001 The authors show how bipartite matching algorithms can be used to permute the rows and columns of a matrix so that the diagonal of the permuted matrix is large. The proposed algorithm computes a matching that corresponds to a permutation of a sparse matrix such that the product (or sum) of the diagonal entries is maximized.
Iain S. Duff, Jacko Koster
openaire +3 more sources
The Sinkhorn-Knopp algorithm : convergence and applications [PDF]
, 2008 As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Knight, P.A.
core +4 more sources
Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm [PDF]
Journal of Applied Mathematics, Statistics and Informatics, 2012 Diagonal Scaling of Ill-Conditioned Matrixes by Genetic AlgorithmThe purpose of this article is to use genetic algorithm for finding two invertible diagonal matricesD1andD2such that the scaled matrixD1AD2approaches to minimum condition number.
Vajargah, Behrouz Fathi, Moradi, Mojtaba
openaire +1 more source
NISQ algorithm for the matrix elements of a generic observable
SciPost Physics, 2023 The calculation of off-diagonal matrix elements has various applications in fields such as nuclear physics and quantum chemistry. In this paper, we present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix ...
Rebecca Erbanni, Kishor Bharti, Leong-Chuan Kwek, Dario Poletti
doaj +1 more source
Latent Multi-View Semi-Nonnegative Matrix Factorization with Block Diagonal Constraint
Axioms, 2022 Multi-view clustering algorithms based on matrix factorization have gained enormous development in recent years. Although these algorithms have gained impressive results, they typically neglect the spatial structures that the latent data representation ...
Lin Yuan +3 more
doaj +1 more source
Deep Subspace Clustering with Block Diagonal Constraint
Applied Sciences, 2020 The deep subspace clustering method, which adopts deep neural networks to learn a representation matrix for subspace clustering, has shown good performance.
Jing Liu, Yanfeng Sun, Yongli Hu
doaj +1 more source
Complete/incomplete multi‐view subspace clustering via soft block‐diagonal‐induced regulariser
IET Computer Vision, 2021 This study proposes a novel multi‐view soft block diagonal representation framework for clustering complete and incomplete multi‐view data. First, given that the multi‐view self‐representation model offers better performance in exploring the intrinsic ...
Yongli Hu +5 more
doaj +1 more source