The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any nonsingular matrix of ordern in <Cxnlos'7 operations, and, hence, theâ€¦ (More)

Several decompositions of, symmetric matrices for calculating inertia and solving systems of linear equations are discussed. New partial pivoting strategies for decomposing symmetric matrices areâ€¦ (More)

The LBL factorization of Bunch for solving linear systems involving a symmetric indefinite tridiagonal matrix T is a stable, efficient method. It computes a unit lower triangular matrix L and a blockâ€¦ (More)

32 BLAS routines can be used to implement the preconditioning operation for several common preconditioners. It has also been shown that the eecient implementation of the Iterative BLAS kernels onâ€¦ (More)

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because ofâ€¦ (More)

The techniques employed for analyzing algorithms in numerical linear algebra have evolved significantly since the 1940â€™s. Significant in this evolution is the partitioning of the terminology intoâ€¦ (More)