Research and Markets, the largest resource for market research information in world providing essential market research reports, industry research, industry analysis, forecasts, market studies, company profiles and country reports.
Welcome - Register - Login - Help/FAQ - 0 items View Basket
Worlds Largest Market Research Resource - 1516374 Live Reports
Search Research and Markets
  Search
Enter keywords, a title or
a report id number below.





Advanced   
Company search
Register for free email updates of market research
Currency
  Select a currency for use throughout the site



Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure
Hard CopyAdd to Basket
Live Chat Live Help Software for Website

Improving Performance of Sparse Numerical Linear Algebra Computations. Edition No. 1

VDM Publishing House, Dec 2009, Pages: 84


  Description  
   Authors   
    
    
    
     
  Enquire before Buying   
  Send to a Friend   

With new processor families appearing every few years, it is increasingly harder to achieve high performance rates in sparse matrix computations. This monograph studies new methods for sparse matrix factorizations and applies them efficiently while retaining ease of use of existing solutions. The implementations are timed and analyzed using a commonly accepted set of test matrices. Contemporary processors are used for the tests. The new factorization techniques are proven to be quite competitive with state of the art software. In addition, an optimization effort is applied to an iterative algorithm that stands out for its numerical robustness. This also gives satisfactory results on the tested computing platforms in terms of performance improvement. The same set of test matrices is used to enable an easy comparison between both investigated techniques, even though they are customarily treated separately in the literature. Possible extensions of the presented work range from easily conceivable merging with existing solutions to rather more evolved schemes dependent on hard to predict progress in theoretical and algorithmic research.



For enquiries please call us on:
  +353-1-415-1241 (GMT Office Hours)
  1-917-300-0470 (EST Office Hours)

   All rights reserved. © Copyright 2012 Research and Markets
   Terms and conditions Privacy Policy Publishers Employment Opportunities Site Map Link to us Webmaster Affiliate Network


Research and Markets RSS Feeds