منابع مشابه
Direct Solvers for Sparse Matrices
There is a vast variety of algorithms associated with each step. The review papers by Duff [16] (see also [15, Chapter 6]) and Heath et al. [27] can serve as excellent reference of various algorithms. Usually steps 1 and 2 involve only the graphs of the matrices, and hence only integer operations. Steps 3 and 4 involve floating-point operations. Step 3 is usually the most time-consuming part, w...
متن کاملDirect linear time solvers for sparse matrices
In the last couple of years it has been realized that Gaussian elimination for sparse matrices arising from certain elliptic PDEs can be done in O(n log(1/ )) flops, where n is the number of unknowns and is a user-specified tolerance [Chandrasekaran and Gu]. The resulting solver will also be backward stable with an error of O( ). The techniques used to achieve this speedup has some commonality ...
متن کاملOptimal direct determination of sparse Jacobian matrices
It is well known that a sparse Jacobian matrix can be determined with fewer function evaluations or automatic differentiation passes than the number of independent variables of the underlying function. In this paper we show that by grouping together rows into blocks one can reduce this number further. We propose a graph coloring technique for row partitioned Jacobian matrices to efficiently det...
متن کاملSparse Direct Factorizations through Unassembled Hyper-Matrices
We present a novel strategy for sparse direct factorizations that is geared towards the matrices that arise from hp-adaptive Finite Element Methods. In that context, a sequence of linear systems derived by successive local refinement of the problem domain needs to be solved. Thus, there is an opportunity for a factorization strategy that proceeds by updating (and possibly downdating) the factor...
متن کاملSparse Direct Methods for Model Simulation
In this paper, diierent strategies to exploit the sparse structure in the solution techniques for macroeconometric models with forward-looking variables are discussed. First, the stacked model is decomposed into recursive submodels without destroying its original block pattern. Next, we concentrate on how to eeciently solve the sparse linear system in the Newton algorithm. In this frame, a mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1980
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v9i123.6541