LAPACK's user's guide
Matrix computations (3rd ed.)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
ACM Transactions on Mathematical Software (TOMS)
Interlaced switch boxes placement for three-dimensional FPGA architecture design
International Journal of Circuit Theory and Applications
| Hi-index | 0.00 |
In LAPACK we have two types of subroutines for solving problems with symmetric matrices: with full and packed storage. The performance of the full storage scheme is much better because it allows the usage of BLAS Level 2 and 3, while the memory requirements for the packed scheme are about twice less. Recently a new storage scheme was proposed which combines the advantages of both schemes: it has a performance similar to that of full storage, and the memory requirements are a little bit higher than for packed storage. In this paper we apply the scheme for inversion of symmetric indefinite matrices.