Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.     

On the extremal values of the second largest Q-eigenvalue

We study extremal graphs for the extremal values of the second largest Q-eigenvalue of a connected graph. We first characterize all simple connected graphs with second largest signless Laplacian eigenvalue at most 3. The second part of the present paper is devoted to the study of the graphs that maximize the second largest Q-eigenvalue. We construct families of such graphs and prove that some of theses families are minimal for the fact that they maximize the second largest signless Laplacian eigenvalue.     

On the approximability of the minimum strictly fundamental cycle basis problem

We consider the problem of finding a strictly fundamental cycle basis of minimum weight in the cycle space associated with an undirected connected graph G, where a nonnegative weight is assigned to each edge of G and the total weight of a basis is defined as the sum of the weights of all the cycles in the basis. Several heuristics have been proposed to tackle this NP-hard problem, which has some interesting applications. In this paper we show that this problem is APX-hard, even when restricted to unweighted graphs, and hence does not admit a polynomial-time approximation scheme, unless P=NP. Using a recent result on the approximability of lower-stretch spanning trees (Elkin et al. (2005) [7]), we obtain that the problem is approximable within O(log²nloglogn) for arbitrary graphs. We obtain tighter approximability bounds for dense graphs. In particular, the problem restricted to complete graphs admits a polynomial-time approximation scheme.     

Postprocessing and higher order convergence for the mixed finite element approximations of the eigenvalue problem

In this paper, we propose a method to improve the convergence rate of the lowest order Raviart-Thomas mixed finite element approximations for the second order elliptic eigenvalue problem. Here, we prove a supercloseness result for the eigenfunction approximations and use a type of finite element postprocessing operator to construct an auxiliary source problem. Then solving the auxiliary additional source problem on an augmented mixed finite element space constructed by refining the mesh or by using the same mesh but increasing the order of corresponding mixed finite element space, we can increase the convergence order of the eigenpair approximation. This postprocessing method costs less computation than solving the eigenvalue problem on the finer mesh directly. Some numerical results are used to confirm the theoretical analysis.     

ESTIMATES ON EIGENVALUES FOR THE BIHARMONIC OPERATOR ON A BOUNDED DOMAIN IN H~n（-1）

In this paper, we consider eigenvalues of the Dirichlet biharmonic operator on a bounded domain in a hyperbolic space. We obtain universal bounds on the (k + 1)th eigenvalue in terms of the first kth eigenvalues independent of the domains.     

混合气体线性化Boltzmann算子的特征值与特征函数

考虑了混合气体线性化Boltzmann算子的特征值与特征函数问题.通过对算子中核函数的分析得出了更一般的混合气体线性化Boltzmann算子的特征值与特征函数.而且结论还适用于单一气体情况.     

Variable neighborhood search for harmonic means clustering

Harmonic means clustering is a variant of minimum sum of squares clustering (which is sometimes called K-means clustering), designed to alleviate the dependance of the results on the choice of the initial solution. In the harmonic means clustering problem, the sum of harmonic averages of the distances from the data points to all cluster centroids is minimized. In this paper, we propose a variable neighborhood search heuristic for solving it. This heuristic has been tested on numerous datasets from the literature. It appears that our results compare favorably with recent ones from tabu search and simulated annealing heuristics.     

Entropy in good manufacturing system: Tool for quality assurance

It has been customary to implement Good Manufacturing Practices (GMP) in pharmaceutical organizations as a systematic and comprehensive quality approach and sometimes by regulatory enforcement. In this scenario, determination of the obvious entropy/disorder arising during the implementation has not been taken care of yet. Therefore, this paper gives the basis for applying query and visual perception of GMP system driven visualization approach, particularly the Laplace equation, to the determination of disorder and deviation pattern inside the GMP system applied in the organization. In this study, a three-dimensional mesh approached with raw and intermediate input handled under GMP parameter is considered to produce high quality products with minimum entropy (variation distribution) by adding the analogy wise different GMP parameters and process variables with Gauss Seidel iteration and thus producing visual picture of the entire system. The approximation involved in applying the equations to the GMP compliant aseptic region was analyzed. Using numerical technique and computer program, the Gauss Seidel iteration equations have been solved with appropriate GMP parameter and process variable. The result indicates that deviations vary over the GMP compliant system and that the process entropy affects the totality of disorderness. Experiments with model of GMP compliant reproductive medicine laboratory confirm that the new method provides optimal manufacturing maintaining GMP and high product quality through the visual representation of the entire system and activity to bring into notice the deviations.     

Quiescent cells: A natural way to resist chemotherapy

Most chemotherapeutic treatments use drugs that target proliferating cancer cells. Therefore, they do not affect quiescent cells which are naturally resistant. Surviving cancer cells can reactivate their cell cycles in the intervals between doses, becoming proliferative again and thus restarting tumor growth. In this work, we present a mathematical model to study the impact of quiescent cells on chemotherapy effectiveness. Our simulations show that, although tumor growth is delayed after the beginning of each dose, the resistance of quiescent cells is enough to reactivate it due to accelerated repopulation, eventually causing therapy failure even in the absence of acquired resistance.     

Currency crises and the evolution of foreign exchange market: Evidence from minimum spanning tree

We examined the time series properties of the foreign exchange market for 1990-2008 in relation to the history of the currency crises using the minimum spanning tree (MST) approach and made several meaningful observations about the MST of currencies. First, around currency crises, the mean correlation coefficient between currencies decreased whereas the normalized tree length increased. The mean correlation coefficient dropped dramatically passing through the Asian crisis and remained at the lowered level after that. Second, the Euro and the US dollar showed a strong negative correlation after 1997, implying that the prices of the two currencies moved in opposite directions. Third, we observed that Asian countries and Latin American countries moved away from the cluster center (USA) passing through the Asian crisis and Argentine crisis, respectively.