Skip to main content
Conference Proceedings

Block and partitioned neville elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1557 575-576
DOI: 10.1007/3-540-49164-3_57
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we analyze block and partitioned Neville elimination, necessary steps in order to adapt Neville elimination to many high performance computer architectures.

Cite

CITATION STYLE

APA

Alonso, P., & Peña, J. M. (1999). Block and partitioned neville elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 575–576). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free