Text
Fast Approximation of the p-Radius, Matrix Pressure, or Generalized Lyapunov Exponent for Positive and Dominated Matrices
If A1,…,AN are real d×d matrices, then the p-radius, generalized Lyapunov exponent, or matrix pressure is defined to be the asymptotic exponential growth rate of the sum ∑Ni1,…,in=1∥Ain⋯Ai1∥p, where p is a real parameter. Under its various names this quantity has been investigated for its applications to topics including wavelet regularity and refinement equations, fractal geometry, and the large deviations theory of random matrix products. In this article we present a new algorithm for computing the p-radius under the hypothesis that the matrices are all positive (or more generally under the hypothesis that they satisfy a weaker condition called domination) and of very low dimension. This algorithm is based on interpreting the p-radius as the leading eigenvalue of a trace-class operator on a Hilbert space and estimating that eigenvalue via approximations to the Fredholm determinant of the operator. In this respect our method is closely related to the work of Z.-Q. Bai and M. Pollicott on computing the top Lyapunov exponent of a random matrix product. For pairs of positive matrices of dimension two our method yields substantial improvements over existing methods.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art141532 | null | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain