SlideShare a Scribd company logo
1 of 43
Download to read offline
A non-stiff boundary integral method
for internal waves
NJIT, 4 June 2013
Oleksiy Varfolomiyev
advisor Michael Siegel
Wednesday, June 19, 13
Motivation
Wednesday, June 19, 13
Motivation
Develop a model and a numerical method that can be
efficiently applied to study the motion of internal waves
for doubly periodic interfacial flows with surface tension.
Wednesday, June 19, 13
Outline
Wednesday, June 19, 13
Outline
•Model Description
Wednesday, June 19, 13
Outline
•Model Description
•Linear Stability Analysis
Wednesday, June 19, 13
Outline
•Model Description
•Linear Stability Analysis
•Discretization
Wednesday, June 19, 13
Outline
•Model Description
•Linear Stability Analysis
•Discretization
•Numerical Experiment
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
Evolution of the interface
between two immiscible, inviscid, incompressible, irrotational fluids
of different density in 3D.
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
Motion of the fluids is driven by
Evolution of the interface
between two immiscible, inviscid, incompressible, irrotational fluids
of different density in 3D.
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
➡ Gravity
Motion of the fluids is driven by
Evolution of the interface
between two immiscible, inviscid, incompressible, irrotational fluids
of different density in 3D.
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
➡ Gravity
➡ Surface Tension
Motion of the fluids is driven by
Evolution of the interface
between two immiscible, inviscid, incompressible, irrotational fluids
of different density in 3D.
Wednesday, June 19, 13
⇤! p( ) : p( ) = min
q⇥Pk
max
⇥[ min, max]
1
⌅ q( ) (41)
We used Wolfram Mathematica intrinsic function MiniMaxApproximation to
obtain p( ). The next figure shows the approximation error
10 100 1000 104
10 15
10 14
10 13
10 12
10 11
To obtain grid steps we rewrite obtained approximation of the impedance
function in the form of continued fraction (12). We proceed with Euclidean type
algorithm with 2k polynomial divisions, i.e.
p( ) =
ck 1
k 1 + ck 2
k 2 + · · · + c0
dk
k + dk 1
k 1 + · · · + d0
(42)
=
1
dk
k+dk 1
k 1+···+d0
ck 1
k 1+ck 2
k 2+···+c0
=
1
dk
ck 1
+
✓
dk 1
dkck 2
ck 1
◆
k 1+···+
✓
d1
dkc0
ck 1
◆
+d0
ck 1
k 1+ck 2
k 2+···+c0
,
ˆ d
Model Description
➡ Gravity
➡ Surface Tension
➡ Prescribed far-field pressure gradient
Motion of the fluids is driven by
Evolution of the interface
between two immiscible, inviscid, incompressible, irrotational fluids
of different density in 3D.
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
The interface S is parametrized by
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
The interface S is parametrized by
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
The interface S is parametrized by
The fluid velocities are governed by the Bernoulli’s law
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
@ i
@t
r i · Xt +
1
2
|r i|2
+
pi
⇢i
+ gz = 0 in Di
The interface S is parametrized by
The fluid velocities are governed by the Bernoulli’s law
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
@ i
@t
r i · Xt +
1
2
|r i|2
+
pi
⇢i
+ gz = 0 in Di
The interface S is parametrized by
The evolution equation for the free surface S
The fluid velocities are governed by the Bernoulli’s law
Wednesday, June 19, 13
Governing Equations
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
@ i
@t
r i · Xt +
1
2
|r i|2
+
pi
⇢i
+ gz = 0 in Di
The interface S is parametrized by
The evolution equation for the free surface S
The fluid velocities are governed by the Bernoulli’s law
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Laplace-Young boundary condition
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Laplace-Young boundary condition
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Far-field boundary conditions
Laplace-Young boundary condition
Wednesday, June 19, 13
Boundary Conditions
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Kinematic boundary condition
Far-field boundary conditions
Laplace-Young boundary condition
Wednesday, June 19, 13
Equations to solve
Wednesday, June 19, 13
is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA =
e can obtain Dirichlet data on the left boundary using
t map. Equation (6) gives Aw(x) = d2w(x)
dx2 , therefore
nd now we can use given in (7) Neumann data to get at
w(0) = f(A)⇤,
mpedance function.
2
Wednesday, June 19, 13
Linear Stability Analysis
Wednesday, June 19, 13
Linear Stability Analysis
Wednesday, June 19, 13
Fourier analysis
Wednesday, June 19, 13
Linearized Problem Solution
Remark
4t ⇠ (4x)
3
2
Wednesday, June 19, 13
Linearized Problem Solution
Remark
4t ⇠ (4x)
3
2
Wednesday, June 19, 13
Discretization
Wednesday, June 19, 13
Wednesday, June 19, 13
Numerical Experiment
Wednesday, June 19, 13
Gravity driven flow
(Rayleigh-Taylor Instability)
Surface tension interface
relaxation
−2
0
2
4
6
8
−2
0
2
4
6
8
−0.8
−0.6
−0.4
−0.2
0
0.2
0.4
0.6
0.8
Numerical Solution
Solution z at T=1
(Implicit method, A=1, dt = 0.1, N=32)
−2
0
2
4
6
8
−2
0
2
4
6
8
−0.4
−0.3
−0.2
−0.1
0
0.1
0.2
0.3
Numerical Solution
Solution z at T=5
(Implicit method, A=0.5, dt = 0.1, N=32)
Wednesday, June 19, 13
Numerical Results
Max interface height for lin & num soln.
Explicit method, N=32, A=0.
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.45
0.5
t
max of the lin and num solution zLin and z
lin soln
num soln
Max interface height for lin & num soln.
Explicit method, N=32, A=1.
0 0.5 1 1.5 2 2.5 3 3.5 4
0
0.5
1
1.5
t
max of the lin and num solution zLin and z
lin soln
num soln
Wednesday, June 19, 13
Stability
growing unstable modes
Wednesday, June 19, 13
Stability Chart
Largest	
  stable	
  time	
  step	
  
for	
  the	
  explicit	
  and	
  implicit	
  methods.
4t ⇠ (4x)
3
2
Wednesday, June 19, 13
Conclusions
✦ We have developed a non-stiff boundary integral method for
3D internal waves
✦ The algorithm is effective at eliminating the third order t-step
constraint that plagues explicit methods
✦ Efficient algorithm for calculating the Birkhoff-Rott integral for a
doubly-periodic surface. This algorithm is based on Ewald
summation, computes the integral in O(N log N ) operations
per time step
✦ Presented method is useful for computing the motion of
doubly-periodic fluid interfaces with surface tension in 3D flow
Wednesday, June 19, 13

More Related Content

What's hot

Solving the energy problem of helium final report
Solving the energy problem of helium final reportSolving the energy problem of helium final report
Solving the energy problem of helium final report
JamesMa54
 
A Note on Correlated Topic Models
A Note on Correlated Topic ModelsA Note on Correlated Topic Models
A Note on Correlated Topic Models
Tomonari Masada
 
6161103 10.6 inertia for an area
6161103 10.6 inertia for an area6161103 10.6 inertia for an area
6161103 10.6 inertia for an area
etcenterrbru
 
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
The Statistical and Applied Mathematical Sciences Institute
 

What's hot (20)

Solving the energy problem of helium final report
Solving the energy problem of helium final reportSolving the energy problem of helium final report
Solving the energy problem of helium final report
 
Sol83
Sol83Sol83
Sol83
 
FEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's MethodFEM Introduction: Solving ODE-BVP using the Galerkin's Method
FEM Introduction: Solving ODE-BVP using the Galerkin's Method
 
Generarlized operations on fuzzy graphs
Generarlized operations on fuzzy graphsGenerarlized operations on fuzzy graphs
Generarlized operations on fuzzy graphs
 
Solovay Kitaev theorem
Solovay Kitaev theoremSolovay Kitaev theorem
Solovay Kitaev theorem
 
Distributed Support Vector Machines
Distributed Support Vector MachinesDistributed Support Vector Machines
Distributed Support Vector Machines
 
Divisor de 7
Divisor de 7Divisor de 7
Divisor de 7
 
A Note on Correlated Topic Models
A Note on Correlated Topic ModelsA Note on Correlated Topic Models
A Note on Correlated Topic Models
 
QMC Error SAMSI Tutorial Aug 2017
QMC Error SAMSI Tutorial Aug 2017QMC Error SAMSI Tutorial Aug 2017
QMC Error SAMSI Tutorial Aug 2017
 
IIR filter realization using direct form I & II
IIR filter realization using direct form I & IIIIR filter realization using direct form I & II
IIR filter realization using direct form I & II
 
Image Restoration 2 (Digital Image Processing)
Image Restoration 2 (Digital Image Processing)Image Restoration 2 (Digital Image Processing)
Image Restoration 2 (Digital Image Processing)
 
Computing DFT using Matrix method
Computing DFT using Matrix methodComputing DFT using Matrix method
Computing DFT using Matrix method
 
6161103 10.6 inertia for an area
6161103 10.6 inertia for an area6161103 10.6 inertia for an area
6161103 10.6 inertia for an area
 
Blur Filter - Hanpo
Blur Filter - HanpoBlur Filter - Hanpo
Blur Filter - Hanpo
 
Universal Prediction without assuming either Discrete or Continuous
Universal Prediction without assuming either Discrete or ContinuousUniversal Prediction without assuming either Discrete or Continuous
Universal Prediction without assuming either Discrete or Continuous
 
Gentle intro to SVM
Gentle intro to SVMGentle intro to SVM
Gentle intro to SVM
 
Bresenham's line algorithm
Bresenham's line algorithmBresenham's line algorithm
Bresenham's line algorithm
 
Gaussian Image Blurring in CUDA C++
Gaussian Image Blurring in CUDA C++Gaussian Image Blurring in CUDA C++
Gaussian Image Blurring in CUDA C++
 
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
QMC: Transition Workshop - Applying Quasi-Monte Carlo Methods to a Stochastic...
 
Litvinenko low-rank kriging +FFT poster
Litvinenko low-rank kriging +FFT  posterLitvinenko low-rank kriging +FFT  poster
Litvinenko low-rank kriging +FFT poster
 

Similar to A non-stiff boundary integral method for internal waves

Natural and Clamped Cubic Splines
Natural and Clamped Cubic SplinesNatural and Clamped Cubic Splines
Natural and Clamped Cubic Splines
Mark Brandao
 
Integration techniques
Integration techniquesIntegration techniques
Integration techniques
Krishna Gali
 
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docxDivide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
jacksnathalie
 

Similar to A non-stiff boundary integral method for internal waves (20)

Natural and Clamped Cubic Splines
Natural and Clamped Cubic SplinesNatural and Clamped Cubic Splines
Natural and Clamped Cubic Splines
 
Sloshing-aware MPC for upper stage attitude control
Sloshing-aware MPC for upper stage attitude controlSloshing-aware MPC for upper stage attitude control
Sloshing-aware MPC for upper stage attitude control
 
2007
20072007
2007
 
parameterized complexity for graph Motif
parameterized complexity for graph Motifparameterized complexity for graph Motif
parameterized complexity for graph Motif
 
3.pdf
3.pdf3.pdf
3.pdf
 
Another possibility
Another possibilityAnother possibility
Another possibility
 
Integration techniques
Integration techniquesIntegration techniques
Integration techniques
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Sol83
Sol83Sol83
Sol83
 
Optimal control problem for processes
Optimal control problem for processesOptimal control problem for processes
Optimal control problem for processes
 
MVPA with SpaceNet: sparse structured priors
MVPA with SpaceNet: sparse structured priorsMVPA with SpaceNet: sparse structured priors
MVPA with SpaceNet: sparse structured priors
 
CLIM Fall 2017 Course: Statistics for Climate Research, Spatial Data: Models ...
CLIM Fall 2017 Course: Statistics for Climate Research, Spatial Data: Models ...CLIM Fall 2017 Course: Statistics for Climate Research, Spatial Data: Models ...
CLIM Fall 2017 Course: Statistics for Climate Research, Spatial Data: Models ...
 
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docxDivide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
Divide-and-Conquer & Dynamic ProgrammingDivide-and-Conqu.docx
 
Ma6251 MATHEMATICS III
Ma6251 MATHEMATICS IIIMa6251 MATHEMATICS III
Ma6251 MATHEMATICS III
 
Gate ee 2012 with solutions
Gate ee 2012 with solutionsGate ee 2012 with solutions
Gate ee 2012 with solutions
 
Complex Integral
Complex IntegralComplex Integral
Complex Integral
 
Lecture 5: Stochastic Hydrology
Lecture 5: Stochastic Hydrology Lecture 5: Stochastic Hydrology
Lecture 5: Stochastic Hydrology
 
Mba admission in india
Mba admission in indiaMba admission in india
Mba admission in india
 
Quantum mechanics and the square root of the Brownian motion
Quantum mechanics and the square root of the Brownian motionQuantum mechanics and the square root of the Brownian motion
Quantum mechanics and the square root of the Brownian motion
 
Lecture 3 image sampling and quantization
Lecture 3 image sampling and quantizationLecture 3 image sampling and quantization
Lecture 3 image sampling and quantization
 

More from Alex (Oleksiy) Varfolomiyev

An Efficient Boundary Integral Method for Stiff Fluid Interface Problems
An Efficient Boundary Integral Method for Stiff Fluid Interface ProblemsAn Efficient Boundary Integral Method for Stiff Fluid Interface Problems
An Efficient Boundary Integral Method for Stiff Fluid Interface Problems
Alex (Oleksiy) Varfolomiyev
 
Dynamic Tumor Growth Modelling
Dynamic Tumor Growth ModellingDynamic Tumor Growth Modelling
Dynamic Tumor Growth Modelling
Alex (Oleksiy) Varfolomiyev
 
Phase Field Method
Phase Field MethodPhase Field Method
Phase Field Method
Alex (Oleksiy) Varfolomiyev
 

More from Alex (Oleksiy) Varfolomiyev (6)

An Efficient Boundary Integral Method for Stiff Fluid Interface Problems
An Efficient Boundary Integral Method for Stiff Fluid Interface ProblemsAn Efficient Boundary Integral Method for Stiff Fluid Interface Problems
An Efficient Boundary Integral Method for Stiff Fluid Interface Problems
 
Optimal Finite Difference Grids for Elliptic and Parabolic PDEs with Applicat...
Optimal Finite Difference Grids for Elliptic and Parabolic PDEs with Applicat...Optimal Finite Difference Grids for Elliptic and Parabolic PDEs with Applicat...
Optimal Finite Difference Grids for Elliptic and Parabolic PDEs with Applicat...
 
Neural Networks and Applications
Neural Networks and ApplicationsNeural Networks and Applications
Neural Networks and Applications
 
Dynamic Tumor Growth Modelling
Dynamic Tumor Growth ModellingDynamic Tumor Growth Modelling
Dynamic Tumor Growth Modelling
 
Optimal Finite Difference Grids
Optimal Finite Difference GridsOptimal Finite Difference Grids
Optimal Finite Difference Grids
 
Phase Field Method
Phase Field MethodPhase Field Method
Phase Field Method
 

Recently uploaded

+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
?#DUbAI#??##{{(☎️+971_581248768%)**%*]'#abortion pills for sale in dubai@
 
Porella : features, morphology, anatomy, reproduction etc.
Porella : features, morphology, anatomy, reproduction etc.Porella : features, morphology, anatomy, reproduction etc.
Porella : features, morphology, anatomy, reproduction etc.
Silpa
 
Bacterial Identification and Classifications
Bacterial Identification and ClassificationsBacterial Identification and Classifications
Bacterial Identification and Classifications
Areesha Ahmad
 
Digital Dentistry.Digital Dentistryvv.pptx
Digital Dentistry.Digital Dentistryvv.pptxDigital Dentistry.Digital Dentistryvv.pptx
Digital Dentistry.Digital Dentistryvv.pptx
MohamedFarag457087
 
Human genetics..........................pptx
Human genetics..........................pptxHuman genetics..........................pptx
Human genetics..........................pptx
Silpa
 
biology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGYbiology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGY
1301aanya
 

Recently uploaded (20)

+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
 
Velocity and Acceleration PowerPoint.ppt
Velocity and Acceleration PowerPoint.pptVelocity and Acceleration PowerPoint.ppt
Velocity and Acceleration PowerPoint.ppt
 
Exploring Criminology and Criminal Behaviour.pdf
Exploring Criminology and Criminal Behaviour.pdfExploring Criminology and Criminal Behaviour.pdf
Exploring Criminology and Criminal Behaviour.pdf
 
Pulmonary drug delivery system M.pharm -2nd sem P'ceutics
Pulmonary drug delivery system M.pharm -2nd sem P'ceuticsPulmonary drug delivery system M.pharm -2nd sem P'ceutics
Pulmonary drug delivery system M.pharm -2nd sem P'ceutics
 
Introduction of DNA analysis in Forensic's .pptx
Introduction of DNA analysis in Forensic's .pptxIntroduction of DNA analysis in Forensic's .pptx
Introduction of DNA analysis in Forensic's .pptx
 
Bhiwandi Bhiwandi ❤CALL GIRL 7870993772 ❤CALL GIRLS ESCORT SERVICE In Bhiwan...
Bhiwandi Bhiwandi ❤CALL GIRL 7870993772 ❤CALL GIRLS  ESCORT SERVICE In Bhiwan...Bhiwandi Bhiwandi ❤CALL GIRL 7870993772 ❤CALL GIRLS  ESCORT SERVICE In Bhiwan...
Bhiwandi Bhiwandi ❤CALL GIRL 7870993772 ❤CALL GIRLS ESCORT SERVICE In Bhiwan...
 
300003-World Science Day For Peace And Development.pptx
300003-World Science Day For Peace And Development.pptx300003-World Science Day For Peace And Development.pptx
300003-World Science Day For Peace And Development.pptx
 
Human & Veterinary Respiratory Physilogy_DR.E.Muralinath_Associate Professor....
Human & Veterinary Respiratory Physilogy_DR.E.Muralinath_Associate Professor....Human & Veterinary Respiratory Physilogy_DR.E.Muralinath_Associate Professor....
Human & Veterinary Respiratory Physilogy_DR.E.Muralinath_Associate Professor....
 
Proteomics: types, protein profiling steps etc.
Proteomics: types, protein profiling steps etc.Proteomics: types, protein profiling steps etc.
Proteomics: types, protein profiling steps etc.
 
Porella : features, morphology, anatomy, reproduction etc.
Porella : features, morphology, anatomy, reproduction etc.Porella : features, morphology, anatomy, reproduction etc.
Porella : features, morphology, anatomy, reproduction etc.
 
FAIRSpectra - Enabling the FAIRification of Analytical Science
FAIRSpectra - Enabling the FAIRification of Analytical ScienceFAIRSpectra - Enabling the FAIRification of Analytical Science
FAIRSpectra - Enabling the FAIRification of Analytical Science
 
Bacterial Identification and Classifications
Bacterial Identification and ClassificationsBacterial Identification and Classifications
Bacterial Identification and Classifications
 
Selaginella: features, morphology ,anatomy and reproduction.
Selaginella: features, morphology ,anatomy and reproduction.Selaginella: features, morphology ,anatomy and reproduction.
Selaginella: features, morphology ,anatomy and reproduction.
 
Chemistry 5th semester paper 1st Notes.pdf
Chemistry 5th semester paper 1st Notes.pdfChemistry 5th semester paper 1st Notes.pdf
Chemistry 5th semester paper 1st Notes.pdf
 
Digital Dentistry.Digital Dentistryvv.pptx
Digital Dentistry.Digital Dentistryvv.pptxDigital Dentistry.Digital Dentistryvv.pptx
Digital Dentistry.Digital Dentistryvv.pptx
 
Human genetics..........................pptx
Human genetics..........................pptxHuman genetics..........................pptx
Human genetics..........................pptx
 
Molecular markers- RFLP, RAPD, AFLP, SNP etc.
Molecular markers- RFLP, RAPD, AFLP, SNP etc.Molecular markers- RFLP, RAPD, AFLP, SNP etc.
Molecular markers- RFLP, RAPD, AFLP, SNP etc.
 
biology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGYbiology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGY
 
Locating and isolating a gene, FISH, GISH, Chromosome walking and jumping, te...
Locating and isolating a gene, FISH, GISH, Chromosome walking and jumping, te...Locating and isolating a gene, FISH, GISH, Chromosome walking and jumping, te...
Locating and isolating a gene, FISH, GISH, Chromosome walking and jumping, te...
 
CURRENT SCENARIO OF POULTRY PRODUCTION IN INDIA
CURRENT SCENARIO OF POULTRY PRODUCTION IN INDIACURRENT SCENARIO OF POULTRY PRODUCTION IN INDIA
CURRENT SCENARIO OF POULTRY PRODUCTION IN INDIA
 

A non-stiff boundary integral method for internal waves

  • 1. A non-stiff boundary integral method for internal waves NJIT, 4 June 2013 Oleksiy Varfolomiyev advisor Michael Siegel Wednesday, June 19, 13
  • 3. Motivation Develop a model and a numerical method that can be efficiently applied to study the motion of internal waves for doubly periodic interfacial flows with surface tension. Wednesday, June 19, 13
  • 6. Outline •Model Description •Linear Stability Analysis Wednesday, June 19, 13
  • 7. Outline •Model Description •Linear Stability Analysis •Discretization Wednesday, June 19, 13
  • 8. Outline •Model Description •Linear Stability Analysis •Discretization •Numerical Experiment Wednesday, June 19, 13
  • 9. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description Wednesday, June 19, 13
  • 10. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description Evolution of the interface between two immiscible, inviscid, incompressible, irrotational fluids of different density in 3D. Wednesday, June 19, 13
  • 11. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description Motion of the fluids is driven by Evolution of the interface between two immiscible, inviscid, incompressible, irrotational fluids of different density in 3D. Wednesday, June 19, 13
  • 12. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description ➡ Gravity Motion of the fluids is driven by Evolution of the interface between two immiscible, inviscid, incompressible, irrotational fluids of different density in 3D. Wednesday, June 19, 13
  • 13. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description ➡ Gravity ➡ Surface Tension Motion of the fluids is driven by Evolution of the interface between two immiscible, inviscid, incompressible, irrotational fluids of different density in 3D. Wednesday, June 19, 13
  • 14. ⇤! p( ) : p( ) = min q⇥Pk max ⇥[ min, max] 1 ⌅ q( ) (41) We used Wolfram Mathematica intrinsic function MiniMaxApproximation to obtain p( ). The next figure shows the approximation error 10 100 1000 104 10 15 10 14 10 13 10 12 10 11 To obtain grid steps we rewrite obtained approximation of the impedance function in the form of continued fraction (12). We proceed with Euclidean type algorithm with 2k polynomial divisions, i.e. p( ) = ck 1 k 1 + ck 2 k 2 + · · · + c0 dk k + dk 1 k 1 + · · · + d0 (42) = 1 dk k+dk 1 k 1+···+d0 ck 1 k 1+ck 2 k 2+···+c0 = 1 dk ck 1 + ✓ dk 1 dkck 2 ck 1 ◆ k 1+···+ ✓ d1 dkc0 ck 1 ◆ +d0 ck 1 k 1+ck 2 k 2+···+c0 , ˆ d Model Description ➡ Gravity ➡ Surface Tension ➡ Prescribed far-field pressure gradient Motion of the fluids is driven by Evolution of the interface between two immiscible, inviscid, incompressible, irrotational fluids of different density in 3D. Wednesday, June 19, 13
  • 15. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Wednesday, June 19, 13
  • 16. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 The interface S is parametrized by Wednesday, June 19, 13
  • 17. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 The interface S is parametrized by Wednesday, June 19, 13
  • 18. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 The interface S is parametrized by The fluid velocities are governed by the Bernoulli’s law Wednesday, June 19, 13
  • 19. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 @ i @t r i · Xt + 1 2 |r i|2 + pi ⇢i + gz = 0 in Di The interface S is parametrized by The fluid velocities are governed by the Bernoulli’s law Wednesday, June 19, 13
  • 20. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 @ i @t r i · Xt + 1 2 |r i|2 + pi ⇢i + gz = 0 in Di The interface S is parametrized by The evolution equation for the free surface S The fluid velocities are governed by the Bernoulli’s law Wednesday, June 19, 13
  • 21. Governing Equations is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 @ i @t r i · Xt + 1 2 |r i|2 + pi ⇢i + gz = 0 in Di The interface S is parametrized by The evolution equation for the free surface S The fluid velocities are governed by the Bernoulli’s law Wednesday, June 19, 13
  • 22. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Wednesday, June 19, 13
  • 23. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Wednesday, June 19, 13
  • 24. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Wednesday, June 19, 13
  • 25. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Laplace-Young boundary condition Wednesday, June 19, 13
  • 26. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Laplace-Young boundary condition Wednesday, June 19, 13
  • 27. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Far-field boundary conditions Laplace-Young boundary condition Wednesday, June 19, 13
  • 28. Boundary Conditions is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Kinematic boundary condition Far-field boundary conditions Laplace-Young boundary condition Wednesday, June 19, 13
  • 30. is defined on span{sin (⇥y), . . . , sin (m⇥y)}, spA = e can obtain Dirichlet data on the left boundary using t map. Equation (6) gives Aw(x) = d2w(x) dx2 , therefore nd now we can use given in (7) Neumann data to get at w(0) = f(A)⇤, mpedance function. 2 Wednesday, June 19, 13
  • 34. Linearized Problem Solution Remark 4t ⇠ (4x) 3 2 Wednesday, June 19, 13
  • 35. Linearized Problem Solution Remark 4t ⇠ (4x) 3 2 Wednesday, June 19, 13
  • 39. Gravity driven flow (Rayleigh-Taylor Instability) Surface tension interface relaxation −2 0 2 4 6 8 −2 0 2 4 6 8 −0.8 −0.6 −0.4 −0.2 0 0.2 0.4 0.6 0.8 Numerical Solution Solution z at T=1 (Implicit method, A=1, dt = 0.1, N=32) −2 0 2 4 6 8 −2 0 2 4 6 8 −0.4 −0.3 −0.2 −0.1 0 0.1 0.2 0.3 Numerical Solution Solution z at T=5 (Implicit method, A=0.5, dt = 0.1, N=32) Wednesday, June 19, 13
  • 40. Numerical Results Max interface height for lin & num soln. Explicit method, N=32, A=0. 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 0 0.05 0.1 0.15 0.2 0.25 0.3 0.35 0.4 0.45 0.5 t max of the lin and num solution zLin and z lin soln num soln Max interface height for lin & num soln. Explicit method, N=32, A=1. 0 0.5 1 1.5 2 2.5 3 3.5 4 0 0.5 1 1.5 t max of the lin and num solution zLin and z lin soln num soln Wednesday, June 19, 13
  • 42. Stability Chart Largest  stable  time  step   for  the  explicit  and  implicit  methods. 4t ⇠ (4x) 3 2 Wednesday, June 19, 13
  • 43. Conclusions ✦ We have developed a non-stiff boundary integral method for 3D internal waves ✦ The algorithm is effective at eliminating the third order t-step constraint that plagues explicit methods ✦ Efficient algorithm for calculating the Birkhoff-Rott integral for a doubly-periodic surface. This algorithm is based on Ewald summation, computes the integral in O(N log N ) operations per time step ✦ Presented method is useful for computing the motion of doubly-periodic fluid interfaces with surface tension in 3D flow Wednesday, June 19, 13