A recursive method for finding the inverse of a CSP matrix
โ Scribed by I. Ramabhadra Sarma; A.V. Dattatreya Rao; B. Rami Reddy
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 188 KB
- Volume
- 92
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
series is d e c o m p o s e d i n t o t e r m s which a r e p r o d u c t s of connected coefficients: the p r o c e d u r e lends itself to an efficient method of truncation that obtains a n a p p r o x im a t i o n t o the i n v e r s e m a t r i x . While t h i s a l g o r i t h m might not be e
In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study
Ray-Chaudhuri, D.K., T. Zhu, A recursive method for construction of designs, Discrete Mathematics 106/107 (1992) 399-406. In this paper, we generalize Blanchard and Narayani's constructions of designs in the following ways. (1) By applying an orthogonal array to the construction, we can reduce the