Results 41 to 50 of about 1,239,411 (205)

Optimizing loss functions through multi-variate taylor polynomial parameterization [PDF]

Proceedings of the Genetic and Evolutionary Computation Conference, 2021
Metalearning of deep neural network (DNN) architectures and hyperparameters has become an increasingly important area of research. Loss functions are a type of metaknowledge that is crucial to effective training of DNNs, however, their potential role in metalearning has not yet been fully explored. Whereas early work focused on genetic programming (GP)
Gonzalez, Santiago, Miikkulainen, Risto
openaire   +2 more sources

A novel collocation method based on residual error analysis for solving integro-differential equations using hybrid Dickson and Taylor polynomials

, 2017
In this study, a novel matrix method based on collocation points is proposed to solve some linear and nonlinear integro-differential equations with variable coefficients under the mixed conditions.
Ömür Kıvanç Kürkçü, Ersin Aslan, M. Sezer   +2 more
semanticscholar   +1 more source

A Numerical Approach Based on Taylor Polynomials for Solving a Class of Nonlinear Differential Equations

Mathematical Problems in Engineering, 2018
In this study, a matrix method based on Taylor polynomials and collocation points is presented for the approximate solution of a class of nonlinear differential equations, which have many applications in mathematics, physics and engineering.
C. Güler, S. Kaya
semanticscholar   +1 more source

A numerical method for solving continuous population models for single and interacting species

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2019
In thisstudy, a numerical approach is presented to obtain the approximate solutions ofcontinuous population models for single and interacting species.
Elçin Gökmen, Elçin Çelik
doaj   +1 more source

The Interlace Polynomial

, 2016
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.Comment: 18 pages, 5 ...
Morse, Ada
core   +1 more source

Universal Taylor series, conformal mappings and boundary behaviour [PDF]

, 2013
A holomorphic function f on a simply connected domain {\Omega} is said to possess a universal Taylor series about a point in {\Omega} if the partial sums of that series approximate arbitrary polynomials on arbitrary compacta K outside {\Omega} (provided ...
Gardiner, Stephen J.
core   +4 more sources

Cosmographic analysis with Chebyshev polynomials

, 2017
The limits of standard cosmography are here revised addressing the problem of error propagation during statistical analyses. To do so, we propose the use of Chebyshev polynomials to parameterize cosmic distances.
Capozziello, Salvatore, D'Agostino, Rocco, Luongo, Orlando   +2 more
core   +1 more source

Chebyshev Interpolation Polynomial-based Tools for Rigorous Computing [PDF]

, 2010
17 pagesInternational audiencePerforming numerical computations, yet being able to provide rigorous mathematical statements about the obtained result, is required in many domains like global optimization, ODE solving or integration.
Brisebarre, Nicolas, Joldes, Mioara Maria   +1 more
core   +3 more sources

Estimation of the order of the matrix method approximation of numerical integration of boundary-value problems for the second order inhomogeneous linear ordinary differential equations

Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2014
Using the first three terms of Taylor expansion of the required function in the approximate derivative by finite differences leads to the second order approximation of the traditional numerical quadrature method of boundary value problems for linear ...
Vladimir N Maklakov
doaj   +1 more source

Polynomial extensions of the Milliken-Taylor Theorem [PDF]

Transactions of the American Mathematical Society, 2014
Summary: \textit{Milliken-Taylor systems} are some of the most general infinitary configurations that are known to be partition regular. These are sets of the form \(\mathrm{MT}(\langle a_i\rangle _{i=1}^m,\langle x_n\rangle _{n=1}^\infty )= \{\sum _{i=1}^m a_i\sum _{t\in F_i}\,x_t:F_1,F_2,\ldots , F_m\) are increasing finite nonempty subsets of ...
Bergelson, Vitaly, Hindman, Neil, Williams, Kendall   +2 more
openaire   +1 more source