Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξn is equal to O (n—1/2) and the method of critical steepest descent

V. L. GIRKO

doi:10.1515/rose.2002.10.3.253

Home Mathematics Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξn is equal to O (n—1/2) and the method of critical steepest descent

Article

Licensed

Unlicensed Requires Authentication

Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent

Published/Copyright: October 19, 2009

Published by

Become an author with De Gruyter Brill

Author Information Explore this Subject

Random Operators and Stochastic Equations

From the journal Volume 10 Issue 3

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

GIRKO, V. L.. "Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent" Random Operators and Stochastic Equations, vol. 10, no. 3, 2002, pp. 253-300. https://doi.org/10.1515/rose.2002.10.3.253

GIRKO, V. (2002). Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent. Random Operators and Stochastic Equations, 10(3), 253-300. https://doi.org/10.1515/rose.2002.10.3.253

GIRKO, V. (2002) Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent. Random Operators and Stochastic Equations, Vol. 10 (Issue 3), pp. 253-300. https://doi.org/10.1515/rose.2002.10.3.253

GIRKO, V. L.. "Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent" Random Operators and Stochastic Equations 10, no. 3 (2002): 253-300. https://doi.org/10.1515/rose.2002.10.3.253

GIRKO V. Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent. Random Operators and Stochastic Equations. 2002;10(3): 253-300. https://doi.org/10.1515/rose.2002.10.3.253

Copy

Copied to clipboard

BibTeX EndNote RIS

Published Online: 2009-10-19

Published in Print: 2002

Walter de Gruyter

You are currently not able to access this content.

Articles in the same Issue

Asymptotic behavior of M-estimators in continuous-time non-linear regression with long-range dependent errors
Estimation problems for random fields from noisy data
Asymptotic study of measure-valued processes generated by randomly moving particles
Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent

Search journal Search the content of this journal

https://doi.org/10.1515/rose.2002.10.3.253

Articles in the same Issue

Asymptotic behavior of M-estimators in continuous-time non-linear regression with long-range dependent errors
Estimation problems for random fields from noisy data
Asymptotic study of measure-valued processes generated by randomly moving particles
Extended proof of the Statement: Convergence rate of the expected spectral functions of symmetric random matrices Ξ_n is equal to O (n^—1/2) and the method of critical steepest descent