Fast Linear Transformations in Python

This paper introduces a new free library for the Python programming language, which provides a collection of structured linear transforms, that are not represented as explicit two dimensional arrays but in a more efficient way by exploiting the structural knowledge. This allows fast and memory savy forward and backward transformations while also provding a clean but still flexible interface to these effcient algorithms, thus making code more readable, scable and adaptable. We first outline the goals of this library, then how they were achieved and lastly we demonstrate the performance compared to current state of the art packages available for Python. This library is released and distributed under a free license.

[1]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[2]  Stephen P. Boyd,et al.  Matrix-Free Convex Optimization Modeling , 2015, 1506.00760.

[3]  Tadeusz Stepinski,et al.  Synthetic aperture imaging using sources with finite aperture: deconvolution of the spatial impulse response. , 2003, The Journal of the Acoustical Society of America.

[4]  Emmanuel J. Candès,et al.  The curvelet transform for image denoising , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[5]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[6]  Stephen P. Boyd,et al.  A New Architecture for Optimization Modeling Frameworks , 2016, 2016 6th Workshop on Python for High-Performance and Scientific Computing (PyHPC).

[7]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[8]  Zhongxiao Jia,et al.  The Refined Harmonic Arnoldi Method and an Implicitly Restarted Refined Algorithm for Computing Interior Eigenpairs of Large Matrices , 2001 .

[9]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[10]  Gaël Varoquaux,et al.  The NumPy Array: A Structure for Efficient Numerical Computation , 2011, Computing in Science & Engineering.

[11]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.

[12]  Rachel Ward,et al.  New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property , 2010, SIAM J. Math. Anal..

[13]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[14]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[15]  Wang-Q Lim,et al.  Image interpolation using shearlet based sparsity priors , 2013, 2013 IEEE International Conference on Image Processing.