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

Adaptive cross approximation for MOM matrix fill for PC problem sizes to 157000 unknowns

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

2 Author(s)

Recent work on sparse MOM codes for PC applications has reduced LU matrix factorization time to significantly less than matrix fill for problem unknowns approaching 200,000. This paper reports on the use and results of applying the recently developed adaptive cross approximation for significantly reducing MOM matrix fill time. Results suggest that when problem sizes approach 500,000 unknowns, matrix fill can be reduced from 100 to 10 hours on a modern PC.

Published in:

Wireless Communications and Applied Computational Electromagnetics, 2005. IEEE/ACES International Conference on

Date of Conference:

3-7 April 2005

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.