It is well known that the parabolic partial differential equations in two or more space dimensions with overspecified boundary data, feature in the mathematical modeling of many phenomena. In this article, an inverse problem of determining an unknown time-dependent source term of a parabolic equation in general dimensions is considered. Employing some transformations, we change the inverse prob...

An analytical investigation is conducted to study the unsteady free convection heat and mass transfer flow through a non-homogeneous porous medium with variable permeability bounded by an infinite porous vertical plate in slip flow regime while taking into account the thermal radiation, chemical reaction, the Soret number, and temperature gradient dependent heat source. The flow is considered u...

This paper presents a numerical solution of a class of fractional optimal control problems (FOCPs) in a bounded domain having a noise function by the spectral Ritz method‎. ‎The Bernstein polynomials with the fractional operational matrix are applied to approximate the unknown functions‎. ‎By substituting these estimated functions into the cost functional‎, ‎an unconstrained nonlinear optimizat...

this article presents a unified approach to the abstract notions of partial convolution and involution in $l^p$-function spaces over semi-direct product of locally compact groups. let $h$ and $k$ be locally compact groups and $tau:hto aut(k)$ be a continuous homomorphism.  let $g_tau=hltimes_tau k$ be the semi-direct product of $h$ and $k$ with respect to $tau$. we define left and right $tau$-c...

A left ideal of any C∗-algebra is an example of an operator algebra with a right contractive approximate identity (r.c.a.i.). Indeed, left ideals in C∗-algebras may be characterized as the class of such operator algebras, which happen also to be triple systems. Conversely, we show here and in a sequel to this paper, that operator algebras with r.c.a.i. should be studied in terms of a certain le...

In standard kernelization algorithms, the usual goal is to reduce, in polynomial time, an instance (I, k) of a parameterized problem to an equivalent instance (I ′, k′) of size bounded by a function in k. One of the central problems in this area, whose investigation has led to the development of many kernelization techniques, is the Dominating Set problem. Given a graph G and k ∈ N, Dominating ...