On solution of a nonlocal problem with dynamic boundary conditions for a loaded linear parabolic equation by straight-line methods
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2017, Vol 5, Issue 1
Abstract
We consider a nonlocal problem with dynamic boundary conditions for a loaded linear parabolic equation. For this problem we prove the unique solvability in Sobolev's spaces and the maximum principle under some natural conditions. We suggest the numerical straight-lines method for the finding of the solution of the problem. The convergence of the straight-lines method to the exact solution is also proved.
Authors and Affiliations
Zakir Khankishiyev
Keywords
Related Articles
- EP ID EP243957
- DOI -
- Views 84
- Downloads 0
New results on the stability, integrability and boundedness in Volterra integro-differential equations
The authors of this article deal with a first order non-linear Volterra integro-differential equation (NVIDE). To this end, the conditions are obtained which are sufficient for stability (S), boundedness (B), and for eve...
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were use...
Modified Spectral Projected Subgradient Method: Convergence Analysis and Momentum Parameter Heuristics
The Modified Spectral Projected Subgradient (MSPS) was proposed to solve Langrangen Dual Problems, and its convergence was shown when the momentum term was zero. The MSPS uses a momentum term in order to speed up its con...
Evaluation of the Von Rosenberg's method for the convection-diffusion equation
An explicit numerical scheme developed by Von Rosenberg for the convection-diffusion equation in one spatial dimension is reviewed and analyzed. The convergence of this scheme is outlined and a comparative study was esta...
Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iter...