Back to Results
First PageMeta Content
Parallel computing / Application programming interfaces / Compiler optimizations / Fortran / OpenMP / Automatic parallelization / Message Passing Interface / Intel C++ Compiler / Lis / Computing / Software / Computer programming


Intervals and OpenMP: Towards an Efficient Parallel Result-Verifying Nonlinear Solver? Thomas Beelitz1 , Christian H. Bischof2 , and Bruno Lang1 1 2
Add to Reading List

Document Date: 2007-10-15 03:40:53


Open Document

File Size: 138,96 KB

Share Result on Facebook

City

Wuppertal / Aachen / Dordrecht / New York / /

Company

Cambridge University Press / Intel Corporation / /

Country

Germany / Netherlands / United Kingdom / /

Facility

Class Library / C-XSC library / Aachen University / Germany Aachen University / University of Wuppertal / /

IndustryTerm

chemical processes / active processors / result-verifying algorithms / chemical process / correct then result-verifying algorithms / nonlinear systems / diverse applications / possible solutions / linear systems / result-verifying solution / /

OperatingSystem

Solaris / /

Organization

Cambridge University / University of Wuppertal / Germany Aachen University / Mathematics Department / Institute for Scientific Computing / OpenMP Architecture Review Board / /

Person

Wolff von Gudenberg / /

ProgrammingLanguage

C / C++ / /

ProvinceOrState

New York / /

Technology

active processors / 1 processors / 4 processors / four processors / result-verifying algorithms / 24 processors / few processors / http / shared memory / provably correct then result-verifying algorithms / /

URL

http /

SocialTag