From 01f7d9f70b0fc0e25d84b74421b9f31da0b9443c Mon Sep 17 00:00:00 2001 From: Tim Holy Date: Fri, 6 Nov 2020 05:00:00 -0600 Subject: [PATCH] Update README.md --- README.md | 3 --- 1 file changed, 3 deletions(-) diff --git a/README.md b/README.md index d79a21a..bd0574b 100644 --- a/README.md +++ b/README.md @@ -2,9 +2,6 @@ UPDATE: some of the things described below have already moved to Julia itself. The still-to-do item is to come up with efficient "synchronizable" iterators, with the main benefit being to sparse matrix algebra. The key problem to be solved is that Julia has `N` different sparse matrix types (`SparseMatrixSCS`, `Diagonal`, `BiDiagonal`, `Tridiagonal`, `SymTriDiagonal`, wrappers like `Adjoint` and `Transpose` which compose with those types, plus types in packages). Implementing efficient algorithms for `A*B` might therefore require `O(N^2)` methods, one for each possible pair of types. The goal of this package is to make it possible to simply define `N` iterators (one per matrix type) and then use them to define a reasonably-efficient fallback method. -If you're interested in this package, the `teh/stored2` branch is actually the state-of-the-art. - - [![Build Status](https://travis-ci.org/timholy/ArrayIteration.jl.svg?branch=master)](https://travis-ci.org/timholy/ArrayIteration.jl) This repository contains a candidate next-generation interface for handling arrays in the Julia programming language.