Endre søk
Begrens søket
1 - 8 of 8
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    af Klinteberg, Ludvig
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA. KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Lindbo, Dag
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA. KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    Tornberg, Anna-Karin
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Numerisk analys, NA. KTH, Skolan för teknikvetenskap (SCI), Centra, Linné Flow Center, FLOW.
    An explicit Eulerian method for multiphase flow with contact line dynamics and insoluble surfactant2014Inngår i: Computers & Fluids, ISSN 0045-7930, E-ISSN 1879-0747, Vol. 101, s. 50-63Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The flow behavior of many multiphase flow applications is greatly influenced by wetting properties and the presence of surfactants. We present a numerical method for two-phase flow with insoluble surfactants and contact line dynamics in two dimensions. The method is based on decomposing the interface between two fluids into segments, which are explicitly represented on a local Eulerian grid. It provides a natural framework for treating the surfactant concentration equation, which is solved locally on each segment. An accurate numerical method for the coupled interface/surfactant system is given. The system is coupled to the Navier-Stokes equations through the immersed boundary method, and we discuss the issue of force regularization in wetting problems, when the interface touches the boundary of the domain. We use the method to illustrate how the presence of surfactants influences the behavior of free and wetting drops.

  • 2. Gottschling, Peter
    et al.
    Lindbo, Dag
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Generic compressed sparse matrix insertion: algorithms and implementations in MTL4 and FEniCS2009Inngår i: Proceedings of the 8th workshop on Parallel/High-Performance Object-Oriented Scientific Computing, 2009, s. 2-1Konferansepaper (Fagfellevurdert)
    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.

  • 3.
    Lindbo, Dag
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Spectral Accuracy in Fast Ewald Methods and Topics in Fluid Interface Simulation2011Doktoravhandling, med artikler (Annet vitenskapelig)
    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.

  • 4.
    Lindbo, Dag
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA (stängd 2012-06-30).
    Tornberg, Anna-Karin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA (stängd 2012-06-30).
    Fast and spectrally accurate Ewald summation for 2-periodic electrostatic systems2012Inngår i: Journal of Chemical Physics, ISSN 0021-9606, E-ISSN 1089-7690, Vol. 136, nr 16, s. 164111-1-164111-16Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A new method for Ewald summation in planar/slablike geometry, i.e., systems where periodicity applies in two dimensions and the last dimension is "free" (2P), is presented. We employ a spectral representation in terms of both Fourier series and integrals. This allows us to concisely derive both the 2P Ewald sum and a fast particle mesh Ewald (PME)-type method suitable for large-scale computations. The primary results are: (i) close and illuminating connections between the 2P problem and the standard Ewald sum and associated fast methods for full periodicity; (ii) a fast, O(N log N), and spectrally accurate PME-type method for the 2P k-space Ewald sum that uses vastly less memory than traditional PME methods; (iii) errors that decouple, such that parameter selection is simplified. We give analytical and numerical results to support this.

  • 5.
    Lindbo, Dag
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Tornberg, Anna-Karin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Fast and spectrally accurate summation of 2-periodic Stokes potentialsManuskript (preprint) (Annet vitenskapelig)
    Abstract [en]

    We derive a Ewald decomposition for the Stokeslet in planar periodicity and a novel PME-type O(N log N) method for the fast evaluation of the resulting sums. The decomposition is the natural 2P counterpart to the classical 3P decomposition by Hasimoto, and is given in an explicit form not found in the literature. Truncation error estimates are provided to aid in selecting parameters. The fast, PME-type, method appears to be the first fast method for computing Stokeslet Ewald sums in planar periodicity, and has three attractive properties: it is spectrally accurate; it uses the minimal amount of memory that a gridded Ewald method can use; and provides clarity regarding numerical errors and how to choose parameters. Analytical and numerical results are give to support this. We explore the practicalities of the proposed method, and survey the computational issues involved in applying it to 2-periodic boundary integral Stokes problems.

  • 6.
    Lindbo, Dag
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Tornberg, Anna-Karin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Interface tracking using patches2011Manuskript (preprint) (Annet vitenskapelig)
  • 7.
    Lindbo, Dag
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Tornberg, Anna-Karin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Spectral accuracy in fast Ewald-based methods for particle simulations2011Inngår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 230, nr 24, s. 8744-8761Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A spectrally accurate fast method for electrostatic calculations under periodic boundary conditions is presented. We follow the established framework of FFT-based Ewald summation, but obtain a method with an important decoupling of errors: it is shown, for the proposed method, that the error due to frequency domain truncation can be separated from the approximation error added by the fast method. This has the significance that the truncation of the underlying Ewald sum prescribes the size of the grid used in the FFT-based fast method, which clearly is the minimal grid. Both errors are of exponential-squared order, and the latter can be controlled independently of the grid size. We compare numerically to the established SPME method by Essmann et al. and see that the memory required can be reduced by orders of magnitude. We also benchmark efficiency (i.e. error as a function of computing time) against the SPME method, which indicates that our method is competitive. Analytical error estimates are proven and used to select parameters with a great degree of reliability and ease.

  • 8.
    Lindbo, Dag
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Tornberg, Anna-Karin
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA.
    Spectrally accurate fast summation for periodic Stokes potentials2010Inngår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 229, nr 23, s. 8994-9010Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A spectrally accurate method for the fast evaluation of N-particle sums of the periodic Stokeslet is presented. Two different decomposition methods, leading to one sum in real space and one in reciprocal space, are considered. An FFT based method is applied to the reciprocal part of the sum, invoking the equivalence of multiplications in reciprocal space to convolutions in real space, thus using convolutions with a Gaussian function to place the point sources on a grid. Due to the spectral accuracy of the method, the grid size needed is low and also in practice, for a fixed domain size, independent of N. The leading cost, which is linear in N, arises from the to-grid and from-grid operations. Combining this FFT based method for the reciprocal sum with the direct evaluation of the real space sum, a spectrally accurate algorithm with a total complexity of 0(N log N) is obtained. This has been shown numerically as the system is scaled up at constant density. (C) 2010 Elsevier Inc. All rights reserved.

1 - 8 of 8
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf