scholarly journals Analytic subordination theory of operator-valued free additive convolution and the solution of a general random matrix problem

2017 ◽  
Vol 2017 (732) ◽  
pp. 21-53 ◽  
Author(s):  
Serban T. Belinschi ◽  
Tobias Mai ◽  
Roland Speicher

Abstract We develop an analytic theory of operator-valued additive free convolution in terms of subordination functions. In contrast to earlier investigations our functions are not just given by power series expansions, but are defined as Fréchet analytic functions in all of the operator upper half plane. Furthermore, we do not have to assume that our state is tracial. Combining this new analytic theory of operator-valued free convolution with Anderson’s selfadjoint version of the linearization trick we are able to provide a solution to the following general random matrix problem: Let {X_{1}^{(N)},\dots,X_{n}^{(N)}} be selfadjoint {N\times N} random matrices which are, for {N\to\infty} , asymptotically free. Consider a selfadjoint polynomial p in n non-commuting variables and let {P^{(N)}} be the element {P^{(N)}=p(X_{1}^{(N)},\dots,X_{n}^{(N)})} . How can we calculate the asymptotic eigenvalue distribution of {P^{(N)}} out of the asymptotic eigenvalue distributions of {X_{1}^{(N)},\dots,X_{n}^{(N)}} ?

2021 ◽  
Vol 40 (2) ◽  
pp. 59-64
Author(s):  
Jan Verschelde

Hardware double precision is often insufficient to solve large scientific problems accurately. Computing in higher precision defined by software causes significant computational overhead. The application of parallel algorithms compensates for this overhead. Newton's method to develop power series expansions of algebraic space curves is the use case for this application.


1987 ◽  
Vol 24 (2) ◽  
pp. 540-546 ◽  
Author(s):  
J. P. C. Blanc

Numerical data are presented concerning the mean and the standard deviation of the waiting-time distribution for multiserver systems with queues in parallel, in which customers choose one of the shortest queues upon arrival. Moreover, a new numerical method is outlined for calculating state probabilities and moments of queue-length distributions. This method is based on power series expansions and recursion. It is applicable to many systems with more than one waiting line.


Sign in / Sign up

Export Citation Format

Share Document