Sergiy Koshkin

Vojin Jovanovic, Sergiy Koshkin

We develop a general form of the Ritz method for trial functions that do not satisfy the essential boundary conditions. The idea is to treat the latter as variational constraints and remove them using the Lagrange multipliers. In multidimensional problems in addition to the trial functions boundary weight functions also have to be selected to approximate the boundary conditions. We prove convergence of the method and discuss its limitations and implementation issues. In particular, we discuss the required regularity of the variational functional, the completeness of systems of the trial functions, and conditions for consistency of the equations for the trial solutions. The discussion is accompanied by a detailed examination of examples, both analytic and numerical, to illustrate the method.

Sergiy Koshkin, Taylor Styers

We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q-matrices, and prove that it preserves the original error correction properties of the encryption. Moreover, the additional parameters involved in generating the coding matrices make this unimodular cryptography resilient to the chosen plaintext attacks that worked against the golden cryptography. Finally, we show that even the golden cryptography is generally unable to correct double errors in the same row of the ciphertext matrix, and offer an additional check number which, if transmitted, allows for the correction.