Two-direction refinable functions and two-direction wavelets with high approximation order and regularity

The concept of two-direction refinable functions and two-direction wavelets is introduced. We investigate the existence of distributional(or L~2-stable) solutions of the two-direction refinement equation: (?)(x)=(?)p_k~ (?)(mx-k) (?)p_k~-(?)(k-mx), where m≥2 is an integer.Based on the positive mask {p_k~ } and negative mask {p_k~-},the conditions that guarantee the above equation has compactly distributional solutions or L~2-stable solutions are established.Furthermore,the condition that the L~2-stable solution of the above equation can generate a two-direction MRA is given.The support interval of (?)(x) is discussed amply.The definition of orthogonal two-direction refinable function and orthogonal two-direction wavelets is presented,and the orthogonality criteria for two-direction refinable functions are established.An algorithm for construct- ing orthogonal two-direction refinable functions and their two-direction wavelets is presented.Another construction algorithm for two-direction L~2-refinable functions,which have nonnegative symbol masks and possess high approximation order and regularity,is presented.Finally,two construction examples are given.     

A class of multiwavelets and projected frames from two-direction wavelets

This article aims at studying two-direction refinable functions and two-direction wavelets in the setting ?^s, s > 1. We give a sufficient condition for a two-direction refinable function belonging to L²(?^s). Then, two theorems are given for constructing biorthogonal (orthogonal) two-direction refinable functions in L²(?^s) and their biorthogonal (orthogonal) two-direction wavelets, respectively. From the constructed biorthogonal (orthogonal) two-direction wavelets, symmetric biorthogonal (orthogonal) multiwaveles in L²(?^s can be obtained easily. Applying the projection method to biorthogonal (orthogonal) two-direction wavelets in L²(?^s, we can get dual (tight) two-direction wavelet frames in L²(?^m, where. m ≥ s From the projected dual (tight) two-direction wavelet frames in L²(?^m, symmetric dual (tight) frames in L²(?^m can be obtained easily. In the end, an example is given to illustrate theoretical results.     

Raising approximation order of refinable vector by increasing multiplicity

An algorithm is presented for raising an approximation order of any given orthogonal multiscaling function with the dilation factor a. Let φ(x) = [φ1(x),φ2(x),…,φr(x)]T be an orthogonal multiscaling function with the dilation factor a and the approximation order m. We can construct a new orthogonal multiscaling function φnew(x) = [ φT(x). f3r 1(x),φr 2(x),…,φr s(x)}T with the approximation order m L(L ∈ Z ). In other words, we raise the approximation order of multiscaling function φ(x) by increasing its multiplicity. In addition, we discuss an especial setting. That is, if given an orthogonal multiscaling function φ(x) = [φ1 (x), φ2(x), …, φr(x)]T is symmetric, then the new orthogonal multiscaling function φnew(x) not only raise the approximation order but also preserve symmetry. Finally, some examples are given.     

Multiwavelet Frames from Refinable Function Vectors

Starting from any two compactly supported d-refinable function vectors in (L ₂(R)) ^r with multiplicity r and dilation factor d, we show that it is always possible to construct 2rd wavelet functions with compact support such that they generate a pair of dual d-wavelet frames in L ₂(R) and they achieve the best possible orders of vanishing moments. When all the components of the two real-valued d-refinable function vectors are either symmetric or antisymmetric with their symmetry centers differing by half integers, such 2rd wavelet functions, which generate a pair of dual d-wavelet frames, can be real-valued and be either symmetric or antisymmetric with the same symmetry center. Wavelet frames from any d-refinable function vector are also considered. This paper generalizes the work in [5,12,13] on constructing dual wavelet frames from scalar refinable functions to the multiwavelet case. Examples are provided to illustrate the construction in this paper.     

Regularity of multiwavelets

The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L _p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.     

Totally interpolating biorthogonal multiwavelet systems with approximation order

In this article, compactly supported totally interpolating biorthogonal multiwavelet systems are studied. Necessary and sufficient conditions for such systems to have given approximation orders are stated in simple equations. It is shown that the shorter nontrivial filter component that has the minimum possible length for a given approximation order is uniquely determined up to a discrete parameter. Among systems with such property, we provide all totally interpolating biorthogonal stable multiwavelet systems of approximation orders 2 and 3 with minimal total length whose scaling vectors have minimal lengths as well.     

基于二次函数光滑化逼近的修正低阶罚函数

针对不等式约束优化问题, 给出了通过二次函数对低阶精确罚函数进行光滑化逼近的两种函数形式, 得到修正的光滑罚函数. 证明了在一定条件下, 当罚参数充分大, 修正的光滑罚问题的全局最优解是原优化问题的全局最优解. 给出的两个数值例子说明了所提出的光滑化方法的有效性.     

Multivariate matrix refinable functions with arbitrary matrix dilation

Characterizations of the stability and orthonormality of a multivariate matrix refinable function with arbitrary matrix dilation are provided in terms of the eigenvalue and -eigenvector properties of the restricted transition operator. Under mild conditions, it is shown that the approximation order of is equivalent to the order of the vanishing moment conditions of the matrix refinement mask . The restricted transition operator associated with the matrix refinement mask is represented by a finite matrix , with and being the Kronecker product of matrices and . The spectral properties of the transition operator are studied. The Sobolev regularity estimate of a matrix refinable function is given in terms of the spectral radius of the restricted transition operator to an invariant subspace. This estimate is analyzed in an example.

     

The approximation order of polysplines

We show that the scaling spaces defined by the polysplines of order provide approximation order For that purpose we refine the results on one-dimensional approximation order by -splines obtained by de Boor, DeVore, and Ron (1994).

     

一种神经网络算子及其逼近阶估计

讨论了一种神经网络算子f_n(x)=sum from -n~2 to n~2 (f(k/n))/(n~α)b(n~(1-α)(x-k/n)),对f(x)的逼近误差|f_n(x)-f(x)|的上界在f(x)为连续和N阶连续可导两种情形下分别给出了该网络算子逼近的Jackson型估计.     

Polynomial interpolation, ideals and approximation order of multivariate refinable functions

The paper identifies the multivariate analog of factorization properties of univariate masks for compactly supported refinable functions, that is, the ``zero at '-property, as containment of the mask polynomial in an appropriate quotient ideal. In addition, some of these quotient ideals are given explicitly.

     

Limitations of frequency domain approximation for detecting chaos in fractional order systems

In this paper, we analytically study the influences of using frequency domain approximation in numerical simulations of fractional order systems. The number and location of equilibria, and also the stability of these points, are compared between the original system and its frequency based approximated counterpart. It is shown that the original system and its approximation are not necessarily equivalent according to the number, location and stability of the fixed points. This problem can cause erroneous results in special cases. For instance, to prove the existence of chaos in fractional order systems, numerical simulations have been largely based on frequency domain approximations, but in this paper we show that this method is not always reliable for detecting chaos. This approximation can numerically demonstrate chaos in the non-chaotic fractional order systems, or eliminate chaotic behavior from a chaotic fractional order system.     

A class of compactly supported orthogonal symmetric complex wavelets with dilation factor 3

When approximation order is an odd positive integer a simple method is given to construct compactly supported orthogonal symmetric complex scaling function with dilation factor 3. Two corresponding orthogonal wavelets, one is symmetric and the other is antisymmetric about origin, are constructed explicitly. Additionally, when approximation order is an even integer 2, we also give a method to construct compactly supported orthogonal symmetric complex wavelets. In the end, there are several examples that illustrate the corresponding results.     

On lower bounds in radial basis approximation

We investigate the approximation by manifolds _n() generated by linear combinations of n radial basis functions on R^d of the form (|–a|), where is the thin-plate spline type function. We obtain exact asymptotic estimates for the approximation of Sobolev classes W^r(B^d) in the space L(B^d) on the unit ball B^d. AMS subject classification 41A25, 41A63, 65D07, 41A15     

三系数有限元向量尺度函数的构造

The aim of this paper is to present construction of finite element multiscaling function with three coefficients. In order to illuminate the result, two examples are given finally.     

基于散乱阈值结点的周期神经网络的逼近阶

§1Introduction Inrecentyearstherehasbeengrowinginterestintheproblemofneuralnetworkand relatedapproximation,manyimportantresultsareobtained.Becauseofitsabilityof parallelcomputationinlargescaleandofperfectself-adaptingandapproximation,the neuralnetworkhasbeenwidelyapplied.Theapproximationabilityoftheneuralnetwork dependsonitstopologicalstructure.LetRsbeans-dimensionalEuclidSpaceand(x)isa realfunctiondefinedonRs.When(x)isanexcitationfunctionandx∈Rsisaninput vector,thesimpleneuralnetwork…     

Optimal appointment scheduling in continuous time: The lag order approximation method

We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within reasonable computation times. Therefore, we develop the lag order approximation method, that sets the client’s optimal appointment time based on only a part of his predecessors. We show that a lag order of two, i.e., taking two predecessors into account, results in nearly optimal schedules within reasonable computation times. We illustrate our approximation method with an appointment scheduling problem in a CT-scan area.     

Renormalization group second‐order approximation for singularly perturbed nonlinear ordinary differential equations

We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ²). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics.