Performance analysis of 13 methods to solve the Galerkin method equations

DOI10.1016/0024-3795(83)80035-4zbMath0515.65081OpenAlexW2045202599MaRDI QIDQ1052071

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

comparison of methodsGalerkin methodcomputational experimentssparse Gaussian eliminationsparse matrix methods

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

• LINPACK
• YSMP
• NSPIV

Cites Work

• A population of linear, second order, elliptic partial differential equations on rectangular domains. I, II
• Yale sparse matrix package I: The symmetric codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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