Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations

dc.contributor.author	Eberly, Wayne
dc.date.accessioned	2016-11-02T22:04:02Z
dc.date.available	2016-11-02T22:04:02Z
dc.date.issued	2016-11-02
dc.description.abstract	Processes to automate the selection of appropriate algorithms for various matrix computations are described. In particular, processes to check for, and certify, various matrix properties of black-box matrices are presented. These include sparsity patterns and structural properties that allow “superfast” algorithms to be used in place of black box algorithms. Matrix properties that hold generically, and allow the use of matrix preconditioning to be reduced or eliminated, can also be checked for and certified — notably including in the small-field case, where this presently has the greatest impact on the efficiency of the computation.	en_US
dc.description.refereed	No	en_US
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/30593
dc.identifier.uri	http://hdl.handle.net/1880/51739
dc.publisher.department	Computer Science	en_US
dc.publisher.faculty	Science	en_US
dc.publisher.institution	University of Calgary	en_US
dc.relation.ispartofseries	2016-1085-04;
dc.subject	Algorithms	en_US
dc.subject	Black Box Matrices	en_US
dc.subject	Computations	en_US
dc.title	Selecting Algorithms for Black Box Matrices: Checking for Matrix Properties That Can Simplify Computations	en_US
dc.type	technical report	en_US