Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17103137> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q17103137 subject Q8386923.
- Q17103137 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.".
- Q17103137 wikiPageWikiLink Q11216.
- Q17103137 wikiPageWikiLink Q1147936.
- Q17103137 wikiPageWikiLink Q1191895.
- Q17103137 wikiPageWikiLink Q1192869.
- Q17103137 wikiPageWikiLink Q14097093.
- Q17103137 wikiPageWikiLink Q17007827.
- Q17103137 wikiPageWikiLink Q17099589.
- Q17103137 wikiPageWikiLink Q1778169.
- Q17103137 wikiPageWikiLink Q220184.
- Q17103137 wikiPageWikiLink Q339444.
- Q17103137 wikiPageWikiLink Q5289813.
- Q17103137 wikiPageWikiLink Q7001954.
- Q17103137 wikiPageWikiLink Q7001956.
- Q17103137 wikiPageWikiLink Q72599.
- Q17103137 wikiPageWikiLink Q8386923.
- Q17103137 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.".
- Q17103137 label "Schur complement method".