arXiv · 0907.3319
Degree Complexity of Matrix Inversion
Abstract
For a q by q matrix x=(x_{i,j}) we let J(x)=(x_{i,j}^{-1}) be the Hadamard inverse, which takes the reciprocal of the elements of x . We let I(x)=(x_{i,j})^{-1} denote the matrix inverse, and we define K=I\circ J to be the birational map obtained from the composition of these two involutions. We consider the iterates K^n=K\circ...\circ K and determine degree complexity of K, which is the exponential rate of degree growth of the degrees of the iterates.
Explore related subjects
Keep this discovery
Eric Bedford, Tuyen Trung Truong. 2009-07-19. Degree Complexity of Matrix Inversion. https://arxiv.org/abs/0907.3319
Cite the original work for its findings. Save a collection to share your selection of sources.