In this paper, we present new extensions of incomplete gamma, beta, Gauss hypergeometric, confluent hypergeometric function and Appell-Lauricella functions, by using the extended Bessel due to Boudjelkha [?]. Some recurrence relations, transformation formulas, Mellin transform integral representations are obtained for these generalizations. Further, an extension Riemann-Liouville fractional deri...

We introduce and study generalized holographic superconductors with higher derivative couplings between the field strength tensor and a complex scalar field, in four dimensional AdS black hole backgrounds. We study this theory in the probe limit, as well as with backreaction. There are multiple tuning parameters in the theory, and with two non-zero parameters, we show that the theory has a rich...

A generalization of the Yang-Mills covariant derivative, that uses both vector and scalar fields and transforms as a 4-vector contracted with Dirac matrices, is used to simplify the Glashow-Weinberg-Salam model. Since SU (3) assigns the wrong hypercharge to the Higgs boson, it is necessary to use a special representation of U (3) to obtain all the correct quantum numbers. A surplus gauge scalar...

Quasi-interpolation is very useful in the study of approximation theory and its applications, since it can yield solutions directly without the need to solve any linear system of equations. Based on the good performance, Chen and Wu presented a kind of multiquadric (MQ) quasi-interpolation, which is generalized from the LD operator, and used it to solve hyperbolic conservation laws and Burgers’...

We derive a novel derivative based version of kernelized Generalized Learning Vector Quantization (KGLVQ) as an effective, easy to interpret, prototype based and kernelized classifier. It is called D-KGLVQ and we provide generalization error bounds, experimental results on real world data, showing that D-KGLVQ is competitive with KGLVQ and the SVM on UCI data and additionally show that automati...

A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses that question with respect to Generalized Pattern Search (GPS) methods for unconstrained and linearly constrained optimization. Specifically this paper concentrates on the GPS poll step. Polling is done to certify the need to refine the curren...