Results 11 to 20 of about 3,814,069 (243)
A fast algorithm for matrix balancing [PDF]
, 2013 As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the
Knight, Philip, Ruiz, Daniel
core +2 more sources
Sequential Matrix Diagonalization Algorithms for Polynomial EVD of Parahermitian Matrices [PDF]
IEEE Transactions on Signal Processing, 2015 For parahermitian polynomial matrices, which can be used, for example, to characterise space-time covariance in broadband array processing, the conventional eigenvalue\ud decomposition (EVD) can be generalised to a polynomial matrix EVD (PEVD). In this paper, a new iterative PEVD algorithm based on sequential matrix diagonalisation (SMD) is introduced.
Soydan Redif +2 more
openaire +5 more sources
ALGORITMA POLINOMIAL MINIMUM UNTUK MEMBENTUK MATRIKS DIAGONAL DARI MATRIKS PERSEGI
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2017 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
A New Algorithm for Diagonalizing a Real Symmetric Matrix [PDF]
Mathematics of Computation, 1964 The algorithm described in this paper is essentially a Jacobi-like procedure employing Householder and Jacobi orthogonal similarity transformations successively on a real symmetric matrix to obtain, in the limit, a diagonal matrix of eigenvalues. The columns of the product matrix of all the orthogonal transformations, taken in the proper order, form a ...
openaire +2 more sources
matrix-toolbox/CHM_scripts: Sinkhorn Algorithm
, 2023 Several CHM matrices (M-scripts) obtained by the Sinkhorn Algorithm are ...
matrix-toolbox
core +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms
IEEE Access, 2021 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
Covariance matrix estimation with heterogeneous samples [PDF]
, 2008 We consider the problem of estimating the covariance matrix Mp of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly Mp.
Bidon, Stéphanie +2 more
core +1 more source
EURASIP Journal on Advances in Signal Processing, 2020 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
Kalman filter polarization demultiplexing algorithm based on diagonalized matrix treatment
Optics Express, 2022 When we implement the equalizations of polarization effects using a Kalman filter (KF) in a coherent optical fiber communication system, we will require to multiply many matrices. If the state vector describing the system has a dimension of n, the state error covariance matrix P will have the dimension of n × n, and other matrices used in the Kalman ...
Qi Zhang +4 more
openaire +2 more sources