Schur Complement Method
Versandkostenfrei!
Versandfertig in 6-10 Tagen
19,99 €
inkl. MwSt.
PAYBACK Punkte
10 °P sammeln!
High Quality Content by WIKIPEDIA articles! In numerical analysis, the Schur complement method 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. The Schur complement is usually not stored, but the multiplication of a vector by the Schur complement is imple...
High Quality Content by WIKIPEDIA articles! In numerical analysis, the Schur complement method 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. The Schur complement is usually not stored, but the multiplication of a vector by the Schur complement is implemented by solving the Dirichlet problem on each subdomain. The multiplication of a vector by the Schur complement is a discrete version of the Poincaré Steklov operator, also called the Dirichlet to Neumann mapping.
Andere Kunden interessierten sich für
