We present an AXIOM environment called JET for geometric computations with partial dierential equations within the framework of the jet bundle formalism. This comprises especially the completion of a given dierential equation to an involutive one according to the Cartan-Kuranishi Theorem and the setting up of the determining system for the generators of classical and non-classical Lie symmetrie...

14.

We describe a novel formulation of the range recovery problem, based on computation of the di erential variation in image intensities with respect to changes in camera position. The method uses a single stationary camera and a pair of calibrated optical masks to directly measure this di erential quantity. The subsequent computation of the range image is simple and should be suitable for real-ti...

While impossible di erential cryptanalysis is a well-known and popular cryptanalytic method, errors in the analysis are often discovered and many papers in the literature present aws. Wishing to solve that, Boura et al. [1] presented at ASIACRYPT'14 a generic vision of impossible di erential attacks with the aim of simplifying and helping the construction and veri cation of this type of cryptan...

Re nement Calculus is a formal framework for the development of provably correct software It is also used in the development of Action Systems which is a predicate transformer based framework for constructing distributed and reactive software systems Recently Action Systems were extended with a new action called the di erential action It allows the modelling of con tinuous behaviour Along with ...

A new technique is proposed to improve the performance of di erential detection of MDPSK (M{ary di erential phase{shift keying) signi cantly, applying sequence estimation. In order to obtain an appropriate representation of the received signal, a nonlinear time{variant FIR or IIR prediction{error lter is used. For both lter structures the optimum coe cients are derived, assuming transmission ov...

We present a method to solve initial and boundary value problems using arti ial neural networks. A trial solution of the di erential equation is written as a sum of two parts. The rst part satis es the initial/boundary onditions and ontains no adjustable parameters. The se ond part is onstru ted so as not to a e t the initial/boundary onditions. This part involves a feedforward neural network, ...

S hur omplement pre onditioning for ellipti systems of partial di erential equations D. Loghin and A. J. Wathen One su essful approa h in the design of solution methods for saddle-point problems requires the eÆ ient solution of the asso iated S hur omplement problem ([26℄, [19℄). In the ase of problems arising from partial di erential equations the fa torization of the symbol of the operator an...

The problem of simultaneous reduction of real matrices by either orthogo nal similarity or orthogonal equivalence transformations is considered Based on the Jacobi idea of minimizing the sum of squares of the complementary part of the desired form to which matrices are reduced the projected gradi ent method is used in this paper It is shown that the projected gradient of the objective function ...

1. Introdu tion. There are plenty of appli ation papers in whi h kernels or radial basis fun tions are su essfully used for solving partial di erential equations by meshless methods. The usage of kernels is typi ally based on spatial interpolation at s attered lo ations, writing the trial fun tions entirely in terms of nodes [2℄. For stationary partial di erential equations, the dis retization ...