Sciweavers

77 search results - page 14 / 16
» moc 1998
Sort
View
MOC
1998
147views more  MOC 1998»
14 years 11 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
MOC
1998
109views more  MOC 1998»
14 years 11 months ago
A comparison of regularizations for an ill-posed problem
Abstract. We consider numerical methods for a “quasi-boundary value” regularization of the backward parabolic problem given by ut + Au = 0 , 0 < t < T u(T ) = f, where A ...
Karen A. Ames, Gordon W. Clark, James F. Epperson,...
MOC
1998
64views more  MOC 1998»
14 years 11 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
MOC
1998
136views more  MOC 1998»
14 years 11 months ago
Total variation diminishing Runge-Kutta schemes
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solvi...
Sigal Gottlieb, Chi-Wang Shu
MOC
2002
86views more  MOC 2002»
14 years 11 months ago
Ten consecutive primes in arithmetic progression
Abstract. In 1967 the first set of 6 consecutive primes in arithmetic progression was found. In 1995 the first set of 7 consecutive primes in arithmetic progression was found. Betw...
Harvey Dubner, Tony Forbes, Nik Lygeros, Michel Mi...