1974
DOI: 10.1145/360767.360777
|View full text |Cite
|
Sign up to set email alerts
|

A fast method for solving a class of tridiagonal linear systems

Abstract: Scrtmiv C UKsifiration / * DOCUMENT CONTROL DATA R&D iSecunty

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

1997
1997
2014
2014

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(17 citation statements)
references
References 1 publication
0
16
0
Order By: Relevance
“…We describe an algorithm adapted from Malcolm and Palmer [1974] for solving the common case where ϕ = p, q . , p is symmetric with support width of 3 elements.…”
Section: Inverse Discrete Convolutionmentioning
confidence: 99%
“…We describe an algorithm adapted from Malcolm and Palmer [1974] for solving the common case where ϕ = p, q . , p is symmetric with support width of 3 elements.…”
Section: Inverse Discrete Convolutionmentioning
confidence: 99%
“…With these relations, we can obtain from (6) and (9) with some algebraic manipulations (13) and (14). Combining the limit of {|x after some ÿnite steps of the QR factorization, we can get a vector x (k) which satisÿes the above condition.…”
Section: Theoremmentioning
confidence: 99%
“…In fact, if one can show that the entries in the QR factorization converge rapidly to machine precision, one can avoid the computation of the entire factorization and use the limits directly instead in the factors, as soon as convergence is achieved, leading to signiÿcant computational savings in solving the linear system Ax = c, or the least squares problem min Ax − d 2 (where A = is still a Toeplitz matrix) by the QR factorization. If A is a symmetric, diagonally dominant, tridiagonal Toeplitz matrix, it is shown in Reference [14] that the diagonals of the LU factors of A converge and computational savings are possible. Similar properties also hold for cyclic reduction, see Reference [15]; but for the QR factorization we are not aware of any results in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we develop a second-order finite difference approximation scheme and solve the resulting large algebraic system of linear equations systematically using block tridiagonal system [14] and extend the Hockney's method [15] to solve the three dimensional Poisson's equation on Cylindrical coordinates system.…”
Section: Introductionmentioning
confidence: 99%