Learn More
The capacitated minimum spanning tree problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The capacitated minimum spanning tree problem arises as a fundamental subproblem in many telecommunication network design problems. The capacitated minimum spanning tree(More)
Probability-one homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probability-one homotopy algorithm for MCPs was developed earlier by Billups and Watson based on the default(More)
Science and engineering problems frequently require solving a sequence of dual linear systems. Besides having to store only few Lanczos vectors, using the BiConjugate Gradient method (BiCG) to solve dual linear systems has advantages for specific applications. For example, using BiCG to solve the dual linear systems arising in interpolatory model reduction(More)
Most user focused data mining techniques involve purchase pattern analysis, targeted at strictly-formatted database-like transaction records. Most personalization systems employ explicitly provided user preferences rather than implicit rating data obtained automatically by collecting users' interactions. In this paper, we show that in complex information(More)
In a variety of applications such as learning, we need to integrate multimedia information into convenient packages (like presentations). The challenges involved in this process are: Selecting or working with information elements at sub-document level while retaining the original context; describing the integration or packaging of such elements; and making(More)
Krylov subspace recycling is a process for accelerating the convergence of sequences of linear systems. Based on this technique we have recently developed the recycling BiCG algorithm. We now generalize and extend this recycling theory to BiCGSTAB. Recycling BiCG focuses on efficiently solving sequences of dual linear systems, while the focus here is on(More)
We focus on robust and efficient iterative solvers for the pressure Poisson equation in in-compressible Navier-Stokes problems. Preconditioned Krylov subspace methods are popular for these problems, with BiCGStab and GMRES(m) most frequently used for nonsymmet-ric systems. BiCGStab is popular because it has cheap iterations, but it may fail for stiff(More)
The Widespread usage of social media for picture sharing led resulting popularity of JPEG progressive format due to refinement of image over time on slow internet connection. Typically, these pictures are decoded by means of software and takes large decoding time as resolution in terms of Mpixels increase. In case of embedded devices, typically have(More)