Cart (Loading....) | Create Account
Close category search window
 

Broadband multilevel fast multipole algorithm for locally refined meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jarvenpaa, S. ; Helsinki Univ. of Technol., Helsinki

Multilevel fast multipole algorithm (MLFMA) based on the standard Rokhlin translation function cannot handle effectively cases where the element size is very small compared to the wavelength. Broadband MLFMA allows the creation of additional levels with smaller cubes, and so also these cases can be computed. However, if the element size varies a lot across the model and the childless cubes are all on the same level, either the sparse system matrix or the cube structure can require large amounts of memory. This paper presents an algorithm that modifies broadband MFLMA so that the memory requirements stay reasonable in all cases.

Published in:

Computational Electromagnetics Workshop, 2007

Date of Conference:

30-31 Aug. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.