To visualize the 3-D subsurface of the earth 3-D migration algorithms are needed which give accurate results within a reasonable computation time. In this Chapter several recursive depth migration algorithms are discussed and compared with each other. The backbone of every recursive depth migration algorithm is a 3-D extrapolation algorithm. In lateral homogeneous media the extrapolation algori...

Let $\bar{M}_{0,n}(G(r,V), d)$ be the coarse moduli space of stable degree $d$ maps from $n$-pointed genus $0$ curves to a Grassmann variety $G(r,V)$. We provide recursive method for computation Hodge numbers and Betti all $n$ $d$. Our is generalization Getzler Pandharipande's work projective spaces.

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...

We provide a recursive formula for the computation of moments distributions belonging to subclass exponential family. This includes important cases as binomial, negative Poisson, gamma and normal distribution, among others. The provides procedure sequentially calculate using only elementary operations. approach makes no use moment generating function.

To visualize the 3-D subsurface of the earth 3-D migration algorithms are needed which give accurate results within a reasonable computation time. In this Chapter several recursive depth migration algorithms are discussed and compared with each other. The backbone of every recursive depth migration algorithm is a 3-D extrapolation algorithm. In lateral homogeneous media the extrapolation algori...

The notion of binomial coefficients (T S ) of finite planar, reduced rooted trees T, S is defined and a recursive formula for its computation is shown. The nonassociative binomial formula (1 + x) = ∑

The paper deals with the calculation of higher order derivatives of the inverse function. A simple and fast recursive procedure is presented and compared with other methods known in literature both with respect to the computation time and memory usage.

A simple proof of the Greville formula for the recursive computation of the Moore-Penrose (MP) inverse of a matrix is presented. The proof utilizes no more than the elementary properties of the MP inverse.

Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.