Sciweavers

1716 search results - page 114 / 344
» Proving Conditional Termination
Sort
View
65
Voted
SCL
2008
79views more  SCL 2008»
15 years 21 days ago
Stability of block-triangular stationary random matrices
The objective of this note is to prove, under certain technical conditions, that the top-Lyapunov exponent of a strictly stationary random sequence of block-triangular matrices is...
László Gerencsér, György...
ACTA
2005
101views more  ACTA 2005»
15 years 20 days ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
113
Voted
AMC
2005
134views more  AMC 2005»
15 years 20 days ago
The Fourier spectral method for the Cahn-Hilliard equation
In this paper, a Fourier spectral method for numerically solving Cahn-Hilliard equation with periodic boundary conditions is developed. We establish their semi-discrete and fully d...
Xingde Ye, Xiao-Liang Cheng
AMC
2005
123views more  AMC 2005»
15 years 20 days ago
Iterative methods for Robbins problems
Preconditioned iterative methods are described for the solution of an elliptic partial differential equation over an unit square region with Robbins boundary conditions. Transform...
Andy C. Ho, Michael K. Ng
89
Voted
COMBINATORICS
2004
48views more  COMBINATORICS 2004»
15 years 19 days ago
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
Jason P. Bell, Stanley Burris