Search results for "Elimination-tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
50	Wen-Yang Lin	Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms.	Appl. Intell.	2005	DBLP DOI BibTeX RDF	sparse matrix ordering, parallel factorization, genetic algorithms, elimination tree
31	Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson	Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height.	WG	1991	DBLP DOI BibTeX RDF
26	Wen-Yang Lin	Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	column task graph, sparse matrix ordering, parallel computing, Cholesky factorization, elimination tree
24	Maciej Paszynski, Robert Schaefer	Reutilization of Partial LU Factorizations for Self-adaptive hpFinite Element Method Solver.	ICCS (1)	2008	DBLP DOI BibTeX RDF
20	Chung-Hsien Hsu, Sheng-Lung Peng, Chong-Hui Shi	Constructing a minimum height elimination tree of a tree in linear time.	Inf. Sci.	2007	DBLP DOI BibTeX RDF
18	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	Algorithmica	2005	DBLP DOI BibTeX RDF	Bandwidth, Chordal graph, Graph searching, Tree decomposition, Elimination tree
18	Michel Cosnard, Laura Grigori	Using Postordering and Static Symbolic Factorization for Parallel Sparse LU.	IPDPS	2000	DBLP DOI BibTeX RDF	sparse unsymmetric matrices, partial pivoting, static symbolic factorization, postordering, Gaussian elimination, elimination tree
18	Jochen A. G. Jess, H. G. M. Kees	A Data Structure for Parallel L/U Decomposition.	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	triangulated graph, L/U decomposition, sparse matrix pivoting, tearing, schedule, parallel processing, task graph, Elimination-tree
15	Enver Kayaaslan, Bora Uçar	Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices.	HiPC	2014	DBLP DOI BibTeX RDF
15	Firas Al-Hasani, Michael P. Hayes, Andrew Bainbridge-Smith	A Common Subexpression Elimination Tree Algorithm.	IEEE Trans. Circuits Syst. I Regul. Pap.	2013	DBLP DOI BibTeX RDF
15	John R. Gilbert, Laura Grigori	A Note on the Column Elimination Tree.	SIAM J. Matrix Anal. Appl.	2003	DBLP DOI BibTeX RDF
15	Wen-Yang Lin, Chuen-Liang Chen	On evaluating elimination tree based parallel sparse cholesky factorizations.	Int. J. Comput. Math.	2000	DBLP DOI BibTeX RDF
15	Bengt Aspvall	Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.	Inf. Process. Lett.	1995	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks	Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.	J. Algorithms	1995	DBLP DOI BibTeX RDF
15	Younzhou Zhu, David Mutchler	On Constructing the Elimination Tree.	Discret. Appl. Math.	1994	DBLP DOI BibTeX RDF
15	P. Sreenivasa Kumar, M. Kishore Kumar, A. Basu	A parallel algorithm for elimination tree computation and symbolic factorization.	Parallel Comput.	1992	DBLP DOI BibTeX RDF
8	Vladimir Rotkin, Sivan Toledo	The design and implementation of a new out-of-core sparse cholesky factorization method.	ACM Trans. Math. Softw.	2004	DBLP DOI BibTeX RDF	out-of-core
8	Dariusz Dereniowski, Marek Kubale	Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.	PPAM	2003	DBLP DOI BibTeX RDF
8	Wen-Yang Lin, Chuen-Liang Chen	On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations.	IPDPS	2000	DBLP DOI BibTeX RDF
8	Venu M. Padakanti	Sparse cholesky factorization on a simulated hypercube.	ACM Southeast Regional Conference	1992	DBLP DOI BibTeX RDF
8	John R. Gilbert, Hjálmtyr Hafsteinsson	Parallel Solution of Space Linear Systems.	SWAT	1988	DBLP DOI BibTeX RDF