let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

The L(h, k)-labeling is an assignment of non negative integer labels to the nodes of a graph such that ’close’ nodes have labels which differ by at least k, and ’very close’ nodes have labels which differ by at least h. The span of an L(h, k)-labeling is the difference between the largest and the smallest assigned label. We study L(h, k)-labelings of cellular, squared and hexagonal grids, seeki...

• Predictive Accuracy Measures. These measures evaluate how close the recommender system came to predicting actual rating/utility values. • Classification Accuracy Measures. These measures evaluate the frequency with which a recommender system makes correct/incorrect decisions regarding items. • Rank Accuracy Measures. These measures evaluate the correctness of the ordering of items performed b...

The Conjugate Gradient Squared (CGS) is an iterative method for solving nonsymmetric linear systems of equations. However, during the iteration large residual norms may appear, which may lead to inaccurate approximate solutions or may even deteriorate the convergence rate. Instead of squaring the Bi-CG polynomial as in CGS, we propose to consider products of two nearby Bi-CG polynomials which l...

OF THE DISSERTATION In this thesis, we propose various algorithms for problems arising in nonlinear circuits, nonlinear electromagnetics and data mining. Through the design and implementation of these algorithms, we show that the algorithms developed are scalable. In the first part of the thesis we provide two solutions to the forward problem of finding the steady-state solution of nonlinear RL...