Results 11 to 20 of about 11,041 (298)
Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem [PDF]
Neutrosophic Sets and Systems, 2015 In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP). In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi ...
Ibrahim M. Hezam +2 more
doaj +3 more sources
Rigorous Polynomial Approximation Using Taylor Models in Coq [PDF]
, 2012 One of the most common and practical ways of representing a real function on machines is by using a polynomial approximation. It is then important to properly handle the error introduced by such an approximation. The purpose of this work is to offer guaranteed error bounds for a specific kind of rigorous polynomial approximation called Taylor model. We
Brisebarre, Nicolas +7 more
openaire +4 more sources
Data-driven evolutionary optimization with clustering aided ensemble learning and taylor polynomial-based data generation [PDF]
Complex & Intelligent SystemsData-driven evolutionary algorithms (DDEA) have proven to be highly effective in solving expensive and computationally intensive problems. However, offline DDEA heavily relies on the availability of historical data.
Long Zheng, Feichi Gu, Shunhuai Chen
doaj +2 more sources
Polynomial adjusted Student-t densities for modeling asset returns [PDF]
, 2022 We present a polynomial expansion of the standardized Student-t distribution. Our density, obtained through the polynomial adjusted method in Bagnato, Potì and Zoia (2015), is an extension of the Gram-Charlier density in Jondeau and Rockinger (2001).
Ñíguez, T.M., León, Á.
core +1 more source
Interpolation: a Taylor polynomial approach [PDF]
, 2021 Interpolation is a technique that calculates the unknown values from known given values with in the certain range. Whereas the process of calculating unknown values beyond the certain given range is called extrapolation.
Faham, M.A.A.M., Sasni, M.I.S.
core +3 more sources
Estimates in the Taylor series method for polynomial total systems of PDEs [PDF]
, 2021 Many of total systems of PDEs can be reduced to the polynomial form. As was shown by various authors, one of the best methods for the numerical solution of the initial value problem for ODE systems is the Taylor Series Method (TSM). In the article, the
Pototskaya, Irina Yu. +2 more
core +1 more source
Taylor polynomial solutions of systems of linear differential equations with variable coefficients [PDF]
, 2005 WOS: 000229988100010A Taylor collocation method has been presented for numerically solving systems of high-order linear ordinary, differential equations with variable coefficients.
Gulsu, M, Sezer, M, Karamete, A
core +1 more source
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2016 We present the first message of the cycle from two articles where the rearrangement of the order of approximation of the matrix method of numerical integration depending on the degree in the Taylor’s polynomial expansion of solutions of boundary value ...
Vladimir N Maklakov
doaj +1 more source
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem [PDF]
Logical Methods in Computer Science, 2012 The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise ...
Libor Barto, Marcin Kozik
doaj +1 more source
Diversity of Bivariate Concordance Measures
Mathematics, 2022 We revisit the axioms of Scarsini, defining bivariate concordance measures for a pair of continuous random variables (X,Y); such measures can be understood as functions of the bivariate copula C associated with (X,Y).
Martynas Manstavičius
doaj +1 more source