diff --git a/CHANGELOG b/CHANGELOG
new file mode 100644
index 0000000000000000000000000000000000000000..a85bb1f41503661e350dc3fdab9b680a4260c153
--- /dev/null
+++ b/CHANGELOG
@@ -0,0 +1,4 @@
+
+
+20210324: Version 1.0, initial release.
+
diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000000000000000000000000000000000000..53d1f3d01864c35841739c55aeba9700657627b7
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,675 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<https://www.gnu.org/licenses/why-not-lgpl.html>.
+
diff --git a/README.md b/README.md
index 697169493243be733820d16d103051cfe504dc27..a61f3ea2f187cf0a0d75965d42d88c679dead180 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,27 @@
-# VillaEtAl2021BullMathBiol
+# Public gitlab repository VillaEtAl2021BullMathBiol
 
+This repository provides Matlab files to perform simulations as described in
+*Mechanical models of pattern and form in biological tissues: the role of stress-strain constitutive equations*
+by *C. Villa, M.A.J. Chaplain, A. Gerisch, T. Lorenzi*
+and to appear in *Bullettin of Mathematical Biology* (2021).
+For details we refer the intereseted reader to this publication and its supplementary material.
+
+If you use this software in your work then please cite the above name paper.
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% VillaEtAl2021BullMathBio: simulate mechanical models of pattern formation%
+% Copyright (C) 2021 C. Villa and A. Gerisch                               %
+%                                                                          %
+% This program is free software: you can redistribute it and/or modify     %
+% it under the terms of the GNU General Public License as published by     %
+% the Free Software Foundation, either version 3 of the License, or        %
+% (at your option) any later version.                                      %
+%                                                                          %
+% This program is distributed in the hope that it will be useful,          %
+% but WITHOUT ANY WARRANTY; without even the implied warranty of           %
+% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the            %
+% GNU General Public License for more details.                             %
+%                                                                          %
+% You should have received a copy of the GNU General Public License        %
+% along with this program.  If not, see <https://www.gnu.org/licenses/>.   %
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
diff --git a/Simulations_1D.m b/Simulations_1D.m
new file mode 100644
index 0000000000000000000000000000000000000000..3efb1da87a6f0dfce55e2bf7ae09a1191bf65b15
--- /dev/null
+++ b/Simulations_1D.m
@@ -0,0 +1,267 @@
+function Simulations_1D(in_K, in_model)
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%                                                                     %%%
+%%%  "Mechanical models of pattern and form in biological tissues:      %%%
+%%%       the role of stress-strain constitutive equations"             %%%
+%%%                                                                     %%%
+%%%      C. Villa (*), M.A.J. Chaplain, A. Gerisch (**), T. Lorenzi     %%%
+%%%                                                                     %%%
+%%%            Bullettin of Mathematical Biology (2021)                 %%%
+%%%                                                                     %%%
+%%%                                                                     %%%
+%%% (*) cv23[at]st-andrews.ac.uk                                        %%%
+%%% (**) gerisch[at]mathematik.tu-darmstadt.de                          %%%
+%%%                                                                     %%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%  1D Simulations (Kelvin-Voigt and Maxwell models)                   %%%
+%%%  For details about the equations and schemes please see the         %%%
+%%%  manuscript indicated above and the supplementary material          %%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%
+% function Simulations_1D(in_K, in_model)
+% Runs the spatially one-dimensional simulation using viscoelastic 
+% model in_model (either 'Maxwell' or 'Kelvin-Voigt') on a uniform grid
+% with in_K grid cells. 
+% The results are saved in file saved_y1D_[in_model]_[in_K].mat and 
+% a video in saved_y1D_[in_model]_[in_K].avi .
+%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%% Simulations_1D.m: simulates a 1D mechanical model of pattern formation%
+%%% Copyright (C) 2021 C. Villa and A. Gerisch                            %
+%%%                                                                       %
+%%% This program is free software: you can redistribute it and/or modify  %
+%%% it under the terms of the GNU General Public License as published by  %
+%%% the Free Software Foundation, either version 3 of the License, or     %
+%%% (at your option) any later version.                                   %
+%%%                                                                       %
+%%% This program is distributed in the hope that it will be useful,       %
+%%% but WITHOUT ANY WARRANTY; without even the implied warranty of        %
+%%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         %
+%%% GNU General Public License for more details.                          %
+%%%                                                                       %
+%%% You should have received a copy of the GNU General Public License     %
+%%% along with this program.  If not, see <https://www.gnu.org/licenses/>.%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+
+clc
+close all
+
+set(0,'DefaultAxesFontName', 'Times New Roman')
+set(0,'DefaultAxesFontSize', 14)
+set(0,'defaultaxeslinewidth',1)
+set(0,'defaultpatchlinewidth',1)
+set(0,'defaultlinelinewidth',2)
+set(0,'defaultTextInterpreter','latex')
+
+
+%% Numerical set up
+par.seed = 44;                 % Seed for random number generator
+par.model = in_model;          % type of viscoelastic model
+%par.model = 'Maxwell';
+%par.model = 'Kelvin-Voigt'; 
+par.K = in_K;                  % Number of spatial grid cells
+par.L = 1;                     % Domain length
+x = linspace(0,par.L,par.K+1); % Discretise spatial domain
+par.dx = x(2)-x(1);            % Cell size
+t0 = 0;                        % Initial time
+tf = 10000;                    % Final time
+tspan = linspace(t0,tf,201);   % Time span
+
+%% Initial conditions - eq.(28)
+steadystate = [ones(2*par.K,1); zeros(par.K,1)];
+rng(par.seed);                 % initialize random number generator
+randP = [randn(par.K,1); zeros( 2*par.K,1)]; % random perturbation
+factP = 1e-2;                  % factor for random perturbation
+y0 = steadystate+factP*randP;  % perturbed IC [n0, p0, u0] as long column
+
+%% Solve with ODE15i
+%%% Compute consistent yp0 
+%res = @(y,yp)(norm(mechanochemical(y,yp,par),'inf'));
+res = @(y,yp)(norm(mechanochemical(y,yp,par)));
+disp(['residuum of steady state = ' ...
+    num2str(res(steadystate,0*steadystate), '%15.10e')]);
+[y0,yp0,resnorm] = decic(@(t,y,yp)(mechanochemical(y,yp,par)), t0, ...
+    y0, ones(3*par.K,1), zeros(3*par.K,1), zeros(3*par.K,1));
+disp(['residuum (from decic) of IC = ' num2str(resnorm, '%15.10e')]);
+disp(['residuum (from res()) of IC = ' num2str(res(y0,yp0), '%15.10e')]);
+%%% Solve
+tic
+[t,y] = ode15i(@(t,y,yp)(mechanochemical(y,yp,par)),tspan,y0,yp0);
+toc
+%%% Save computed solution to file
+filename = ['saved_y1D_' par.model '_' num2str(par.K)];
+save(filename, 't', 'y', 'par', 'x');
+
+%% Plot
+video_on = true; % Record video: YES (true), NO (false)
+video_filename = [filename '.avi'];
+plot_solution(x,y,t,par,video_on,video_filename);
+
+end
+
+%% Main function implementing the model
+function f = mechanochemical(y,yp,par)
+
+    %%% Parameter values
+    eta = 1;      % viscosity
+    E = 1;        % elasticity
+    D = 0.01;     % diffusion
+    alpha = 0.05; % haptotaxis
+    r = 1;        % proliferation
+    s = 10;       % substrate elasticity
+    beta = 0.005; % long range traction 
+    lambda = 0.5; % (cell traction) saturation coefficient
+    tau = 0.2;    % cell traction 
+    
+    %%% Choose constitutive model (see Table 1)
+    switch par.model
+        case 'Kelvin-Voigt' % Kelvin Voigt  - eq.(3)
+            [a0,a1,b0,b1] = deal(1,0,E,eta); 
+        case 'Maxwell' % Maxwell - eq.(4)
+            [a0,a1,b0,b1] = deal(1/eta,1/E,0,1);
+        otherwise
+            error('Unknown constitutive model')
+    end
+    
+    %%% Reshape input vectors
+    [n,p,u] = deal(y(1:par.K),y(par.K+1:2*par.K),y(2*par.K+1:3*par.K));
+    [np,pp,up] = deal(yp(1:par.K),yp(par.K+1:2*par.K),...
+        yp(2*par.K+1:3*par.K));
+    
+    %%% Equation for n
+    % Advection velocity at grid cell interfaces - eq.(S.6)
+    up_Avx1 = Avx1(up); 
+    vx1 = alpha*Mx1_face(p,par) + up_Avx1; 
+    % fn(n,n',p,u') = 0 - eq.(S.5)
+    fn = np - D*Mxx1(n,par) + MA1(n, vx1, par) - r*n.*(1-n);
+    
+    %%% Equation for p
+    % fp(p,p',u') = 0 - eq.(S.10)
+    fp = pp + MA1(p, up_Avx1, par);
+   
+    %%% Equation for u 
+    % Traction term - eq.(S.12)-(S.14)
+    pexp = 2; 
+    fn1 = n./(1+lambda*n.^pexp); % Lambda_1
+    fn2 = ((1-(pexp-1)*lambda*n.^pexp)./((1+lambda*n.^pexp).^2)); %Lambda_2
+    fp1 = p + beta*Mxx1(p, par); % M_T1 P
+    fp2 = pp + beta*Mxx1(pp, par); % M_T1 P'
+    Tr = tau*(a0*fn1.*fp1 + a1*(fn2.*np.*fp1+fn1.*fp2));
+    % fu(n,n',p,p',u,u') = 0 - eq.(S.11)
+    fu = b1*Mxx1(up, par) + b0*Mxx1(u, par) ...
+        + Mx1_center(Tr, par) - a1*s*(p.*up + pp.*u) - a0*s*p.*u;
+    
+    %%% Full system - eq.(S.1)
+    f = [fn; fp; fu];
+end
+    
+
+%% Annexed functions
+
+%%% Compute variable at grid cell interfaces - def.(S.3)
+function avx1 = Avx1(y)
+    avx1 = 0.5*(y +y([2:end,1]));
+end
+
+%%% Compute first order derivative on grid cell interfaces 
+%%% (second order approximation, central) - def.(S.4)
+function dx1 = Mx1_face(y, par)
+    persistent Mdx;
+    if size(Mdx,2) ~= size(y,1)
+      disp('Mx1_face  : resetting persistent matrix.');  
+      c = (1/par.dx)*sparse([-1; zeros(par.K-2,1); 1]); % First column
+      Mdx = toeplitz(c,[c(1), c(end:-1:2)']); 
+    end
+    dx1 = Mdx*y;
+end
+
+%%% Compute first order derivative on grid cell centers
+%%% (second order approximation, central) - def.(S.2)
+function dx1 = Mx1_center(y, par)
+    persistent Mdx;
+    if size(Mdx,2) ~= size(y,1)
+      disp('Mx1_center: resetting persistent matrix.');  
+      c = (1/(2*par.dx))*sparse([0;-1; zeros(par.K-3,1); 1]); 
+      Mdx = toeplitz(c,[c(1), c(end:-1:2)']); 
+    end
+    dx1 = Mdx*y;
+end
+
+%%% Compute second order derivative on grid cell centers
+%%% (second order approximation, central) - def.(S.2)
+function dxx1 = Mxx1(y, par)
+    persistent Mdxx;
+    if size(Mdxx,2) ~= size(y,1)
+      disp('Mxx1      : resetting persistent matrix.');  
+      c = (1/(par.dx^2))*sparse([-2; 1; zeros(par.K-3,1); 1]);
+      Mdxx = toeplitz(c,[c(1), c(end:-1:2)']);
+    end
+    dxx1 = Mdxx*y;    
+end
+
+%%% Compute advection at grid cell centers using first order upwinding
+%%% with advective velocity given at grid cell interfaces - def.(S.7)
+function fluxdiffx1 = MA1(y, vel, par)
+    % find pos/neg velocity entries
+    velPos_ind = (vel>0);
+    velNeg_ind = (~velPos_ind);
+    % compute flux accross cell interfaces using first order upwinding 
+    % def.(S.8)-(S.9)
+    flux = NaN(size(y));
+    flux(velPos_ind) = y(velPos_ind).*vel(velPos_ind);
+    yshift = y([2:end 1]);
+    flux(velNeg_ind) = yshift(velNeg_ind).*vel(velNeg_ind);
+    % add entries for flux along x1=0 by periodicity
+    flux = flux([end,1:end]);
+    % compute flux difference per grid cell - def.(S.7) and (S.4)
+    fluxdiffx1 = (1/par.dx)*(flux(2:end)-flux(1:(end-1)));
+end
+
+%%% Plot solution 
+function plot_solution(x,y,t,par,video_on,video_filename)
+    if video_on % Initialise video
+        vid = VideoWriter(video_filename);
+        open(vid);
+        figure('Units','normalized','Position',[0 0 0.5 0.45])
+    end
+    maxu = 10^(-6);
+    for i=1:length(t)
+        clf
+        n = [y(i,1*par.K),y(i,1:par.K)];
+        p = [y(i,2*par.K),y(i,par.K+1:2*par.K)];
+        u = [y(i,3*par.K),y(i,2*par.K+1:3*par.K)];
+        if max(abs(u))>maxu
+          maxu = max(abs(u))+0.1*max(abs(u));
+        end
+        subplot(1,3,1)
+        plot(x,n)
+        title('$n(t,x)$')
+        ylim([0,2])
+        axis square
+        subplot(1,3,2)
+        plot(x,p)
+        title('$\rho(t,x)$')
+        ylim([0,max(2,max(p))])
+        axis square
+        subplot(1,3,3)
+        plot(x,u)
+        title('$u(t,x)$')
+        axis square
+        ylim([-maxu,maxu])
+        a = axes;
+        t1 = title([par.model ' (t=',num2str(t(i)),')']);
+        a.Visible = 'off'; 
+        t1.Visible = 'on'; 
+        drawnow
+        if video_on % Record video
+            frame = getframe(gcf);
+            size(frame.cdata);
+            writeVideo(vid,frame);
+            pause(0.1)
+        end
+    end
+    if video_on % Close video
+        close(vid)
+    end
+end
diff --git a/Simulations_2D.m b/Simulations_2D.m
new file mode 100644
index 0000000000000000000000000000000000000000..aab36d88f6f0aff7a2d90b03aca2111401816277
--- /dev/null
+++ b/Simulations_2D.m
@@ -0,0 +1,453 @@
+function Simulations_2D(in_K, in_model)
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%                                                                     %%%
+%%%  "Mechanical models of pattern and form in biological tissues:      %%%
+%%%       the role of stress-strain constitutive equations"             %%%
+%%%                                                                     %%%
+%%%      C. Villa (*), M.A.J. Chaplain, A. Gerisch (**), T. Lorenzi     %%%
+%%%                                                                     %%%
+%%%            Bullettin of Mathematical Biology (2021)                 %%%
+%%%                                                                     %%%
+%%%                                                                     %%%
+%%% (*) cv23[at]st-andrews.ac.uk                                        %%%
+%%% (**) gerisch[at]mathematik.tu-darmstadt.de                          %%%
+%%%                                                                     %%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%  2D Simulations (Kelvin-Voigt and Maxwell models)                   %%%
+%%%  For details about the equations and schemes please see the         %%%
+%%%  manuscript indicated above and the supplementary material          %%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%
+% function Simulations_2D(in_K, in_model)
+% Runs the spatially two-dimensional simulation using viscoelastic 
+% model in_model (either 'Maxwell' or 'Kelvin-Voigt') on a uniform 
+% square grid with in_K grid cells in each dimension. 
+% The results are saved in file saved_y2D_[in_model]_[in_K].mat and 
+% a video in saved_y2D_[in_model]_[in_K].avi .
+%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%% Simulations_2D.m: simulates a 2D mechanical model of pattern formation%
+%%% Copyright (C) 2021 C. Villa and A. Gerisch                            %
+%%%                                                                       %
+%%% This program is free software: you can redistribute it and/or modify  %
+%%% it under the terms of the GNU General Public License as published by  %
+%%% the Free Software Foundation, either version 3 of the License, or     %
+%%% (at your option) any later version.                                   %
+%%%                                                                       %
+%%% This program is distributed in the hope that it will be useful,       %
+%%% but WITHOUT ANY WARRANTY; without even the implied warranty of        %
+%%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         %
+%%% GNU General Public License for more details.                          %
+%%%                                                                       %
+%%% You should have received a copy of the GNU General Public License     %
+%%% along with this program.  If not, see <https://www.gnu.org/licenses/>.%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+clc
+close all
+
+set(0,'DefaultAxesFontName', 'Times New Roman')
+set(0,'DefaultAxesFontSize', 14)
+set(0,'defaultaxeslinewidth',1)
+set(0,'defaultpatchlinewidth',1)
+set(0,'defaultlinelinewidth',2)
+set(0,'defaultTextInterpreter','latex')
+
+
+%% Numerical set up
+par.seed = 44;                   % Seed for random number generator
+par.model = in_model;            % type of viscoelastic model
+%par.model = 'Maxwell';
+%par.model = 'Kelvin-Voigt'; 
+par.K = in_K;                    % Number of spatial grid cells
+par.L = 1;                       % Domain length
+x1 = linspace(0,par.L,par.K+1);  % Discretise spatial domain
+par.K2 = par.K^2;                % Total number of grid cells
+par.dx = x1(2)-x1(1);            % Cell size
+t0 = 0;                          % Initial time
+tf = 10000;                      % Final time
+tspan = linspace(t0,tf,251);     % Time span
+
+%% Initial conditions
+steadystate = [ones(2*par.K2,1); zeros(2*par.K2,1)];
+rng(par.seed);                  % initialize random number generator                       % use seed 44 in random number generator
+randP = [randn(par.K2,1); zeros(3*par.K2,1)]; % random perturbation
+factP = 1e-2;                  % factor for random perturbation
+y0 = steadystate+factP*randP;  % perturbed IC [n0, p0, u10, u20] as long column
+
+%% Solve with ODE15i
+solve_on = true;  % run simulation and save result: YES (true), NO (false)
+if solve_on
+    tic
+    %%% Create Jacobian pattern
+    [SPDY,SPDYP] = Jpattern(par.K);
+    options = odeset('Jpattern',{SPDY,SPDYP});
+    %options = [];
+    %%% Compute consistent yp0
+    %res = @(y,yp)(norm(mechanochemical(y,yp,par),'inf'));
+    res = @(y,yp)(norm(mechanochemical(y,yp,par)));
+    disp(['residuum of steady state = ' ...
+        num2str(res(steadystate,0*steadystate), '%15.10e')]);
+    [y0,yp0, resnorm] = decic(@(t,y,yp)(mechanochemical(y,yp,par)), ...
+        t0, y0, ones(4*par.K2,1), ...
+        zeros(4*par.K2,1), zeros(4*par.K2,1), options);
+    disp(['residuum (from decic) of IC = ' num2str(resnorm, '%15.10e')]);
+    disp(['residuum (from res()) of IC = ' num2str(res(y0,yp0), '%15.10e')]);
+    toc
+    %%% Solve
+    tic
+    [t,y] = ode15i(@(t,y,yp)(mechanochemical(y,yp,par)),tspan,...
+        y0,yp0,options);
+    toc
+    %%% Save computed solution to file
+    filename = ['saved_y2D_' par.model '_' num2str(par.K)];
+    save(filename, 't', 'y', 'par', 'x1');
+end
+
+
+%%% Plot
+if isempty(filename)
+  filename = 'saved_y2D_Maxwell_50'; % make sure it exists...
+end
+load(filename, 't', 'y', 'par', 'x1');
+video_on = true; % Record video: YES (true), NO (false)
+video_filename = [filename '.avi'];
+plot_solution(x1,y,t,par,video_on,video_filename);
+
+end
+
+%% Main function implementing the model
+function f = mechanochemical(y,yp,par)
+
+    %%% Parameter values
+    eta = 1;           % viscosity
+    E = 1;             % elasticity
+    D = 0.01;          % diffusion
+    alpha = 0.05;      % haptotaxis
+    r = 1;             % proliferation
+    s = 10;            % substrate elasticity
+    beta = 0.005;      % long range traction 
+    lambda = 0.5;      % (cell traction) saturation coefficient
+    tau = 0.2;         % cell traction 
+    nu = 0.25;         % Poisson ratio
+    Ep = E/(1+nu);     % eq.(33)
+    nup = nu/(1-2*nu); % eq.(33)
+    % mu = nup*eta:    % Simplifying assumption (A.4)
+
+    %%% Choose constitutive model - see eq.(31) and Table 3
+    switch par.model
+        case 'Kelvin-Voigt' % Kelvin Voigt  - (A.2)
+            [a0,a1,b0,b1,c0,c1] = deal(1/eta,0,Ep/eta,1,Ep*nup/eta,nup); 
+        case 'Maxwell' % Maxwell - (A.3)
+            [a0,a1,b0,b1,c0,c1] = deal(1/eta,1/Ep,0,1,0,nup);
+        otherwise
+            error('Unknown constitutive model')
+    end
+    %%% Reshape input vectors
+    [n,p,u1,u2] = vec2mats(y,par.K);
+    [np,pp,u1p,u2p] = vec2mats(yp,par.K);
+    
+    %%% Equation for n
+    % Advection velocity at grid cell interfaces - eq.(S.22)
+    u1p_Avx1 = Avx1(u1p);
+    vx1 = alpha*Mx1_face(p,par)+u1p_Avx1; 
+    u2p_Avx2 = Avx1(u2p')';
+    vx2 = alpha*Mx1_face(p',par)'+u2p_Avx2;
+    % fn(t,n,n') = 0 - eq.(S.21)
+    fn = np ...
+        - D*(Mxx1(n,par) + Mxx1(n',par)') ...
+        +  MA1(n, vx1, par) + MA1(n', vx2', par)' ...
+        - r * (n.*(1-n));
+      
+    %%% Equation for p
+    % fp(t,p,p') = 0 - eq.(S.23)
+    fp = pp ...
+        + MA1(p, u1p_Avx1, par) + MA1(p', u2p_Avx2', par)';
+    
+    %%% Equation for u1 and u2    
+    % Traction term - eq.(S.29) with (S.13) and (S.30)
+    pexp = 2;
+    fn1 = n./(1+lambda*n.^pexp); % Lambda_1
+    fn2 = ((1-(pexp-1)*lambda*n.^pexp) ./ ((1+lambda*n.^pexp).^2)); % Lambda_2 
+    fp1 = p + beta*(Mxx1(p, par)+ Mxx1(p', par)'); % M_T2 P
+    fp2 = pp + beta*(Mxx1(pp, par)+ Mxx1(pp', par)');  % M_T2 P'
+    Tr = tau*(a0*fn1.*fp1 + a1*(fn2.*np.*fp1+fn1.*fp2));    
+    % fu1(n,n',p,p',u1,u1',u2,u2') = 0 - eq.(S.27)
+    fu1 = (b1+c1)*Mxx1(u1p, par) + 0.5*b1*(Mxx1(u1p', par))' ...
+        +(0.5*b1+c1)* Mx1x2(u2p, par) ...
+        +(b0+c0)*Mxx1(u1, par)   + 0.5*b0*(Mxx1(u1', par))' ...
+        +(0.5*b0+c0)* Mx1x2(u2, par) ...
+        + Mx1_center(Tr, par) ...
+        -a1*s*(p.*u1p + pp.*u1) - a0*s*p.*u1;
+    % fu2(n,n',p,p',u1,u1',u2,u2') = 0 - eq.(S.28)
+    fu2 = (b1+c1)*Mxx1(u2p', par)' + 0.5*b1*Mxx1(u2p, par) ...
+        +(0.5*b1+c1)* Mx1x2(u1p, par) ...
+        +(b0+c0)*Mxx1(u2', par)'   + 0.5*b0*Mxx1(u2, par) ...
+        +(0.5*b0+c0)* Mx1x2(u1, par) ...
+        +Mx1_center(Tr', par)'  ...
+        -a1*s*(p.*u2p + pp.*u2) - a0*s*p.*u2;
+    
+    %%% Full system - eq.(S.15)
+    f = mats2vec(fn, fp, fu1, fu2);
+    
+end
+    
+%% Annexed functions
+
+%%% Vector to matrices
+function [n,p,u1,u2] = vec2mats(y,K)
+    K2 = K^2;
+    n  = reshape(y(0*K2+1:1*K2), K, K);
+    p  = reshape(y(1*K2+1:2*K2), K, K);
+    u1 = reshape(y(2*K2+1:3*K2), K, K);
+    u2 = reshape(y(3*K2+1:4*K2), K, K);
+end
+
+%%% Matrices to vector
+function y = mats2vec(n, p, u1, u2)
+    y = [n(:); p(:); u1(:); u2(:)];
+end
+
+%%% Compute advection at grid cell centers using first order upwinding
+%%% in the x1 direction with advective velocity given at grid cell 
+%%% interfaces - def.(S.7) and (S.20)
+function fluxdiffx1 = MA1(y, vel, par)
+    % find pos/neg velocity entries
+    velPos_ind = (vel>0);
+    velNeg_ind = (~velPos_ind);
+    % compute flux accross cell interfaces using first order upwinding 
+    % def.(S.8)-(S.9)
+    flux = NaN(size(y));
+    flux(velPos_ind) = y(velPos_ind).*vel(velPos_ind);
+    yshift = y([2:end 1],:);
+    flux(velNeg_ind) = yshift(velNeg_ind).*vel(velNeg_ind);
+    % add entries for flux along x1=0 by periodicity
+    flux = flux([end,1:end],:);
+    % compute flux difference per grid cell in x1 direction - def.(S.7) and (S.4)
+    fluxdiffx1 = (1/par.dx)*(flux(2:end,:)-flux(1:(end-1),:));
+end
+
+%%% Compute second order mixed derivative in grid cell centres
+%%% (second order approximation, central) - def.(S.18)
+function dx1x2 = Mx1x2(y, par)
+    persistent Mdx;
+    if size(Mdx,2) ~= size(y,1)
+      disp('Mx1x2     : resetting persistent matrix.');
+      c = (1/(2*par.dx))*sparse([0;-1; zeros(par.K-3,1); 1]);
+      Mdx = toeplitz(c,[c(1), c(end:-1:2)']); 
+    end
+    dx1x2 = (Mdx*(Mdx*y)')';
+end
+
+%%% Compute first order derivative in x1 direction on grid cell interfaces
+%%% (second order approximation, central) - def.(S.16)
+function dx1 = Mx1_face(y, par)
+    persistent Mdx;
+    if size(Mdx,2) ~= size(y,1)
+      disp('Mx1_face  : resetting persistent matrix.');
+      c = (1/par.dx)*sparse([-1; zeros(par.K-2,1); 1]);
+      Mdx = toeplitz(c,[c(1), c(end:-1:2)']); 
+    end
+    dx1 = Mdx*y;
+end
+
+%%% Compute first order derivative in x1 direction on grid cell centres
+%%% (second order approximation, central) - def.(S.16)
+function dx1 = Mx1_center(y, par)
+    persistent Mdx;
+    if size(Mdx,2) ~= size(y,1)
+      disp('Mx1_center: resetting persistent matrix.');
+      c = (1/(2*par.dx))*sparse([0;-1; zeros(par.K-3,1); 1]);
+      Mdx = toeplitz(c,[c(1), c(end:-1:2)']); 
+    end
+    dx1 = Mdx*y;
+end
+
+%%% Compute variable at grid cell interfaces in the x1 direction -
+%%% def.(S.3) and (S.19)
+function avx1 = Avx1(y)
+    avx1 = 0.5*(y +y([2:end,1],:));
+end
+
+%%% Compute second order derivative in x1 direction in grid cell centres
+%%% (second order approximation, central) - def.(S.2) and (S.17)
+function dxx1 = Mxx1(y, par)
+    persistent Mdxx;
+    if size(Mdxx,2) ~= size(y,1)
+      disp('Mxx1      : resetting persistent matrix.');
+      c = (1/(par.dx^2))*sparse([-2; 1; zeros(par.K-3,1); 1]);
+      Mdxx = toeplitz(c,[c(1), c(end:-1:2)']);
+    end
+    dxx1 = Mdxx*y;    
+end
+
+%%% Plot solution 
+function plot_solution(x1,y,t,par,video_on,video_filename)
+    if video_on % Initialise video
+        vid = VideoWriter(video_filename);
+        open(vid);
+        figure('Units','normalized','Position',[0 0 0.5 0.45])
+    end
+    for i=1:length(t)
+        clf
+        [N, P, U1, U2] = vec2mats(y(i,:),par.K);
+        n = [N(par.K,par.K)  N(par.K,:)
+             N(:,par.K)      N];
+        p = [P(par.K,par.K)  P(par.K,:)
+             P(:,par.K)      P];
+        u1 = [U1(par.K,par.K) U1(par.K,:)
+              U1(:,par.K)     U1];
+        u2 = [U2(par.K,par.K) U2(par.K,:)
+              U2(:,par.K)     U2];
+        subplot(2,2,1)
+        surf(x1,x1,n)
+        view(0,90)
+        shading flat
+        axis square
+        xlim([0,par.L])
+        ylim([0,par.L])
+        title('$n(t,x)$')
+        colormap(parula);
+        colorbar;
+        subplot(2,2,2)
+        surf(x1,x1,p)
+        view(0,90)
+        shading flat
+        axis square
+        xlim([0,par.L])
+        ylim([0,par.L])
+        title('$\rho(t,x)$')
+        colormap(parula);
+        colorbar;
+        subplot(2,2,3)
+        surf(x1,x1,u1)
+        view(0,90)
+        shading flat
+        axis square
+        xlim([0,par.L])
+        ylim([0,par.L])
+        title('$u_1(t,x)$')
+        colormap(parula);
+        colorbar;
+        subplot(2,2,4)
+        surf(x1,x1,u2)
+        view(0,90)
+        shading flat
+        axis square
+        xlim([0,par.L])
+        ylim([0,par.L])
+        title('$u_2(t,x)$')
+        colormap(parula);
+        colorbar;
+        a = axes;
+        t1 = title([par.model ' (t=',num2str(t(i)),')'],...
+            'Position', [0.5, 1, 2]);
+        a.Visible = 'off'; 
+        t1.Visible = 'on'; 
+        drawnow
+        if video_on % Record video
+            frame = getframe(gcf);
+            size(frame.cdata);
+            writeVideo(vid,frame);
+            pause(0.1)
+        end
+    end
+    if video_on % Close video
+        close(vid)
+    end
+end
+
+function [SPDY,SPDYP] = Jpattern(K)
+    % init return matrices to empty sparse matrices
+    SPDY  = sparse(4*K^2,4*K^2); 
+    SPDYP = sparse(4*K^2,4*K^2);
+    
+    % vector of first entry (start index) of n, p, u1, u2 in y and yp
+    si = 1+(0:3)*(K^2);
+    % vector of the "grid cell numbers-1" from 0 to K^2-1; this vector
+    % represents the order of the grid cells
+    self = (0:(K^2-1))'; 
+    % indices of all entries in y and yp of the four solution components 
+    in=si(1)+self;
+    ip=si(2)+self;
+    iu1=si(3)+self;
+    iu2=si(4)+self;
+   
+%     % Example stencil: second order central difference of 2D Laplace
+%     centre = [2,2]; % [row index, column index] of stencil centre
+%     % stencil: visual mode, i.e. increasing row index is decreasing
+%     % x2-direction and increasing column index is increasing x1-direction
+%     stencil = [0 1 0
+%                1 1 1
+%                0 1 0];
+           
+    % Here: for now generic full stencil of size 5x5
+    stencilsize = 5;
+    centre = [1, 1]*((stencilsize+1)/2);
+    stencil = ones(stencilsize); % square matrix of all 1
+    
+    % rather simple, not optimal but sufficient choice: 
+    % assume each equation depends on n, p, u1, u2 and their 
+    % derivatives using the same stencil as defined above.
+    mat = SPDY;
+    mat = add(mat, in, in, stencil, centre, K);
+    mat = add(mat, in, ip, stencil, centre, K);
+    mat = add(mat, in, iu1, stencil, centre, K);
+    mat = add(mat, in, iu2, stencil, centre, K);
+    %
+    mat = add(mat, ip, in, stencil, centre, K);
+    mat = add(mat, ip, ip, stencil, centre, K);
+    mat = add(mat, ip, iu1, stencil, centre, K);
+    mat = add(mat, ip, iu2, stencil, centre, K);
+    %
+    mat = add(mat, iu1, in, stencil, centre, K);
+    mat = add(mat, iu1, ip, stencil, centre, K);
+    mat = add(mat, iu1, iu1, stencil, centre, K);
+    mat = add(mat, iu1, iu2, stencil, centre, K);
+    %
+    mat = add(mat, iu2, in, stencil, centre, K);
+    mat = add(mat, iu2, ip, stencil, centre, K);
+    mat = add(mat, iu2, iu1, stencil, centre, K);
+    mat = add(mat, iu2, iu2, stencil, centre, K);
+    SPDY=mat;
+    
+    mat = SPDYP;
+    mat = add(mat, in, in, stencil, centre, K);
+    mat = add(mat, in, ip, stencil, centre, K);
+    mat = add(mat, in, iu1, stencil, centre, K);
+    mat = add(mat, in, iu2, stencil, centre, K);
+    %
+    mat = add(mat, ip, in, stencil, centre, K);
+    mat = add(mat, ip, ip, stencil, centre, K);
+    mat = add(mat, ip, iu1, stencil, centre, K);
+    mat = add(mat, ip, iu2, stencil, centre, K);
+    %
+    mat = add(mat, iu1, in, stencil, centre, K);
+    mat = add(mat, iu1, ip, stencil, centre, K);
+    mat = add(mat, iu1, iu1, stencil, centre, K);
+    mat = add(mat, iu1, iu2, stencil, centre, K);
+    %
+    mat = add(mat, iu2, in, stencil, centre, K);
+    mat = add(mat, iu2, ip, stencil, centre, K);
+    mat = add(mat, iu2, iu1, stencil, centre, K);
+    mat = add(mat, iu2, iu2, stencil, centre, K);
+    SPDYP=mat;
+    
+    % final tuning
+    SPDYP(SPDYP>1) = 1;
+    SPDY(SPDY>1) = 1;
+   
+    function M = add(M, c, r, stencil, centre, K)
+        toR = @(ind,count)(reshape(circshift(reshape(ind,K,K),-count,1),1,K^2));
+        toU = @(ind,count)(reshape(circshift(reshape(ind,K,K),-count,2),1,K^2));
+        [x2dir,x1dir]= find(stencil);
+        x1dir = x1dir-centre(2);
+        x2dir = -(x2dir-centre(1));
+        %[x1dir,x2dir]
+        for ii=1:length(x1dir)
+            rtmp = toR(r   , x1dir(ii));
+            rtmp = toU(rtmp, x2dir(ii));
+            M = M + sparse(c,rtmp,ones(size(c)),4*K^2,4*K^2);
+        end
+    end
+end