Improving test coverage of LAPACK

ISSN： 0938-1279

Source： Applicable Algebra in Engineering, Communication and Computing, Vol.18, Iss.3, 2007-05, pp. : 209-222

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Faster and Simpler Recursive Algorithm for the LAPACK Routine DGELS

By Elmroth Erik Gustavson Fred

Bit Numerical Mathematics, Vol. 41, Iss. 5, 2001-12 ,pp. : 936-949

Springer Publishing Company

Access to resources Recommend Favorite

Secrecy Coverage

By Sarkar Amites

Internet Mathematics, Vol. 9, Iss. 2-3, 2013-06 ,pp. : 199-216

Taylor & Francis Ltd

Access to resources Recommend Favorite

Workload coverage through nonsmooth optimization

By Sukhorukova Nadezda Ugon Julien Yearwood John

Optimization Methods and Software, Vol. 24, Iss. 2, 2009-04 ,pp. : 285-298

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient and inefficient ant coverage methods

By Koenig Sven

Annals of Mathematics and Artificial Intelligence, Vol. 31, Iss. 1-4, 2001-10 ,pp. : 41-76

Springer Publishing Company

Access to resources Recommend Favorite

Coverage for robotics – A survey of recent results

By Choset Howie

Annals of Mathematics and Artificial Intelligence, Vol. 31, Iss. 1-4, 2001-10 ,pp. : 113-126

Springer Publishing Company

Access to resources Recommend Favorite