<commit_before>pySDC
======

The pySDC project is a Python implementation of the spectral deferred correction (SDC) approach and its flavors, 
esp. the multilevel extension MLSDC. It is intended for rapid prototyping and educational purposes. New ideas like e.g 
sweepers or predictors can be tested and first toy problems can be easily implemented. Two virtually parallel PFASST 
iterators are implemented as well, giving full access to all values at any time.


News
----

* February 2, 2016: the fast-wave slow-wave release, containing all the code for the FWSW-SDC [paper](http://arxiv.org/abs/1602.01626)
* October 27, 2015: the fault-tolerant release, containing all the code for the FT-PFASST [paper](http://arxiv.org/abs/1510.08334)
* June 17, 2015: Gray-Scott example using FEniCS is up and running
* May 7, 2015: added first [FEniCS](http://fenicsproject.org/) example
* May 5, 2015: added [Clawpack](http://www.clawpack.org/) examples using Sharpclaw
* April 16, 2015: new PFASST iterator (loop-based) implemented, new examples added
* March 19, 2015: code now also runs with Python 2.7, development of SharpClaw example started 
* January 7, 2015: revised the examples to work with the new driver in Methods.py, new statistics framework
* December 29, 2014: virtual PFASST implemented using stages, see [flowchart](flowchart.png) for implementation details
* November 4, 2014: First open source release on github, four very basic examples up and running, code is documented


Documentation and Testing<commit_msg>News update<commit_after>pySDC
======

The pySDC project is a Python implementation of the spectral deferred correction (SDC) approach and its flavors, 
esp. the multilevel extension MLSDC. It is intended for rapid prototyping and educational purposes. New ideas like e.g 
sweepers or predictors can be tested and first toy problems can be easily implemented. Two virtually parallel PFASST 
iterators are implemented as well, giving full access to all values at any time.


News
----

* August 3, 2016: Added code for Newton-based sweeper (BIRS talk)
* February 2, 2016: the fast-wave slow-wave release, containing all the code for the FWSW-SDC [paper](http://arxiv.org/abs/1602.01626)
* October 27, 2015: the fault-tolerant release, containing all the code for the FT-PFASST [paper](http://arxiv.org/abs/1510.08334)
* June 17, 2015: Gray-Scott example using FEniCS is up and running
* May 7, 2015: added first [FEniCS](http://fenicsproject.org/) example
* May 5, 2015: added [Clawpack](http://www.clawpack.org/) examples using Sharpclaw
* April 16, 2015: new PFASST iterator (loop-based) implemented, new examples added
* March 19, 2015: code now also runs with Python 2.7, development of SharpClaw example started 
* January 7, 2015: revised the examples to work with the new driver in Methods.py, new statistics framework
* December 29, 2014: virtual PFASST implemented using stages, see [flowchart](flowchart.png) for implementation details
* November 4, 2014: First open source release on github, four very basic examples up and running, code is documented


Documentation and Testing
{'fraction_non_alphanumeric': 0.07771355170199101, 'fraction_numerical': 0.04977520873474631, 'mean_word_length': 4.747232472324724, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3535895', 'n_tokens_mistral': 1023, 'n_tokens_neox': 835, 'n_words': 414}