• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.251-264
• /
• 2004

We introduce a semidiscrete mixed finite element approximation for the single-phase linear Stefan problem and show the unique existence of the approximation. And the optimal rate of convergence in $L^2$ and $H^1$ norms are derived.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.795-809
• /
• 2001

In this paper, we apply finite element Galerkin method to a single-ohase linear Stefan problem with a forcing term. We apply the extrapolated Crank-Nicolson method to construct the fully discrete approximation and we derive optimal error estimates in the temporal direction in $L^2$, $H^1$ spaces.

• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.185-199
• /
• 2003

In this paper, we apply finite element Galerkin method to a single-phase quasi-linear Stefan problem with a forcing term. We consider the existence and uniqueness of a semidiscrete approximation and optimal error estimates in $L_2$, $L_{\infty}$, $H_1$ and $H_2$ norms for semidiscrete Galerkin approximations we derived.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.165-181
• /
• 2004

Based on Landau-type transformation, a Stefan problem with non-linear free boundary condition is transformed into a system consisting of parabolic equation and the ordinary differential equations. Semidiscrete approximations are constructed. Optimal orders of convergence of semidiscrete approximation in $L_2$, $H^1$ and $H^2$ normed spaces are derived.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.97-113
• /
• 2004

In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.

• 대한수학회보
• /
• 제31권2호
• /
• pp.309-318
• /
• 1994

The approach presented in this paper is based on the transformation of the Stefan problem in one space dimension to an initial-boundary value problem for the heat equation in a fixed domain. Of course, the problem is non-linear. The finite element approximation adopted here is the standared continuous Galerkin method in time. In this paper, only the regular case is discussed. This means the error analysis is based on the assumption that the solution is sufficiently smooth. The aim of this paper is the existence of the solution in a finite Galerkin system of ordinary equations.