scholarly journals Upper and lower bounds on solutions of initial value problems

1971 ◽  
Vol 36 (2) ◽  
pp. 283-300 ◽  
Author(s):  
Shlomo Breuer ◽  
David Gottlieb
1973 ◽  
Vol 40 (4) ◽  
pp. 1097-1102 ◽  
Author(s):  
C. A. Bell ◽  
F. C. Appl

A new method has been developed for finding rigorous upper and lower bounds to the solution of a wide class of initial value problems. The method is applicable to initial value problems of the following type: x(¨t)+f(t,x,x)˙=0,x(0)=X0,x(˙0)=V0, where f is continuous with continuous first derivatives, Lipschitzian, and ∂f/∂x ≥ 0. An original bounding theorem has been formulated and proven and a numerical technique has been developed for finding the bounding functions in analytic form as linear combinations of Tchebyshev polynomials. The method has been applied to several problems of engineering interest.


2001 ◽  
Vol 6 (1) ◽  
pp. 9-19 ◽  
Author(s):  
A. Buikis ◽  
J. Cepitis ◽  
H. Kalis ◽  
A. Reinfelds ◽  
A. Ancitis ◽  
...  

The mathematical model of wood drying based on detailed transport phenomena considering both heat and moisture transfer have been offered in article. The adjustment of this model to the drying process of papermaking is carried out for the range of moisture content corresponding to the period of drying in which vapour movement and bound water diffusion in the web are possible. By averaging as the desired models are obtained sequence of the initial value problems for systems of two nonlinear first order ordinary differential equations. 


Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.


Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 2023
Author(s):  
Christopher Nicholas Angstmann ◽  
Byron Alexander Jacobs ◽  
Bruce Ian Henry ◽  
Zhuang Xu

There has been considerable recent interest in certain integral transform operators with non-singular kernels and their ability to be considered as fractional derivatives. Two such operators are the Caputo–Fabrizio operator and the Atangana–Baleanu operator. Here we present solutions to simple initial value problems involving these two operators and show that, apart from some special cases, the solutions have an intrinsic discontinuity at the origin. The intrinsic nature of the discontinuity in the solution raises concerns about using such operators in modelling. Solutions to initial value problems involving the traditional Caputo operator, which has a singularity inits kernel, do not have these intrinsic discontinuities.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.


Sign in / Sign up

Export Citation Format

Share Document