SIAM Journal on Numerical Analysis · 1977 · 123 citations · 33 references
ComputingComputer ScienceMathematicsAlgorithmsComputational MechanicsScientific ComputingConvergence AnalysisError EstimationIterative SolversNumerical AlgorithmsNumerical AnalysisNumerical Methods For Differential EquationsBoundary Value Problem SolversChebyshev PolynomialsElliptic Boundary-value ProblemsNumerical Solutions Of Partial Differential Equations
Several new fast direct methods for solving constant coefficient elliptic boundary value problems are presented. The methods make extensive use of the algebraic properties of the modified Chebyshev polynomials $S_n (x)$ and $C_n (x)$, which allow us to obtain operation counts of $O(n^2 )$ or $O(n^2 \log _2 ({n / k}))$ for solving problems on an $n \times n$ grid. The algorithms are shown to be numerically stable by giving a Wilkinson-style error analysis. Previously studied fast direct methods, and shooting and multiple shooting techniques are related to the algorithms.
33
James H. Bramble, Richard S. Varga · Mathematics of Computation · 1963 · 4.2K citations
The algebraic eigenvalue problem
V.V. Voyevodin · USSR Computational Mathematics and Mathematical Physics · 1966 · 2.1K citations
Rounding errors in algebraic processes
Journal of the Franklin Institute · 1964 · 1.3K citations
Computer Solution of Linear Algebraic Systems
A. S. H., George E. Forsythe, C Moler · Mathematics of Computation · 1970 · 834 citations