The local projection method is applied to inf-sup stable discretisations of the Oseen problem. Error bounds of order r are proven for known inf-sup stable pairs of finite element spaces which approximate velocity and pressure by elements of order r and r− 1, respectively. In case of a positive reaction coefficient, the error constants are robust with respect to the viscosity but depend on the p...

In this paper, we make use of the concept q−calculus in theory univalent functions, to obtain bounds for certain coefficient functional problems Janowski type starlike functions and find Fekete–Szegö functional. A similar results have been done function ℘−1. Further, newly defined class determine estimates, distortion bounds, radius problems, related partial sums.

in this paper, we introduce and investigate a subclass of analytic and bi-univalent functions in the open unit disk. upper bounds for the second and third coefficients of functions in this subclass are founded. our results, which are presented in this paper, generalize and improve those in related works of several earlier authors.

In this paper, we consider a subclass SQ of normalized analytic functions f satisfying ℜf′(z)>1/2. For the in class SQ, determine upper bounds for number coefficient estimates, among which are initial coefficients, second Hankel determinant, and Zalcman functional. Upper estimates higher-order Schwarzian derivatives also obtained.

In this article we consider variable coefficient time dependent wave equations in R×R. Using phase space methods we construct outgoing parametrices and prove Strichartz type estimates globally in time. This is done in the context of C metrics which satisfy a weak asymptotic flatness condition at infinity.

The dilation coefficient of a graph representation is defined as the quotient of the longest and the shortest edge representation. The minimum of the dilation coefficients over all planar representations of a graph G is called the dilation coefficient of the graph G. The dilation coefficient of different planar representations of complete graphs is considered and upper and lower bounds for the ...