No label defined (Q4499440)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1498374
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1498374

      Statements

      0 references
      30 August 2000
      0 references
      forward-backward parabolic equation
      0 references
      nonclassical problem
      0 references
      numerical examples
      0 references
      finite difference approximation
      0 references
      weak convergence
      0 references
      algorithms
      0 references
      The aim of the article is to study numerically a nonclassical problem for a nonlinear parabolic equation with an alternating coefficient at the time derivative of the form \[ \begin{alignedat}{2} &uu_t = u_{xx} - du + f(x,t),&&\quad (x,t)\in Q_T,\\ &u(x,0) = \varphi(x) \geq 0,&&\quad 0\leq x\leq l,\\ &u(x,T) = \Phi(x) \leq 0,&&\quad 0\leq x\leq l,\\ &u(0,t) = 0,\quad u(l,t) = 0,&&\quad 0\leq t\leq T, \end{alignedat} \] where \(u(x,t)\) changes its sign in \(Q_T = Q_T^+\cup Q_T^-\). Here \(Q_T^+ = \{(x,t)\mid \xi(t) < x < l,\;0<t\leq T\}\) and \(Q_T^- = \{(x,t)\mid 0<x<\xi(t),\;0\leq t< T\}\). It is assumed that \(d-1/2|u_t|\geq\delta>0\), which guarantees existence of a weak solution to the problem [see \textit{S. G. Pyatkov} and \textit{A. G. Podgaev}, Sib. Math. J. 28, No. 3, 498-505 (1987; Zbl 0646.35047)]. For the numerical solution of this problem, a finite difference approximation scheme is suggested. The author proves weak convergence in the space \(L_3(G_h)\) of an approximate solution for a weak solution to the problem. The rest of the article is devoted to numerical realization of the difference scheme constructed which is based on applying both iterative and noniterative algorithms. The results of numerical calculations demonstrate the iterative algorithm provides a more exact approximate solution.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references