Results 11  20
of
82,577
Performance Study of LU Decomposition on the Programmable GPU ⋆
"... Abstract. With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation but also for generalpurpose computation. In this paper, to study the performance of programmable GPUs, we des ..."
Abstract
 Add to MetaCart
describe the design and implementation of LU decomposition as an example of numerical computation. To achieve this, we have developed and evaluated some methods with different implementation approaches in terms of (a) loop processing, (b) branch processing, and (c) vector processing. The experimental
Floatingpoint based block LU decomposition on FPGAs
 in Proceedings of the 2004 International Conference on Engineering Reconfigurable Systems and
, 2004
"... In this paper, we propose an architecture for floatingpoint based LU decomposition for largesized matrices. Our proposed architecture is based on the well known concept of blocking and uses pipelined floatingpoint units to obtain high throughput. We first analyze the effects of block size and the ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we propose an architecture for floatingpoint based LU decomposition for largesized matrices. Our proposed architecture is based on the well known concept of blocking and uses pipelined floatingpoint units to obtain high throughput. We first analyze the effects of block size
A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems
, 2007
"... Generalized intervals (intervals whose bounds are not constrained to be increasingly ordered) extend classical intervals providing better algebraic properties. In particular, the generalized interval arithmetic is a group for addition and for multiplication of zero free intervals. These properties ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
allow one constructing a LU decomposition of a generalized interval matrix A: the two computed generalized interval matrices L and U satisfy A = LU with equality instead of the weaker inclusion obtained in the context of classical intervals. Some potential applications of this generalized interval LU
A note on LU decomposition of the Discrete Fourier Transform matrix
, 2015
"... We describe some properties of the lower triangular Toeplitz matrix Tq with coefficients ti,j = 1/(q; q)i−j, where (z; q)k is the qPochhammer symbol. We identify explicitly the inverse of Tq and show that both this matrix and its transpose appear in LU decomposition of the Vandermonde matrix Vq hav ..."
Abstract
 Add to MetaCart
We describe some properties of the lower triangular Toeplitz matrix Tq with coefficients ti,j = 1/(q; q)i−j, where (z; q)k is the qPochhammer symbol. We identify explicitly the inverse of Tq and show that both this matrix and its transpose appear in LU decomposition of the Vandermonde matrix Vq
LUDECOMPOSITION OF A NONCOMMUTATIVE LINEAR SYSTEM AND JACOBI POLYNOMIALS
, 810
"... Abstract. In this paper we obtain the LUdecomposition of a noncommutative linear system of equations that, in the rank one case, characterizes the image of the Lepowsky homomorphism U(g) K → U(k) M ⊗U(a). This LUdecomposition can be transformed into very simple matrix identities, where the entries ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In this paper we obtain the LUdecomposition of a noncommutative linear system of equations that, in the rank one case, characterizes the image of the Lepowsky homomorphism U(g) K → U(k) M ⊗U(a). This LUdecomposition can be transformed into very simple matrix identities, where
Pricing American Options Using LU Decomposition
, 2004
"... Numerical solution methods for pricing American options are considered. We propose a secondorder accurate RungeKutta scheme for the time discretization of the BlackScholes partial di#erential equation with an early exercise constraint. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Numerical solution methods for pricing American options are considered. We propose a secondorder accurate RungeKutta scheme for the time discretization of the BlackScholes partial di#erential equation with an early exercise constraint.
Equational verification of cache blocking in lu decomposition using kleene algebra with tests
, 2002
"... In a recent paper of Mateev et al. (2001), a new technique for program analysis called fractal symbolic analysis was introduced and applied to verify the correctness of a series of sourcelevel transformations for cache blocking in LU decomposition with partial pivoting. It was argued in that paper ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
In a recent paper of Mateev et al. (2001), a new technique for program analysis called fractal symbolic analysis was introduced and applied to verify the correctness of a series of sourcelevel transformations for cache blocking in LU decomposition with partial pivoting. It was argued in that paper
An Improved Algorithm for Parallel Sparse LU Decomposition on a DistributedMemory Multiprocessor
 Fifth SIAM Conference on Applied Linear Algebra
, 1994
"... In this paper we present a new parallel algorithm for the LU decomposition of a general sparse matrix. Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the number of pivots produced. Experimental results obtained on a network ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a new parallel algorithm for the LU decomposition of a general sparse matrix. Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the number of pivots produced. Experimental results obtained on a
Abstract MultiFPGA based High Performance LU Decomposition
"... LU Decomposition is a linear algebra routine that is used to bring down the complexity of solving a system of linear equations with multiple RHS. Its application can be found in computational physics (modeling 2D structures), image processing, and computational chemistry (design and analysis of mol ..."
Abstract
 Add to MetaCart
LU Decomposition is a linear algebra routine that is used to bring down the complexity of solving a system of linear equations with multiple RHS. Its application can be found in computational physics (modeling 2D structures), image processing, and computational chemistry (design and analysis
Results 11  20
of
82,577