Efficient computation of enclosures for the exact solvents of a quadratic matrix equation.
Efficient Computing of some Vector Operations over GF(3) and GF(4)
The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.
Eine Faktorisierung der bei der rationalen Interpolation auftretenden Matrizen.
Enclosures for the solution set of parametric interval linear systems
We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for this case, comparing and refinement of both. We show that the latter bounds are not provable better, and that they are also sometimes too pessimistic. The presented form of both methods is suitable for combining them into one to get a more efficient algorithm. Some numerical experiments are carried out to illustrate performances of the methods....
Error analysis of some approximating algorithms
Error Analysis of Splitting Algorithms for Polynomials.
Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals.
Evaluating the Frechet derivative of the matrix exponential.
Extension de la méthode Procuste à la comparaison de nuages de points situés dans des espaces de dimensions différentes