Udo Schendel. Sparse Matrices: Numerical Aspects with Applications for Scientists and Engineers. Ellis Horwood Limited, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Polynomial Approximation Algorithm for the Minimum Fill-In .. - Assaf Natanzon Ron (1998) (1 citation) (Correct)
....in which (i; j) is an edge iff M i;j 6= 0. In 1979 Garey and Johnson [9] posed the complexity of the minimum fill in problem as a major open problem. Yannakakis subsequently proved that the minimum fill in problem is NP complete [22] Due to its importance the problem has been studied intensively [2, 11, 13, 21], and many heuristics have been developed for it [5, 12, 19, 20] None of those gives a performance guarantee with respect to the size of the fill in introduced. Note that in contrast, the minimal fill in problem (finding a a triangulation of G which is minimal with respect to inclusion) is ....
U. SCHENDEL, Sparse matrices: numerical aspects with applications for scientists and engineers, Ellis Horwood, 1989.
Grid Filters for Local Nonlinear Image Restoration - Veldhuizen (1998) (1 citation) (Correct)
....systems of equations. CG gets its name from the fact that its consecutive descent directions are conjugate (orthogonal) CG is fast and requires only a small amount of temporary working space. For efficiency, the sparse matrix is converted from hash table storage to compressed row storage (CRS) [42] prior to CG solution. Figure 2.7 gives an outline of the CG solution algorithm. Convergence was determined by checking the change in the parameter vector f every 20 iterations. The algorithm was halted when CHAPTER 2. THEORY AND IMPLEMENTATION 55 max i jf j i Gamma f j Gamma20 i j 10 ....
U. Schendel. Sparse Matrices: Numerical Aspects with Applications for Scientists and Engineers. Halsted Press, Toronto, 1989.
A Polynomial Approximation Algorithm for the Minimum.. - Natanzon, Shamir, Sharan (1998) (1 citation) (Correct)
....in which (i; j) is an edge iff M i;j 6= 0. In 1979 Garey and Johnson [9] posed the complexity of the minimum fill in problem as a major open problem. Yannakakis subsequently proved that the minimum fill in problem is NP complete [22] Due to its importance the problem has been studied intensively [2, 11, 12, 21] and many heuristics have been developed for it [5, 13, 19, 20] None of those gives a performance guarantee with respect to the size of the fill in introduced. Note that in contrast, the minimal fill in problem (finding a a triangulation of G which is minimal with respect to inclusion) is ....
U. Schendel. Sparse matrices: numerical aspects with applications for scientists and engineers. Ellis Horwood, 1989.
A Matlab Implementation of the Implicitly Restarted Arnoldi Method .. - Radke (1996) (5 citations) (Correct)
No context found.
Udo Schendel. Sparse Matrices: Numerical Aspects with Applications for Scientists and Engineers. Ellis Horwood Limited, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC