Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generic compressed sparse matrix insertion: algorithms and implementations in MTL4 and FEniCS
KTH, School of Computer Science and Communication (CSC), Numerical Analysis, NA.
2009 (English)In: Proceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing, 2009, 2-1 p.Conference paper, Published paper (Refereed)
Abstract [en]

Sparse matrices are indispensable components of most scientific applications. Nevertheless, there is very little general-purpose software support. With the Matrix Template Library 4 (MTL4) we provide a generic library support for dense and compressed sparse matrices. The first challenge in working with compressed matrices is how to set the nonzero entries in an efficient manner. The implementation in MTL4 does not need any pre-allocation or pre-sorting phase, uses a minimal amount of memory and was in all measures as fast or faster than comparable libraries. We demonstrate the performance on well-defined benchmarks.

Place, publisher, year, edition, pages
2009. 2-1 p.
Keyword [en]
FEniCS, generic programming, matrix template library, sparse matrices
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-48762DOI: 10.1145/1595655.1595657Scopus ID: 2-s2.0-70450186197OAI: oai:DiVA.org:kth-48762DiVA: diva2:458559
Note
QC 20111125Available from: 2011-11-23 Created: 2011-11-23 Last updated: 2011-11-25Bibliographically approved
In thesis
1. Spectral Accuracy in Fast Ewald Methods and Topics in Fluid Interface Simulation
Open this publication in new window or tab >>Spectral Accuracy in Fast Ewald Methods and Topics in Fluid Interface Simulation
2011 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

  This work contains two separate but related parts: one on spectrally  accurate and fast Ewald methods for electrostatics and viscous flow,  and one on micro- and complex fluid interface problems.  In Part I we are concerned with fast and spectrally accurate methods  to compute sums of slowly decaying potentials over periodic  lattices. We consider two PDEs: Laplace (electrostatics, the Coulomb  potential) and Stokes (viscous flow, the ``Stokeslet''  potential). Moreover, we consider both full and planar periodicity,  the latter meaning that periodicity applies in two dimensions and  the third is ``free''. These are major simulation tasks in current  molecular dynamics simulations and in many areas of computational  fluid mechanics involving e.g. particle suspensions.   For each of the four combinations of PDE and periodic structure, we  give spectrally accurate and O(N log N) fast methods based on  Ewald's or Ewald-like decompositions of the underlying potential  sums. In the plane-periodic cases we derive the decompositions in a  manner that lets us develop fast methods. Associated error estimates  are developed as needed throughout. All four methods can be placed  in the P3M/PME (Particle Mesh Ewald) family. We argue that they  have certain novel and attractive features: first, they are spectral  accurate; secondly, they use the minimal amount of memory possible  within the PME family; third, each has a clear and reliable view of  numerical errors, such that parameters can be chosen  wisely. Analytical and numerical results are given to support these  propositions. We benchmark accuracy and performance versus an  established (S)PME method.  Part II deals with free boundary problems, specifically numerical  methods for multiphase flow. We give an interface tracking method  based on a domain-decomposition idea that lets us split the  interface into overlapping patches. Each patch is discretized on a  uniform grid, and accurate and efficient numerical methods are given  for the equations that govern interface transport. We demonstrate  that the method is accurate and how it's used in immersed boundary,  and interface, Navier-Stokes methods, as well as in a boundary  integral Stokes setting.  Finally, we consider a problem in complex fluidics where there is a  concentration of surfactants \emph{on} the interface and the  interface itself is in contact with a solid boundary (the contact  line problem). We argue that the domain-decomposition framework is  attractive for formulating and treating complex models  (e.g. involving PDEs on a dynamic interface) and proceed with  developing various aspects of such a method.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. xv, 104 p.
Series
Trita-CSC-A, ISSN 1653-5723 ; 2011:19
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-48805 (URN)978-91-7501-195-0 (ISBN)
Public defence
2011-12-16, Salongen, KTHB, Osquars backe 25, Stockholm, 10:00 (English)
Opponent
Supervisors
Funder
Swedish e‐Science Research Center
Note
QC 20111125Available from: 2011-11-25 Created: 2011-11-23 Last updated: 2012-05-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lindbo, Dag
By organisation
Numerical Analysis, NA
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 92 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf