Results 11 to 20 of about 54,360 (214)
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
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
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
NISQ algorithm for the matrix elements of a generic observable
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
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
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
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
ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
In mathematics, matrices have many uses, they are finding solutions of a linear equation system, looking for specific solutions of differential equations, determining state classification on Markov chains, and so on.
Himmatul Mursyidah
doaj +1 more source
Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms
This paper presents factorizations of each discrete sine transform (DST) matrix of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices.
Sirani M. Perera, Levi E. Lingsch
doaj +1 more source
This paper discusses the fitting of linear state space models to given multivariate time series in the presence of constraints imposed on the four main parameter matrices of these models.
Andreas Galka +2 more
doaj +1 more source

