Results 1  10
of
740,262
Reversing the Row Order for the RowByRow Frontal Method
, 1999
"... The efficiency of the rowbyrow frontal method is dependent on the row ordering used. Numerical experience has shown us that it can be advantageous to reverse a given row ordering. We present two results on invariances under the reversal of the ordering and use real applications to illustrate the v ..."
Abstract
 Add to MetaCart
The efficiency of the rowbyrow frontal method is dependent on the row ordering used. Numerical experience has shown us that it can be advantageous to reverse a given row ordering. We present two results on invariances under the reversal of the ordering and use real applications to illustrate
TwoStage Ordering for Unsymmetric Parallel RowByRow Frontal Solvers.
, 2000
"... The rowbyrow frontal method may be used to solve general large sparse linear systems of equations. By partitioning the matrix into (nearly) independent blocks and applying the frontal method to each block, a coarsegrained parallel frontal algorithm is obtained. The success of this approach depend ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
). For a range of practical examples from chemical process engineering it is shown that the proposed algorithm substantially reduces the block frontal matrix size and, for sufficiently large problems, this can lead to significant reductions in the factorization times when the rowbyrow frontal method
WEAK STRUCTURE AT INFINITY AND ROWBYROW DECOUPLING FOR LINEAR DELAY SYSTEMS
"... We consider the rowbyrow decoupling problem for linear delay systems and show some close connections between the design of a decoupling controller and some particular structures of delay systems, namely the socalled weak structure at infinity. The realization by static state feedback of decouplin ..."
Abstract
 Add to MetaCart
We consider the rowbyrow decoupling problem for linear delay systems and show some close connections between the design of a decoupling controller and some particular structures of delay systems, namely the socalled weak structure at infinity. The realization by static state feedback
Algorithm 8xx: a concise sparse Cholesky factorization package
 Univ. of Florida
, 2004
"... The LDL software package is a set of short, concise routines for factorizing symmetric positivedefinite sparse matrices, with some applicability to symmetric indefinite matrices. Its primary purpose is to illustrate much of the basic theory of sparse matrix algorithms in as concise a code as possib ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
as possible, including an elegant new method of sparse symmetric factorization that computes the factorization rowbyrow but stores it columnbycolumn. The entire symbolic and numeric factorization consists of a total of only 53 lines of code. The package is written in C, and includes a MATLAB interface.
User Guide for LDL, a concise sparse Cholesky package
, 2012
"... The LDL software package is a set of short, concise routines for factorizing symmetric positivedefinite sparse matrices, with some applicability to symmetric indefinite matrices. Its primary purpose is to illustrate much of the basic theory of sparse matrix algorithms in as concise a code as poss ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
as possible, including an elegant method of sparse symmetric factorization that computes the factorization rowbyrow but stores it columnbycolumn. The entire symbolic and numeric factorization consists of less than 50 lines of code. The package is written in C, and includes a MATLAB interface. 1
Factoring wavelet transforms into lifting steps
 J. Fourier Anal. Appl
, 1998
"... ABSTRACT. This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This dec ..."
Abstract

Cited by 573 (8 self)
 Add to MetaCart
. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is wellknown to algebraists (and expressed by the formula); it is also used in linear systems theory in the electrical engineering community. We
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract

Cited by 1103 (7 self)
 Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a family of volume rendering algorithms that reduces rendering times to one second. First we present a scanlineorder volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanlineorder algorithms are fundamentally more efficient than commonlyused ray casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective projections and
Okapi at TREC3
, 1996
"... this document length correction factor is #global": it is added at the end, after the weights for the individual terms have been summed, and is independentofwhich terms match. ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
this document length correction factor is #global": it is added at the end, after the weights for the individual terms have been summed, and is independentofwhich terms match.
Results 1  10
of
740,262