‎using several examples of positive definite functions‎, ‎some inequalities for the numerical radius of‎ ‎matrices are investigated‎. ‎also‎, ‎some open problems are stated‎.

The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...

There are many methods for numerical solutions of integral equations. In various branches of science and engineering, chemistry and biology, and physics applications integral equation is provided by many other authors. In this paper, a simple numerical method using a fuzzy, for the numerical solution of the integral equation with the weak singular kernel is provided. Finally, by providing three...

In this research, the variation of ultimate bearing capacity, failure mechanism and deformation pattern of soil beneath two closely square footings have been studied using numerical methods. It is assumed that the adjacent footings are constructed on the surface of sand. The presented numerical analyses are based on explicit-finite-difference code, FLAC3D. The elasto-plastic behavior of soil is...

Finite elements methods (FEMs) with numerical integration play a central role in numerical homogenization methods for partial differential equations with multiple scales, as the effective data in a homogenization problem can only be recovered from a microscopic solver at a finite number of points in the computational domain. In a multiscale framework the convergence of a FEM with numerical inte...

Intuitively, patterns of numerical sequences are often interpreted as formulas. However, we have observed earlier that such an intuition is too naive. Numerical Kolmogorov complexity theory is further developed. Based on these new formulations, a sequence is random if There is no patterns that are simpler than the complexity of data.

we show how daubechies wavelets are used to solve kuramoto-sivashinsky type equations with periodic boundary condition‎. ‎wavelet bases are used for numerical solution of the kuramoto-sivashinsky type equations by galerkin method‎. ‎the numerical results in comparison with the exact solution prove the efficiency and accuracy of our method‎.

‎let $n$ and $k$ be two positive integers‎, ‎$kleq n$ and $a$ be an $n-$square quaternion matrix‎. ‎in this paper‎, ‎some results on the $k-$numerical range of $a$ are investigated‎. ‎moreover‎, ‎the notions of $k$-numerical radius‎, ‎right $k$-spectral radius and $k$-norm of $a$ are introduced‎, ‎and some of their algebraic properties are studied‎.