Abstract   In the present study, the effects of wavy wall’s properties on mixed convection heat transfer of Water-Al2O3 Nanofluid in a lid-driven cavity are investigated using the Lattice Boltzmann Method. The Boundary Fitting Method with second order accuracy at both velocity and temperature fields is used to simulate the curved boundaries in the LBM. The problem is investigated for different ...

Motion Blur is one of the common artifacts in digital photographing. With the population of handheld camera and smart phone, image deblurring becomes an important problem. RichardsonLucy algorithm is well-known deconvolution algorithm. But the ringing artifacts usually appear while the estimated point spread function is not accurate. In this paper, we proposed an improved Richardson-Lucy deconv...

We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau. These properties lead to a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. Résumé. Nous établissons ...

Koornwinder polynomials are q-orthogonal equipped with extra five parameters and the $$B C_n$$ -type Weyl group symmetry, which were introduced by (Contemp Math 138:189–204, 1992) as multivariate analogue of Askey–Wilson polynomials. They now understood Macdonald associated affine root system type $$(C^\vee _n,C_n)$$ via Macdonald–Cherednik theory double Hecke algebras. In this paper, we give e...

The Belkale-Kumar product on H(G/P) is a degeneration of the usual cup product on the cohomology ring of a generalized flag manifold. In the case G = GLn, it was used by N. Ressayre to determine the regular faces of the Littlewood-Richardson cone. We show that forG/P a (d−1)-step flagmanifold, each Belkale-Kumar structure constant is a product of ( d 2 ) Littlewood-Richardson numbers, for which...

Recently, the gradient based iterative algorithms have been widely exploited for finding the (leastsquares) solutions of the different kinds of the (coupled) linear matrix equations. Nevertheless, so far, the convergence of the propounded gradient based algorithms has been studied under the circumstance that the mentioned (coupled) linear matrix equations have a unique (least-squares) solution....