Réduction de la résolution d'un problème de réseau maillé
Réduction de la résolution d'un problème de réseau maillé (B) : sur la convergence locale de certaines méthodes
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
This paper addresses a combinatorial optimization problem (COP), namely a variant of the (standard) matrix chain product (MCP) problem where the matrices are square and either dense ( full) or lower/upper triangular. Given a matrix chain of length , we first present a dynamic programming algorithm (DPA) adapted from the well known standard algorithm and having the same O( ) complexity. We then design and analyse two optimal O() greedy algorithms leading in general to different optimal...
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
This paper addresses a combinatorial optimization problem (COP), namely a variant of the (standard) matrix chain product (MCP) problem where the matrices are square and either dense ( full) or lower/upper triangular. Given a matrix chain of length , we first present a dynamic programming algorithm (DPA) adapted from the well known standard algorithm and having the same O( ) complexity. We then design and analyse two optimal O() greedy algorithms leading in general to different optimal...
Page 1