1978
DOI: 10.1016/0096-3003(78)90001-2
|View full text |Cite
|
Sign up to set email alerts
|

The numerical solution of Stefan problems with front-tracking and smoothing methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1978
1978
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 20 publications
0
8
0
Order By: Relevance
“…The backward sweep Equation (2.11) also will be integrated with the trapezoidal rule. This method leads, of course, to a very crude resolution of each one dimensional two point boundary value problem, but numerous computations with fixed and free nonlinear boundary conditions have substantiated that for the slowly varying solutions typical of diffusion type problems the trapezoidal rule is accurate enough when answers from various mesh sizes are compared with analytical solutions of model problems (see [7] and [8]). The overriding advantage of the trapezoidal rule is the fact that no interpolation between mesh points is necessary during the reverse sweep which simplifies programming of the algorithm.…”
Section: Numerical Experimentsmentioning
confidence: 97%
See 2 more Smart Citations
“…The backward sweep Equation (2.11) also will be integrated with the trapezoidal rule. This method leads, of course, to a very crude resolution of each one dimensional two point boundary value problem, but numerous computations with fixed and free nonlinear boundary conditions have substantiated that for the slowly varying solutions typical of diffusion type problems the trapezoidal rule is accurate enough when answers from various mesh sizes are compared with analytical solutions of model problems (see [7] and [8]). The overriding advantage of the trapezoidal rule is the fact that no interpolation between mesh points is necessary during the reverse sweep which simplifies programming of the algorithm.…”
Section: Numerical Experimentsmentioning
confidence: 97%
“…It was shown in [7] and [8] that the method of lines-SOR-invariant imbedding method could reproduce numerically the analytic solutions of certain model problems with fixed and free boundaries. We shall discuss here its performance for two problems of comparable complexity without known solution in order to demonstrate the flexibility of the method and to verify some of the effects predicted by the theoretical results of the next section.…”
Section: Numerical Experimentsmentioning
confidence: 98%
See 1 more Smart Citation
“…The formalism can be adapted to accommodate time-varying bounds. This is more generally studied as a free boundary problem, with a typical example including the Stefan problem (Meyer, 1978;Li, 1997).…”
Section: Fokker-planck Formalism With Time-varying Boundsmentioning
confidence: 99%
“…Due to the inherent non-linearity of the energy balance at the interface governing the interface position, few analytical solutions of interest are available [1][2][3][4] giving place to the development of a great number of numerical algorithms [5][6][7] based on finite differences [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26] finite elements and, more recently, boundary elements [64][65][66][67]. All these methods can be classified into two main groups, front tracking methods and fixed domain methods.…”
Section: Introductionmentioning
confidence: 99%