Dense linear system: A parallel self-verified solver
From MaRDI portal
Publication:941827
DOI10.1007/s10766-007-0058-xzbMath1154.68361OpenAlexW2105663314MaRDI QIDQ941827
Luiz Gustavo Fernandes, Mariana Luderitz Kolberg, Dalcidio Moraes Claudio
Publication date: 2 September 2008
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10766-007-0058-x
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
High performance verified computing using C-XSC, High accuracy and interval arithmetic on multicore processors, An efficient approach to solve very large dense linear systems with verified computing on clusters, Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The accuracy of a parallel \(LU\) decomposition algorithm
- Accurate scientific computations. Symposium, Bad Neuenahr, FRG, March 12- 14, 1985. Proceedings
- LU decomposition optimized for a parallel computer with a hierarchical distributed memory
- Parallel algorithms for \(LU\) decomposition on a shared memory multiprocessor
- Parallel Processing and Applied Mathematics
- Accurate Sum and Dot Product