We give a condition on a closed set K of real n mma trices which ensures that any W p gradient Young measure sup ported on K must be trivial the condition given is also necessary when K is bounded Introduction Assume is a smooth bounded domain in R and p is a given number Let W p R be the usual Sobolev space of maps u from to R the Jacobi or gradient matrix ru of u is L integrable and thus de n...

This paper presents a methodology to transform a pure functional speciication into a distributed message-passing program via equa-tional reasoning. The methodology uses a formal model of a message passing system. This abstract system can be implemented using PVM or MPI, and thus executable programs produced.

Bose-Chaudhuri-Hocquenghem and Justesen codes are used to pack equa spheres in M-dimensional Euclidean space with density A satisfying log2 A > — 6n + o(ri), for all sufficiently large n of the form m2, where m is a power of 4. These appear to be the densest packings yet constructed in high dimensional space.

1987 ABSTRACT In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equa-tional program, with run-time speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very brieey, concentrating on shortc...

Many process algebras are deened by structural operational semantics (SOS). Indeed , most such deenitions are nicely structured and t the GSOS format of 15]. We give a procedure for converting any GSOS language deenition to a nite complete equa-tional axiom system (possibly with one innnitary induction principle) which precisely characterizes strong bisimulation of processes.

The Reduced Basis (RB) method is a well established method for the model order reduction of problems formulated as parametrized partial differential equations. One crucial requirement for the application of RB schemes is the availability of an a posteriori error estimator to reliably estimate the error introduced by the reduction process. However, straightforward implementations of standard res...

Efficient numerical algorithms for the solution of large and sparse matrix Riccati and Lyapunov equations based on the low rank alternating directions implicit (ADI) iteration have become available around the year 2000. Over the decade that passed since then, additional methods based on extended and rational Krylov subspace projection have entered the field and proved to be competitive alternat...

In this paper we consider solving the single layer integral equa tion on a closed surface in R The numerical method is based on Galerkin s method with spherical polynomials as the approximation ing functions We study the error of the approximating solution in suitable Sobolev spaces