30
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Computing with locally effective matrices

&
Pages 1177-1189 | Published online: 19 Aug 2006
 

Abstract

In this work, we start from the naive notion of integer infinite matrix (i.e., the functions of the set ℤℕ × ℕ = {f: ℕ × ℕ → ℤ} ). Then, several undecidability results are established, leading to a convenient data structure for effective machine computations. We call this data structure a locally effective matrix. We study when (and how) the standard matrix calculus (Ker and CoKer computations) can be extended to the infinite case. We find again several undecidability barriers. When these limitations are overcome, we describe effective procedures for computing in the locally effective case. Finally, the role played by these data structures in the development of real symbolic computation systems for algebraic topology (based on the effective homology notion) is illustrated.

Acknowledgements

The authors were partially supported by MCyT and FEDER, project TIC2002-01626.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.