Approximating the inverse of a balanced symmetric matrix with positive elements
Ting Yan, Xu Jinfeng

TL;DR
This paper introduces an approximation method for the inverse of balanced symmetric matrices with positive elements, providing explicit error bounds and demonstrating the approximation's accuracy improves with larger matrix size.
Contribution
It proposes a novel approximation formula for the inverse of such matrices and derives explicit uniform error bounds, enhancing computational efficiency.
Findings
The approximation is accurate to order 1/(n-1)^2.
Explicit bounds on the approximation error are derived.
The method is effective for large balanced symmetric matrices.
Abstract
For an balanced symmetric matrix with positive elements satisfying and certain bounding conditions, we propose to use the matrix to approximate its inverse, where , is the Kronecker delta function, and . An explicit bound on the approximation error is obtained, showing that the inverse is well approximated to order uniformly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Statistical and numerical algorithms · Advanced Optimization Algorithms Research
