Extended averaging and data windowing techniques in phase-stepping measurements: an approach using the characteristic polynomial theory

1998 ◽  
Vol 37 (8) ◽  
pp. 2314 ◽  
Author(s):  
Yves Surrel
Keyword(s):  
Characteristic Polynomial ◽  
Phase Stepping ◽  
Polynomial Theory

Characteristic polynomial theory of two-stage phase shifting algorithms

2012 ◽  
Vol 50 (4) ◽  
pp. 522-528 ◽  
Author(s):  
M. Miranda ◽  
B.V. Dorrío ◽  
J. Blanco ◽  
J. Diz-Bugarín ◽  
F. Ribas
Keyword(s):  
Characteristic Polynomial ◽  
Phase Shifting ◽  
Two Stage ◽  
Polynomial Theory

scholarly journals The normalized distance Laplacian

2021 ◽  
Vol 9 (1) ◽  
pp. 1-18
Author(s):  
Carolyn Reinhart
Keyword(s):  
Spectral Radius ◽  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Diagonal Matrix ◽  
The Matrix

Abstract The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of transmissions of the vertices of the graph. The normalized distance Laplacian, 𝒟𝒧(G) = I−T(G)−1/2 𝒟(G)T(G)−1/2, is introduced. This is analogous to the normalized Laplacian matrix, 𝒧(G) = I − D(G)−1/2 A(G)D(G)−1/2, where D(G) is the diagonal matrix of degrees of the vertices of the graph and A(G) is the adjacency matrix. Bounds on the spectral radius of 𝒟 𝒧 and connections with the normalized Laplacian matrix are presented. Twin vertices are used to determine eigenvalues of the normalized distance Laplacian. The distance generalized characteristic polynomial is defined and its properties established. Finally, 𝒟𝒧-cospectrality and lack thereof are determined for all graphs on 10 and fewer vertices, providing evidence that the normalized distance Laplacian has fewer cospectral pairs than other matrices.

scholarly journals Multiple phases in a generalized Gross-Witten-Wadia matrix model

2020 ◽  
Vol 2020 (9) ◽  
Author(s):  
Jorge G. Russo ◽  
Miguel Tierz
Keyword(s):  
Partition Function ◽  
Matrix Models ◽  
Characteristic Polynomial ◽  
Matrix Model ◽  
Phase Structure ◽  
Unitary Matrix ◽  
Two Dimensional ◽  
Toeplitz Determinants ◽  
Dimensional Parameter ◽  
Planar Limit

Abstract We study a unitary matrix model of the Gross-Witten-Wadia type, extended with the addition of characteristic polynomial insertions. The model interpolates between solvable unitary matrix models and is the unitary counterpart of a deformed Cauchy ensemble. Exact formulas for the partition function and Wilson loops are given in terms of Toeplitz determinants and minors and large N results are obtained by using Szegö theorem with a Fisher-Hartwig singularity. In the large N (planar) limit with two scaled couplings, the theory exhibits a surprisingly intricate phase structure in the two-dimensional parameter space.

Sign in / Sign up

Export Citation Format

Share Document