Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Hierarchical matrix
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Hierarchical_matrix
http://dbpedia.org/ontology/abstract In numerical mathematics, hierarchical matIn numerical mathematics, hierarchical matrices (H-matrices)are used as data-sparse approximations of non-sparse matrices. While a sparse matrix of dimension can be represented efficiently in units of storage by storing only its non-zero entries, a non-sparse matrix would require units of storage, and using this type of matrices for large problems would therefore be prohibitively expensive in terms of storage and computing time. Hierarchical matrices provide an approximation requiring only units of storage, where is a parameter controlling the accuracy of the approximation. In typical applications, e.g., when discretizing integral equations,preconditioning the resulting systems of linear equations,or solving elliptic partial differential equations, a rank proportional to with a small constant is sufficient to ensure an accuracy of . Compared to many other data-sparse representations of non-sparse matrices, hierarchical matrices offer a major advantage: the results of matrix arithmetic operations like matrix multiplication, factorization or inversion can be approximated in operations, wheren can be approximated in operations, where
http://dbpedia.org/ontology/wikiPageExternalLink https://www.wr.uni-bayreuth.de/en/software/ahmed + , https://github.com/gchavez2/awesome-hierarchical-matrices + , https://github.com/JuliaMatrices/HierarchicalMatrices.jl + , http://www.hlibpro.com + , http://www.h2lib.org + , http://www.hlib.org +
http://dbpedia.org/ontology/wikiPageID 33198000
http://dbpedia.org/ontology/wikiPageLength 15019
http://dbpedia.org/ontology/wikiPageRevisionID 1068473627
http://dbpedia.org/ontology/wikiPageWikiLink http://dbpedia.org/resource/LU_decomposition + , http://dbpedia.org/resource/Numerical_mathematics + , http://dbpedia.org/resource/Lagrange_polynomial + , http://dbpedia.org/resource/Green%27s_function + , http://dbpedia.org/resource/Boundary_element_method + , http://dbpedia.org/resource/Galerkin_method + , http://dbpedia.org/resource/Spectral_method + , http://dbpedia.org/resource/Category:Matrices + , http://dbpedia.org/resource/Schur_complement + , http://dbpedia.org/resource/Low_rank_approximation + , http://dbpedia.org/resource/Panel_clustering + , http://dbpedia.org/resource/Fast_multipole_method + , http://dbpedia.org/resource/Polynomial_interpolation + , http://dbpedia.org/resource/Finite_element_method + , http://dbpedia.org/resource/Sparse_matrix +
http://purl.org/dc/terms/subject http://dbpedia.org/resource/Category:Matrices +
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Hierarchical_matrix?oldid=1068473627&ns=0 +
http://xmlns.com/foaf/0.1/isPrimaryTopicOf http://en.wikipedia.org/wiki/Hierarchical_matrix +
owl:sameAs https://global.dbpedia.org/id/faco + , http://rdf.freebase.com/ns/m.0h6801n + , http://www.wikidata.org/entity/Q17029389 + , http://yago-knowledge.org/resource/Hierarchical_matrix + , http://dbpedia.org/resource/Hierarchical_matrix +
rdf:type http://dbpedia.org/class/yago/Group100031264 + , http://dbpedia.org/class/yago/Abstraction100002137 + , http://dbpedia.org/class/yago/WikicatMatrices + , http://dbpedia.org/class/yago/Array107939382 + , http://dbpedia.org/class/yago/Arrangement107938773 + , http://dbpedia.org/class/yago/Matrix108267640 +
rdfs:comment In numerical mathematics, hierarchical matIn numerical mathematics, hierarchical matrices (H-matrices)are used as data-sparse approximations of non-sparse matrices. While a sparse matrix of dimension can be represented efficiently in units of storage by storing only its non-zero entries, a non-sparse matrix would require units of storage, and using this type of matrices for large problems would therefore be prohibitively expensive in terms of storage and computing time. Hierarchical matrices provide an approximation requiring only units of storage, where is a parameter controlling the accuracy of the approximation. In typical applications, e.g., when discretizing integral equations,preconditioning the resulting systems of linear equations,or solving elliptic partial differential equations, a rank proportional to with a smalltions, a rank proportional to with a small
rdfs:label Hierarchical matrix
hide properties that link here 
http://dbpedia.org/resource/H-matrix + , http://dbpedia.org/resource/Comparison_of_Gaussian_process_software + , http://dbpedia.org/resource/Boundary_element_method + , http://dbpedia.org/resource/Wolfgang_Hackbusch + , http://dbpedia.org/resource/Hierarchical_matrices + http://dbpedia.org/ontology/wikiPageWikiLink
http://en.wikipedia.org/wiki/Hierarchical_matrix + http://xmlns.com/foaf/0.1/primaryTopic
http://dbpedia.org/resource/Hierarchical_matrix + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.