𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive T-matrix algorithm for multiple metallic cylinders

✍ Scribed by Adnan Şahin; Eric L. Miller

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
205 KB
Volume
15
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.

✦ Synopsis

We present a new application of the recursi¨e T-matrix algorithm to calculate the scattered field from a single or multiple metallic cylinders of arbitrary shapes. Using the equi¨alence theorem, each metallic object is replaced with small metallic cylinders along its perimeter; then scattered fields are calculated using the recursi¨e T-matrix algorithm. Results are ¨erified by those in the literature and by analytical calculations.

📜 SIMILAR VOLUMES

A practical algorithm for faster matrix
A practical algorithm for faster matrix multiplication
✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab

Improved Bounds in the Multiple-Recursiv
Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation
✍ Harold Niederreiter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f

A submatrix algorithm for the matrix-vec
A submatrix algorithm for the matrix-vector multiplication of very large matrices
✍ Roland Lindh; Per-Årke Malmquist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form

A framework for high-performance matrix
A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels
✍ Vinod Valsalam; Anthony Skjellum 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

## Abstract Despite extensive research, optimal performance has not easily been available previously for matrix multiplication (especially for large matrices) on most architectures because of the lack of a structured approach and the limitations imposed by matrix storage formats. A simple but effec

Compound matrix method for eigenvalue pr
Compound matrix method for eigenvalue problems in multiple connected domains
✍ Anturkar, N. R. ;Papanastasiou, T. C. ;Wilkes, J. O. 📂 Article 📅 1992 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 490 KB 👁 1 views

An algorithm based on a compound matrix method is presented for solving difficult eigenvalue problems of n equation sets in connected domains that are coupled through (n -1) sets of interfacial boundary conditions, when n is an arbitrary number. As an example, a linear stability problem of n-layer p