Ara
Toplam kayıt 16, listelenen: 11-16
Adaptive methods for solving operator equations by using frames of subspaces
(Işık University Press, 2017)
In this paper, using a frame of subspaces we transform an operator equation to an equivalent `2-problem. Then, we propose an adaptive algorithm to solve the problem and investigate the optimality and complexity properties ...
Partitioning a graph into monopoly sets
(Işık University Press, 2017)
In a graph G = (V, E), a set M ? V (G) is said to be a monopoly set of G if every vertex v ? V ? M has, at least, d(v)/2 neighbors in M. The monopoly size of G, denoted by mo(G), is the minimum cardinality of a monopoly ...
A new heuristic algorithm for multiple traveling salesman problem
(Işık University Press, 2017)
The Multiple Traveling Salesman Problem (mTSP) is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different ...
Numerical solution of a 2D- diffusion reaction problem modelling the density of di-vacancies and vacancies in a metal
(Işık University Press, 2017-01-03)
A decomposition solution of a diffusion reaction problem, which models the density of di-vacancies and vacancies in a metal is presented. The results are compared with the numerical solutions. Zero - diffusion solutions ...
Numerical solution of the interrelated differential equation of motion in phonon engineering
(Işık University Press, 2017)
In this work, we study numeric calculations of phonon modes in nanostructures. The motion equation of atoms in a crystal with some simplification, results in a second order ordinary differential equation and two interrelated ...
A note on line graphs
(Işık University Press, 2017-02-20)
The line graph and 1-quasitotal graph are well-known concepts in graph theory. In Satyanarayana, Srinivasulu, and Syam Prasad [13], it is proved that if a graph G consists of exactly m connected components Gi (1 ? i ? m) ...