Add to ORKGAbstract. We present an algorithm to compute the LDL> factorization of a matrix of the form ZZ>+Λ, which can be computed in O(nm2) time. Here, m is the rank of Z and n is the rank of the diagonal matrix Λ. We also show how the linear system (ZZ> + Λ)x = y can be solved in O(mn) time using our factorization. In addition, this yields an LDV> decomposition algorithm for Z which can be obtained in O(m3) time. Finally, we show how rank-1 modifications of such matrices can be computed in at most O(mn) time
This thesis presents the Lenstra, Lenstra, and Lovász algorithm (more commonly the LLL-algorithm), w...
International audienceWe present a novel recursive algorithm for reducing a symmetric matrix to a tr...
AbstractFor a linear program in which the constraint coefficients vary linearly with the time parame...
International audienceWe consider the LU factorization of an $n\times n$ matrix $A$ represented as a...
International audienceWe devise an algorithm, L1 tilde, with the following specifications: It takes ...
We consider the LU factorization of an $n\times n$ matrix $A$ represented as a block low-rank (BLR) ...
We consider the problem of computing the rank of an m × nmatrix A over a field. We present a randomi...
Rank-revealing ULV and URV factorizations are useful tools to determine the rank and to compute ...
For an $n \times n$ tridiagonal matrix we exploit the structure of its QR factorization to devis...
In this paper, we study the problem of computing an LSP-decompositionof a matrix over a field. This ...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
Given an $m \times n$ matrix M with $m \geqslant n$, it is shown that there exists a permutation $\P...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
AbstractThis paper gives improved parallel methods for several exact factorizations of some classes ...
[[abstract]]We consider permutations of any given squared matrix and the generalized LU(r) factoriza...
This thesis presents the Lenstra, Lenstra, and Lovász algorithm (more commonly the LLL-algorithm), w...
International audienceWe present a novel recursive algorithm for reducing a symmetric matrix to a tr...
AbstractFor a linear program in which the constraint coefficients vary linearly with the time parame...
International audienceWe consider the LU factorization of an $n\times n$ matrix $A$ represented as a...
International audienceWe devise an algorithm, L1 tilde, with the following specifications: It takes ...
We consider the LU factorization of an $n\times n$ matrix $A$ represented as a block low-rank (BLR) ...
We consider the problem of computing the rank of an m × nmatrix A over a field. We present a randomi...
Rank-revealing ULV and URV factorizations are useful tools to determine the rank and to compute ...
For an $n \times n$ tridiagonal matrix we exploit the structure of its QR factorization to devis...
In this paper, we study the problem of computing an LSP-decompositionof a matrix over a field. This ...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
Given an $m \times n$ matrix M with $m \geqslant n$, it is shown that there exists a permutation $\P...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
AbstractThis paper gives improved parallel methods for several exact factorizations of some classes ...
[[abstract]]We consider permutations of any given squared matrix and the generalized LU(r) factoriza...
This thesis presents the Lenstra, Lenstra, and Lovász algorithm (more commonly the LLL-algorithm), w...
International audienceWe present a novel recursive algorithm for reducing a symmetric matrix to a tr...
AbstractFor a linear program in which the constraint coefficients vary linearly with the time parame...