Numerical Solution of Nonlinear System of Partial Differential Equations by the Laplace Decomposition Method and the Pade Approximation

In this paper, Laplace decomposition method (LDM) and Pade approximant are employed to find approximate solutions for the Whitham-Broer-Kaup shallow water model, the coupled nonlinear reaction diffusion equations and the system of Hirota-Satsuma coupled KdV. In addition, the results obtained from Laplace decomposition method (LDM) and Pade approximant are compared with corresponding exact analytical solutions.

Stochastic Approximation Method for Fixed Point Problems

We study iterative processes of stochastic approximation for finding fixed points of weakly contractive and nonexpansive operators in Hilbert spaces under the condition that operators are given with random errors. We prove mean square convergence and convergence almost sure (a.s.) of iterative approximations and establish both asymptotic and nonasymptotic estimates of the convergence rate in degenerate and non-degenerate cases. Previously the stochastic approximation algorithms were studied mainly for optimization problems.

Expansion of the Decoupled Discreet-Time Jacobian Eigenvalue Approximation for Model-Free Analysis of PMU Data

This paper proposes an extension of the algorithm in [1], as well as utilization of the wavelet transform in event detection, including High Impedance Fault (HIF). Techniques to analyze the abundant data of PMUs quickly and effectively are paramount to increasing response time to events and unstable parameters. With the amount of data PMUs output, unstable parameters, tie line oscillations, and HIFs are often overlooked in the bulk of the data. This paper explores model-free techniques to attain stability information and determine events in real-time. When full system connectivity is unknown, many traditional methods requiring other bus measurements can be impossible or computationally extensive to apply. The traditional method of interest is analyzing the power flow Jacobian for singularities and system weak points, attained by applying singular value decomposition. This paper further develops upon the approach in [1] to expand the Discrete-Time Jacobian Eigenvalue Approximation (DDJEA), giving values to significant off-diagonal terms while establishing a generalized connectivity between correlated buses. Statistical linear models are applied over large data sets to prove significance to each term. Then the off diagonal terms are given time-varying weights to account for changes in topology or sensitivity to events using a reduced system model. The results of this novel method are compared to the present errors of the previous publication in order to quantify the degree of improvement that this novel method imposes. The effective bus eigenvalues are briefly compared to Prony analysis to check similarities. An additional application for biorthogonal wavelets is also introduced to detect event types, including the HIF, for PMU data.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

Numerical Solution of Mean-Square Approximation Problem of Real Nonnegative Function by the Modulus of Double Fourier Integral

A nonlinear problem of mean-square approximation of a real nonnegative continuous function with respect to two variables by the modulus of double Fourier integral dependent on two real parameters with use of the smoothing functional is studied. Finding the optimal solutions of this problem is reduced to solution of the Hammerstein type two-dimensional nonlinear integral equation. The numerical algorithms to find the branching lines and branching-off solutions of this equation are constructed and justified. Numerical examples are presented.

Gamma Approximation Based Multi-Antenna Covert Communication Detection

Covert communication technology makes wireless communication more secure,but it also provides more opportunities for illegal users to transmit harmful information.In order to detect the illegal covert communication of the lawbreakers in real time for subsequent processing,this paper proposes a Gamma approximation-based detection method for multi-antenna covert communication systems.Specifically,the Gamma approximation property is used to calculate the miss detection rate and false alarm rate of the monitor firstly.Then the optimization problem to minimize the sum of the missed detection rate and the false alarm rate is proposed.The optimal detection threshold and the minimum error detection probability are solved according to the properties of the Lambert W function.Finally,simulation results are given to demonstrate the effectiveness of the proposed method.

An Approach to Continuous Approximation of Pareto Front Using Geometric Support Vector Regression for Multi-objective Optimization of Fermentation Process

The approaches to discrete approximation of Pareto front using multi-objective evolutionary algorithms have the problems of heavy computation burden, long running time and missing Pareto optimal points. In order to overcome these problems, an approach to continuous approximation of Pareto front using geometric support vector regression is presented. The regression model of the small size approximate discrete Pareto front is constructed by geometric support vector regression modeling and is described as the approximate continuous Pareto front. In the process of geometric support vector regression modeling, considering the distribution characteristic of Pareto optimal points, the separable augmented training sample sets are constructed by shifting original training sample points along multiple coordinated axes. Besides, an interactive decision-making(DM)procedure, in which the continuous approximation of Pareto front and decision-making is performed interactively, is designed for improving the accuracy of the preferred Pareto optimal point. The correctness of the continuous approximation of Pareto front is demonstrated with a typical multi-objective optimization problem. In addition,combined with the interactive decision-making procedure, the continuous approximation of Pareto front is applied in the multi-objective optimization for an industrial fed-batch yeast fermentation process. The experimental results show that the generated approximate continuous Pareto front has good accuracy and completeness. Compared with the multi-objective evolutionary algorithm with large size population, a more accurate preferred Pareto optimal point can be obtained from the approximate continuous Pareto front with less computation and shorter running time. The operation strategy corresponding to the final preferred Pareto optimal point generated by the interactive DM procedure can improve the production indexes of the fermentation process effectively.

Degree of Approximation of Conjugate of Signals (Functions) by Lower Triangular Matrix Operator

In the present paper, an attempt is made to obtain the degree of approximation of conjugate of functions (signals) belonging to the generalized weighted W(LP, ξ(t)), (p ≥ 1)-class, by using lower triangular matrix operator of conjugate series of its Fourier series.

CHEBYSHEV APPROXIMATION BY FUNCTIONS HAVING RESTRICTED RANGES WITH EQUALITIES

In this paper, we establish a new type of alternation theory for more general restricted ranges Chebyshev approximation with equalities. The uniqueness and strong uniqueness theorems are given. Applying the results, we obtain the alternation theorem and uniqueness theorem for best coposilive approximation.

ON CURVED SURFACE APPROXIMATION AND HIDDEN SURFACE ELIMINATION IN 3-D COMPUTER AIDED GARMENT DESIGN

An approximation method for curved surface mannequin and hidden surface eliminationin 3-D computer aided garment design system is described. The mannequin is the basis of the3-D modeling for clothes. In terms of the requirements of computer aided garment design,the authors put forward a method for curved surface approximation in the meaning of leastsquares. Using. this method the computation of geometric modeling is simple andefficient. It is also convenient for curved surface modification and shading.

An Approximation Method for a Maximum Likelihood Equation System and Application to the Analysis of Accidents Data

There exist many iterative methods for computing the maximum likelihood estimator but most of them suffer from one or several drawbacks such as the need to inverse a Hessian matrix and the need to find good initial approximations of the parameters that are unknown in practice. In this paper, we present an estimation method without matrix inversion based on a linear approximation of the likelihood equations in a neighborhood of the constrained maximum likelihood estimator. We obtain closed-form approximations of solutions and standard errors. Then, we propose an iterative algorithm which cycles through the components of the vector parameter and updates one component at a time. The initial solution, which is necessary to start the iterative procedure, is automated. The proposed algorithm is compared to some of the best iterative optimization algorithms available on R and MATLAB software through a simulation study and applied to the statistical analysis of a road safety measure.

Improved QoS-Secure Routing in MANET Using Real-Time Regional ME Feature Approximation

Mobile Ad-hoc Network(MANET)routing problems are thoroughly studied several approaches are identified in support of MANET.Improve the Quality of Service(QoS)performance of MANET is achieving higher performance.To reduce this drawback,this paper proposes a new secure routing algorithm based on real-time partial ME(Mobility,energy)approximation.The routing method RRME(Real-time Regional Mobility Energy)divides the whole network into several parts,and each node’s various characteristics like mobility and energy are randomly selected neighbors accordingly.It is done in the path discovery phase,estimated to identify and remove malicious nodes.In addition,Trusted Forwarding Factor(TFF)calculates the various nodes based on historical records and other characteristics of multiple nodes.Similarly,the calculated QoS Support Factor(QoSSF)calculating by the Data Forwarding Support(DFS),Throughput Support(TS),and Lifetime Maximization Support(LMS)to any given path.One route was found to implement the path of maximizing MANET QoS based on QoSSF value.Hence the proposed technique produces the QoS based on real-time regional ME feature approximation.The proposed simulation implementation is done by the Network Simulator version 2(NS2)tool to produce better performance than other methods.It achieved a throughput performance had 98.5%and a routing performance had 98.2%.

Approximation of Finite Population Totals Using Lagrange Polynomial

Approximation of finite population totals in the presence of auxiliary information is considered. A polynomial based on Lagrange polynomial is proposed. Like the local polynomial regression, Horvitz Thompson and ratio estimators, this approximation technique is based on annual population total in order to fit in the best approximating polynomial within a given period of time (years) in this study. This proposed technique has shown to be unbiased under a linear polynomial. The use of real data indicated that the polynomial is efficient and can approximate properly even when the data is unevenly spaced.

Truncated sparse approximation property and truncated q-norm minimization

This paper considers approximately sparse signal and low-rank matrix’s recovery via truncated norm minimization minx∥xT∥q and minX∥XT∥Sq from noisy measurements.We first introduce truncated sparse approximation property,a more general robust null space property,and establish the stable recovery of signals and matrices under the truncated sparse approximation property.We also explore the relationship between the restricted isometry property and truncated sparse approximation property.And we also prove that if a measurement matrix A or linear map A satisfies truncated sparse approximation property of order k,then the first inequality in restricted isometry property of order k and of order 2k can hold for certain different constantsδk andδ2k,respectively.Last,we show that ifδs(k+|T^c|)<√(s-1)/s for some s≥4/3,then measurement matrix A and linear map A satisfy truncated sparse approximation property of order k.It should be pointed out that when Tc=Ф,our conclusion implies that sparse approximation property of order k is weaker than restricted isometry property of order sk.

Computing Approximation GCD of Several Polynomials by Structured Total Least Norm

The task of determining the greatest common divisors (GCD) for several polynomials which arises in image compression, computer algebra and speech encoding can be formulated as a low rank approximation problem with Sylvester matrix. This paper demonstrates a method based on structured total least norm (STLN) algorithm for matrices with Sylvester structure. We demonstrate the algorithm to compute an approximate GCD. Both the theoretical analysis and the computational results show that the method is feasible.

Determining Hubbard U of VO_(2) by the quasi-harmonic approximation

Vanadium dioxide VO_(2) is a strongly correlated material that undergoes a metal-to-insulator transition around 340 K.In order to describe the electron correlation effects in VO_(2), the DFT+U method is commonly employed in calculations.However, the choice of the Hubbard U parameter has been a subject of debate and its value has been reported over a wide range. In this paper, taking focus on the phase transition behavior of VO_(2), the Hubbard U parameter for vanadium oxide is determined by using the quasi-harmonic approximation(QHA). First-principles calculations demonstrate that the phase transition temperature can be modulated by varying the U values. The phase transition temperature can be well reproduced by the calculations using the Perdew–Burke–Ernzerhof functional combined with the U parameter of 1.5eV. Additionally,the calculated band structure, insulating or metallic properties, and phonon dispersion with this U value are in line with experimental observations. By employing the QHA to determine the Hubbard U parameter, this study provides valuable insights into the phase transition behavior of VO_(2). The findings highlight the importance of electron correlation effects in accurately describing the properties of this material. The agreement between the calculated results and experimental observations further validates the chosen U value and supports the use of the DFT+U method in studying VO_(2).

Relaxed Stability Criteria for Time-Delay Systems:A Novel Quadratic Function Convex Approximation Approach

This paper develops a quadratic function convex approximation approach to deal with the negative definite problem of the quadratic function induced by stability analysis of linear systems with time-varying delays.By introducing two adjustable parameters and two free variables,a novel convex function greater than or equal to the quadratic function is constructed,regardless of the sign of the coefficient in the quadratic term.The developed lemma can also be degenerated into the existing quadratic function negative-determination(QFND)lemma and relaxed QFND lemma respectively,by setting two adjustable parameters and two free variables as some particular values.Moreover,for a linear system with time-varying delays,a relaxed stability criterion is established via our developed lemma,together with the quivalent reciprocal combination technique and the Bessel-Legendre inequality.As a result,the conservatism can be reduced via the proposed approach in the context of constructing Lyapunov-Krasovskii functionals for the stability analysis of linear time-varying delay systems.Finally,the superiority of our results is illustrated through three numerical examples.

An Overview of Sequential Approximation in Topology Optimization of Continuum Structure

This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.

THE SARD BEST APPROXIMATION OF LINEAR FUNCTIONAL

In numerical analysis, it is significant to approximate the linear functional Ef=sum from i=0 to m-1([integral from a to b(a1（x）f1（x）dx+ sum from f=0 to i1(b1f1（x1）)]) by a simpler linear functional Lf=sum from i=1 to m（a1f（x1）） In this paper, making use of natural Tchebysheff spline function, we give existence theorem and uniqueness theorem of L that is exact for the degree m to F; we also give three sufficient and necessary conditions in which L is the Sard best approximation to F.

Theoretical analysis of pilotless frame synchronization for LDPC code using Gaussian approximation

The pilotless frame synchronization approach and implementations of LDPC code are the crucial issue of LDPC decoder. The Maximum-A-Posteriori probability( MAP) decoder has a perfect frame synchronization error rate( FSER) performance. In this paper,a theoretical derivation of the FSER performance of pilotless frame synchronization for LDPC code is presented. The FSER performance by theoretical analysis coincides well with that by simulation in additive white Gaussian channel and Rician fading channel. So it is estimated the FSER performance of an LDPC code by theoretical analysis can be used instead of the simulations which are much more time-consuming.