rweed

First I think we need to define which types of linked list we need. I prefer a circular double-linked list as the basic type since its the type I use...

For sparse matrix support I suggest you look at the PSBLAS3 project of Filippone and Buttari. Its Object-Oriented Fortran 2003/2008. Go to https://github.com/sfilippone/psblas3 I also recommend you read the papers...

Before trying to reinvent the wheel check out PSBLAS 3 which is a parallel Fortran 2003 OOP implementation of sparse matrixes (see http://people.uniroma2.it/salvatore.filippone/psblas and the selected publications listed).

I would like to suggest that as policy COO will be used as the bridge format for implementing new sparse formats, for initializing an existing format and conversion to/from other...

Fortunately, there is a wealth of libraries etc we can draw from. Some of the older ones like SLATEC etc are still in F77 but can be converted to F90...

Be careful with MKL. I don't know about FFT etc. but I encountered a problem with their implementation of LAPACK90 where they changed the argument list (same arguments but in...

I have refactored (ie pasta free) versions of Nodecal and Morales LBFGSB code, Turlach's quadratic programming code, and a couple of nature inspired algorithms (cuckoo search and Particle Swarm) optimizers...

Also, forgot that I have a version of the Nelder-Mead simplex algorithm I can contribute.

@jacobwilliams , In my code I usually (but not always - for old code its sometimes not practicle) use an empty abstract class (optimizers_t) and derive all of the base...

@jacobwilliams I don't have the code in a repository but the following will give you an example of how I implement the abstract classes. I'll be the first to admint...