consider an n × n matrix polynomial p(λ). a spectral norm distance from p(λ) to the set of n × n matrix polynomials that havea given scalar µ ∈ c as a multiple eigenvalue was introducedand obtained by papathanasiou and psarrakos. they computedlower and upper bounds for this distance, constructing an associated perturbation of p(λ). in this paper, we extend this resultto the case of two given di...

This paper regards initial value problem for second order impulsive integro-differential equations as some nonlinear vector system. By means of the Mönch′s fixed point theorem, some existence theorems of solutions of the initial value problem are established. The results are newer than all of the previous ones because of the more general form compactness-type condition and the weaker restrictio...

this paper presents an efficient modification of the variational iteration method for solvingboundary value problems using the chebyshev polynomials. the proposed method can be applied to linearand nonlinear models. the scheme is tested for some examples and the obtained results demonstrate thereliability and efficiency of the proposed method.

‎in this paper‎, ‎by using four functionals fixed point theorem‎, ‎we obtain sufficient conditions for the existence of‎ ‎at least one positive solution of an $n$th-order $m$-point boundary value problem‎. ‎as an application‎, ‎we give an example to demonstrate our main result.

Sparse matrix-matrix products appear in multigrid solvers and computational methods for graph theory. Some formulations of these products require the inner product of two sparse vectors, which have inefficient use of cache memory. In this paper, we propose a new algorithm for computing sparse matrix-matrix products by exploiting matrix nonzero structure through the process of graph coloring. We...