Search results for "CMA"
showing 10 items of 188 documents
Computer code from Sex roles and the evolution of parental care specialization
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Fuzzy Control of Uncertain Nonlinear Systems with Numerical Techniques: A Survey
2019
This paper provides an overview of numerical methods in order to solve fuzzy equations (FEs). It focuses on different numerical methodologies to solve FEs, dual fuzzy equations (DFEs), fuzzy differential equations (FDEs) and partial fuzzy differential equations (PFDEs). The solutions which are produced by these equations are taken to be the controllers. This paper also analyzes the existence of the roots of FEs and some important implementation problems. Finally, several examples are reviewed with different methods.
Incomplete Riemann Solvers Based on Functional Approximations to the Absolute Value Function
2021
We give an overview on the work developed in recent years about certain classes of incomplete Riemann solvers for hyperbolic systems. These solvers are based on polynomial or rational approximations to |x|, and they do not require the knowledge of the complete eigenstructure of the system, but only a bound on the maximum wave speed. Our solvers can be readily applied to nonconservative hyperbolic systems, by following the theory of path-conservative schemes. In particular, this allows for an automatic treatment of source or coupling terms in systems of balance laws. The properties of our schemes have been tested with some challenging numerical experiments involving systems such as the Euler…
A generalized integration formula for indefinite integrals of special functions
2020
An integration formula for generating indefinite integrals which was presented in Conway JT [A Lagrangian method for deriving new indefinite integrals of special functions. Integral Transforms Spec...
A decidable word problem without equivalent canonical term rewriting system
1989
We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.
Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n
2005
Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.
Guaranteed error bounds for a class of Picard-Lindelöf iteration methods
2013
We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
A-Codes from Rational Functions over Galois Rings
2006
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over Galois rings. Exponential sums over these rings help determine--or bound--the parameters of such codes.