This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods...This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods always lead to optimal convergence rates and have some other important features, especially the methods can be implemented parallelly.展开更多
Parallel algorithms have been designed for the past 20 years initially by parallelising existing sequential algorithms for many different parallel architectures. More recently parallel strategies have been identified ...Parallel algorithms have been designed for the past 20 years initially by parallelising existing sequential algorithms for many different parallel architectures. More recently parallel strategies have been identified and utilized 'resulting in many new parallel algorithms. However the analysis of such algorithms reveals that further strategies can be applied to increase the parallelism. One of these, i.e., increasing the computational capacity in each processing node can reduce the congestion/communicgtion for shared memory/distributed memory multiprocessor systems and dramahcally improve the Performance of the algorithm. Two algorithms are identified and studied, i.e., the Cyclic reduction method for solving large tridiagonal linear systems in which the odd/even sequence is increased to a 'stride of 3' or more resulting in an improved algorithm. Similarly the Gaussian Elimination method for solving linear systems in which one element is eliminated at a time can be adapted to parallel form in which two elements are simultaneously eliminated resulting in the Parallel Implicit Elimination (P.I.E.) method. Numerical results are presented to support the analyses.展开更多
A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segme...A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.展开更多
In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and di...In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.展开更多
A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is pr...A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is proved and the stability analysis is given. The numerical examples demonstrate that these formulas can solve an extensive class of initial value problems for the ordinary differential equations.展开更多
In this paper,a non-negative adaptive mechanism based on an adaptive nonsingular fast terminal sliding mode control strategy is proposed to have finite time and high-speed trajectory tracking for parallel manipulators...In this paper,a non-negative adaptive mechanism based on an adaptive nonsingular fast terminal sliding mode control strategy is proposed to have finite time and high-speed trajectory tracking for parallel manipulators with the existence of unknown bounded complex uncertainties and external disturbances.The proposed approach is a hybrid scheme of the online non-negative adaptive mechanism,tracking differentiator,and nonsingular fast terminal sliding mode control(NFTSMC).Based on the online non-negative adaptive mechanism,the proposed control can remove the assumption that the uncertainties and disturbances must be bounded for the NFTSMC controllers.The proposed controller has several advantages such as simple structure,easy implementation,rapid response,chattering-free,high precision,robustness,singularity avoidance,and finite-time convergence.Since all control parameters are online updated via tracking differentiator and non-negative adaptive law,the tracking control performance at high-speed motions can be better in real-time requirement and disturbance rejection ability.Finally,simulation results validate the effectiveness of the proposed method.展开更多
基金This work was supported by the National Natural Science Foundation of China
文摘This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods always lead to optimal convergence rates and have some other important features, especially the methods can be implemented parallelly.
文摘Parallel algorithms have been designed for the past 20 years initially by parallelising existing sequential algorithms for many different parallel architectures. More recently parallel strategies have been identified and utilized 'resulting in many new parallel algorithms. However the analysis of such algorithms reveals that further strategies can be applied to increase the parallelism. One of these, i.e., increasing the computational capacity in each processing node can reduce the congestion/communicgtion for shared memory/distributed memory multiprocessor systems and dramahcally improve the Performance of the algorithm. Two algorithms are identified and studied, i.e., the Cyclic reduction method for solving large tridiagonal linear systems in which the odd/even sequence is increased to a 'stride of 3' or more resulting in an improved algorithm. Similarly the Gaussian Elimination method for solving linear systems in which one element is eliminated at a time can be adapted to parallel form in which two elements are simultaneously eliminated resulting in the Parallel Implicit Elimination (P.I.E.) method. Numerical results are presented to support the analyses.
基金Project supported by the National Natural Science Foundation of China(No.10671113)the Natural Science Foundation of Shandong Province of China(No.Y2003A04)
文摘A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.
基金national natural science foundation natural science foundation of Gansu province.
文摘In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.
基金Project supported by the National Natural Science Foundation of China
文摘A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is proved and the stability analysis is given. The numerical examples demonstrate that these formulas can solve an extensive class of initial value problems for the ordinary differential equations.
基金the Vietnam National Foundation for Science and Technology Development(NAFOSTED)Vietnam under Grant No.(107.01-2019.311).
文摘In this paper,a non-negative adaptive mechanism based on an adaptive nonsingular fast terminal sliding mode control strategy is proposed to have finite time and high-speed trajectory tracking for parallel manipulators with the existence of unknown bounded complex uncertainties and external disturbances.The proposed approach is a hybrid scheme of the online non-negative adaptive mechanism,tracking differentiator,and nonsingular fast terminal sliding mode control(NFTSMC).Based on the online non-negative adaptive mechanism,the proposed control can remove the assumption that the uncertainties and disturbances must be bounded for the NFTSMC controllers.The proposed controller has several advantages such as simple structure,easy implementation,rapid response,chattering-free,high precision,robustness,singularity avoidance,and finite-time convergence.Since all control parameters are online updated via tracking differentiator and non-negative adaptive law,the tracking control performance at high-speed motions can be better in real-time requirement and disturbance rejection ability.Finally,simulation results validate the effectiveness of the proposed method.
