Displaying 1021 – 1040 of 1340

Showing per page

Roundoff errors in the fast computation of discrete convolutions

Karel Segeth (1981)

Aplikace matematiky

The efficient evaluation of a discrete convolution is usually carried out as a repated evaluation of a discrete convolution of a special type with the help of the fast Fourier transform. The paper is concerned with the analysis of the roundoff errors in the fast computation of this convolution. To obtain a comparison, the roundoff errors in the usual (direct) computation of this convolution are also considered. A stochastic model of the propagation of roundoff errors. is employed. The theoretical...

Self-correcting iterative methods for computing 2 -inverses

Stanimirović, Predrag S. (2003)

Archivum Mathematicum

In this paper we construct a few iterative processes for computing { 2 } -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.

Several results on chordal bipartite graphs

Mihály Bakonyi, Aaron Bono (1997)

Czechoslovak Mathematical Journal

The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence, occurance of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph. Next, a property concerning minimal edge separators is presented. Finally, it is shown that,...

Currently displaying 1021 – 1040 of 1340