Results 21  30
of
82,577
LU DecompositionBased Key Predistribution Scheme for Heterogeneous Wireless Sensor Networks
"... Since LU decompositionbased key predistribution schemes can be compressed easily, they are very appropriate for sourcelimited sensor networks. But existing schemes have two flaws: 1) they all focus on key establishment without considering key or key material update, thus they can’t support extra ..."
Abstract
 Add to MetaCart
Since LU decompositionbased key predistribution schemes can be compressed easily, they are very appropriate for sourcelimited sensor networks. But existing schemes have two flaws: 1) they all focus on key establishment without considering key or key material update, thus they can’t support extra
Sequential Performance versus Scalability: Optimizing Parallel LUDecomposition
, 1996
"... High e#cient implementations of parallel algorithms need high e#cient sequential kernels. Therefore, libraries like BLAS are successfully used in manynumerical applications. In this paper we show the tradeo# between the performance of these kernels and the scalability of parallel applications. I ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. It turns out that the fastest routine on a single node does not necessarily lead to the fastest parallel program and that the structure of the kernels have be adapted to the communication parameters of the machine. As an example application we presentan optimized parallel LUdecomposition for dense
The Ensparsed LU Decomposition Method for Large Scale Circuit Transient Analysis
"... We propose the Ensparsed LU decomposition (ELU) method as a linear solver for largescale circuit transient analysis. Ensparsing is an algorithmic technique of ignoring small values in computation. While some researchers have used ensparsing by value in linear solvers for circuit simulation, the EL ..."
Abstract
 Add to MetaCart
We propose the Ensparsed LU decomposition (ELU) method as a linear solver for largescale circuit transient analysis. Ensparsing is an algorithmic technique of ignoring small values in computation. While some researchers have used ensparsing by value in linear solvers for circuit simulation
PARALLEL SPARSE LU DECOMPOSITION ON A MESH NETWORK OF TRANSPUTERS*
"... Abstract. A parallel algorithm is presented for the LU decomposition of a general sparse matrix on a distributedmemory MIMD multiprocessor with a square mesh communication network. In the algorithm, matrix elements are assigned to processors according to the grid distribution. Each processor repres ..."
Abstract
 Add to MetaCart
Abstract. A parallel algorithm is presented for the LU decomposition of a general sparse matrix on a distributedmemory MIMD multiprocessor with a square mesh communication network. In the algorithm, matrix elements are assigned to processors according to the grid distribution. Each processor
CLUDE: An Efficient Algorithm for LU Decomposition Over a Sequence of Evolving Graphs
"... In many applications, entities and their relationships are represented by graphs. Examples include the WWW (web pages and hyperlinks) and bibliographic networks (authors and coauthorship). A graph can be conveniently modeled by a matrix from which various quantitative measures are derived. Some exa ..."
Abstract
 Add to MetaCart
sequence of evolving matrices. We study how LUdecomposition should be done over the sequence so that (1) the decomposition is efficient and (2) the resulting LU matrices best preserve the sparsity of the matrices A’s (i.e., the number of extra nonzero entries introduced in L and U are minimized.) We
Mapping the LU Decomposition on a ManyCore Architecture: Challenges and Solutions
 in Proceedings of the 6th ACM Conference on Computing Frontiers (CF ’09
, 2009
"... Recently, multicore architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ softwaremanaged embedded memory. An open question is what programming and compiling methods are effective to exploit the performance potential o ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
of this new class of architectures. Using the LU decomposition as a case study, we propose three techniques that combined achieve a 27 times speedup on the IBM Cyclops64 manycore architecture, compared to the parallel LU implementation from the SPLASH2 benchmarks suite. Our first method allows adaptive
Some Bounds of the Zeros of Polynomials Based on the QRDecomposition and the LUDecomposition of the Frobenius Companion Matrix
"... In this paper, new bounds of zeros of polynomials of the monic polynomial of order n will be introduced by applying famous matrix norms to the QRdecomposition of C(p). The LU decomposition of C(p) will be investigated and will be used to find more bounds of the zeros of p(z). ..."
Abstract
 Add to MetaCart
In this paper, new bounds of zeros of polynomials of the monic polynomial of order n will be introduced by applying famous matrix norms to the QRdecomposition of C(p). The LU decomposition of C(p) will be investigated and will be used to find more bounds of the zeros of p(z).
LU Decomposition Method for Solving Fully Fuzzy Linear System with Trapezoidal Fuzzy Numbers
"... applications at least some of the system’s parameters and measurements are represented by fuzzy numbers rather than crisp numbers. Therefore it is imperative to develop mathematical models and numerical procedures to solve such a fuzzy linear system. The general model of a fuzzy linear system whose ..."
Abstract
 Add to MetaCart
system with trapezoidal fuzzy numbers. LU decomposition method for a crisp matrix is well known in solving linear system of equations. We discuss LU decomposition of the coefficient matrix of the fully fuzzy linear system, in which the coefficients are trapezoidal fuzzy numbers.
Rotated Alternative LU Decomposition Method and Its Preconditioner for Periodic Block Pentadiagonal Linear Systems on Vector Processor
, 1999
"... In this paper, a new method "Rotated Alternative LU (Rotated ALU) decomposition" for solving block pentadiagonal linear systems is proposed, that makes vector processing more efficient. And a new way to apply the Rotated ALU decomposition to periodic pentadiagonal linear systems is propose ..."
Abstract
 Add to MetaCart
In this paper, a new method "Rotated Alternative LU (Rotated ALU) decomposition" for solving block pentadiagonal linear systems is proposed, that makes vector processing more efficient. And a new way to apply the Rotated ALU decomposition to periodic pentadiagonal linear systems
A highperformance and energyefficient architecture for floatingpoint based LU decomposition on FPGAs
 In Proceedings of the 11th Reconfigurable Architectures Workshop (RAW
, 2004
"... In this paper, we first develop a novel architecture for fixedpoint LU decomposition of streaming input matrices, on FPGAs. Our architecture, based on a circular linear array, achieves the minimal latency and is resourceefficient. We then extend it, by using a stacked matrices approach, to a float ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In this paper, we first develop a novel architecture for fixedpoint LU decomposition of streaming input matrices, on FPGAs. Our architecture, based on a circular linear array, achieves the minimal latency and is resourceefficient. We then extend it, by using a stacked matrices approach, to a
Results 21  30
of
82,577