A recursive algorithm for matrix Padé approximants—the divide-and-conquer approach
✍ Scribed by P. Achuthan; S. Sundar
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 500 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
In this paper, we present an efficient and systematic algorithm for the solution of electromagnetic scattering and radiation problems o¨er a wide frequency inter¨al. The algorithm is based on the e¨aluation of the Pade approximant of the solution ¨ector, constructed át a minimum number of expansion