HTML Microdata document

This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n10	https://global.dbpedia.org/id/
yago	http://dbpedia.org/class/yago/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink: dbr:Schur_complement_method

Subject Item: dbr:Neumann–Neumann_methods
dbo:wikiPageWikiLink: dbr:Schur_complement_method

Subject Item: dbr:List_of_things_named_after_Issai_Schur
dbo:wikiPageWikiLink: dbr:Schur_complement_method

Subject Item: dbr:Poincaré–Steklov_operator
dbo:wikiPageWikiLink: dbr:Schur_complement_method

Subject Item: dbr:Schur_complement_method
rdf:type: yago:PsychologicalFeature100023100 yago:WikicatDomainDecompositionMethods yago:Abstraction100002137 yago:Know-how105616786 yago:Ability105616246 yago:Cognition100023271 yago:Method105660268
rdfs:label: Schur complement method
rdfs:comment: In numerical analysis, the Schur complement method, named after Issai Schur, is the basic and the earliest version of non-overlapping domain decomposition method, also called iterative substructuring. A finite element problem is split into non-overlapping subdomains, and the unknowns in the interiors of the subdomains are eliminated. The remaining Schur complement system on the unknowns associated with subdomain interfaces is solved by the conjugate gradient method.
dcterms:subject: dbc:Domain_decomposition_methods
dbo:wikiPageID: 16269477
dbo:wikiPageRevisionID: 972789634
dbo:wikiPageWikiLink: dbr:Domain_decomposition_method dbr:Numerical_analysis dbr:Issai_Schur dbr:Linear_elasticity dbr:Discretization dbr:Finite_element dbc:Domain_decomposition_methods dbr:Conjugate_gradient_method dbr:Poincaré–Steklov_operator dbr:Dirichlet_to_Neumann_mapping dbr:Laplace_equation dbr:Iterative_substructuring dbr:Neumann–Dirichlet_method dbr:Schur_complement dbr:Condition_number dbr:Dirichlet_problem dbr:Neumann–Neumann_method dbr:Diagonal_preconditioner
owl:sameAs: n10:f67b wikidata:Q17103137 yago-res:Schur_complement_method freebase:m.03wfjx_
dbp:wikiPageUsesTemplate: dbt:Numerical_PDE dbt:Dablink dbt:Unreferenced
dbo:abstract: In numerical analysis, the Schur complement method, named after Issai Schur, is the basic and the earliest version of non-overlapping domain decomposition method, also called iterative substructuring. A finite element problem is split into non-overlapping subdomains, and the unknowns in the interiors of the subdomains are eliminated. The remaining Schur complement system on the unknowns associated with subdomain interfaces is solved by the conjugate gradient method.
prov:wasDerivedFrom: wikipedia-en:Schur_complement_method?oldid=972789634&ns=0
dbo:wikiPageLength: 3824
foaf:isPrimaryTopicOf: wikipedia-en:Schur_complement_method

Subject Item: wikipedia-en:Schur_complement_method
foaf:primaryTopic: dbr:Schur_complement_method