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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n20https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
n5https://web.archive.org/web/20080228054053/http:/www.mgnet.org/mgnet/Codes/jmandel/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n18http://
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Balancing_domain_decomposition_method
Subject Item
dbr:Balancing_domain_decomposition
dbo:wikiPageWikiLink
dbr:Balancing_domain_decomposition_method
dbo:wikiPageRedirects
dbr:Balancing_domain_decomposition_method
Subject Item
dbr:Balancing_domain_decomposition_method
rdf:type
yago:PsychologicalFeature100023100 yago:Cognition100023271 yago:Ability105616246 yago:Know-how105616786 yago:Abstraction100002137 yago:WikicatDomainDecompositionMethods dbo:Software yago:Method105660268
rdfs:label
Balancing domain decomposition method
rdfs:comment
In numerical analysis, the balancing domain decomposition method (BDD) is an iterative method to find the solution of a symmetric positive definite system of linear algebraic equations arising from the finite element method. In each iteration, it combines the solution of local problems on non-overlapping subdomains with a coarse problem created from the subdomain nullspaces. BDD requires only solution of subdomain problems rather than access to the matrices of those problems, so it is applicable to situations where only the solution operators are available, such as in oil reservoir simulation by . In its original formulation, BDD performs well only for 2nd order problems, such elasticity in 2D and 3D. For 4th order problems, such as plate bending, it needs to be modified by adding to the c
dcterms:subject
dbc:Domain_decomposition_methods
dbo:wikiPageID
16252572
dbo:wikiPageRevisionID
897484470
dbo:wikiPageWikiLink
dbc:Domain_decomposition_methods dbr:BDDC dbr:Symmetric dbr:Plate_bending dbr:Oil_reservoir dbr:Eigenvalue dbr:Simulation dbr:FETI dbr:Nullspace dbr:Elasticity_(physics) dbr:Null_space dbr:Iterative_method dbr:Mixed_finite_elements dbr:Linear dbr:Finite_element_method dbr:Positive_definite dbr:Neumann–Neumann_methods dbr:Coarse_problem dbr:Neumann_problem dbr:Numerical_analysis dbr:Schur_complement dbr:Algebraic_equation
dbo:wikiPageExternalLink
n5: n18:www.domain-decomposition.com
owl:sameAs
wikidata:Q4850008 yago-res:Balancing_domain_decomposition_method freebase:m.03wf2tt n20:4VS1p
dbp:wikiPageUsesTemplate
dbt:Numerical_PDE
dbo:abstract
In numerical analysis, the balancing domain decomposition method (BDD) is an iterative method to find the solution of a symmetric positive definite system of linear algebraic equations arising from the finite element method. In each iteration, it combines the solution of local problems on non-overlapping subdomains with a coarse problem created from the subdomain nullspaces. BDD requires only solution of subdomain problems rather than access to the matrices of those problems, so it is applicable to situations where only the solution operators are available, such as in oil reservoir simulation by . In its original formulation, BDD performs well only for 2nd order problems, such elasticity in 2D and 3D. For 4th order problems, such as plate bending, it needs to be modified by adding to the coarse problem special basis functions that enforce continuity of the solution at subdomain corners, which makes it however more expensive. The BDDC method uses the same corner basis functions as, but in an additive rather than multiplicative fashion. The dual counterpart to BDD is FETI, which enforces the equality of the solution between the subdomain by Lagrange multipliers. The base versions of BDD and FETI are not mathematically equivalent, though a special version of FETI designed to be robust for hard problems has the same eigenvalues and thus essentially the same performance as BDD. The operator of the system solved by BDD is the same as obtained by eliminating the unknowns in the interiors of the subdomain, thus reducing the problem to the Schur complement on the subdomain interface. Since the BDD preconditioner involves the solution of Neumann problems on all subdomain, it is a member of the Neumann–Neumann class of methods, so named because they solve a Neumann problem on both sides of the interface between subdomains. In the simplest case, the coarse space of BDD consists of functions constant on each subdomain and averaged on the interfaces. More generally, on each subdomain, the coarse space needs to only contain the nullspace of the problem as a subspace.
gold:hypernym
dbr:Method
prov:wasDerivedFrom
wikipedia-en:Balancing_domain_decomposition_method?oldid=897484470&ns=0
dbo:wikiPageLength
4399
foaf:isPrimaryTopicOf
wikipedia-en:Balancing_domain_decomposition_method
Subject Item
wikipedia-en:Balancing_domain_decomposition_method
foaf:primaryTopic
dbr:Balancing_domain_decomposition_method