Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4850008> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Q4850008 subject Q8386923.
- Q4850008 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 mixed finite elements. 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.".
- Q4850008 wikiPageExternalLink jmandel.
- Q4850008 wikiPageWikiLink Q11216.
- Q4850008 wikiPageWikiLink Q1149279.
- Q4850008 wikiPageWikiLink Q12485.
- Q4850008 wikiPageWikiLink Q17004830.
- Q4850008 wikiPageWikiLink Q1753188.
- Q4850008 wikiPageWikiLink Q1778169.
- Q4850008 wikiPageWikiLink Q1845437.
- Q4850008 wikiPageWikiLink Q190524.
- Q4850008 wikiPageWikiLink Q220184.
- Q4850008 wikiPageWikiLink Q2321565.
- Q4850008 wikiPageWikiLink Q2914509.
- Q4850008 wikiPageWikiLink Q45045.
- Q4850008 wikiPageWikiLink Q4835365.
- Q4850008 wikiPageWikiLink Q50698.
- Q4850008 wikiPageWikiLink Q5138064.
- Q4850008 wikiPageWikiLink Q5425382.
- Q4850008 wikiPageWikiLink Q62932.
- Q4850008 wikiPageWikiLink Q7001956.
- Q4850008 wikiPageWikiLink Q7233276.
- Q4850008 wikiPageWikiLink Q8386923.
- Q4850008 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.".
- Q4850008 label "Balancing domain decomposition method".