A Sparse Kernel Approximate Method for Fractional Boundary Value Problems

In this paper,the weak pre-orthogonal adaptive Fourier decomposition(W-POAFD)method is applied to solve fractional boundary value problems(FBVPs)in the reproducing kernel Hilbert spaces(RKHSs)W_(0)^(4)[0,1] and W^(1)[0,1].The process of the W-POAFD is as follows:(i)choose a dictionary and implement the pre-orthogonalization to all the dictionary elements;(ii)select points in[0,1]by the weak maximal selection principle to determine the corresponding orthonormalized dictionary elements iteratively;(iii)express the analytical solution as a linear combination of these determined dictionary elements.Convergence properties of numerical solutions are also discussed.The numerical experiments are carried out to illustrate the accuracy and efficiency of W-POAFD for solving FBVPs.

Positive-instantaneous frequency and approximation

Positive-instantaneous frequency representation for transient signals has always been a great concern due to its theoretical and practical importance,although the involved concept itself is paradoxical.The desire and practice of uniqueness of such frequency representation(decomposition)raise the related topics in approximation.During approximately the last two decades there has formulated a signal decomposition and reconstruction method rooted in harmonic and complex analysis giving rise to the desired signal representations.The method decomposes any signal into a few basic signals that possess positive instantaneous frequencies.The theory has profound relations to classical mathematics and can be generalized to signals defined in higher dimensional manifolds with vector and matrix values,and in particular,promotes kernel approximation for multi-variate functions.This article mainly serves as a survey.It also gives two important technical proofs of which one for a general convergence result(Theorem 3.4),and the other for necessity of multiple kernel(Lemma 3.7).Expositorily,for a given real-valued signal f one can associate it with a Hardy space function F whose real part coincides with f.Such function F has the form F=f+iHf,where H stands for the Hilbert transformation of the context.We develop fast converging expansions of F in orthogonal terms of the form F=∑k=1^(∞)c_(k)B_(k),where B_(k)'s are also Hardy space functions but with the additional properties B_(k)(t)=ρ_(k)(t)e^(iθ_(k)(t)),ρk≥0,θ′_(k)(t)≥0,a.e.The original real-valued function f is accordingly expanded f=∑k=1^(∞)ρ_(k)(t)cosθ_(k)(t)which,besides the properties ofρ_(k)andθ_(k)given above,also satisfies H(ρ_(k)cosθ_(k))(t)ρ_(k)(t)sinρ_(k)(t).Real-valued functions f(t)=ρ(t)cosθ(t)that satisfy the conditionρ≥0,θ′(t)≥0,H(ρcosθ)(t)=ρ(t)sinθ(t)are called mono-components.If f is a mono-component,then the phase derivativeθ′(t)is defined to be instantaneous frequency of f.The above described positive-instantaneous frequency expansion is a generalization of the Fourier series expansion.Mono-components are crucial to understand the concept instantaneous frequency.We will present several most important mono-component function classes.Decompositions of signals into mono-components are called adaptive Fourier decompositions(AFDs).Wc note that some scopes of the studies on the ID mono-components and AFDs can be extended to vector-valued or even matrix-valued signals defined on higher dimensional manifolds.We finally provide an account of related studies in pure and applied mathematics.