In this paper we consider a functional-integral equation with linear modification of the argument. By applying the successive approximation method and by using the trapezoidal formula we give an algorithm for the appr...
详细信息
In this paper we consider a functional-integral equation with linear modification of the argument. By applying the successive approximation method and by using the trapezoidal formula we give an algorithm for the approximation of the solution of this equation.
We propose general preprocessing techniques to reshape dense multivariate polynomials over finite fields, in order to minimize the cost of memory accesses, while preserving sufficient parallelism, so as to reduce the ...
详细信息
We propose general preprocessing techniques to reshape dense multivariate polynomials over finite fields, in order to minimize the cost of memory accesses, while preserving sufficient parallelism, so as to reduce the running time of polynomial multiplication in multi-threaded implementations.
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of t...
详细信息
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is ...
详细信息
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
In this paper the Lucas optimal growth of the human capital and consumption is analyzed on finite horizon. the main purpose is the approximation of the optimal human capital and consumption evolution on infinite horiz...
详细信息
In this paper the Lucas optimal growth of the human capital and consumption is analyzed on finite horizon. the main purpose is the approximation of the optimal human capital and consumption evolution on infinite horizon by the finite case which can be numerically computed.
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in s...
详细信息
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in some families of means. Most of the computations are performed withthe symbolic capabilities of the Maple computer algebra system.
the goal of this research is to perform origami geometric constructions in the 3D space using the symbolic computation capabilities in the computational origami system Eos. In this paper, we explain the formalization ...
详细信息
ISBN:
(纸本)9781538626276
the goal of this research is to perform origami geometric constructions in the 3D space using the symbolic computation capabilities in the computational origami system Eos. In this paper, we explain the formalization of the fold that generates non-flat origamis. We show the example of constructing a non-flat module of an origami polytope.
We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and mul...
详细信息
ISBN:
(纸本)9781509004621
We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and multisets and analyze thedressed epsilon (membership) symbol, which gives additionalinformation to the multiplicity of elements in a multiset.
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a...
详细信息
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose.
暂无评论