Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Parallel solution of the volume integral equation of electromagnetic scattering
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 1124/1996
Book
Euro-Par'96 Parallel Processing
DOI
10.1007/BFb0024677
Copyright
1996
ISBN
978-3-540-61627-6
Category
Workshop 07 Parallel Numerical Algorithms
DOI
10.1007/BFb0024688
Pages
81-90
Subject Collection
Computer Science
SpringerLink Date
Monday, April 10, 2006
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (555.0 KB)
Free Preview
Workshop 07 Parallel Numerical Algorithms
Parallel solution of the volume integral equation of electromagnetic scattering
Jussi Rahola
1
(1)
Center for Scientific Computing, P.O. Box 405, FIN-02101 Espoo, Finland
Abstract
Dense linear systems arising from volume integral equations can be effectively solved with iterative solvers. In this article we show how these iterative methods can be parallelized. The performance of the serial code is discussed on a vector system and on a RISC processor. The performance depends very much on the memory architecture. The parallel version of the code is written using MPI. We obtain good parallel speedup when the elements of the coefficient matrix are recomputed during each iteration. The speedup is moderate when a special FFT algorithm is used to compute the matrix-vector product.
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.113 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)