A Class of Splitting Preconditioners for the iterative solution of Linear Systems arising from Interior Point Methods for Linear Programming Problems needs to find a base by a sophisticated process based in a lying rectangular LU factorization, that involves reordering columns many times until certain conditions are satisfied. At the same time, it is necessary to prevent excessive fill-in in L ...

While originally P systems were defined to contain multiset rewriting rules, it turned out that considering different types of rules may produce important results, such as increasing the computational power of the rules. This paper focuses on factoring out the concept of a membrane structure out of various P system models with the goal of providing useful formalisations. Both static and dynamic...

Clinical document contains vital information like symptom names, medication names, age, gender and some demographical information. These information can be used for giving quick relief from a disease. In existing system, they had built a system for clustering symptom names and medication names using Multi-View Non-Negative Matrix Factorization. While considering the clinical documents the facto...

A well designed and reliable prevention system for non-payment event is very important for the telecom company. Monitoring is especially needed in case the client exceeds the level of his standard payments what can lead to his financial problems. In this paper, we propose a system describing client's behavior and informing about possible problems in advance. In this approach we apply novel ense...

Based on Singular Value Decomposition an incremental and iterative Matrix Factorization method for very sparse matrices is presented. Such matrices arise in Collaborative Filtering (CF) systems, like the Netflix system. This paper shows how such an incremental Matrix Factorization can be used to predict ratings in a CF system and therefore how to fill the empty fields of a rating matrix of a CF...

For differential-algebraic power systems, saddle-noddle bifurcation and Hopf bifurcation are both of universally existent phenomena in power systems. Usually Newton iteration method could be applied to the Moore-Spence system to compute saddle-noddle and Hopf bifurcation points directly. But the Moore-Spence system has very high dimension and causes much complexity in Jacobian matrix factorizat...

We derive factorization identities for a class of preemptive-resume queueing systems, with batch arrivals and catastrophes that, whenever they occur, eliminate multiple customers present in the system. These processes are quite general, as they can be used to approximate Lévy processes, diffusion processes, and certain types of growth-collapse processes; thus, all of the processes mentioned abo...

This paper presents a factorization of the error system that arises in model reduction of linear time invariant systems by Krylov subspace methods. The factorization is introduced for reduced models that match moments and/or Markov parameters of the original system with multiple inputs and outputs. Furthermore, dual results are given for the reduction with input and output Krylov subspaces. To ...

In Niederreiter’s factorization algorithm for univariate polynomials over finite fields, the factorization problem is reduced to solving a linear system over the finite field in question, and the solutions are used to produce the complete factorization of the polynomial into irreducibles. For fields of characteristic 2, a polynomial time algorithm for extracting the factors using the solutions ...

We present algorithms to factorize homogeneous polynomials in the first q-Weyl algebra and the first Weyl algebra. By homogeneous we mean homogeneous with respect to a Z-grading on the first (q-)Weyl algebra which will be introduced in this article. It turns out that the factorization can be almost completely reduced to commutative univariate factorization with some additional easy combinatoria...