Partition-and-Recur (PAR) method is a simple and useful formal method. It can be used to design and testify algo-rithmic programs. In this paper, we propose that PAR method is an effective formal method on solving com...Partition-and-Recur (PAR) method is a simple and useful formal method. It can be used to design and testify algo-rithmic programs. In this paper, we propose that PAR method is an effective formal method on solving combinatorics problems. Furthermore, we formally derive combinatorics problems by PAR method, which cannot only simplify the process of algorithmic program's designing, but also improve its automatization, standardization and correctness. We develop algorithms for two typical combinatorics problems, the number of string scheme and the number of error per-mutation scheme. Lastly, we obtain accurate C++ programs which are transformed by automatic transforming system of PAR platform.展开更多
A class of parallel Rosenbrock methods for differential algebraic equations are presented in this paper. The local truncation errors are defined and the order conditions are established by using the DA-trees and DA-se...A class of parallel Rosenbrock methods for differential algebraic equations are presented in this paper. The local truncation errors are defined and the order conditions are established by using the DA-trees and DA-series. The paper also deals with the convergence of the parallel Rosenbrock methods for h -> 0 and states the bounds for the global errors of the methods. Some particular methods are obtained by solving the order equations and a numerical example is given, from which the theoretical orders are actually observed.展开更多
文摘Partition-and-Recur (PAR) method is a simple and useful formal method. It can be used to design and testify algo-rithmic programs. In this paper, we propose that PAR method is an effective formal method on solving combinatorics problems. Furthermore, we formally derive combinatorics problems by PAR method, which cannot only simplify the process of algorithmic program's designing, but also improve its automatization, standardization and correctness. We develop algorithms for two typical combinatorics problems, the number of string scheme and the number of error per-mutation scheme. Lastly, we obtain accurate C++ programs which are transformed by automatic transforming system of PAR platform.
基金the National Natural Science Foundation of China (No. 19871080)
文摘A class of parallel Rosenbrock methods for differential algebraic equations are presented in this paper. The local truncation errors are defined and the order conditions are established by using the DA-trees and DA-series. The paper also deals with the convergence of the parallel Rosenbrock methods for h -> 0 and states the bounds for the global errors of the methods. Some particular methods are obtained by solving the order equations and a numerical example is given, from which the theoretical orders are actually observed.
