An efficient and reliable a posteriori error estimate is derived for linear parabolic equations which does not depend on any regularity assumption on the underlying ...

We describe an efficient implementation of the so-called minimum degree algorithm, which experience has shown to produce efficient orderings for sparse positive definite systems. Our algorithm is a ...

Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...