GitHub

Lapack-C-Matrix-Diagonalization

This is a simple C++ program for computing the eigenvalues and eigenvectors of any square matrix using the LAPACK library. Diagonalization is handled by the "diagonalization" class, which is defined ...
JSTOR Daily

Explicit solutions of the Yang-Baxter-like matrix equation for diagonalizable coefficient matrix with two distinct nonzero eigenvalues

Let A be a complex diagonalizable matrix with two distinct nonzero eigenvalues λ and μ, the Yang-Baxter-like matrix equation AXA = XAX is reconsidered. We correct and improve the results in Shen et al ...
Scientific Research Publishing

Block Decompositions and Applications of Generalized Reflexive Matrices ()

Department of Cyber-Physical Systems, Clark Atlanta University, Atlanta, GA, USA. where P is some reflection (symmetric signed permutation) matrix. Like U, the generalized reflexive matrices A arise ...
GitHub

Use diagonalization instead of scipy.expm in the cases where it's faster (matrix dim <~ 1600)

When taking the matrix exponential of an Hermitean matrix M (for example to compute the time evolution operator from the Hamiltonian of a closed system) it is sometimes faster to first diagonalize the ...
IEEE

Stator inductance matrix diagonalization algorithms for different multi-phase winding schemes of round-rotor electric machines part II. Examples and validations

Abstract: The stator winding of multi-phase machines can be designed according to different schemes, which differ by either the number or the spatial arrangement of phases. For control and analysis ...
IEEE

A discrete fractional Hankel transform based on the eigen decomposition of a symmetric kernel matrix of the discrete Hankel transform

Abstract: Recently a discrete Hankel transform (DHT) has been introduced using a symmetric involutory kernel matrix T. Although Namias contributed the fractional Hankel transform (FRHT) in 1980, no ...