zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On the numerical solution of the heat conduction equations subject to nonlocal conditions. (English) Zbl 1167.65423
Summary: Many physical phenomena are modelled by nonclassical parabolic boundary value problems with nonlocal boundary conditions. Many different papers studied the second-order parabolic equation, particularly the heat equation subject to the specifications of mass. In this paper, we provide a whole family of new algorithms that improve the CPU time and accuracy of Crandall’s formula shown in [the authors, Appl. Numer. Math. 59, No. 6, 1258–1264 (2009; Zbl 1167.65422)] (and this algorithm improved the results obtained with BTCS, FTCS or Dufort-Frankel three-level techniques previously used in other works, see [M. Dehghan, Appl. Numer. Math. 52, No. 1, 39–62 (2005; Zbl 1063.65079)]) with this kind of problems. Other methods got second or fourth order only when k=sh 2 , while the new codes got nth order for k=h; therefore, the new schemes require a smaller storage and CPU time employed than other algorithms. We study the convergence of the new algorithms and finally compare the efficiency of the new methods with some well-known numerical examples.
65M06Finite difference methods (IVP of PDE)