Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N）...Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.展开更多
This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of func...This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.展开更多
A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the error estimate is g...A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the error estimate is given, which shows that the same order of accuracy can be achieved as solving the system directly in the fine mesh when h = H2. Both theoretical analysis and numerical experiments illustrate the efficiency of the algorithm for solving the coupled problem.展开更多
This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and s...This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and second orders instead of the derivatives of (1).展开更多
Spatially fractional order diffusion equations are generalizations of classical diffusion equations which are increasingly used in modeling practical super diffusive problems in fluid flow, finance and others areas of...Spatially fractional order diffusion equations are generalizations of classical diffusion equations which are increasingly used in modeling practical super diffusive problems in fluid flow, finance and others areas of application. This paper presents the analytical solutions of the space fractional diffusion equations by variational iteration method (VIM). By using initial conditions, the explicit solutions of the equations have been presented in the closed form. Two examples, the first one is one-dimensional and the second one is two-dimensional fractional diffusion equation, are presented to show the application of the present techniques. The present method performs extremely well in terms of efficiency and simplicity.展开更多
Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonst...Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonstrated. We present a theorem and its proof that confirms the possibility to obtain the finite process and imposes the requirement for the matrix of SLAE. This matrix must be unipotent, i.e. all its eigenvalues to be equal to 1. An example of transformation of SLAE given analytically to the form with a unipotent matrix is presented. It is shown that splitting the unipotent matrix into identity and nilpotent ones results in Cramer’s analytical formulas in a finite number of iterations.展开更多
In this paper, variational iteration method and He-Laplace method are used to solve the nonlinear ordinary and partial differential equations. Laplace transformation with the homotopy perturbation method is called He-...In this paper, variational iteration method and He-Laplace method are used to solve the nonlinear ordinary and partial differential equations. Laplace transformation with the homotopy perturbation method is called He-Laplace method. A comparison is made among variational iteration method and He-Laplace. It is shown that, in He-Laplace method, the nonlinear terms of differential equation can be easily handled by the use of He’s polynomials and provides better results.展开更多
In this paper, a user friendly algorithm based on the variational iteration method (VIM) is proposed to solve singular integral equations with generalized Abel’s kernel. It is observed that an approximate solutions y...In this paper, a user friendly algorithm based on the variational iteration method (VIM) is proposed to solve singular integral equations with generalized Abel’s kernel. It is observed that an approximate solutions yn(x) converges to the exact solution irrespective of the initial choice y0 (x). Illustrative numerical examples are given to demonstrate the efficiency and simplicity of the method in solving these types of singular integral equations.展开更多
In this paper, we consider two extended model equations for shallow water waves. We use He’s variational iteration method (VIM) to solve them. It is proved that this method is a very good tool for shallow water wave ...In this paper, we consider two extended model equations for shallow water waves. We use He’s variational iteration method (VIM) to solve them. It is proved that this method is a very good tool for shallow water wave equations and the obtained solutions are shown graphically.展开更多
For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describ...For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describes, an adaptation of Newton-Raphson method was used for solving the highly nonlinear system of equations describing the formation of equilibrium products in reacting of fuel-additive-air mixtures. This study also shows what possible of the results. In this paper, to be present the efficient numerical algorithms for. solving the combustion problem, to be used nonlinear equations based on the iteration method and high order of the Taylor series. The modified Adomian decomposition method was applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms. Comparisons of results by the new Matlab routines and previous routines, the result data indicate that the new Matlab routines are reliable, typical deviations from previous results are less than 0.05%.展开更多
This paper is concerned with the following fourth-order three-point boundary value problem , where , we discuss the existence of positive solutions to the above problem by applying to the fixed point theory in cones a...This paper is concerned with the following fourth-order three-point boundary value problem , where , we discuss the existence of positive solutions to the above problem by applying to the fixed point theory in cones and iterative technique.展开更多
Let{Xn;n≥1}be a sequence of i.i.d, random variables with finite variance,Q（n）be the related R/S statistics. It is proved that lim ε↓0 ε^2 ∑n=1 ^8 n log n/1 P{Q（n）≥ε√2n log log n}=2/1 EY^2,where Y=sup0≤t...Let{Xn;n≥1}be a sequence of i.i.d, random variables with finite variance,Q（n）be the related R/S statistics. It is proved that lim ε↓0 ε^2 ∑n=1 ^8 n log n/1 P{Q（n）≥ε√2n log log n}=2/1 EY^2,where Y=sup0≤t≤1B（t）-inf0≤t≤sB（t）,and B（t） is a Brownian bridge.展开更多
In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order...In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.展开更多
In this paper, we present and analyze modified families of predictor-corrector iterative methods for finding simple zeros of univariate nonlinear equations, permitting near the root. The main advantage of our methods ...In this paper, we present and analyze modified families of predictor-corrector iterative methods for finding simple zeros of univariate nonlinear equations, permitting near the root. The main advantage of our methods is that they perform better and moreover, have the same efficiency indices as that of existing multipoint iterative methods. Furthermore, the convergence analysis of the new methods is discussed and several examples are given to illustrate their efficiency.展开更多
In this paper we examine single-step iterative methods for the solution of the nonlinear algebraic equation f (x) = x2 - N = 0 , for some integer N, generating rational approximations p/q that are optimal in the sense...In this paper we examine single-step iterative methods for the solution of the nonlinear algebraic equation f (x) = x2 - N = 0 , for some integer N, generating rational approximations p/q that are optimal in the sense of Pell’s equation p2 - Nq2 = k for some integer k, converging either alternatingly or oppositely.展开更多
We study a spectrum sharing problem where multiple systems coexist and interfere with each other. First, an analysis is proposed for distributed spectrum sharing based on Prisoners' Dilemma (PD) in Cognitive Radio...We study a spectrum sharing problem where multiple systems coexist and interfere with each other. First, an analysis is proposed for distributed spectrum sharing based on Prisoners' Dilemma (PD) in Cognitive Radios (CRs). In one-shot game, selfish and rational CRs greedily full spread their own spectrum space in order to maximize their own rates, which leads to Nash Equilibrium (N.E.). But with long term interaction, i.e., Iterated Prisoner's Dilemma (IPD), CRs can come to cooperate and acquire the social optimal point by using different evolutionary strategies such as Tit For Tat (TFT), Generous TFT (GTFT), etc. Also we compare the performances of the different evolutionary strategies in noise-free and noisy environments for two-player games. Finally, N-player IPD (N-IPD) is simulated to verify our conclusions that TFT is a good strategy for spectrum sharing in CRs.展开更多
文摘Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.
文摘This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.
基金supported by National Foundation of Natural Science(11471092,11326231)Zhejiang Provincial Natural Science Foundation of China(LZ13A010003)
文摘A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the error estimate is given, which shows that the same order of accuracy can be achieved as solving the system directly in the fine mesh when h = H2. Both theoretical analysis and numerical experiments illustrate the efficiency of the algorithm for solving the coupled problem.
文摘This paper presents a new nonstationary iterative method for solving non linear algebraic equations that does not require the use of any derivative. The study uses only the Newton’s divided differences of first and second orders instead of the derivatives of (1).
文摘Spatially fractional order diffusion equations are generalizations of classical diffusion equations which are increasingly used in modeling practical super diffusive problems in fluid flow, finance and others areas of application. This paper presents the analytical solutions of the space fractional diffusion equations by variational iteration method (VIM). By using initial conditions, the explicit solutions of the equations have been presented in the closed form. Two examples, the first one is one-dimensional and the second one is two-dimensional fractional diffusion equation, are presented to show the application of the present techniques. The present method performs extremely well in terms of efficiency and simplicity.
文摘Contrary to the opinion about approximation nature of a simple-iteration method, the exact solution of a system of linear algebraic equations (SLAE) in a finite number of iterations with a stationary matrix is demonstrated. We present a theorem and its proof that confirms the possibility to obtain the finite process and imposes the requirement for the matrix of SLAE. This matrix must be unipotent, i.e. all its eigenvalues to be equal to 1. An example of transformation of SLAE given analytically to the form with a unipotent matrix is presented. It is shown that splitting the unipotent matrix into identity and nilpotent ones results in Cramer’s analytical formulas in a finite number of iterations.
文摘In this paper, variational iteration method and He-Laplace method are used to solve the nonlinear ordinary and partial differential equations. Laplace transformation with the homotopy perturbation method is called He-Laplace method. A comparison is made among variational iteration method and He-Laplace. It is shown that, in He-Laplace method, the nonlinear terms of differential equation can be easily handled by the use of He’s polynomials and provides better results.
文摘In this paper, a user friendly algorithm based on the variational iteration method (VIM) is proposed to solve singular integral equations with generalized Abel’s kernel. It is observed that an approximate solutions yn(x) converges to the exact solution irrespective of the initial choice y0 (x). Illustrative numerical examples are given to demonstrate the efficiency and simplicity of the method in solving these types of singular integral equations.
文摘In this paper, we consider two extended model equations for shallow water waves. We use He’s variational iteration method (VIM) to solve them. It is proved that this method is a very good tool for shallow water wave equations and the obtained solutions are shown graphically.
文摘For a specific combustion problem involving calculations of several species at the equilibrium state, it is simpler to write a general computer program and calculate the combustion concentration. Original work describes, an adaptation of Newton-Raphson method was used for solving the highly nonlinear system of equations describing the formation of equilibrium products in reacting of fuel-additive-air mixtures. This study also shows what possible of the results. In this paper, to be present the efficient numerical algorithms for. solving the combustion problem, to be used nonlinear equations based on the iteration method and high order of the Taylor series. The modified Adomian decomposition method was applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms. Comparisons of results by the new Matlab routines and previous routines, the result data indicate that the new Matlab routines are reliable, typical deviations from previous results are less than 0.05%.
文摘This paper is concerned with the following fourth-order three-point boundary value problem , where , we discuss the existence of positive solutions to the above problem by applying to the fixed point theory in cones and iterative technique.
基金Project Supported by NSFC (10131040)SRFDP (2002335090)
文摘A law of iterated logarithm for R/S statistics with the help of the strong approximations of R/S statistics by functions of a Wiener process is shown.
文摘Let{Xn;n≥1}be a sequence of i.i.d, random variables with finite variance,Q（n）be the related R/S statistics. It is proved that lim ε↓0 ε^2 ∑n=1 ^8 n log n/1 P{Q（n）≥ε√2n log log n}=2/1 EY^2,where Y=sup0≤t≤1B（t）-inf0≤t≤sB（t）,and B（t） is a Brownian bridge.
文摘In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.
文摘In this paper, we present and analyze modified families of predictor-corrector iterative methods for finding simple zeros of univariate nonlinear equations, permitting near the root. The main advantage of our methods is that they perform better and moreover, have the same efficiency indices as that of existing multipoint iterative methods. Furthermore, the convergence analysis of the new methods is discussed and several examples are given to illustrate their efficiency.
文摘In this paper we examine single-step iterative methods for the solution of the nonlinear algebraic equation f (x) = x2 - N = 0 , for some integer N, generating rational approximations p/q that are optimal in the sense of Pell’s equation p2 - Nq2 = k for some integer k, converging either alternatingly or oppositely.
基金Supported by the "863" Program (No.2009AA01Z241)the National Natural Science Foundation of China (No.60772062)+2 种基金Key Scientific Research Project of Office of Education in Jiangsu Province (No.06KJA51001)Scientific Research Project of Office of Education in Jiangsu Province (No.8KJB510015)Startup Funding (No.NY208048)
文摘We study a spectrum sharing problem where multiple systems coexist and interfere with each other. First, an analysis is proposed for distributed spectrum sharing based on Prisoners' Dilemma (PD) in Cognitive Radios (CRs). In one-shot game, selfish and rational CRs greedily full spread their own spectrum space in order to maximize their own rates, which leads to Nash Equilibrium (N.E.). But with long term interaction, i.e., Iterated Prisoner's Dilemma (IPD), CRs can come to cooperate and acquire the social optimal point by using different evolutionary strategies such as Tit For Tat (TFT), Generous TFT (GTFT), etc. Also we compare the performances of the different evolutionary strategies in noise-free and noisy environments for two-player games. Finally, N-player IPD (N-IPD) is simulated to verify our conclusions that TFT is a good strategy for spectrum sharing in CRs.
