A STUDY ON THE WEIGHT FUNCTION OF THE MOVING LEAST SQUARE APPROXIMATION IN THE LOCAL BOUNDARY INTEGRAL EQUATION METHOD

The meshless method is a new numerical technique presented in recent years.It uses the moving least square(MLS)approximation as a shape function.The smoothness of the MLS approximation is determined by that of the basic function and of the weight function,and is mainly determined by that of the weight function.Therefore,the weight function greatly affects the accuracy of results obtained.Different kinds of weight functions,such as the spline function, the Gauss function and so on,are proposed recently by many researchers.In the present work,the features of various weight functions are illustrated through solving elasto-static problems using the local boundary integral equation method.The effect of various weight functions on the accuracy, convergence and stability of results obtained is also discussed.Examples show that the weight function proposed by Zhou Weiyuan and Gauss and the quartic spline weight function are better than the others if parameters c and α in Gauss and exponential weight functions are in the range of reasonable values,respectively,and the higher the smoothness of the weight function,the better the features of the solutions.

On the Method of Multiplier-enlargement and Approximation of Unbounded Continuous Functions

By combining the classical appropriate functions “1, x, x 2” with the method of multiplier enlargement, this paper establishes a theorem to approximate any unbounded continuous functions with modified positive linear operators. As an example, Hermite Fejér interpolation polynomial operators are analysed and studied, and a general conclusion is obtained.

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.

APPROXIMATION OF SOLUTION OF LINEAR DIFFERENTIAL EQUATION WITH ALMOST PERIOD FUNCTION COEFFICIENTS

This paper is devoted to the study of approximation of the solution for the differential equation whose coefficients are almost period functions. To this end the authors establish the estimation of the solution of general linear differential equation for infinite interval case. For finite interval case, this equation was investigated by G. Tamarkin([1]) applying the Picard method of successive approximation.

A constructive method for approximating trigonometric functions and their integrals

This paper presents an interpolation-based method(IBM)for approximating some trigonometric functions or their integrals as well.It provides two-sided bounds for each function,which also achieves much better approximation effects than those of prevailing methods.In principle,the IBM can be applied for bounding more bounded smooth functions and their integrals as well,and its applications include approximating the integral of sin(x)/x function and improving the famous square root inequalities.

Asymptotic Approximation of the Eigenvalues and the Eigenfunctions for the Orr-Sommerfeld Equation on Infinite Intervals

Asymptotic eigenvalues and eigenfunctions for the Orr-Sommerfeld equation in two-dimensional and three-dimensional incompressible flows on an infinite domain and on a semi-infinite domain are obtained. Two configurations are considered, one in which a short-wave limit approximation is used, and another in which a long-wave limit approximation is used. In the short-wave limit, Wentzel-Kramers-Brillouin (WKB) methods are utilized to estimate the eigenvalues, and the eigenfunctions are approximated in terms of Green’s functions. The procedure consists of transforming the Orr-Sommerfeld equation into a system of two second order ordinary differential equations for which the eigenvalues and the eigenfunctions can be approximated. In the long-wave limit approximation, solutions are expressed in terms of generalized hypergeometric functions. Our procedure works regardless of the values of the Reynolds number.

On Approximation of Nonbounded Continuous Functions

This paper generalizes the basic principle of multiplier-enlargement approach to approximating any nonbounded continuous functions with positive linear operators, and as an example, Bernstein polynomial operators are analysed and studied. This paper gives a certain theorem as a general rule to approximate any nonbounded continuous functions.

TWO-LEVEL METHOD FOR UNSTEADY NAVIER-STOKES EQUATIONS IN STREAM FUNCTION FORM

Two-level finite element approximation to stream function form of unsteady Navier-Stokes equations is studied.This algorithm involves solving one nonlinear system on a coarse grid and one linear problem on a fine grid.Moreover,the scaling between these two grid sizes is super-linear.Approximation,stability and convergence aspects of a fully discrete scheme are analyzed.At last a numrical example is given whose results show that the algorithm proposed in this paper is effcient.

Local Galerkin Method for the Approximate Solutions to General FPK Equations

In this paper, the method proposed recently by the author for the solution of probability density function (PDF) of nonlinear stochastic systems is presented in detail and extended for more general problems of stochastic differential equations (SDE), therefore the Fokker Planck Kolmogorov (FPK) equation is expressed in general form with no limitation on the degree of nonlinearity of the SDE, the type of δ correlated excitations, the existence of multiplicative excitations, and the dimension of SDE or FPK equation. Examples are given and numerical results are provided for comparing with known exact solution to show the effectiveness of the method.

Multilevel Characteristic Basis Function Method with ACA for Accelerated Solution of Electrically Large Scattering Problems

The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is time-consuming.In reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated efficiently.Therefore,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this study.Numerical results are given to demonstrate the accuracy and efficiency of the method.

Magnetic Properties of One-Dimensional Ferromagnetic Mixed-Spin Model within Tyablikov Decoupling Approximation

In this paper, we apply the two-time Green's function method, and provide a simple way to study themagnetic properties of one-dimensional spin-(S, s) Heisenberg ferromagnets.The magnetic susceptibility and correlationfunctions are obtained by using the Tyablikov decoupling approximation.Our results show that the magnetic susceptibilityand correlation length are a monotonically decreasing function of temperature regardless of the mixed spins.It isfound that in the case of S = s, our results of one-dimensional mixed-spin model is reduced to be those of the isotropicferromagnetic Heisenberg chain in the whole temperature region.Our results for the susceptibility are in agreement withthose obtained by other theoretical approaches.

Galerkin Method for Numerical Solution of Volterra Integro-Differential Equations with Certain Orthogonal Basis Function

This paper concerns the implementation of the orthogonal polynomials using the Galerkin method for solving Volterra integro-differential and Fredholm integro-differential equations. The constructed orthogonal polynomials are used as basis functions in the assumed solution employed. Numerical examples for some selected problems are provided and the results obtained show that the Galerkin method with orthogonal polynomials as basis functions performed creditably well in terms of absolute errors obtained.

APPROXIMATION RATES OF ERROR DISTRIBUTION OF DOUBLE KERNEL ESTIMATES OF CONDITIONAL DENSITY

In this paper, the normal approximation rate and the random weighting approximation rate of error distribution of the kernel estimator of conditional density function f(y|x) are studied. The results may be used to construct the confidence interval of f(y|x) .

Three-dimensional gravity inversion based on sparse recovery iteration using approximate zero norm

This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zero norm solution. The inversion approach mainly employs forward modeling; a depth weight function is introduced into the objective function of the zero norms. Sparse inversion results are obtained by the corresponding optimal mathematical method. To achieve the practical geophysical and geological significance of the results, penalty function is applied to constrain the density values. Results obtained by proposed provide clear boundary depth and density contrast distribution information. The method's accuracy, validity, and reliability are verified by comparing its results with those of synthetic models. To further explain its reliability, a practical gravity data is obtained for a region in Texas, USA is applied. Inversion results for this region are compared with those of previous studies, including a research of logging data in the same area. The depth of salt dome obtained by the inversion method is 4.2 km, which is in good agreement with the 4.4 km value from the logging data. From this, the practicality of the inversion method is also validated.

The improved element-free Galerkin method forthree-dimensional wave equation

The paper presents the improved element-free Galerkin （IEFG） method for three-dimensional wave propa- gation. The improved moving least-squares （IMLS） approx- imation is employed to construct the shape function, which uses an orthogonal function system with a weight function as the basis function. Compared with the conventional moving least-squares （MLS） approximation, the algebraic equation system in the IMLS approximation is not ill-conditioned, and can be solved directly without deriving the inverse matrix. Because there are fewer coefficients in the IMLS than in the MLS approximation, fewer nodes are selected in the IEFG method than in the element-free Galerkin method. Thus, the IEFG method has a higher computing speed. In the IEFG method, the Galerkin weak form is employed to obtain a dis- cretized system equation, and the penalty method is applied to impose the essential boundary condition. The traditional difference method for two-point boundary value problems is selected for the time discretization. As the wave equations and the boundary-initial conditions depend on time, the scal- ing parameter, number of nodes and the time step length are considered for the convergence study.

Strong Approximation Method and the(Functional)Law of Iterated Logarithm for GI/G/1 Queue

In this paper, a unified method based on the strong approximation(SA) of renewal process(RP) is developed for the law of the iterated logarithm(LIL) and the functional LIL(FLIL), which quantify the magnitude of the asymptotic rate of the increasing variability around the mean value of the RP in numerical and functional forms respectively. For the GI/G/1 queue, the method provides a complete analysis for both the LIL and the FLIL limits for four performance functions: The queue length, workload, busy time and idle time processes, covering three regimes divided by the traffic intensity.

An Adaptive Learning Method for the Generation of Fuzzy Inference System from Data

Designing a fuzzy inference system(FIS)from data can be divided into two main phases:structure identification and parameter optimization.First,starting from a simple initial topology,the membership functions and system rules are defined as specific structures.Second,to speed up the convergence of the learning algorithm and lighten the oscillation,an improved descent method for FIS generation is developed.Furthermore, the convergence and the oscillation of the algorithm are system- atically analyzed.Third,using the information obtained from the previous phase,it can be decided in which region of the in- put space the density of fuzzy rules should be enhanced and for which variable the number of fuzzy sets that used to partition the domain must be increased.Consequently,this produces a new and more appropriate structure.Finally,the proposed method is applied to the problem of nonlinear function approximation.

Study on tapered crossed subwavelength gratings by Fourier modal method

Fourier modal method incorporating staircase approximation is used to study tapered crossed subwavelength gratings in this paper. Three intuitive formulations of eigenvalue functions originating from the prototype are presented, and their convergences are compared through numerical calculation. One of them is found to be suitable in modeling the diffraction efficiency of the circular tapered crossed subwavelength gratings without high absorption, and staircase approximation is further proven valid for non-highly-absorptive tapered gratings. This approach is used to simulate the ＂moth-eye＂ antireflection surface on silicon, and the numerical result agrees well with the experimental one.

Intensity Correlation Function of a Single-Mode Laser Driven by Colored Cross-Correlation Noises in Modulation of a Bias Signal

By using the linear approximation method, the intensity correlation function is calculated for a single-mode laser modulated by a bias signal and driven by colored pump and quantum noises with colored cross-correlation. We found that, when the correlation time between the two noises is very short, the behavior of the intensity correlation function versus the time, in addition to decreasing monotonously, also exhibits several cases, such as one maximum, one minimum, and two extrema. When the correlation time between the two noises is very long, the behavior of the intensity correlation function exhibits oscillation and the envelope is similar to the case of short cross-correlation time.

An effective method to calculate the electron impact excitation cross sections of helium from ground state to a final channel in the whole energy region

The electron impact excitation(EIE) cross sections of an atom/ion in the whole energy region are needed in many research fields, such as astrophysics studies, inertial confinement fusion researches and so on. In the present work, an effective method to calculate the EIE cross sections of an atom/ion in the whole energy region is presented. We use the EIE cross sections of helium as an illustration example. The optical forbidden 1^(1)S–n^(1)S(n = 2–4) and optical allowed 1^(1)S–n^(1)P(n = 2–4) excitation cross sections are calculated in the whole energy region using the scheme that combines the partial wave R-matrix method and the first Born approximation. The calculated cross sections are in good agreement with the available experimental measurements. Based on these accurate cross sections of our calculation, we find that the ratios between the accurate cross sections and Born cross sections are nearly the same for different excitation final states in the same channel. According to this interesting property, a universal correction function is proposed and given to calculate the accurate EIE cross sections with the same computational efforts of the widely used Born cross sections,which should be very useful in the related application fields. The datasets presented in this paper are openly available at https://www.doi.org/10.57760/sciencedb.j00113.00142.