Home > Publications database > Isoefficiency Analysis of Parallel QMR-Like Iterative Methods and its Implications on Parallel Algorithm Design > print |
001 | 188733 | ||
005 | 20210129215238.0 | ||
024 | 7 | _ | |a 2128/11934 |2 Handle |
037 | _ | _ | |a FZJ-2015-02057 |
100 | 1 | _ | |a Bücker, H. Martin |0 P:(DE-HGF)0 |b 0 |
111 | 2 | _ | |a 14th Workshop on Parallel Processing |c Lessach |d 1995-09-25 - 1995-09-29 |w Austria |
245 | _ | _ | |a Isoefficiency Analysis of Parallel QMR-Like Iterative Methods and its Implications on Parallel Algorithm Design |
260 | _ | _ | |a Clausthal-Zellerfeld |c 1996 |b Institut für Informatik, 1996 |
295 | 1 | 0 | |a Workshop über Parallelverarbeitung, Lessach (Österreich) |
300 | _ | _ | |a 28-49 |
336 | 7 | _ | |a CONFERENCE_PAPER |2 ORCID |
336 | 7 | _ | |a Conference Paper |0 33 |2 EndNote |
336 | 7 | _ | |a INPROCEEDINGS |2 BibTeX |
336 | 7 | _ | |a conferenceObject |2 DRIVER |
336 | 7 | _ | |a Output Types/Conference Paper |2 DataCite |
336 | 7 | _ | |a Contribution to a conference proceedings |b contrib |m contrib |0 PUB:(DE-HGF)8 |s 1426605119_16390 |2 PUB:(DE-HGF) |
336 | 7 | _ | |a Contribution to a book |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |m contb |
490 | 0 | _ | |a Informatik-Bericht |v 96/1 |
520 | _ | _ | |a A specific problem arising out of electrostatics is taken as an example to demonstrate the process of, firstly, transforming a physical problem into a mathematical model and, secondly, its numerical solution by generating a system of linear equations via finite difference approximations. The resulting nonsymmetric sparse linear system is solved by a class of iterative methods that is defined by taking the Quasi-Minimal Residual(QMR) method as a typical member. A performance model called isoefficiency concept is used to analyze the behavior of such methods implemented on parallel distributed memory computers with two-dimensional mesh topology. The isoefficiency concept is employed to compare two different mappings of data to processors as well as to give hints how QMR-like iterative methods should be designed with respect to parallel computing. |
536 | _ | _ | |a 899 - ohne Topic (POF2-899) |0 G:(DE-HGF)POF2-899 |c POF2-899 |x 0 |f POF I |
856 | 4 | _ | |y OpenAccess |u https://juser.fz-juelich.de/record/188733/files/ib-9604.pdf |
856 | 4 | _ | |y OpenAccess |x icon |u https://juser.fz-juelich.de/record/188733/files/ib-9604.gif?subformat=icon |
856 | 4 | _ | |y OpenAccess |x icon-180 |u https://juser.fz-juelich.de/record/188733/files/ib-9604.jpg?subformat=icon-180 |
856 | 4 | _ | |y OpenAccess |x icon-700 |u https://juser.fz-juelich.de/record/188733/files/ib-9604.jpg?subformat=icon-700 |
856 | 4 | _ | |y OpenAccess |x pdfa |u https://juser.fz-juelich.de/record/188733/files/ib-9604.pdf?subformat=pdfa |
909 | C | O | |o oai:juser.fz-juelich.de:188733 |p openaire |p open_access |p driver |p VDB |p dnbdelivery |
913 | 2 | _ | |a DE-HGF |b Forschungsbereich Materie |l Forschungsbereich Materie |1 G:(DE-HGF)POF3-890 |0 G:(DE-HGF)POF3-899 |2 G:(DE-HGF)POF3-800 |v ohne Topic |x 0 |
913 | 1 | _ | |a DE-HGF |b Programmungebundene Forschung |l ohne Programm |1 G:(DE-HGF)POF2-890 |0 G:(DE-HGF)POF2-899 |2 G:(DE-HGF)POF2-800 |v ohne Topic |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF2 |
915 | _ | _ | |a OpenAccess |0 StatID:(DE-HGF)0510 |2 StatID |
920 | _ | _ | |l yes |
920 | 1 | _ | |0 I:(DE-Juel1)VDB62 |k ZAM |l Zentralinstitut für Angewandte Mathematik |x 0 |
920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 1 |
980 | _ | _ | |a contrib |
980 | _ | _ | |a VDB |
980 | _ | _ | |a UNRESTRICTED |
980 | _ | _ | |a contb |
980 | _ | _ | |a I:(DE-Juel1)VDB62 |
980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
980 | 1 | _ | |a FullTexts |
981 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
Library | Collection | CLSMajor | CLSMinor | Language | Author |
---|