Results 71 to 80 of about 2,172 (231)
KARHUNEN-LOÉVE EXPANSION OF BROWNIAN MOTION FOR APPROXIMATE SOLUTIONS OF LINEAR STOCHASTIC DIFFERENTIAL MODELS USING PICARD ITERATION [PDF]
, 2020 This work presents an application of the Picard Iterative Method (PIM) to a class of Stochastic Differential Equations where the randomness in the equation is considered in terms of the Karhunen-Loéve Expansion finite series.
Ogundile, O. P., Edeki, S.O.
core +1 more source
British Journal of Pharmacology, EarlyView.Abstract Background and Purpose Genomic profiling of patients for genetic variants that modify the effect of specific medications has many benefits, including the possibility of avoiding toxicities and ensuring an adequate effect of the medication. Our intention was to develop a comprehensive, high‐quality pharmacogenetic test panel for clinical use ...
Anna Gréen +5 more
wiley +1 more source
The Equivalence between T-Stabilities of The Krasnoselskij and The Mann Iterations
Fixed Point Theory and Applications, 2007 We prove the equivalence between the T-stabilities of the Krasnoselskij and the Mann iterations; a consequence is the equivalence with the T-stability of the Picard-Banach iteration.
Ştefan M. Şoltuz
doaj +1 more source
The determination of orbits using Picard iteration
, 1975 The determination of orbits by using Picard iteration is reported. This is a direct extension of the classical method of Picard that has been used in finding approximate solutions of nonlinear differential equations for a variety of problems.
Feagin, T., Mikkilineni, R. P.
core
Enhancements to Modified Chebyshev-Picard Iteration Efficiency for Perturbed Orbit Propagation
, 2016 Modified Chebyshev Picard Iteration is an iterative numerical method for solving linear or non-linear ordinary differential equations. In a serial computational environment the method has been shown to compete with, or outperform, current state of ...
J. L. Junkins +4 more
core +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
The equivalence between T-stabilities of Krasnoselskij and Ishikawa iterations
Journal of Numerical Analysis and Approximation Theory, 2008 We prove the equivalence between the \(T\)-stabilities of Krasnoselskij and Ishikawa iterations; a consequence is the equivalence with the \(T\)-stability of Picard-Banach iteration.
Ştefan M. Şoltuz
doaj +2 more sources
Modified Chebyshev Picard Iteration: Integration of Perturbed Motion using Modified Equinoctial Elements [PDF]
, 2017 The topic of this dissertation is the fusion of a novel integration method, Modified Chebyshev Picard Iteration (MCPI), with Gauss' Variational Equations using a set of Modified Equinoctial Orbital Elements.
Read, Julie Louise
core
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Le Matematiche, 2014 In this paper, we prove the equivalence between the convergences of T-Picard iteration, T-Mann iteration and T-Ishikawa iteration for the class ofT-Zamfirescu operators in normed linear spaces.
Priya Raphael, Shaini Pulickakunnel
doaj