In this paper, we present a family of general New to n-like methods with a parametric function for finding a zero of a univariate fu nction, permitting f′(x)=0 in some points. The case of multiple roots is n ot treat...In this paper, we present a family of general New to n-like methods with a parametric function for finding a zero of a univariate fu nction, permitting f′(x)=0 in some points. The case of multiple roots is n ot treated. The methods are proved to be quadratically convergent provided the w eak condition. Thus the methods remove the severe condition f′(x)≠0. Based on the general form of the Newton-like methods, a family of new iterative meth ods with a variable parameter are developed.展开更多
A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots ...A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton and Newton-type methods. The results show that the proposed method has some more advantages than others. It enriches the methods to find the roots of non-linear equations and it is important in both theory and application.展开更多
In this paper,we study real symmetric Toeplitz matrices commutable with tridiagonal matrices, present more detailed results than those in [1], and extend them to nonsymmetric Toeplitz matrices. Also, complex Toeplitz ...In this paper,we study real symmetric Toeplitz matrices commutable with tridiagonal matrices, present more detailed results than those in [1], and extend them to nonsymmetric Toeplitz matrices. Also, complex Toeplitz matrices, especially the corresponding matrices of lower order, are discussed.展开更多
The generalized algebraic method with symbolic computation is extended to some special-type nonlinear equations for constructing a series of new and more general travelling wave solutions in terms of special functions...The generalized algebraic method with symbolic computation is extended to some special-type nonlinear equations for constructing a series of new and more general travelling wave solutions in terms of special functions. Such equations cannot be directly dealt with by the method and require some kinds of pre-processing techniques. It is shown that soliton solutions and triangular periodic solutions can be established as the limits of the Jacobi doubly periodic wave solutions.展开更多
Starting from the variable separation approach, the algebraic soliton solution and the solution describing the interaction between line soliton and algebraic soliton are obtained by selecting appropriate seed solution...Starting from the variable separation approach, the algebraic soliton solution and the solution describing the interaction between line soliton and algebraic soliton are obtained by selecting appropriate seed solution for （2＋1）-dimensional ANNV equation. The behaviors of interactions are discussed in detail both analytically and graphically. It is shown that there are two kinds of singular interactions between line soliton and algebraic soliton： 1） the resonant interaction where the algebraic soliton propagates together with the line soliton and persists infinitely; 2） the extremely repulsive interaction where the algebraic soliton affects the motion of the line soliton infinitely apart.展开更多
A class of third-order convergence methods of solving roots for non-linear equation,which are variant Newton＇s method, are given. Their convergence properties are proved. They are at least third order convergence nea...A class of third-order convergence methods of solving roots for non-linear equation,which are variant Newton＇s method, are given. Their convergence properties are proved. They are at least third order convergence near simple root and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton＇s methods. The results show that the proposed methods have some more advantages than others. They enrich the methods to find the roots of non-linear equations and they are important in both theory and application.展开更多
A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate eq...A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate equations and successfully obtain abundant new exact solutions, which include rational solitary wave solutions and rational triangular periodic wave solutions. The method is straightforward and concise, and it can also be applied to other nonlinear evolution equations in mathematical physics.展开更多
The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su（1,2） algebraic structure： the Hamiltonian can be written as a linear function of the su（1,2） algebra generators. Based o...The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su（1,2） algebraic structure： the Hamiltonian can be written as a linear function of the su（1,2） algebra generators. Based on it, the energy eigenvalues are obta/ned by making use of the similar transformations, and the algebraic diagonalization method is investigated. Some numerical solutions are given, and the results indicate that only one group solution could be accepted in physics.展开更多
Quantum algorithms have been developed for efficiently solving linear algebra tasks.However,they generally require deep circuits and hence universal fault-tolerant quantum computers.In this work,we propose variational...Quantum algorithms have been developed for efficiently solving linear algebra tasks.However,they generally require deep circuits and hence universal fault-tolerant quantum computers.In this work,we propose variational algorithms for linear algebra tasks that are compatible with noisy intermediate-scale quantum devices.We show that the solutions of linear systems of equations and matrix–vector multiplications can be translated as the ground states of the constructed Hamiltonians.Based on the variational quantum algorithms,we introduce Hamiltonian morphing together with an adaptive ans?tz for efficiently finding the ground state,and show the solution verification.Our algorithms are especially suitable for linear algebra problems with sparse matrices,and have wide applications in machine learning and optimisation problems.The algorithm for matrix multiplications can be also used for Hamiltonian simulation and open system simulation.We evaluate the cost and effectiveness of our algorithm through numerical simulations for solving linear systems of equations.We implement the algorithm on the IBM quantum cloud device with a high solution fidelity of 99.95%.展开更多
Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynom...Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.展开更多
In this study, a collocation technique is presented for approximate solution of the fractional-order logistic population model. Actually, we develop the Bessel collocation method by using the fractional derivative in ...In this study, a collocation technique is presented for approximate solution of the fractional-order logistic population model. Actually, we develop the Bessel collocation method by using the fractional derivative in the Caputo sense to obtain the approximate solutions of this model problem. By means of the fractional derivative in the Caputo sense, the collocation points, the Bessel functions of the first kind, the method transforms the model problem into a system of nonlinear algebraic equations. Numerical applications are given to demonstrate efficiency and accuracy of the method. In applications, the reliability of the scheme is shown by the error function based on the accuracy of the approximate solution.展开更多
文摘In this paper, we present a family of general New to n-like methods with a parametric function for finding a zero of a univariate fu nction, permitting f′(x)=0 in some points. The case of multiple roots is n ot treated. The methods are proved to be quadratically convergent provided the w eak condition. Thus the methods remove the severe condition f′(x)≠0. Based on the general form of the Newton-like methods, a family of new iterative meth ods with a variable parameter are developed.
基金Foundation item： Supported by the National Science Foundation of China（10701066） Supported by the National Foundation of the Education Department of Henan Province（2008A110022）
文摘A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton and Newton-type methods. The results show that the proposed method has some more advantages than others. It enriches the methods to find the roots of non-linear equations and it is important in both theory and application.
文摘In this paper,we study real symmetric Toeplitz matrices commutable with tridiagonal matrices, present more detailed results than those in [1], and extend them to nonsymmetric Toeplitz matrices. Also, complex Toeplitz matrices, especially the corresponding matrices of lower order, are discussed.
基金The project supported by the Natural Science Foundation of Shandong Province and the Natural Science Foundation of Liaocheng University
文摘The generalized algebraic method with symbolic computation is extended to some special-type nonlinear equations for constructing a series of new and more general travelling wave solutions in terms of special functions. Such equations cannot be directly dealt with by the method and require some kinds of pre-processing techniques. It is shown that soliton solutions and triangular periodic solutions can be established as the limits of the Jacobi doubly periodic wave solutions.
基金National Natural Science Foundation of China under Grant No.10675065the Science Research Foundation of the Education Department of Zhejiang Province under Grant No.20070979+1 种基金the Natural Science Foundation of Zhejiang Province under Grant No.Y604036the State Key Laboratory of Oil/Gas Reservoir Geology and Exploitation\PLN0402
文摘Starting from the variable separation approach, the algebraic soliton solution and the solution describing the interaction between line soliton and algebraic soliton are obtained by selecting appropriate seed solution for （2＋1）-dimensional ANNV equation. The behaviors of interactions are discussed in detail both analytically and graphically. It is shown that there are two kinds of singular interactions between line soliton and algebraic soliton： 1） the resonant interaction where the algebraic soliton propagates together with the line soliton and persists infinitely; 2） the extremely repulsive interaction where the algebraic soliton affects the motion of the line soliton infinitely apart.
基金Foundation item： Supported by the National Science Foundation of China（10701066）
文摘A class of third-order convergence methods of solving roots for non-linear equation,which are variant Newton＇s method, are given. Their convergence properties are proved. They are at least third order convergence near simple root and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton＇s methods. The results show that the proposed methods have some more advantages than others. They enrich the methods to find the roots of non-linear equations and they are important in both theory and application.
文摘A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate equations and successfully obtain abundant new exact solutions, which include rational solitary wave solutions and rational triangular periodic wave solutions. The method is straightforward and concise, and it can also be applied to other nonlinear evolution equations in mathematical physics.
基金The project supported by National Natural Science Foundation of China under Grant Nos.10447103 and 90305026the Natural Science Foundation of Beijing under Grant No.1072010the Foundation of Education Department of Beijing under Grant No.KM200610772007
文摘The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su（1,2） algebraic structure： the Hamiltonian can be written as a linear function of the su（1,2） algebra generators. Based on it, the energy eigenvalues are obta/ned by making use of the similar transformations, and the algebraic diagonalization method is investigated. Some numerical solutions are given, and the results indicate that only one group solution could be accepted in physics.
基金the Engineering and Physical Sciences Research Council National Quantum Technology Hub in Networked Quantum Information Technology(EP/M013243/1)Japan Student Services Organization(JASSO)Student Exchange Support Program(Graduate Scholarship for Degree Seeking Students)+1 种基金the National Natural Science Foundation of China(U1730449)the European Quantum Technology Flagship project AQTION。
文摘Quantum algorithms have been developed for efficiently solving linear algebra tasks.However,they generally require deep circuits and hence universal fault-tolerant quantum computers.In this work,we propose variational algorithms for linear algebra tasks that are compatible with noisy intermediate-scale quantum devices.We show that the solutions of linear systems of equations and matrix–vector multiplications can be translated as the ground states of the constructed Hamiltonians.Based on the variational quantum algorithms,we introduce Hamiltonian morphing together with an adaptive ans?tz for efficiently finding the ground state,and show the solution verification.Our algorithms are especially suitable for linear algebra problems with sparse matrices,and have wide applications in machine learning and optimisation problems.The algorithm for matrix multiplications can be also used for Hamiltonian simulation and open system simulation.We evaluate the cost and effectiveness of our algorithm through numerical simulations for solving linear systems of equations.We implement the algorithm on the IBM quantum cloud device with a high solution fidelity of 99.95%.
基金supported by National Natural Science Foundation of China(GrantNos.91118001 and 11170153)National Key Basic Research Project of China(Grant No.2011CB302400)Chongqing Science and Technology Commission Project(Grant No.cstc2013jjys40001)
文摘Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.
文摘In this study, a collocation technique is presented for approximate solution of the fractional-order logistic population model. Actually, we develop the Bessel collocation method by using the fractional derivative in the Caputo sense to obtain the approximate solutions of this model problem. By means of the fractional derivative in the Caputo sense, the collocation points, the Bessel functions of the first kind, the method transforms the model problem into a system of nonlinear algebraic equations. Numerical applications are given to demonstrate efficiency and accuracy of the method. In applications, the reliability of the scheme is shown by the error function based on the accuracy of the approximate solution.
