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
Adaptive Computation of Aeroacoustic Sources for Rudimentary Landing Gear
KTH, School of Computer Science and Communication (CSC), Numerical Analysis, NA.
KTH, School of Computer Science and Communication (CSC), Numerical Analysis, NA.ORCID iD: 0000-0002-5020-1631
KTH, School of Computer Science and Communication (CSC), Numerical Analysis, NA.ORCID iD: 0000-0003-4256-0463
2010 (English)In: Benchmark problems for Airframe Noise Computations I, Stockholm 2010, 2010Conference paper, Published paper (Other academic)
Place, publisher, year, edition, pages
2010.
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-30282OAI: oai:DiVA.org:kth-30282DiVA: diva2:399299
Note
QC 20110224Available from: 2011-02-21 Created: 2011-02-21 Last updated: 2011-02-24Bibliographically approved
In thesis
1. High performance adaptive finite element methods for turbulent fluid flow
Open this publication in new window or tab >>High performance adaptive finite element methods for turbulent fluid flow
2011 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Understanding the mechanics of turbulent fluid flow is of key importance for industry and society as for example in aerodynamics and aero-acoustics. The massive computational cost for resolving all turbulent scales in a realistic problem makes direct numerical simulation of the underlying Navier-Stokes equations impossible. Recent advances in adaptive finite element methods offer a new powerful tool in Computational Fluid Dynamics (CFD). The computational cost for simulating turbulent flow can be minimized where the mesh is adaptively resolved, based on a posteriori error control. These adaptive methods have been implemented for efficient serial computations, but the extension to an efficient parallel solver is a challenging task.

This work concerns the development of an adaptive finite element method for modern parallel computer architectures. We present efficient data structures and data decomposition methods for distributed unstructured tetrahedral meshes. Our work also concerns an efficient parallellization of local mesh refinement methods such as recursive longest edge bisection.

We also address the load balance problem with the development of an a priori predictive dynamic load balancing method. Current results are encouraging with almost linear strong scaling to thousands of cores on several modern architectures.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. xii, 29 p.
Series
Trita-CSC-A, ISSN 1653-5723 ; 2011:02
National Category
Computational Mathematics
Identifiers
urn:nbn:se:kth:diva-30277 (URN)978-91-7415-878-6 (ISBN)
Presentation
2011-03-14, E3, KTH, Osquarsbacke 14, Stockholm, 10:15 (English)
Opponent
Supervisors
Note
QC 20110223Available from: 2011-02-23 Created: 2011-02-21 Last updated: 2011-02-23Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Jansson, NiclasHoffman, Johan

Search in DiVA

By author/editor
de Abreu, Rodrigo VilelaJansson, NiclasHoffman, Johan
By organisation
Numerical Analysis, NA
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 164 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