Fast solution of MSC/NASTRAN sparse matrix problems using a multilevel approach

Authors D. Massart, Clemens-August Thole, Sebastian Mayer, Alexander Supalov

Publication date 15 March 1998

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119478, http://www.emis.de/journals/ETNA/vol.6.1997/pp246-254.dir/pp246-254.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

finite elements multigrid methods multilevel method parallel computation preconditioner

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)

Review text

This paper examines a special multilevel method as preconditioner for matrices resulting from MSC/NASTRAN linear static analysis of solid structures. The polynomial degree of the base functions can be specified either globally or for each element. Solution dependent adaptive ``refinement of the \(p\)-level can be selected. Discretizations with lower \(p\)-level can therefore be used as coarser grids for a multilevel method. Case studies illustrate the effectiveness of the methodology.

Recommendations

Describes a project that uses

Uses Software

This page was built for publication: Fast solution of MSC/NASTRAN sparse matrix problems using a multilevel approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381070)