pith. sign in

arxiv: 2309.00979 · v2 · submitted 2023-09-02 · 🧮 math.NA · cs.NA· physics.comp-ph

ADI schemes for heat equations with irregular boundaries and interfaces in 3D with applications

Pith reviewed 2026-05-24 06:51 UTC · model grok-4.3

classification 🧮 math.NA cs.NAphysics.comp-ph
keywords ADI schemesheat equationirregular boundarieskernel-free boundary integralStefan problemlevel set methodunconditional stabilitysecond-order accuracy
0
0 comments X

The pith

KFBI-ADI schemes achieve second-order accuracy and unconditional stability for 3D heat equations with irregular boundaries.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs modified alternating direction implicit schemes for three-dimensional heat equations on domains with irregular boundaries and interfaces by adapting the Douglas-Gunn ADI method to retain accuracy under time-dependent boundary conditions. It then embeds a one-dimensional kernel-free boundary integral discretization into the ADI sub-steps so that Cartesian grids can be used and the coefficient matrices remain tridiagonal. Fourier analysis establishes unconditional stability of the modified ADI scheme, while numerical tests confirm second-order accuracy for both the heat equation and a reaction-diffusion equation; the same framework is applied to the Stefan problem by coupling with a level-set representation of the moving interface. A sympathetic reader would care because the combination yields reliable, efficient solvers that avoid body-fitted meshes for physically relevant three-dimensional problems such as dendritic solidification.

Core claim

The authors start from the Douglas-Gunn ADI scheme, modify it to handle time-dependent boundaries without accuracy loss, combine it with a 1D kernel-free boundary integral method that preserves tridiagonal structure for the fast Thomas algorithm, prove unconditional stability by Fourier analysis, and verify second-order accuracy through numerical tests on heat and reaction-diffusion equations; they further incorporate a level-set method to treat the Stefan problem and present simulations of three-dimensional dendritic solidification.

What carries the argument

Modified Douglas-Gunn ADI scheme integrated with 1D kernel-free boundary integral discretization that preserves the tridiagonal structure of the coefficient matrix.

If this is right

  • The modified ADI scheme retains second-order accuracy for time-dependent boundary conditions.
  • Fourier analysis establishes unconditional stability of the modified ADI scheme.
  • Numerical tests demonstrate second-order accuracy and unconditional stability for both heat and reaction-diffusion equations.
  • Level-set coupling extends the method to free-boundary Stefan problems and produces simulations of three-dimensional dendritic solidification.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The Cartesian-grid efficiency may allow the same framework to treat other linear or semilinear parabolic equations on complex three-dimensional domains.
  • Preservation of the tridiagonal structure suggests the approach could be combined with existing fast ADI solvers for even larger-scale computations.
  • The level-set treatment of moving interfaces indicates possible extension to related moving-boundary problems such as crystal growth or multiphase flows.

Load-bearing premise

The 1D KFBI discretization preserves the tridiagonal structure of the coefficient matrix so that the fast Thomas algorithm can be applied directly.

What would settle it

A convergence study on a three-dimensional heat equation with a fixed irregular boundary in which the observed spatial order drops below two or in which instability appears for time steps larger than those allowed by explicit methods.

Figures

Figures reproduced from arXiv: 2309.00979 by Han Zhou, Minsheng Huang, Wenjun Ying.

Figure 1
Figure 1. Figure 1: Numerical errors are estimated on grid nodes Ωh at the final computational time t = T in both the L2 and L∞ norms, which are defined as ∥e h ∥L2 = s 1 NΩh X x∈Ωh |u h (x, T) − u(x, T)| 2 , ∥e h ∥L∞ = max x∈Ωh |u h (x, T) − u(x, T)|, (53) where NΩh is the number of grid nodes in Ωh , u h and u are the numerical and exact solution, respectively. The convergence order is computed by order = log(||e 2h ||/||e … view at source ↗
Figure 1
Figure 1. Figure 1: Irregular domains: (a) an ellipsoid; (b) a torus; (c) a four-atom molecular; (d) a banana. [PITH_FULL_IMAGE:figures/full_fig_p014_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Temporal convergence of the two KFBI-ADI schemes for the heat equation on the ellipsoid-shaped domain [PITH_FULL_IMAGE:figures/full_fig_p016_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Wall times of the KFBI-ADI method with di [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Numerical solution to the reaction-diffusion equation on a four-atom molecular-shaped domain. 18 [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Numerical solution to the reaction-diffusion equation on a banana-shaped domain. B = [−2, 2]3 is used for computations. Time steps are computed by using the CFL number as 0.5 for the level set equation. The computation is terminated when the free boundary reaches the box boundary. Initially, a spherical solid seed with zero temperature is placed at the origin such that it is surrounded by undercooled liqui… view at source ↗
Figure 6
Figure 6. Figure 6: Time evolution of the free boundary with ¯ε [PITH_FULL_IMAGE:figures/full_fig_p020_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Front view of the free boundary (left) and slices of the temperature field(right). [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Morphologies of the free boundary using di [PITH_FULL_IMAGE:figures/full_fig_p020_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Time evolution of the free boundary with ¯ϵ [PITH_FULL_IMAGE:figures/full_fig_p021_9.png] view at source ↗
read the original abstract

In this paper, efficient alternating direction implicit (ADI) schemes are proposed to solve three-dimensional heat equations with irregular boundaries and interfaces. Starting from the well-known Douglas-Gunn ADI scheme, a modified ADI scheme is constructed to mitigate the issue of accuracy loss in solving problems with time-dependent boundary conditions. The unconditional stability of the new ADI scheme is also rigorously proven with the Fourier analysis. Then, by combining the ADI schemes with a 1D kernel-free boundary integral (KFBI) method, KFBI-ADI schemes are developed to solve the heat equation with irregular boundaries. In 1D sub-problems of the KFBI-ADI schemes, the KFBI discretization takes advantage of the Cartesian grid and preserves the structure of the coefficient matrix so that the fast Thomas algorithm can be applied to solve the linear system efficiently. Second-order accuracy and unconditional stability of the KFBI-ADI schemes are verified through several numerical tests for both the heat equation and a reaction-diffusion equation. For the Stefan problem, which is a free boundary problem of the heat equation, a level set method is incorporated into the ADI method to capture the time-dependent interface. Numerical examples for simulating 3D dendritic solidification phenomenons are also presented.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes modified Douglas-Gunn ADI schemes for 3D heat equations with time-dependent boundary conditions, proves their unconditional stability via Fourier analysis, and combines them with a 1D kernel-free boundary integral (KFBI) method to handle irregular boundaries and interfaces while preserving the tridiagonal structure of the coefficient matrix for direct application of the Thomas algorithm. Second-order accuracy is verified numerically for the heat equation and a reaction-diffusion equation; the approach is extended to Stefan problems via level-set interface tracking, with examples of 3D dendritic solidification.

Significance. If the KFBI-ADI construction maintains both the claimed stability/accuracy and the tridiagonal matrix structure on irregular domains, the work would supply an efficient, unconditionally stable second-order method for parabolic problems in complex 3D geometries. The Fourier stability analysis and the extension to free-boundary Stefan problems with level sets are concrete strengths that would be of interest to the numerical PDE community.

major comments (2)
  1. [Abstract / KFBI-ADI scheme description] Abstract and KFBI-ADI construction: the efficiency claim rests on the assertion that 'the KFBI discretization ... preserves the structure of the coefficient matrix so that the fast Thomas algorithm can be applied.' For irregular boundaries the kernel-free corrections are built from Cartesian data; without an explicit demonstration (e.g., a stencil diagram or matrix pattern in the 1D sub-problem section) that these corrections introduce no off-tridiagonal fill-in, the fast-solver argument remains unverified and load-bearing for the central contribution.
  2. [Stability analysis] Stability section: the unconditional stability proof via Fourier analysis is stated for the modified ADI scheme, yet the subsequent KFBI-ADI combination introduces boundary corrections whose effect on the Fourier symbol is not addressed; a short remark confirming that the corrections do not alter the stability conclusion would strengthen the claim.
minor comments (2)
  1. [Numerical experiments] Numerical results: the abstract states that second-order accuracy is verified through 'several numerical tests,' but the reader notes the absence of explicit error tables or grid-size data in the summary; including a concise table of L2 or max-norm errors versus h and Δt in the results section would make the verification more transparent.
  2. [Introduction / Scheme derivation] Notation: the distinction between the original Douglas-Gunn scheme and the 'modified ADI scheme' introduced to handle time-dependent boundaries should be clarified with a side-by-side equation comparison early in the paper.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive evaluation of the significance of our work and for the constructive major comments. We address each point below and will revise the manuscript to incorporate the suggested clarifications.

read point-by-point responses
  1. Referee: [Abstract / KFBI-ADI scheme description] Abstract and KFBI-ADI construction: the efficiency claim rests on the assertion that 'the KFBI discretization ... preserves the structure of the coefficient matrix so that the fast Thomas algorithm can be applied.' For irregular boundaries the kernel-free corrections are built from Cartesian data; without an explicit demonstration (e.g., a stencil diagram or matrix pattern in the 1D sub-problem section) that these corrections introduce no off-tridiagonal fill-in, the fast-solver argument remains unverified and load-bearing for the central contribution.

    Authors: We agree that an explicit demonstration would strengthen the central efficiency claim. In the revised manuscript we will add, in the section describing the 1D sub-problems of the KFBI-ADI scheme, both a stencil diagram for a representative irregular-boundary point and the explicit matrix pattern showing that the kernel-free corrections modify only the right-hand side (or a small number of local diagonal entries) without introducing off-tridiagonal fill-in, thereby preserving the tridiagonal structure required by the Thomas algorithm. revision: yes

  2. Referee: [Stability analysis] Stability section: the unconditional stability proof via Fourier analysis is stated for the modified ADI scheme, yet the subsequent KFBI-ADI combination introduces boundary corrections whose effect on the Fourier symbol is not addressed; a short remark confirming that the corrections do not alter the stability conclusion would strengthen the claim.

    Authors: We acknowledge that the Fourier stability analysis applies to the interior modified ADI scheme. The KFBI corrections are strictly local to the irregular boundaries and interfaces. In the revision we will insert a short remark in the stability section stating that these localized corrections do not modify the Fourier symbol of the interior scheme and that the unconditional stability of the full KFBI-ADI method is supported by the numerical experiments reported in the paper. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent Fourier proof and stated discretization properties

full rationale

The paper begins from the established Douglas-Gunn ADI scheme, constructs a modification for time-dependent boundaries, and proves unconditional stability via Fourier analysis (an external mathematical technique). The KFBI-ADI extension asserts that the 1D discretization on Cartesian grids preserves tridiagonal structure for the Thomas algorithm, presented as an intrinsic feature of the kernel-free approach rather than a fitted parameter or self-referential definition. No equation or claim reduces by construction to its own inputs, and no load-bearing step collapses to a self-citation chain. Numerical verification is separate from the derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard numerical-analysis assumptions about Fourier stability analysis and the preservation of matrix structure by the KFBI discretization; no free parameters or new entities are introduced in the abstract.

axioms (2)
  • domain assumption Fourier analysis rigorously establishes unconditional stability of the modified ADI scheme.
    Stated directly in the abstract as the basis for the stability claim.
  • domain assumption The 1D KFBI discretization on Cartesian grids preserves the tridiagonal matrix structure required by the Thomas algorithm.
    Invoked to justify computational efficiency of the sub-problems.

pith-pipeline@v0.9.0 · 5758 in / 1307 out tokens · 22221 ms · 2026-05-24T06:51:47.198682+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

52 extracted references · 52 canonical work pages

  1. [1]

    N. Yanenko, On the convergence of the splitting method for the heat conductivity equation with variable co- efficients, USSR Computational Mathematics and Mathematical Physics 2 (1963) 1094–1100. doi:10.1016/ 0041-5553(63)90516-0 . URL https://linkinghub.elsevier.com/retrieve/pii/0041555363905160

  2. [2]

    Gibou, R

    F. Gibou, R. Fedkiw, A fourth order accurate discretization for the laplace and heat equations on arbitrary domains, with applications to the stefan problem, Journal of Computational Physics 202 (2005) 577–601. doi:10.1016/ j.jcp.2004.07.018. URL https://linkinghub.elsevier.com/retrieve/pii/S0021999104002980

  3. [3]

    S. K. Pandit, A. Chattopadhyay, H. F. Oztop, A fourth order compact scheme for heat trans- fer problem in porous media, Computers & Mathematics with Applications 71 (2016) 805–832. doi:10.1016/j.camwa.2015.12.037. URL http://dx.doi.org/10.1016/j.camwa.2015.12.037https://linkinghub.elsevier.com/ retrieve/pii/S0898122115006057

  4. [4]

    Chen, Generation and propagation of interfaces for reaction-di ffusion equations, Journal of Di fferential Equa- tions 96 (1) (1992) 116–141

    X. Chen, Generation and propagation of interfaces for reaction-di ffusion equations, Journal of Di fferential Equa- tions 96 (1992) 116–141. doi:10.1016/0022-0396(92)90146-E

  5. [5]

    R. I. Fernandes, G. Fairweather, An adi extrapolated crank-nicolson orthogonal spline collocation method for nonlinear reaction–diffusion systems, Journal of Computational Physics 231 (2012) 6248–6267. doi:10.1016/ j.jcp.2012.04.001. URL https://linkinghub.elsevier.com/retrieve/pii/S0021999112001726

  6. [6]

    Asante-Asamani, A

    E. Asante-Asamani, A. Kleefeld, B. Wade, A second-order exponential time di fferencing scheme for non-linear reaction-diffusion systems with dimensional splitting, Journal of Computational Physics 415 (2020) 109490. doi: 10.1016/j.jcp.2020.109490. URL https://linkinghub.elsevier.com/retrieve/pii/S0021999120302643

  7. [7]

    B. S. Zhilin Li, Fast and accurate numerical approaches for stefan problems and crystal growth, Numerical Heat Transfer, Part B: Fundamentals 35 (1999) 461–484. doi:10.1080/104077999275848. URL http://www.tandfonline.com/doi/abs/10.1080/104077999275848

  8. [8]

    R. H. Nochetto, M. Paolini, C. Verdi, An adaptive finite element method for two-phase stefan problems in two space dimensions. i. stability and error estimates, Mathematics of Computation 57 (1991) 73. doi:10.1090/ S0025-5718-1991-1079028-X . URL http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1991-1079028-X

  9. [9]

    R. H. Nochetto, M. Paolini, C. Verdi, An adaptive finite element method for two-phase stefan problems in two space dimensions. ii: Implementation and numerical experiments, SIAM Journal on Scientific and Statistical Computing 12 (1991) 1207–1244. doi:10.1137/0912065. URL http://epubs.siam.org/doi/10.1137/0912065

  10. [10]

    J. Jim Douglas, On the numerical integration of { ∂ 2 u}{∂x2} + { ∂ 2 u}{∂y2} = { ∂ u}{∂t} by implicit methods, Journal of the Society for Industrial and Applied Mathematics 3 (1955) 42–65. doi:10.1137/0103004. URL http://epubs.siam.org/doi/10.1137/0103004

  11. [11]

    D. W. Peaceman, J. H. H. Rachford, The numerical solution of parabolic and elliptic differential equations, Journal of the Society for Industrial and Applied Mathematics 3 (1955) 28–41. doi:10.1137/0103003. URL http://epubs.siam.org/doi/10.1137/0103003

  12. [12]

    Douglas, J

    J. Douglas, J. E. Gunn, A general formulation of alternating direction methods, Numerische Mathematik 6 (1964) 428–453. doi:10.1007/BF01386093. URL http://link.springer.com/10.1007/BF01386093

  13. [13]

    S. Kim, H. Lim, High-order schemes for acoustic waveform simulation, Applied Numerical Mathematics 57 (2007) 402–414. doi:10.1016/j.apnum.2006.05.003. URL https://linkinghub.elsevier.com/retrieve/pii/S0168927406001012

  14. [14]

    X. Zhao, Z. zhong Sun, Z. peng Hao, A fourth-order compact adi scheme for two-dimensional nonlinear space fractional schr¨odinger equation, SIAM Journal on Scientific Computing 36 (2014) A2865–A2886.doi:10.1137/ 140961560. URL https://doi.org/10.1137/140961560

  15. [15]

    C. S. Peskin, Numerical analysis of blood flow in the heart, Journal of Computational Physics 25 (1977) 220–252. doi:10.1016/0021-9991(77)90100-0 . URL https://linkinghub.elsevier.com/retrieve/pii/0021999177901000

  16. [16]

    C. S. Peskin, The immersed boundary method, Acta Numerica 11 (2002) 479–517. doi:10.1017/ S0962492902000077

  17. [18]

    R. J. Leveque, Z. Li, Immersed interface method for elliptic equations with discontinuous coe fficients and singular sources, SIAM Journal on Numerical Analysis 31 (1994) 1019–1044. doi:10.1137/0731054. URL https://doi.org/10.1137/0731054

  18. [20]

    Y . C. Zhou, S. Zhao, M. Feig, G. W. Wei, High order matched interface and boundary method for elliptic equations with discontinuous coe fficients and singular sources, Journal of Computational Physics 213 (2006) 1–30. doi: 10.1016/j.jcp.2005.07.022. URL https://www.sciencedirect.com/science/article/pii/S0021999105003578

  19. [21]

    Z. Li, A. Mayo, ADI methods for heat equations with discontinuities along an arbitrary interface, Providence, RI: American Mathematical Society, 1994, pp. 311–315

  20. [22]

    Z. Li, K. Ito, The Immersed Interface Method, Society for Industrial and Applied Mathematics, 2006. doi: 10.1137/1.9780898717464. URL http://epubs.siam.org/doi/book/10.1137/1.9780898717464

  21. [23]

    J. Liu, Z. Zheng, A dimension by dimension splitting immersed interface method for heat conduction equation with interfaces, Journal of Computational and Applied Mathematics 261 (2014) 221–231. doi:10.1016/j.cam. 2013.10.051

  22. [24]

    Z. Li, X. Chen, Z. Zhang, On multiscale ADI methods for parabolic PDEs with a discontinuous coe fficient, Multi- scale Modeling and Simulation 16 (2018) 1623–1647. doi:10.1137/17M1151985

  23. [25]

    Zhao, A Matched Alternating Direction Implicit (ADI) Method for Solving the Heat Equation with Interfaces, Journal of Scientific Computing 63 (2015) 118–137

    S. Zhao, A Matched Alternating Direction Implicit (ADI) Method for Solving the Heat Equation with Interfaces, Journal of Scientific Computing 63 (2015) 118–137. doi:10.1007/s10915-014-9887-0

  24. [26]

    Z. Wei, C. Li, S. Zhao, A spatially second order alternating direction implicit (ADI) method for solving three dimensional parabolic interface problems, Computers & Mathematics with Applications 75 (2018) 2173–2192. doi:10.1016/j.camwa.2017.06.037. URL https://linkinghub.elsevier.com/retrieve/pii/S0898122117303851

  25. [27]

    C. Li, G. Long, Y . Li, S. Zhao, Alternating direction implicit (ADI) methods for solving two-dimensional parabolic interface problems with variable coefficients, Computation 9 (2021). doi:10.3390/computation9070079

  26. [28]

    C. Li, Z. Wei, G. Long, C. Campbell, S. Ashlyn, S. Zhao, Alternating direction ghost-fluid methods for solving the heat equation with interfaces, Computers and Mathematics with Applications 80 (2020) 714–732. doi:10.1016/ j.camwa.2020.04.027

  27. [29]

    S. Deng, Z. Li, K. Pan, An ADI-Yee’s scheme for Maxwell’s equations with discontinuous coefficients, Journal of Computational Physics 438 (2021) 110356. doi:10.1016/j.jcp.2021.110356. URL https://doi.org/10.1016/j.jcp.2021.110356

  28. [30]

    J. Liu, Z. Zheng, IIM-based ADI finite di fference scheme for nonlinear convection-diffusion equations with inter- faces, Applied Mathematical Modelling 37 (2013) 1196–1207. doi:10.1016/j.apm.2012.03.047. URL http://dx.doi.org/10.1016/j.apm.2012.03.047

  29. [31]

    W. Geng, S. Zhao, Fully implicit ADI schemes for solving the nonlinear Poisson-Boltzmann equation, Computa- tional and Mathematical Biophysics 1 (2013) 109–123. doi:10.2478/mlbmb-2013-0006

  30. [32]

    H. Zhou, W. Ying, A dimension splitting method for time dependent pdes on irregular domains, Journal of Scientific Computing 94 (1 2023). doi:10.1007/s10915-022-02066-5

  31. [33]

    W. Ying, C. S. Henriquez, A kernel-free boundary integral method for elliptic boundary value problems, Journal of Computational Physics 227 (2007) 1046–1074. doi:10.1016/j.jcp.2007.08.021

  32. [34]

    W. Ying, W. C. Wang, A kernel-free boundary integral method for implicitly defined surfaces, Journal of Compu- tational Physics 252 (2013) 606–624. doi:10.1016/j.jcp.2013.06.019. URL http://dx.doi.org/10.1016/j.jcp.2013.06.019

  33. [35]

    Y . Xie, W. Ying, A fourth-order kernel-free boundary integral method for implicitly defined surfaces in three space dimensions, Journal of Computational Physics 415 (2020) 109526. doi:10.1016/j.jcp.2020.109526. URL https://doi.org/10.1016/j.jcp.2020.109526

  34. [36]

    W. Ying, W. C. Wang, A kernel-free boundary integral method for variable coe fficients elliptic pdes, Communica- tions in Computational Physics 15 (2014) 1108–1140. doi:10.4208/cicp.170313.071113s

  35. [37]

    Y . Xie, W. Ying, A high-order kernel-free boundary integral method for incompressible flow equations in two space dimensions, Numerical Mathematics 13 (2020) 595–619. doi:10.4208/NMTMA.OA-2019-0175

  36. [38]

    Y . Xie, Z. Huang, W. Ying, A cartesian grid based tailored finite point method for reaction-di ffusion equation on complex domains, Computers and Mathematics with Applications 97 (2021) 298–313. doi:10.1016/j.camwa. 2021.05.020. URL https://www.sciencedirect.com/science/article/pii/S0898122121002005 25

  37. [39]

    Douglas, J

    J. Douglas, J. E. Gunn, Alternating direction methods for parabolic systems in ¡i¿m¡ /i¿ space variables, Journal of the ACM 9 (1962) 450–456. doi:10.1145/321138.321142. URL https://dl.acm.org/doi/10.1145/321138.321142

  38. [40]

    J. A. Sethian, Curvature and the evolution of fronts, Communications in Mathematical Physics 101 (4) (1985) 487–

  39. [41]

    URL https://doi.org/10.1007/BF01210742http://link.springer.com/10.1007/BF01210742

    doi:10.1007/BF01210742. URL https://doi.org/10.1007/BF01210742http://link.springer.com/10.1007/BF01210742

  40. [42]

    Osher, J

    S. Osher, J. A. Sethian, Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations, Journal of Computational Physics 79 (1) (1988) 12–49. doi:10.1016/0021-9991(88)90002-2 . URL https://www.sciencedirect.com/science/article/pii/0021999188900022https: //linkinghub.elsevier.com/retrieve/pii/0021999188900022

  41. [43]

    Schmidt, Computation of Three Dimensional Dendrites with Finite Elements, Journal of Computational Physics 125 (2) (1996) 293–312

    A. Schmidt, Computation of three dimensional dendrites with finite elements, Journal of Computational Physics 125 (1996) 293–312. doi:10.1006/jcph.1996.0095. URL https://linkinghub.elsevier.com/retrieve/pii/S0021999196900959

  42. [44]

    S. Chen, B. Merriman, S. Osher, P. Smereka, A simple level set method for solving stefan problems, Journal of Computational Physics 135 (1997) 8–29. doi:10.1006/jcph.1997.5721. URL https://linkinghub.elsevier.com/retrieve/pii/S0021999197957211

  43. [45]

    Hundsdorfer, J

    W. Hundsdorfer, J. Verwer, Numerical Solution of Time-Dependent Advection-Di ffusion-Reaction Equations, V ol. 33, Springer Berlin Heidelberg, 2003.doi:10.1007/978-3-662-09017-6 . URL http://link.springer.com/10.1007/978-3-662-09017-6

  44. [46]

    Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, 2003

    Y . Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, 2003. doi:10.1137/1.9780898718003. URL http://epubs.siam.org/doi/book/10.1137/1.9780898718003

  45. [47]

    Mayo, The Fast Solution of Poisson’s and the Biharmonic Equations on Irregular Regions, SIAM Journal on Numerical Analysis 21 (2) (1984) 285–299

    A. Mayo, The Fast Solution of Poisson’s and the Biharmonic Equations on Irregular Regions, SIAM Journal on Numerical Analysis 21 (2) (1984) 285–299. doi:10.1137/0721021. URL https://doi.org/10.1137/0721021http://epubs.siam.org/doi/10.1137/0721021

  46. [48]

    Mayo, Fast High Order Accurate Solution of Laplace’s Equation on Irregular Regions, SIAM Journal on Scien- tific and Statistical Computing 6 (1) (1985) 144–157

    A. Mayo, Fast High Order Accurate Solution of Laplace’s Equation on Irregular Regions, SIAM Journal on Scien- tific and Statistical Computing 6 (1) (1985) 144–157. doi:10.1137/0906012. URL https://doi.org/10.1137/0906012http://epubs.siam.org/doi/10.1137/0906012

  47. [49]

    Mayo, The rapid evaluation of volume integrals of potential theory on general regions, Journal of Computational Physics 100 (2) (1992) 236–245

    A. Mayo, The rapid evaluation of volume integrals of potential theory on general regions, Journal of Computational Physics 100 (2) (1992) 236–245. doi:10.1016/0021-9991(92)90231-M . URL https://linkinghub.elsevier.com/retrieve/pii/002199919290231M

  48. [50]

    Osher, R

    S. Osher, R. Fedkiw, Level set methods and dynamic implicit surfaces, Computers & Mathematics with Applica- tions 46 (5-6) (2003) 983–984. doi:10.1016/S0898-1221(03)90179-9 . URL https://linkinghub.elsevier.com/retrieve/pii/S0898122103901799

  49. [51]

    Smereka, Semi-implicit level set methods for curvature and surface diffusion motion, Journal of Scientific Com- puting 19 (2003) 439–456

    P. Smereka, Semi-implicit level set methods for curvature and surface diffusion motion, Journal of Scientific Com- puting 19 (2003) 439–456. doi:10.1023/A:1025324613450. URL https://doi.org/10.1023/A:1025324613450

  50. [52]

    Salac, W

    D. Salac, W. Lu, A local semi-implicit level-set method for interface motion, Journal of Scientific Computing 35 (2008) 330–349. doi:10.1007/s10915-008-9188-6 . URL http://link.springer.com/10.1007/s10915-008-9188-6

  51. [53]

    Osher, C.-W

    S. Osher, C.-W. Shu, High-Order Essentially Nonoscillatory Schemes for Hamilton–Jacobi Equations, SIAM Jour- nal on Numerical Analysis 28 (4) (1991) 907–922. doi:10.1137/0728049. URL https://arc.aiaa.org/doi/10.2514/1.9320http://epubs.siam.org/doi/10.1137/0728049

  52. [54]

    Chandra, L

    R. Chandra, L. Dagum, D. Kohr, R. Menon, D. Maydan, J. McDonald, Parallel programming in OpenMP, Morgan kaufmann, 2001. 26