Selfverifying solvers for linear systems of equations in C-XSC

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we discuss the implementation of selfverifying solvers for systems of linear equations Ax = b with dense and banded matrices A and the future adaptation these solvers to high performance environments. The algorithms were implemented using C-XSC (a C++ class library for extended scientific computing). We discuss, too, the integration between C-XSC and MPI libraries on cluster computers. The main topics of our research are the development of software tools for Validated Numerics in High Performance Environments using C-XSC and MPI, the optimization of C-XSC and its use on cluster computers and the application these software tools to real life problems [5]. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Hölbig, C. A., Morandi, P. S., Alcalde, B. F. K., & Diverio, T. A. (2004). Selfverifying solvers for linear systems of equations in C-XSC. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 292–297. https://doi.org/10.1007/978-3-540-24669-5_38

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