๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Two space-saving algorithms for computing the permuted transpose of a sparse matrix

โœ Scribed by Frank Cameron

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
959 KB
Volume
17
Category
Article
ISSN
0965-9978

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computing entries of the inverse of a sp
Computing entries of the inverse of a sparse matrix using the FIND algorithm
โœ S. Li; S. Ahmed; G. Klimeck; E. Darve ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

An accurate and efficient algorithm, called fast inverse using nested dissection (FIND), for computing non-equilibrium Green's functions (NEGF) for nanoscale transistors has been developed and applied in the simulation of a novel dual-gate metal-oxide-semiconductor field-effect transistor (MOSFET) d

Linear combination of Lanczos vectors: A
Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations
โœ T. Koslowski; W. Von Niessen ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i

Fast algorithms for placing large entrie
Fast algorithms for placing large entries along the diagonal of a sparse matrix
โœ Vamsi Kundeti; Sanguthevar Rajasekaran ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

a b s t r a c t Solving a sparse system of linear equations Ax = b is one of the most fundamental operations inside any circuit simulator. The equations/rows in the matrix A are often rearranged/permuted before factorization and applying direct or iterative methods to obtain the solution. Permuting

Algorithms for the computation of the tr
Algorithms for the computation of the transfer function matrix for two-dimensional regular and singular general state-space models
โœ Zou Yun; Yang Chengwu ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

problem of computing the transfer function matrices for regular and singular discrete two-dimensional general state-space models (2D GM) is discussed, and some programmable algorithms are developed that generalize the well-known Leverrier algorithm to 2D systems of general form. The results also sho