Imperfect Fluid Generalized Robertson Walker Spacetime Admitting Ricci-Yamabe Metric

In the present paper, we investigate the nature of Ricci-Yamabe soliton on an imperfect fluid generalized Robertson-Walker spacetime with a torse-forming vector field ξ . Furthermore, if the potential vector field ξ of the Ricci-Yamabe soliton is of the gradient type, the Laplace-Poisson equation is derived. Also, we explore the harmonic aspects of η -Ricci-Yamabe soliton on an imperfect fluid GRW spacetime with a harmonic potential function ψ . Finally, we examine necessary and sufficient conditions for a 1 -form η , which is the g -dual of the vector field ξ on imperfect fluid GRW spacetime to be a solution of the Schrödinger-Ricci equation.

Numerical algorithms for solving an elliptic optimal control problem with a power-law nonlinearity

The paper is devoted to the development and analysis of approximation-iteration algorithms based on the method of grids and the method of lines for solving an elliptic optimal control problem with a power-law nonlinearity. For the numerical solution of the main boundary value problem and the adjoint one, the second order of accuracy difference schemes are applied using the implicit method of simple iteration. Computational schemes of the method of lines for solving the above-mentioned elliptic boundary value problems are implemented in combination with the shooting method for the approximate solution of boundary value problems for the corresponding ordinary differential equations systems arising in the considered domain after lattice approximation. To minimize the objective functional, well-known gradient-type methods (gradient projection and conditional gradient methods) of constrained optimization are used. The essence of the proposed approximation-iteration approach consists in replacing the original extremal problem with a sequence of grid problems that approximate it on a set of refining grids, and applying an iterative gradient-type method to each of the "approximate" extremal problems. In this case, we propose to construct only a few approximations to the solution for each of the "approximate" problems and to take the last of these approximations, using piecewise linear interpolation, as the initial approximation in the iterative process for the next "approximate" problem. The sequence of the corresponding piecewise linear interpolants is considered as a sequence of approximations to the solution of the original extremal problem. The paper discusses the theoretical foundations of this combined approach, as well as its advantages over traditional methods using the example of solving a model optimal control problem

Geometry of α-Cosymplectic Metric as ∗-Conformal η-Ricci–Yamabe Solitons Admitting Quarter-Symmetric Metric Connection

The outline of this research article is to initiate the development of a ∗-conformal η-Ricci–Yamabe soliton in α-Cosymplectic manifolds according to the quarter-symmetric metric connection. Here, we have established some curvature properties of α-Cosymplectic manifolds in regard to the quarter-symmetric metric connection. Further, the attributes of the soliton when the manifold gratifies a quarter-symmetric metric connection have been displayed in this article. Later, we picked up the Laplace equation from ∗-conformal η-Ricci–Yamabe soliton equation when the potential vector field ξ of the soliton is of gradient type, admitting quarter-symmetric metric connection. Next, we evolved the nature of the soliton when the vector field’s conformal killing reveals a quarter-symmetric metric connection. We show an example of a 5-dimensional α-cosymplectic metric as a ∗-conformal η-Ricci–Yamabe soliton acknowledges quarter-symmetric metric connection to prove our results.

Orcein and DAPI-stained karyotype analysis of Alocasia macrorrhizos (L.) G. Don

Karyotype analyses are required for the identification, characterization, and genetic improvement of any organism. Alocasia macrorrhizos (L.) G. Don. was investigated cytogenetically to determine the karyotypic features. Complex chromocenter type, of interphase nuclei, and gradient type of prophase chromosomes were found in this study. Alocasia macrorrhizos was found to possesses 2n=28 chromosomes. The total length of the 2n chromosome complement was recorded as 98.83±1.39 μm. The range of chromosomal length was 2.50±0.10-4.70±0.10 μm. A gradual decrease in chromosomal length was observed. The total form (TF%) value was found to be 43.58%, Karyotype symmetry index (Syi %) was 77.00 % and karyotype asymmetry index (AsK %) was 56.66%. The centromeric formula was 18m+4sm+2ac, representing asymmetric karyotype. In DAPI banding, the 1.48% positive banded region indicates the lower amount of AT rich repeats in this material. Therefore, Alocasia macrorrhizos could be authentically characterized through karyotype analysis. J. Bangladesh Acad. Sci. 45(1); 27-35: June 2021

Simultaneous optimization of even flow and land and timber value in forest planning: a continuous approach

Background Forest management planning involves deciding which silvicultural treatment should be applied to each stand and at what time to best meet the objectives established for the forest. For this, many mathematical formulations have been proposed, both within the linear and non-linear programming frameworks, in the latter case generally considering integer variables in a combinatorial manner. We present a novel approach for planning the management of forests comprising single-species, even-aged stands, using a continuous, multi-objective formulation (considering economic and even flow) which can be solved with gradient-type methods. Results The continuous formulation has proved robust in forest with different structures and different number of stands. The results obtained show a clear advantage of the gradient-type methods over heuristics to solve the problems, both in terms of computational time (efficiency) and in the solution obtained (effectiveness). Their improvement increases drastically with the dimension of the problem (number of stands). Conclusions It is advisable to rigorously analyze the mathematical properties of the objective functions involved in forest management planning models. The continuous bi-objective model proposed in this paper works with smooth enough functions and can be efficiently solved by using gradient-type techniques. The advantages of the new methodology are summarized as: it does not require to set management prescriptions in advance, it avoids the division of the planning horizon into periods, and it provides better solutions than the traditional combinatorial formulations. Additionally, the graphical display of trade-off information allows an a posteriori articulation of preferences in an intuitive way, therefore being a very interesting tool for the decision-making process in forest planning.

Two-versions of descent conjugate gradient methods for large-scale unconstrained optimization

<p>The conjugate gradient methods are noted to be exceedingly valuable for solving large-scale unconstrained optimization problems since it needn't the storage of matrices. Mostly the parameter conjugate is the focus for conjugate gradient methods. The current paper proposes new methods of parameter of conjugate gradient type to solve problems of large-scale unconstrained optimization. A Hessian approximation in a diagonal matrix form on the basis of second and third-order Taylor series expansion was employed in this study. The sufficient descent property for the proposed algorithm are proved. The new method was converged globally. This new algorithm is found to be competitive to the algorithm of fletcher-reeves (FR) in a number of numerical experiments.</p>