Related Experiment Video
Updated: Mar 8, 2026

Fabrication and Characterization of Disordered Polymer Optical Fibers for Transverse Anderson Localization of Light
Published on: July 29, 2013
Chebyshev-polynomial expansion of the localization length of Hermitian and non-Hermitian random chains
Naomichi Hatano1, Joshua Feinberg2
1Institute of Industrial Science, University of Tokyo, Komaba, Meguro, Tokyo 153-8505, Japan.
Abstract:
We study Chebyshev-polynomial expansion of the inverse localization length of Hermitian and non-Hermitian random chains as a function of energy. For Hermitian models, the expansion produces this energy-dependent function numerically in one run of the algorithm. This is in strong contrast to the standard transfer-matrix method, which produces the inverse localization length for a fixed energy in each run. For non-Hermitian models, as in the transfer-matrix method, our algorithm computes the inverse localization length for a fixed (complex) energy. We also find a formula of the Chebyshev-polynomial expansion of the density of states of non-Hermitian models. As explained in detail, our algorithm for non-Hermitian models may be the only available efficient algorithm for finding the density of states of models with interactions.
Related Concept Videos
Chebyshev's Theorem to Interpret Standard Deviation
Radical Chain-Growth Polymerization: Chain Branching
Ziegler–Natta Chain-Growth Polymerization: Overview
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
The Chain Rule: Problem Solving
Central Limit Theorem
The sample size, n, that...

