numerical 
The essential dimension is a numerical invariant of the group; it is often equal to the minimal number of independent parameters required to describe all algebraic objects of a certain type.


We do this in a setting that closely resembles the numerical analysis setting of Mallat and Zhong and that seems to capture something of the essence of their (practical) reconstruction method.


We do this in a setting that closely resembles the numerical analysis setting of Mallat and Zhong and that seems to capture something of the essence of their (practical) reconstruction method.


Mathematical details and numerical examples are included.


Then, we describe a numerical method to compute the dual function and give an estimate of the error.


The mathematical theory usually addresses this problem in infinite dimensions (typically in L2 (?) or ?2(?)), whereas numerical methods have to operate with a finitedimensional model.


Further we investigate under which conditions one can replace the discrete model of the finite section method by the periodic discrete model, which is used in many numerical procedures.


While our proofs, constructions and numerical examples are given for eigenvalue problems for the Laplacian operator in the plane, other elliptic operators can be treated similarly.


Nevanlinna theory, diophantine approximation, and numerical analysis


The popularity of PSWFs seems likely to increase in the near future, as bandlimited functions become a numerical (as well as an analytical) tool.


A new method for the numerical solution of volume integral equations is proposed


The numerical treatment of twodimensional scattering in inhomogeneous media


Riesz property plays an important role in any waveletbased compression algorithm and is critical for the stability of any waveletbased numerical algorithms.


Numerical examples testing the method on the sphere are included.


We discuss an implementation of an efficient algorithm for the numerical computation of Fourier transforms of bandlimited functions defined on the rotation group SO(3).


26(4):10661099, [1997]), our fast SO(3) algorithm can be improved to give an algorithm of complexity O(B3log?2B), but at a cost in numerical reliability.


Numerical and empirical results are presented establishing the empirical stability of the basic algorithm.


Because of this perspective, several numerical methods become available to compute the tight frames.


Utilizing analysis of similarity (ANOSIM) on the ten pharmaceutical descriptors provides a discrete numerical result that indicates overall dissimilarity among these agents.


Numerical simulations are carried out to test the feasibility and to study the general characteristics of the technique without the real measurement data.

