Affiliation:
1. Hasselt University, Martelarenlaan, Hasselt, Belgium
2. University of Antwerp, Middelheimlaan, Belgium
Abstract
We investigate the expressive power of MATLANG, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation inv for inverting a matrix. In MATLANG + inv, we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed, we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation eigen for diagonalizing a matrix. It is defined such that for each eigenvalue a set of mutually orthogonal eigenvectors is returned that span the eigenspace of that eigenvalue. We show that inv can be expressed in MATLANG + eigen. We put forward the open question whether there are Boolean queries about matrices, or generic queries about graphs, expressible in MATLANG + eigen but not in MATLANG + inv. Finally, the evaluation problem for MATLANG + eigen is shown to be complete for the complexity class ∃ R.
Publisher
Association for Computing Machinery (ACM)
Reference69 articles.
1. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley.
2. Geometric reasoning with logic and algebra
3. S. Axler. 2015. Linear Algebra Done Right (third ed.). Springer. S. Axler. 2015. Linear Algebra Done Right (third ed.). Springer.
4. S. Basu R. Pollack and M.-F. Roy. 2008. Algorithms in Real Algebraic Geometry (second ed.). Springer. S. Basu R. Pollack and M.-F. Roy. 2008. Algorithms in Real Algebraic Geometry (second ed.). Springer.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献