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
A Lanczos Approach to the Inverse Square Root of a Large and Sparse Matrix
✍ Scribed by Artan Boriçi
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 57 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this work, a numerical procedure is presented to obtain a sparse moment matrix for thin‐wire electromagnetic scattering problems. The numerical procedure involves developing a set of basis functions spanning several subdomains, as opposed to spanning one or two subdomains in the conv
the method of finite difference in a following paper. The results are useful in susceptibility or radiated emission tests and transmission line theory.
D'Aveni in a recent book proposes tools and frameworks that meet the new economic realities, and a new 7-S model of strategic management. ## * The D'Aveni concepts are applied in this article to the electrotechnical industry, and in particular to the Asea Brown Boveri merger of 1988. environment
## Abstract A new approach, based on the radial‐bias function neural network (RBF‐NN) combined with wavelet transform, is presented for the estimation of the locations and radii of conducting cylindrical scatterers. The discrete wavelet transform coefficients of the electric‐field values scattered