The approximation characteristic of diagonal matrix in probabilistic setting
From MaRDI portal
Publication:990816
DOI10.1016/J.JCO.2010.04.002zbMATH Open1202.41023OpenAlexW2067125676MaRDI QIDQ990816FDOQ990816
Authors: Pengjuan Nie, Xinjian Luo, Guanggui Chen
Publication date: 1 September 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.04.002
Recommendations
- On the diagonal approximation of full matrices
- Diagonals of matrices stochastically similar to a given matrix
- On diagonals of matrices doubly stochastically similar to a given matrix
- Diagonalization matrix and its application in distribution theory
- An estimator for the diagonal of a matrix
- Approximate Diagonalization
- Approximation characteristics for diagonal operators in different computational settings
- On estimation of the diagonal elements of a sparse precision matrix
- Linear \(n\)-widths of diagonal matrices in the average and probabilistic settings
- Sum-product estimates for diagonal matrices
Cites Work
Cited In (4)
- Linear \(n\)-widths of diagonal matrices in the average and probabilistic settings
- Approximation characteristics for diagonal operators in different computational settings
- Probabilistic and average widths of Sobolev spaces on compact two-point homogeneous spaces equipped with a Gaussian measure
- Probabilistic and average linear widths of weighted Sobolev spaces on the ball equipped with a Gaussian measure
This page was built for publication: The approximation characteristic of diagonal matrix in probabilistic setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990816)