A multiresolution method for fitting scattered data on the sphere

In this work, we propose an efficient multiresolution method for fitting scattered data functions on a sphere S, using a tensor product method of periodic algebraic trigonometric splines of order 3 and quadratic polynomial splines defined on a rectangular map of S. We describe the decomposition and reconstruction algorithms corresponding to the polynomial and periodic algebraic trigonometric wavelets. As application of this method, we give an algorithm which allows to compress scattered data on spherelike surfaces. In order to illustrate our results, some numerical examples are presented.     

A Family of Spline Quasi-Interpolants on the Sphere

In this paper, we construct a local quasi-interpolant Q for fitting a function f defined on the sphere S. We first map the surface S onto a rectangular domain and next, by using the tensor product of polynomial splines and 2-periodic trigonometric splines, we give the expression of Qf. The use of trigonometric splines is necessary to enforce some boundary conditions which are useful to ensure the C ² continuity of the associated surface. Finally, we prove that Q realizes an accuracy of optimal order.     

Transformation semigroup compactifications and norm continuity of weakly almost periodic functions

We prove if there exists a separately continuous action of a topologically right simple semitopological semigroupS on a topological spaceX and ifS acts topologically surjective onX then each weakly almost periodic function onX, with respect toS, is left norm continuous.     

Invariant semigroups of orthodox semigroups

We consider, in a right inverse semigroupS with a multiplicative inverse transversalS ^o, the notion of anS ^o-invariant subsemigroup and use this to describe all the left amenable orders definable onS. The results obtained, together with their duals, are used to prove that ifS is an orthodox semigroup with a multiplicative inverse transversalS ^o, then every amenable order onS ^o can be extended to a unique amenable order onS. NATO Collaborative Research Grant 910765 is gratefully acknowledged. The second-named author also gratefully acknowledges support from the Calouste Gulbenkian Foundation, Lisbon.     

Stationary measures for randomly chosen maps

A Markov process on a compact metric space,X is given by random transformations.S is a finite set of continuous transformations ofX to itself. A random evolution onX is defined by lettingx inX evolve toT(x) forT inS with probability that depends onx andT but is independent of any other past measurable events. This type of model is often called a place dependent iterated function system. The transformations are assumed to have either monotone or contractive properties. Theorems are given to describe the number and types of ergodic invariant measures. Special emphasis is given to learning models and self-reinforcing random walks.Supported in part by AFOSR Grant No. 91-0215, the Alexander von Humboldt Foundation and SFB 170, University of Göttingen.     

A General Multiresolution Method for Fitting Functions on the Sphere

In [7], Lyche and Schumaker have described a method for fitting functions of class C ¹ on the sphere which is based on tensor products of quadratic polynomial splines and trigonometric splines of order three associated with uniform knots. In this paper, we present a multiresolution method leading to C ²-functions on the sphere, using tensor products of polynomial and trigonometric splines of odd order with arbitrary simple knot sequences. We determine the decomposition and reconstruction matrices corresponding to the polynomial and trigonometric spline spaces. We describe the general tensor product decomposition and reconstruction algorithms in matrix form which are convenient for the compression of surfaces. We give the different steps of the computer implementation of these algorithms and, finally, we present a test example.     

Quintic trigonometric spline based numerical scheme for nonlinear modified Burgers' equation

This paper presents a numerical method based on quintic trigonometric B‐splines for solving modified Burgers' equation (MBE). Here, the MBE is first discretized in time by Crank–Nicolson scheme and the resulting scheme is solved by quintic trigonometric B‐splines. The proposed method tackles nonlinearity by using a linearization process known as quasilinearization. A rigorous analysis of the stability and convergence of the proposed method are carried out, which proves that the method is unconditionally stable and has order of convergence O(h⁴ + k²). Numerical results presented are very much in accordance with the exact solution, which is established by the negligible values of L₂ and L_∞ errors. Computational efficiency of the scheme is proved by small values of CPU time. The method furnishes results better than those obtained by using most of the existing methods for solving MBE.     

Approximation of Scattered Data by Trigonometric Polynomials on the Torus and the 2-sphere

Fast, efficient and reliable algorithms for the discrete least-square approximation of scattered points on the torus T ^d and the sphere S ² by trigonometric polynomials are presented. The algorithms are based on iterative CG-type methods in combination with fast Fourier transforms for nonequispaced data. The emphasis is on numerical aspects, in order to solve large scale problems. Numerical examples show the efficiency of the new algorithms.     

Exploiting structure in piecewise-linear homotopy algorithms for solving equations

We consider the recent algorithms for computing fixed points or zeros of continuous functions fromR ⁿ to itself that are based on tracing piecewise-linear paths in triangulations. We investigate the possible savings that arise when these fixed-point algorithms with their usual triangulations are applied to computing zeros of functionsf with special structure:f is either piecewise-linear in certain variables, separable, or has Jacobian with small bandwidth. Each of these structures leads to a property we call modularity; the algorithmic path within a simplex can be continued into an adjacent simplex without a function evaluation or linear programming pivot. Modularity also arises without any special structure onf from the linearity of the function that is deformed tof. In the case thatf is separable we show that the path generated by Kojima's algorithm with the homotopyH ² coincides with the path generated by the standard restart algorithm of Merrill when the usual triangulations are employed. The extra function evaluations and linear programming steps required by the standard algorithm can be avoided by exploiting modularity.This research was performed while the author was visiting the Mathematics Research Center, University of Wisconsin-Madison, and was sponsored by the United States Army under Contract No. DAAG-29-75-C-0024 and by the National Science Foundation under Grant No. ENG76-08749.     

When isf(x,y) = u(x) + v(y)?

LetX andY be arbitrary non-empty sets and letS a non-empty subset ofX ×Y. We give necessary and sufficient conditions onS which ensure that every real valued function onS is the sum of a function onX and a function onY.     

Pseudodifferential operators with heavy spectrum

We establish Fredholm criteria and index formulas for one-dimensional zero-order pseudodifferential operators with piecewise continuous generating functions onL ^p spaces with Muckenhoupt weights. The Fredholm symbol of such operators is shown to be a matrix function defined on a set which, roughly speaking, is a cylinder with a certain collection of horn shaped handles. The presence of these horns implies that, unlike the case ofL ^p spaces without weight or with so-called power weights, the spectrum may contain heavy parts, i. e. the set of the interior points of the spectrum need not be empty. Our proof makes essential use of recent results by Finck, Roch, Silbermann, Gohberg, and Krupnik on the inverse closedness of certain Banach algebras.Research supported by the Alfried Krupp Förderpreis für junge Hochschullehrer of the Krupp Foundation.     

Fast Wavelet Transform for Toeplitz Matrices and Property Analysis

Fast wavelet transform algorithms for Toeplitz matrices are proposed in this paper. Distinctive from the well known discrete trigonometric transforms, such as the discrete cosine transform （DCT） and the discrete Fourier transform （DFT） for Toeplitz matrices, the new algorithms are achieved by compactly supported wavelet that preserve the character of a Toeplitz matrix after transform, which is quite useful in many applications involving a Toeplitz matrix. Results of numerical experiments show that the proposed method has good compression performance similar to using wavelet in the digital image coding. Since the proposed algorithms turn a dense Toeplitz matrix into a band-limited form, the arithmetic operations required by the new algorithms are O（N） that are reduced greatly compared with O（N log N） by the classical trigonometric transforms.     

L 2-approximation by the translates of a function and related attenuation factors

Summary Let be thek-dimensional subspace spanned by the translates (·–2j/k),j=0, 1, ...,k–1, of a continuous, piecewise smooth, complexvalued, 2-periodic function . For a given functionfL ²(–, ), its least squares approximantS _kf from can be expressed in terms of an orthonormal basis. Iff is continuous,S _kf can be computed via its discrete analogue by fast Fourier transform. The discrete least squares approximant is used to approximate Fourier coefficients, and this complements the works of Gautschi on attenuation factors. Examples of include the space of trigonometric polynomials where is the de la Valleé Poussin kernel, algebraic polynomial splines where is the periodic B-spline, and trigonometric polynomial splines where is the trigonometric B-spline.     

NEW PERIODIC SOLUTIONS OF ITO＇S 5th-ORDER mKdV EQUATION AND ITO＇S 7th-ORDER mKdV EQUATION

Based on the modified Jocobi elliptic function expansion method and the modified extended tanh-function method, a new algebraic method is presented to obtain multiple travelling wave solutions for nonlinear wave equations. By using the method ,Ito‘s 5th-order and 7th-order mKdV equations are studied in detail and more new exact Jocobi elliptic function periodic solutions are found. With modulus m→1 or m→0, these solutions degenerate into corresponding solitary wave solutions, shock wave solutions and trigonometric function solutions.     

Approximations by polynomial and trigonometric splines of third order preserving some properties of approximated functions

In this paper with the help of parabolic splines we construct a linear method of approximate recovery of functions by their values on an arbitrary grid. In the method, a spline inherits the properties of monotonicity and convexity from the approximated function, and is sufficiently smooth. In addition, the constructed linear operator as an operator acting from the space of continuous functions to the same space has the norm equal to one. We also obtain similar results for trigonometric splines of third order.     

Best mean approximation by splines satisfying generalized convexity constraints

A characterization of the best L₁-approximation to a continuous function by classes of fixed-knot polynomial splines which satisfy generalized convexity constraints is presented and uniqueness is shown. Included is the possibility of specifying the positivity, monotonicity, or convexity of the class. The proof of uniqueness uses recently developed results for Hermite-Birkhoff interpolation by splines.     

B-splines with homogenized knots

The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.     

B-splines with homogenized knots

The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming algorithms for evaluation, differentiation and knot insertion. Moreover, the B-spline is locally supported and a Marsden’s identity exists. Spaces of natural splines and certain polynomial spline spaces with more general continuity properties than ordinary splines have bases of B-splines over homogenized knots. Applications to nonpolynomial splines such as trigonometric and hyperbolic splines are made.     

Minimal sets for flows on moduli space

LetS be a compact orientable surface, letQ be the moduli space of quadratic differentials onS and letM be a stratum inQ. We explicitly describe the minimal sets for the (Teichmüller) horocycle flow onM and onQ, and show that these correspond to horizontal cylindrical decompositions ofS.     

Uniform semigroups and fixed point properties

LetS be a uniform semigroup (this includes all topological groups and affine semigroups). We show that a certain space of uniformly continuous functions onS has a left invariant mean iffS has the fixed point property for uniformly continuous affine actions ofS on compact convex sets. This is closely related to but independent of the results of T. Mitchell in [13] and A. Lau in [10]. Interesting examples and consequences are given for the special cases of topological groups and affine convolution semigroups of probability measures on a locally compact semigroup or group. Research Supported by NSERC of Canada Grant No. A8227.