Performance analysis of 13 methods to solve the Galerkin method equations

DOI10.1016/0024-3795(83)80035-4MaRDI QIDQ1052071zbMATH OpenOpenAlexFDO

Authors John R. Rice

Publication date 1983

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/297

zbMATH Keywords

computational experimentsGalerkin methodcomparison of methodssparse matrix methodssparse Gaussian elimination

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites work

• scientific article; zbMATH DE number 3733182 (Why is no real title available?)
• scientific article; zbMATH DE number 3748409 (Why is no real title available?)
• scientific article; zbMATH DE number 3436463 (Why is no real title available?)
• A population of linear, second order, elliptic partial differential equations on rectangular domains. I, II
• Yale sparse matrix package I: The symmetric codes

Cited in

(2)

• Mathematical software: Past, present, and future
• An experimental performance analysis for the rate of convergence of collocation on general domains

Describes a project that uses

Uses Software

• NSPIV
• YSMP
• LINPACK

This page was built for publication: Performance analysis of 13 methods to solve the Galerkin method equations

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