The problem of multiplying (m X n) X (n X k) matrices (the (m, n, k) problem) is an interesting case of the bilinear forms computation theory. We call EC-algoritâ€™hms (Exactly-Computing) those solvingâ€¦ (More)

The computational cost, in the bit model of computation, of the evaluation of a real function $$f(x)$$ in a point $$x$$ is analyzed, when the number d of correct digits of the result increasesâ€¦ (More)

A set of symmetric, closed, interpolatory integration formulas on the interval [-1, 1] with positive weights and increasing degree of precision is introduced. These formulas, called recursiveâ€¦ (More)

Numerical stability of the Levinson algorithm, generalized for Toeplitz-like systems, is studied. Arguments based on the analytic results of an error analysis for floating point arithmetic produce anâ€¦ (More)

We study the chaotic behavior of a particular class of dynamical systems: cellular automata. We specialize the definition of chaos given by Devaney for general dynamical systems to the case ofâ€¦ (More)

In many numerical applications, for instance in image deconvolution, the nonnegativity of the computed solution is required. When a problem of deconvolution is formulated in a statistical frame, theâ€¦ (More)

The preconditioned conjugate gradient (CG) is often applied in image reconstruction as a regularizing method. When the blurring matrix has Toeplitz structure, the modified circulant preconditionerâ€¦ (More)

To apply the Generalized Cross-Validation (GCV) as a stopping rule for an iterative method, we must estimate the trace of the so-called influence matrix which appears in the denominator of the GCVâ€¦ (More)