𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A symmetry and bi-recursive algorithm of accurately computing Krawtchouk moments

✍ Scribed by Guojun Zhang; Zhu Luo; Bo Fu; Bo Li; Jiaping Liao; Xiuxiang Fan; Zheng Xi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
928 KB
Volume
31
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A novel parallel recursive Newton–Euler
A novel parallel recursive Newton–Euler algorithm for modelling and computation of robot dynamics
✍ E. Abdalla; H.J. Pu; M. MΓΌller; A.A. Tantawy; L. Abdelatif; H. Nour Eldin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 675 KB

The recursive Newton-Euler formulation to compile or compute the robot dynamics is essential for problems of robot simulation as well as for robot inverse dynamics. Beside the established form of computation in outward (forward) and inward (backward) recursion, several schemes that exploit inherent

A BSP Recursive Divide and Conquer Algor
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix
✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
✍ S. Rombouts; K. Heyde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.

A fast algorithm for the computation of
A fast algorithm for the computation of axial moments and its application to the orthogonal fitting of curves
✍ Roman M. Palenichka; Marek B. Zaremba πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 343 KB

This paper describes a fast algorithm to compute local axial moments used in the detection of objects of interest in images. The basic idea is the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of th