In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

the problem of downward continuation of the gravity field from the earth’s surface to the reference ellipsoid arises from the fact that the solution to the boundary value problem for geoid determination without applying stokes formula is sought in terms of the disturbing potential on the ellipsoid but the disturbing gravity observations are only available on the earth’s surface. downward contin...

in the present paper, we introduce the sequence space [{l_p}(e,delta) = left{ x = (x_n)_{n = 1}^infty : sum_{n = 1}^infty left|  sum_{j in {e_n}} x_j - sum_{j in e_{n + 1}} x_jright| ^p < infty right},] where $e=(e_n)$ is a partition of finite subsets of the positive integers and $pge 1$. we investigate its topological properties and inclusion relations. moreover, we consider the problem of fin...

in this research, a first order markov chain model was applied to simulate soil salinity in nine standard depths and 10 classes in the cultivated pistachio areas of ardakan city. transition probability matrix, kernel and uniform distribution were used to simulate 500000 soil profiles. results indicate kernel function could reproduce soil salinity values with statistical criteria (i.e. mean, sta...

We use elements in the quantum hyperalgebra to define a quantum version of the Désarménien matrix. We prove that our matrix is upper triangular with ones on the diagonal and that, as in the classical case, it gives a quantum straightening algorithm for quantum bideterminants. We use our matrix to give a new proof of the standard basis theorem for the q-Weyl module. As well, we show that the sta...

a matrix $pintextmd{c}^{ntimes n}$ is called a generalized reflection matrix if $p^{h}=p$ and $p^{2}=i$‎. ‎an $ntimes n$‎ ‎complex matrix $a$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $p$ if $a=pap$ ($a=-pap$)‎. ‎in this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $axb=c$ and $dxe=f$ over reflexiv...