# On the Numerical Solution of Cyclic Tridiagonal Systems

@inproceedings{Piller1999OnTN, title={On the Numerical Solution of Cyclic Tridiagonal Systems}, author={Marzio Piller}, year={1999} }

All numerical techniques for the solution of Partial Differential Equations (PDE) involve discretization. Many times this discretization leads to the solution of a large system of linear equations, the generic of which can be represented as Ax = D; A is known as the coefficient matrix , while x is the vector of unknowns and D is the right-hand side vector. It often happens that the coefficient matrix has some particular properties, such that a general-purpose solution algorithm results too… Expand

No Paper Link Available

#### References

SHOWING 1-3 OF 3 REFERENCES

SOME EXTENSIONS OF TRIDIAGONAL AND PENTADIAGONAL MATRIX ALGORITHMS

- Mathematics
- 1995

Abstract Tridiagonal, pentadiagonal, and cyclic triagonal matrix algorithms are well-eestablished elements of line-by-line iterative procedures for the solution of algebraic decretized equations… Expand