The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We present quasi-Monte Carlo analogs of Monte Carlo methods
for some linear algebra problems: solving systems of linear equations,
computing extreme eigenvalues, and matrix inversion. Reformulating the
problems as solving integral equations with a special kernels and domains
permits us to analyze the quasi-Monte Carlo methods with bounds from
numerical integration. Standard Monte Carlo methods for integration provide
a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo
methods...
Currently displaying 1 –
3 of
3