Abstract: This paper describes an algorithm which produces all ideals compatible with a given surjective Frobenius near-splitting. [Copyright &y& Elsevier]
Abstract: In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of finite difference method for solving singular perturbation problems was established, a new matlab procedure ehssp was implemented, too. Several linear and non-linear problems are presented to illustrate the implementation of the program. [Copyright &y& Elsevier]
Abstract: In this paper, by using the theories and methods of mathematics analysis and computer algebra, a reliable algorithm for solving high-order nonlinear Volterra–Fredholm integro-differential equations was established, and a new Maple procedure voltfredproc was established too. The results of the examples indicated that the procedure voltfredproc of Taylor polynomial method is simple and effective, and could provide an accuracy approximate solution or exact solution of the high-order nonlinear Volterra–Fredholm integro-differential equation. This would be useful for solving integro-differential equation, integral equations and ordinary differential equation. [Copyright &y& Elsevier]
The complexity of an algorithm is usually expressed using complexity functions and complexity classes, in this paper we present a method to reduce the work with multi-variable complexity functions to the work with one-variable complexity functions. We define five complexity classes for multi-variable complexity functions and then we prove some properties for these classes. [ABSTRACT FROM AUTHOR]
Published
2009
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.