Fast Gauss-Doolittle matrix triangulation

DOI10.1016/0045-7949(88)90033-8zbMATH Open0627.73085OpenAlexW2093932806MaRDI QIDQ3763705FDOQ3763705

Authors:

Publication date: 1988

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(88)90033-8

Recommendations

• Efficient parallel Gauss-Doolittle matrix triangulation
• Fast \(CU\) triangular factorization algorithm
• scientific article; zbMATH DE number 176382
• A parallel-vector algorithm for rapid structural analysis on high-performance computers
• scientific article; zbMATH DE number 4054913

zbMATH Keywords

Hermitiantriangulationhybrid methodGauss eliminationDoolittle eliminationsquare real symmetric

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Yxx) Software, source code, etc. for problems pertaining to mechanics of deformable solids (74-04)

Cited In (3)

• Fast calculating node impedance matrix with symmetrical \(\boldsymbol{LR}\) triangular factorization algorithm
• Fast \(CU\) triangular factorization algorithm
• Efficient parallel Gauss-Doolittle matrix triangulation

This page was built for publication: Fast Gauss-Doolittle matrix triangulation

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