| dbo:abstract |
In numerical analysis, nested dissection is a divide and conquer heuristic for the solution of sparse symmetric systems of linear equations based on graph partitioning. Nested dissection was introduced by ; the name was suggested by Garrett Birkhoff. Nested dissection consists of the following steps: * Form an undirected graph in which the vertices represent rows and columns of the system of linear equations, and an edge represents a nonzero entry in the sparse matrix representing the system. * Recursively partition the graph into subgraphs using separators, small subsets of vertices the removal of which allows the graph to be partitioned into subgraphs with at most a constant fraction of the number of vertices. * Perform Cholesky decomposition (a variant of Gaussian elimination for symmetric matrices), ordering the elimination of the variables by the recursive structure of the partition: each of the two subgraphs formed by removing the separator is eliminated first, and then the separator vertices are eliminated. As a consequence of this algorithm, the fill-in (the set of nonzero matrix entries created in the Cholesky decomposition that are not part of the input matrix structure) is limited to at most the square of the separator size at each level of the recursive partition. In particular, for planar graphs (frequently arising in the solution of sparse linear systems derived from two-dimensional finite element method meshes) the resulting matrix has O(n log n) nonzeros, due to the planar separator theorem guaranteeing separators of size O(√n). For arbitrary graphs there is a nested dissection that guarantees fill-in within a factor of optimal, where d is the maximum degree and m is the number of non-zeros. (en) |
| dbo:wikiPageExternalLink |
http://www.ecommons.cornell.edu/handle/1813/6607 |
| dbo:wikiPageID |
28070753 (xsd:integer) |
| dbo:wikiPageLength |
4283 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
951629677 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbc:Sparse_matrices dbr:Cycle_rank dbr:Undirected_graph dbr:Vertex_separator dbr:Symmetric_matrix dbr:Garrett_Birkhoff dbr:Gaussian_elimination dbr:Glossary_of_graph_theory dbr:Cholesky_decomposition dbr:Planar_separator_theorem dbr:Graph_partitioning dbr:Numerical_analysis dbr:Recursion dbc:Numerical_linear_algebra dbr:Heuristic dbr:Divide_and_conquer_algorithm dbr:Sparse_matrix dbr:Finite_element_method dbr:System_of_linear_equations |
| dbp:wikiPageUsesTemplate |
dbt:Citation dbt:Harvtxt dbt:Radic dbt:Reflist |
| dct:subject |
dbc:Sparse_matrices dbc:Numerical_linear_algebra |
| gold:hypernym |
dbr:Divide |
| rdf:type |
yago:WikicatSparseMatrices yago:Abstraction100002137 yago:Arrangement107938773 yago:Array107939382 yago:Group100031264 yago:Matrix108267640 |
| rdfs:comment |
In numerical analysis, nested dissection is a divide and conquer heuristic for the solution of sparse symmetric systems of linear equations based on graph partitioning. Nested dissection was introduced by ; the name was suggested by Garrett Birkhoff. Nested dissection consists of the following steps: (en) |
| rdfs:label |
Nested dissection (en) |
| owl:sameAs |
freebase:Nested dissection yago-res:Nested dissection wikidata:Nested dissection https://global.dbpedia.org/id/4sSNC |
| prov:wasDerivedFrom |
wikipedia-en:Nested_dissection?oldid=951629677&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Nested_dissection |
| is dbo:wikiPageRedirects of |
dbr:Nested_dissection_algorithm |
| is dbo:wikiPageWikiLink of |
dbr:Cycle_rank dbr:List_of_numerical_analysis_topics dbr:Contraction_hierarchies dbr:Planar_separator_theorem dbr:Nested_dissection_algorithm |
| is foaf:primaryTopic of |
wikipedia-en:Nested_dissection |