Incremental stability analysis for time-delay systems has attracted more and attention its contemporary applications in transportation processes, population dynamics, economics, satellite positions, etc. This paper researches the criteria exponential incremental with continuous or discontinuous right-hand sides. Firstly, sufficient conditions sides are studied, several corollaries specific case...

We consider CFDnc, an alternative to the description logic CFD that retains the latter’s ability to support PTIME reasoning in the presence of terminological cycles with universal restrictions over functional roles and also in the presence of functional constraints over functional role paths. In contrast, CFDnc replaces the ability to have conjunction on left-hand-sides of inclusion dependencie...

We present a scalable approach and implementation for solving stochastic optimization problems on high-performance computers. In this work we revisit the sparse linear algebra computations of the parallel solver PIPS with the goal of improving the shared-memory performance and decreasing the time to solution. These computations consist of solving sparse linear systems with multiple sparse right...

We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. These solvers are highly parallel and they perform a factor of 0.4P1/6 less communication than existing algorithms, where P is number of processors. The new solvers reduce communication at the expense of using more tempora...

A general algorithm is developed that reuses available information to accelerate the iterative convergence of linear systems with multiple right-hand sides A x = b i, which are commonly encountered in steady or unsteady simulations of nonlinear equations. The algorithm is based on the classical GMRES algorithm with eigenvector enrichment but also includes a Galerkin projection preprocessing ste...

We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). The algorithm capitalizes on the vectors already available from CG, building a small window of vectors that approximates the eigenvectors. While this window is restarted in a locally optimal way, the CG is not. Our...

We consider the solution of very large sparse systems of linear equations on parallel architectures. In this context, memory is often a bottleneck that prevents or limits the use of direct solvers, especially those based on the multifrontal method. This work focuses on memory and performance issues of the two memory and computationally intensive phases of direct methods, namely, the numerical f...

We describe cloned segments of rDNA that contain short type I insertions of differing lengths. These insertions represent a coterminal subset of sequences from the right hand side of the major 5kb type I insertion. Three of these shorter insertions are flanked on both sides by a short sequence present as a single copy in uninterrupted rDNA units. The duplicated segment is 7, 14 and 15 nucleotid...