Grenoble Institute of Technology

About: Grenoble Institute of Technology is a education organization based out in Grenoble, France. It is known for research contribution in the topics: Hyperspectral imaging & Geology. The organization has 3427 authors who have published 5345 publications receiving 137158 citations. The organization is also known as: Grenoble INP.

Adaptive condition-based maintenance decision framework for deteriorating systems operating under variable environment and uncertain condition monitoring:

Abstract: The present article deals with the efficient use of different types of monitoring information in optimizing condition-based maintenance decision making for a deteriorating system operating under variable environment. The degradation phenomenon of a system is the fatigue crack growth that is modeled by a physics-based stochastic process. The environment process is assumed to be modeled by a time-homogenous Markov chain with finite state space. We suppose that the environmental condition is observed perfectly, while the crack depth can be assessed imperfectly through a non-destructive ultrasonic technique. As such, two kinds of indirect information are available on the system at each inspection time: environmental covariate and diagnostic covariate. Based on this set of information, two condition-based maintenance strategies adaptive to environmental conditions are developed. In the first one, the adaptation scheme is time-based, while in the second, it is condition-based. These maintenance strategies are c...

Rank-profile revealing Gaussian elimination and the CUP matrix decomposition

Abstract: Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of computational exact linear algebra. This paper surveys the well known variations of such decompositions and transformations that have been proposed in the literature. We present an algorithm to compute the CUP decomposition of a matrix, adapted from the LSP algorithm of Ibarra, Moran and Hui (1982), and show reductions from the other most common Gaussian elimination based matrix transformations and decompositions to the CUP decomposition. We discuss the advantages of the CUP algorithm over other existing algorithms by studying time and space complexities: the asymptotic time complexity is rank sensitive, and comparing the constants of the leading terms, the algorithms for computing matrix invariants based on the CUP decomposition are always at least as good except in one case. We also show that the CUP algorithm, as well as the computation of other invariants such as transformation to reduced column echelon form using the CUP algorithm, all work in place, allowing for example to compute the inverse of a matrix on the same storage as the input matrix.