LU decomposition

Known as: Doolittle decomposition, Gauss decomposition, LU factorisation 
In numerical analysis and linear algebra, LU decomposition (where 'LU' stands for 'lower upper', and also called LU factorization) factors a matrix… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type… (More)
  • table 4.1
  • figure 4.1
  • figure 4.2
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Extra memory allows parallel matrix multiplication to be done with asymptotically less communication than Cannon’s algorithm and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
To efficiently perform large matrix LU decomposition on FPGAs with limited local memory, the original algorithm needs to be… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2008
2008
This paper reports on an FPGA implementation of sparse LU decomposition. The resulting special purpose hardware is geared towards… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The adaptive cross approximation method can be used to efficiently approximate stiffness matrices arising from boundary element… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
Numerical solution methods for pricing American options are considered. We propose a second-order accurate Runge-Kutta scheme for… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • SIVAN TOLEDOyAbstract
  • 1997
This paper presents a new partitioned algorithm for LU decomposition with partial pivoting. The new algorithm, called the… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • JINCHAO XUy
  • 1994
A new multigrid or incomplete LU technique is developed in this paper for solving large sparse algebraic systems from… (More)
  • figure 3
Is this relevant?
1988
1988
A parallel algorithm is derived for LU decomposition with partial pivoting on a local-memory multiprocessor. A general Cartesian… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1969
Highly Cited
1969
Standard computer implementations of Dantzig's simplex method for linear programming are based upon forming the inverse of the… (More)
Is this relevant?