algorithm 
This paper gives an algorithm for computing invariant rings of reductive groups in arbitrary characteristic.


The algorithm presented here computes a geometric characteristic of this action in the case where G is connected and reductive, and $\rho$ is a morphism of algebraic groups: The algorithm takes as input the


We present an algorithm for computing the invariant field k(X)G.


More precisely, we give an algorithm for computing a nonempty open subset of X with a geometric quotient.


We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance.


Unique reconstruction of bandlimited signals by a MallatZhong wavelet transform algorithm


We show that the rate of convergence for this reconstruction algorithm is geometric and computable in advance.


The results on decay are used to prove uniqueness of solutions and convergence of the cascade algorithm.


We derive a fast algorithm to compute the coefficients.


This article genralizes the fast Fourier transform algorithm to the computation of Fourier transforms on compact Lie groups.


An algorithm to calculate the pressure is presented.


We present here a selfcontained derivation, building the decomposition from basic principles such as the Euclidean algorithm, with a focus on applying it to wavelet filtering.


A geometrical problem arising in a signal restoration algorithm


We present an algorithm which, based on certain properties of analytic dependence, constructs boundary perturbation expansions of arbitrary order for eigenfunctions of elliptic PDEs.


The derivation of our algorithm depends on certain properties of joint analyticity (with respect to spatial variables and perturbations) which had not been established before this work.


Microlocal Analysis of an FBP Algorithm for Truncated Spiral Cone Beam Data


Earlier work by Driscoll and Healy has produced an efficient algorithm for


Also, from the information that the ArovGrossman functional model provides we obtain a version of the Levinson algorithm.


Anewwaveletbased geometric mesh compression algorithm was developed recently in the area of computer graphics by Khodakovsky, Schr?der, and Sweldens in their interesting article [23].


This leads to a very efficient geometric mesh compression algorithm as proposed in [23].

