diff --git a/.gitignore b/.gitignore
index 55fa2bd..3320179 100644
--- a/.gitignore
+++ b/.gitignore
@@ -4,5 +4,3 @@ vlaplex
*.mod
*.o
*.tar.gz
-obj/
-mod/
diff --git a/AUTHORS b/AUTHORS
deleted file mode 100644
index 62d97f8..0000000
--- a/AUTHORS
+++ /dev/null
@@ -1,4 +0,0 @@
-# This is the list of VlaPlEx's contributors.
-
-Jorge Gonzalez
-Jop Hendrikx
diff --git a/COPYING b/COPYING
deleted file mode 100644
index f288702..0000000
--- a/COPYING
+++ /dev/null
@@ -1,674 +0,0 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc.
- 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.
-
-
- Copyright (C)
-
- 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 .
-
-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:
-
- Copyright (C)
- 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
-.
-
- 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
-.
diff --git a/README.md b/README.md
index e30de96..f7cbda4 100644
--- a/README.md
+++ b/README.md
@@ -5,15 +5,3 @@ It solves the Vlasov equation for ions in a 1D spherical domain.
Electrons are treated as a fluid either isothermal (Boltzmann) or polytropic.
Self-consistent electric field is solved using a Newton-Raphson method to solve the Poisson equation.
-
-A 2D table linking T_e, n_e and the average Z must be provided. Examples can be found in 'data/TNZ'.
-
-Input files for different cases are in the 'input' folder.
-
-Files with the boundary conditions are provided in 'data/boundary'.
-
-Input files must specify which TNZ table and boundary file are using.
-
-To run the code execute
-
-./vlaplex
diff --git a/data/boundary/bc_80ns_T10.csv b/bc_80ns_T10.csv
similarity index 100%
rename from data/boundary/bc_80ns_T10.csv
rename to bc_80ns_T10.csv
diff --git a/data/boundary/bc_80ns_T30.csv b/bc_80ns_T30.csv
similarity index 100%
rename from data/boundary/bc_80ns_T30.csv
rename to bc_80ns_T30.csv
diff --git a/data/boundary/bc_80ns_T6.csv b/bc_80ns_T6.csv
similarity index 100%
rename from data/boundary/bc_80ns_T6.csv
rename to bc_80ns_T6.csv
diff --git a/data/boundary/bc_80ns_T60.csv b/bc_80ns_T60.csv
similarity index 100%
rename from data/boundary/bc_80ns_T60.csv
rename to bc_80ns_T60.csv
diff --git a/data/boundary/bc_fa_T30.csv b/bc_fa_T30.csv
similarity index 100%
rename from data/boundary/bc_fa_T30.csv
rename to bc_fa_T30.csv
diff --git a/input/input_80ns_T10.nml b/input/input_80ns_T10.nml
deleted file mode 100644
index 7a28a4b..0000000
--- a/input/input_80ns_T10.nml
+++ /dev/null
@@ -1,43 +0,0 @@
-&reference
- m_ref = 1.9712258e-25 ! Ion mass [kg]
- Temp_ref = 30.0 ! Plasma temperature [eV]
- n_ref = 1.0e24 ! Plasma density [m^-3]
-/
-
-&grid
- r0 = 10.0e-6 ! Initial position [m]
- rf = 2.0e-3 ! Final position [m]
- dr = 1.0e-6 ! Spatial step [m]
- v0 = -50e3 ! Lower limit for velocity space [m s^-1]
- vf = 250e3 ! Upper limit for velocity space [m s^-1]
- nv = 401 ! Number of grid points in the velocity space
-/
-
-&output
- folder = 'polytropic_80ns_T10' ! Folder name
- outputStep = 1e-9 ! Time step for file write [s]
-/
-
-&time
- t0 = 0.0 ! Initial time [s]
- tf = 2.0e-7 ! Final time [s]
- cfl = 0.2 ! CFL condition (dt = CFL * dr / vf)
-/
-
-&detector
- rCum = 1.0e-3 ! Position of the detector [m]
-/
-
-&boundary
- filename = 'data/boundary/bc_80ns_T10.csv' ! File for boundary value
-/
-
-&Zbins
- filename = 'data/TNZ/Sn.csv' ! File with table to get Z from Te and ne
- ZList = 0.1, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ! Bins of average Z
-/
-
-¶llel
- nThreads = 16 ! Number of threads for OpenMP
-/
-
diff --git a/input/input_80ns_T30.nml b/input/input_80ns_T30.nml
deleted file mode 100644
index 50024e0..0000000
--- a/input/input_80ns_T30.nml
+++ /dev/null
@@ -1,43 +0,0 @@
-&reference
- m_ref = 1.9712258e-25 ! Ion mass [kg]
- Temp_ref = 30.0 ! Plasma temperature [eV]
- n_ref = 1.0e24 ! Plasma density [m^-3]
-/
-
-&grid
- r0 = 10.0e-6 ! Initial position [m]
- rf = 2.0e-3 ! Final position [m]
- dr = 1.0e-6 ! Spatial step [m]
- v0 = -50e3 ! Lower limit for velocity space [m s^-1]
- vf = 250e3 ! Upper limit for velocity space [m s^-1]
- nv = 401 ! Number of grid points in the velocity space
-/
-
-&output
- folder = 'polytropic_80ns_T30' ! Folder name
- outputStep = 1e-9 ! Time step for file write [s]
-/
-
-&time
- t0 = 0.0 ! Initial time [s]
- tf = 2.0e-7 ! Final time [s]
- cfl = 0.2 ! CFL condition (dt = CFL * dr / vf)
-/
-
-&detector
- rCum = 1.0e-3 ! Position of the detector [m]
-/
-
-&boundary
- filename = 'data/boundary/bc_80ns_T30.csv' ! File for boundary value
-/
-
-&Zbins
- filename = 'data/TNZ/Sn.csv' ! File with table to get Z from Te and ne
- ZList = 0.1, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ! Bins of average Z
-/
-
-¶llel
- nThreads = 16 ! Number of threads for OpenMP
-/
-
diff --git a/input/input_80ns_T6.nml b/input/input_80ns_T6.nml
deleted file mode 100644
index 6a5a0c8..0000000
--- a/input/input_80ns_T6.nml
+++ /dev/null
@@ -1,43 +0,0 @@
-&reference
- m_ref = 1.9712258e-25 ! Ion mass [kg]
- Temp_ref = 30.0 ! Plasma temperature [eV]
- n_ref = 1.0e24 ! Plasma density [m^-3]
-/
-
-&grid
- r0 = 10.0e-6 ! Initial position [m]
- rf = 2.0e-3 ! Final position [m]
- dr = 1.0e-6 ! Spatial step [m]
- v0 = -50e3 ! Lower limit for velocity space [m s^-1]
- vf = 250e3 ! Upper limit for velocity space [m s^-1]
- nv = 401 ! Number of grid points in the velocity space
-/
-
-&output
- folder = 'polytropic_80ns_T6' ! Folder name
- outputStep = 1e-9 ! Time step for file write [s]
-/
-
-&time
- t0 = 0.0 ! Initial time [s]
- tf = 2.0e-7 ! Final time [s]
- cfl = 0.2 ! CFL condition (dt = CFL * dr / vf)
-/
-
-&detector
- rCum = 1.0e-3 ! Position of the detector [m]
-/
-
-&boundary
- filename = 'data/boundary/bc_80ns_T6.csv' ! File for boundary value
-/
-
-&Zbins
- filename = 'data/TNZ/Sn.csv' ! File with table to get Z from Te and ne
- ZList = 0.1, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ! Bins of average Z
-/
-
-¶llel
- nThreads = 16 ! Number of threads for OpenMP
-/
-
diff --git a/input/input_80ns_T60.nml b/input/input_80ns_T60.nml
deleted file mode 100644
index 5528da7..0000000
--- a/input/input_80ns_T60.nml
+++ /dev/null
@@ -1,43 +0,0 @@
-&reference
- m_ref = 1.9712258e-25 ! Ion mass [kg]
- Temp_ref = 30.0 ! Plasma temperature [eV]
- n_ref = 1.0e24 ! Plasma density [m^-3]
-/
-
-&grid
- r0 = 10.0e-6 ! Initial position [m]
- rf = 2.0e-3 ! Final position [m]
- dr = 1.0e-6 ! Spatial step [m]
- v0 = -50e3 ! Lower limit for velocity space [m s^-1]
- vf = 250e3 ! Upper limit for velocity space [m s^-1]
- nv = 401 ! Number of grid points in the velocity space
-/
-
-&output
- folder = 'polytropic_80ns_T60' ! Folder name
- outputStep = 1e-9 ! Time step for file write [s]
-/
-
-&time
- t0 = 0.0 ! Initial time [s]
- tf = 2.0e-7 ! Final time [s]
- cfl = 0.2 ! CFL condition (dt = CFL * dr / vf)
-/
-
-&detector
- rCum = 1.0e-3 ! Position of the detector [m]
-/
-
-&boundary
- filename = 'data/boundary/bc_80ns_T60.csv' ! File for boundary value
-/
-
-&Zbins
- filename = 'data/TNZ/Sn.csv' ! File with table to get Z from Te and ne
- ZList = 0.1, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ! Bins of average Z
-/
-
-¶llel
- nThreads = 16 ! Number of threads for OpenMP
-/
-
diff --git a/input/input_fa_T30.nml b/input/input_fa_T30.nml
deleted file mode 100644
index 082a30d..0000000
--- a/input/input_fa_T30.nml
+++ /dev/null
@@ -1,43 +0,0 @@
-&reference
- m_ref = 1.9712258e-25 ! Ion mass [kg]
- Temp_ref = 30.0 ! Plasma temperature [eV]
- n_ref = 1.0e24 ! Plasma density [m^-3]
-/
-
-&grid
- r0 = 10.0e-6 ! Initial position [m]
- rf = 2.0e-3 ! Final position [m]
- dr = 1.0e-6 ! Spatial step [m]
- v0 = -50e3 ! Lower limit for velocity space [m s^-1]
- vf = 250e3 ! Upper limit for velocity space [m s^-1]
- nv = 401 ! Number of grid points in the velocity space
-/
-
-&output
- folder = 'polytropic_fa_T30' ! Folder name
- outputStep = 1e-9 ! Time step for file write [s]
-/
-
-&time
- t0 = 0.0 ! Initial time [s]
- tf = 2.0e-7 ! Final time [s]
- cfl = 0.2 ! CFL condition (dt = CFL * dr / vf)
-/
-
-&detector
- rCum = 1.0e-3 ! Position of the detector [m]
-/
-
-&boundary
- filename = 'data/boundary/bc_fa_T30.csv' ! File for boundary value
-/
-
-&Zbins
- filename = 'data/TNZ/Sn.csv' ! File with table to get Z from Te and ne
- ZList = 0.1, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0 ! Bins of average Z
-/
-
-¶llel
- nThreads = 16 ! Number of threads for OpenMP
-/
-
diff --git a/makefile b/makefile
index de0165b..e210cc5 100644
--- a/makefile
+++ b/makefile
@@ -1,33 +1,15 @@
-# set folders
-TOPDIR = $(PWD)# top directory
-MODDIR := $(TOPDIR)/mod# module folder
-OBJDIR := $(TOPDIR)/obj# object folder
-SRCDIR := $(TOPDIR)/src# source folder
-
-# compiler
-# gfortran:
-FC := gfortran
-
-# compiler flags
-# gfortran:
-FCFLAGS := -fopenmp -Ofast -g -J $(MODDIR) -Wall -march=native
-
-#Output file
-OUTPUT = vlaplex
-
-export
-
-all: $(OUTPUT)
-
-$(OUTPUT): src.o
-
-src.o:
- @mkdir -p $(MODDIR)
- @mkdir -p $(OBJDIR)
- $(MAKE) -C src $(OUTPUT)
+all:
+ gfortran moduleConstantParameters.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran moduleReferenceValues.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran moduleOutput.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran moduleTableBC.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran moduleTableTtoZ.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran moduleTableTtoZne.f90 -c -lopenblas -Ofast -fopenmp -Wall
+ gfortran vlaplex.f90 moduleConstantParameters.o moduleReferenceValues.o moduleOutput.o moduleTableBC.o moduleTableTtoZ.o moduleTableTtoZne.o -lopenblas -Ofast -fopenmp -Wall -o vlaplex
clean:
- rm -f $(OUTPUT)
- rm -f $(MODDIR)/*.mod
- rm -f $(MODDIR)/*.smod
- rm -f $(OBJDIR)/*.o
+ rm -f vlaplex
+ rm -f *.mod
+ rm -f *.smod
+ rm -f *.o
+
diff --git a/src/modules/constantParameters.f90 b/moduleConstantParameters.f90
similarity index 100%
rename from src/modules/constantParameters.f90
rename to moduleConstantParameters.f90
diff --git a/src/modules/output.f90 b/moduleOutput.f90
similarity index 98%
rename from src/modules/output.f90
rename to moduleOutput.f90
index 0d3351a..9a3a882 100644
--- a/src/modules/output.f90
+++ b/moduleOutput.f90
@@ -37,17 +37,15 @@ module output
end function setZFormat
- subroutine createPath(folder)
- character(8) :: date_now
- character(10):: time_now
- character(:), allocatable:: folder
+ subroutine createPath()
+ character(8) :: date_now
+ character(10) :: time_now
call date_and_time(date_now, time_now)
!Compose the folder name
pathOutput = date_now(1:4) // '-' // date_now(5:6) // '-' // date_now(7:8) // '_' // &
- time_now(1:2) // '.' // time_now(3:4) // '.' // time_now(5:6) // '_' // &
- folder // '/'
+ time_now(1:2) // '.' // time_now(3:4) // '.' // time_now(5:6) // '/'
call system('mkdir ' // pathOutput)
diff --git a/src/modules/referenceValues.f90 b/moduleReferenceValues.f90
similarity index 77%
rename from src/modules/referenceValues.f90
rename to moduleReferenceValues.f90
index 5a7e6d9..c93679e 100644
--- a/src/modules/referenceValues.f90
+++ b/moduleReferenceValues.f90
@@ -2,7 +2,6 @@ module referenceValues
use constantParameters, only: dp
implicit none
- real(dp):: m_ref ! Reference values
real(dp):: L_ref, t_ref, n_ref, u_ref, Temp_ref ! Reference values
real(dp):: phi_ref ! Reference values
diff --git a/src/modules/tableBoundary.f90 b/moduleTableBC.f90
similarity index 97%
rename from src/modules/tableBoundary.f90
rename to moduleTableBC.f90
index dfcd081..a79337c 100644
--- a/src/modules/tableBoundary.f90
+++ b/moduleTableBC.f90
@@ -1,4 +1,4 @@
-module tableBoundary
+module moduleTableBC
use constantParameters, only: dp
type:: tableBC
@@ -61,7 +61,7 @@ module tableBoundary
read(id, *) ! Skip header
do
read(id, '(A)', iostat = stat) dummy
- !TODO: Make this a function
+ !TOdo: Make this a function
if (stat /= 0) EXIT
!Add data
!TODO: substitute with extracting information from dummy
@@ -132,5 +132,5 @@ module tableBoundary
end subroutine getValueTableBC
-end module tableBoundary
+end module moduleTableBC
diff --git a/moduleTableTtoZ.f90 b/moduleTableTtoZ.f90
new file mode 100644
index 0000000..61106de
--- /dev/null
+++ b/moduleTableTtoZ.f90
@@ -0,0 +1,116 @@
+module moduleTableTtoZ
+ use constantParameters, only: dp
+
+ type:: tableTtoZ
+ real(dp):: Z_min, Z_max
+ real(dp):: Temp_min, Temp_max
+ real(dp), allocatable, dimension(:):: Temp
+ real(dp), allocatable, dimension(:):: Z
+ real(dp), allocatable, dimension(:):: Z_k
+ contains
+ procedure, pass:: init => initTableTtoZ
+ procedure, pass:: get => getValueTableTtoZ
+
+ end type tableTtoZ
+
+ contains
+ subroutine initTableTtoZ(self, tableFile)
+ use constantParameters, only: eV_to_K
+ use referenceValues, only: Temp_ref
+ implicit none
+
+ class(tableTtoZ), intent(inout):: self
+ character(:), allocatable, intent(in):: tableFile
+ character(100):: dummy
+ integer:: amount
+ integer:: i
+ integer:: stat
+ integer:: id = 20
+
+ open(id, file = tableFile)
+ amount = -1 ! Remove header
+ do
+ read(id, '(A)', iostat = stat) dummy
+ !If EOF or error, exit file
+ if (stat /= 0) EXIT
+ ! !Skip comment
+ ! if (index(dummy,'#') /= 0) CYCLE
+ !Add row
+ amount = amount + 1
+
+ end do
+
+ !Go bback to initial point
+ rewind(id)
+
+ !Allocate table arrays
+ allocate(self%Temp(1:amount))
+ allocate(self%Z(1:amount))
+ allocate(self%Z_k(1:amount))
+ self%Temp = 0.0_dp
+ self%Z = 0.0_dp
+ self%Z_k = 0.0_dp
+
+ i = 0
+ read(id, *) ! Skip header
+ do
+ read(id, '(A)', iostat = stat) dummy
+ !TOdo: Make this a function
+ if (stat /= 0) EXIT
+ !Add data
+ !TODO: substitute with extracting information from dummy
+ backspace(id)
+ i = i + 1
+ read(id, *) self%Temp(i), self%Z(i)
+
+ end do
+ self%Temp = self%Temp * eV_to_K / Temp_ref
+
+ close(id)
+
+ self%Temp_min = self%Temp(1)
+ self%Temp_max = self%Temp(amount)
+ self%Z_min = self%Z(1)
+ self%Z_max = self%Z(amount)
+
+ do i = 1, amount - 1
+ self%Z_k(i) = ( self%Z(i+1) - self%Z(i))/(self%Temp(i+1) - self%Temp(i))
+
+ end do
+
+ end subroutine initTableTtoZ
+
+ subroutine getValueTableTtoZ(self, Temp, Z)
+ implicit none
+
+ class(tableTtoZ), intent(in):: self
+ real(dp), intent(in):: Temp
+ real(dp), intent(out):: Z
+ real(dp):: delta_Temp
+ integer:: i
+
+ if (Temp <= self%Temp_min) THEN
+ Z = self%Z_min
+
+ elseif (Temp >= self%Temp_max) THEN
+ Z = self%Z_max
+
+ else
+ i = minloc(abs(Temp - self%Temp), 1)
+ delta_Temp = Temp - self%Temp(i)
+ if (delta_Temp < 0 ) THEN
+ i = i - 1
+ delta_Temp = Temp - self%Temp(i)
+
+ end if
+
+ Z = self%Z(i) + self%Z_k(i)*delta_Temp
+
+ end if
+
+ end subroutine getValueTableTtoZ
+
+
+
+end module moduleTableTtoZ
+
diff --git a/src/modules/tableTNZ.f90 b/moduleTableTtoZne.f90
similarity index 91%
rename from src/modules/tableTNZ.f90
rename to moduleTableTtoZne.f90
index 12cb341..be9abe3 100644
--- a/src/modules/tableTNZ.f90
+++ b/moduleTableTtoZne.f90
@@ -1,7 +1,7 @@
-module tableTNZ
+module moduleTableTtoZne
use constantParameters, only: dp
- type:: tableTn_to_Z
+ type:: tableTtoZne
real(dp) :: Z_min, Z_max
real(dp) :: Temp_min, Temp_max
real(dp), allocatable, dimension(:):: Temp
@@ -12,7 +12,7 @@ module tableTNZ
procedure, pass:: init => initTableTtoZne
procedure, pass:: get => getValueTableTtoZne
- end type tableTn_to_Z
+ end type tableTtoZne
contains
subroutine initTableTtoZne(self, tableFile)
@@ -20,7 +20,7 @@ module tableTNZ
use referenceValues, only: Temp_ref, n_ref
implicit none
- class(tableTn_to_Z), intent(inout):: self
+ class(tableTtoZne), intent(inout):: self
character(:), allocatable, intent(in):: tableFile
character(100):: dummy
character(len=512) :: line
@@ -31,13 +31,6 @@ module tableTNZ
integer:: id = 20
num_ne = 0
- inquire(file=tableFile, iostat=stat)
- if (stat /= 0) then
- write (*, '("Error: TNZ table file ", a, " does not exist")') tableFile
- return
-
- end if
-
open(id, file = tableFile)
amount = -1 ! Remove header
do
@@ -117,7 +110,7 @@ module tableTNZ
subroutine getValueTableTtoZne(self, Temp, ne, Z)
implicit none
- class(tableTn_to_Z), intent(in):: self
+ class(tableTtoZne), intent(in):: self
real(dp), intent(in):: Temp, ne
real(dp), intent(out):: Z
real(dp):: delta_Temp
@@ -151,5 +144,5 @@ module tableTNZ
-end module tableTNZ
+end module moduleTableTtoZne
diff --git a/scripts_python/plotBC.py b/scripts_python/plotBC.py
index 9e756d6..207869e 100644
--- a/scripts_python/plotBC.py
+++ b/scripts_python/plotBC.py
@@ -4,7 +4,7 @@ import numpy as np
import readBC
-paths = ['../2025-04-15_13.33.28/']
+paths = ['../2025-04-10_08.40.09/']
time, n_i, u_i, T_i, Zinj, Z_Tne = readBC.read(paths[0] + 'bc.csv')
fig, ax = plt.subplots()
@@ -14,7 +14,7 @@ n_e = n_i * Zinj
plt.plot(time, n_e / n_e[0], label = f"$n_e$ ($\\times {n_e[0] * 1e-6:.0e} \\; cm^{{-3}})$")
plt.plot(time, T_i / T_i[0], label = f"$T \\; (\\times{T_i[0]:.1f} \\; eV)$")
plt.plot(time, Zinj, label = "Zinj")
-# plt.plot(time, Z_Tne, label = "Z_Tne")
+plt.plot(time, Z_Tne, label = "Z_Tne")
plt.semilogy()
plt.legend()
plt.show()
diff --git a/scripts_python/plotCumF.py b/scripts_python/plotCumF.py
index 5c5b500..01a8d31 100644
--- a/scripts_python/plotCumF.py
+++ b/scripts_python/plotCumF.py
@@ -16,30 +16,27 @@ m_i = 1.9712e-25
# paths = ['../2024-12-10_18.45.17/', '../Poisson_50ns_T30Z11/']
# paths = ['../2024-12-11_12.38.27/', '../Poisson_polytropic_fa_T30Z11/', '../Poisson_fa_T30Z11/']
# paths = ['../Poisson_partialAblation/','../Poisson_partialAblation_lowerT/','../Poisson_partialAblation_lowT/','../Poisson_partialAblation_highT/']
-paths = ['../2025-04-17_14.39.34/']
+paths = ['../polytropic_80ns_T30/']
labels = [path[3:-1] for path in paths]
-m2s2_to_eV = m_i*0.5/e
-
for path, label in zip(paths, labels):
Zlist = readZlist.read(path+'ZList.csv')
filesCum_i = sorted(glob.glob(path+'time_*_fCum_i.csv'))
_, _, v, _ = readF.read(filesCum_i[-1])
sumF = np.zeros(len(v))
- E = v**2*m2s2_to_eV
for Z in Zlist:
filename='time_*_Z_{:.1f}_fCum_i.csv'.format(Z)
filesCum_i = sorted(glob.glob(path+filename))
- time, rCum, v, f_i = readF.read(filesCum_i[-1])
+ time, x, v, f_i = readF.read(filesCum_i[-1])
sumF += f_i[0]
- plt.plot(E, 4.0*np.pi*rCum[0]**2*f_i[0]/E, label=Z)
- plt.plot(E, 4.0*np.pi*rCum[0]**2*sumF/E, label='sum', color='k', linestyle='dashed')
+ plt.plot(v**2*m_i*0.5/e, f_i[0]*e/m_i/v, label=Z)
print(time)
+ plt.plot(v**2*m_i*0.5/e, sumF*e/m_i/v, label='sum', color='k', linestyle='dashed')
plt.yscale('log')
-plt.ylim([1e8,5e11])
-plt.ylabel('dN / dE (eV^-1)')
+plt.ylim([1e16,5e27])
+plt.ylabel('Sum f(e) / sqrt(e) (m^-3 eV^-1)')
plt.xscale('log')
plt.xlim([1e0,1e4])
plt.xlabel('e (eV)')
diff --git a/scripts_python/plotMom.py b/scripts_python/plotMom.py
index 0da99b8..2f1dacb 100644
--- a/scripts_python/plotMom.py
+++ b/scripts_python/plotMom.py
@@ -12,8 +12,7 @@ from scipy.constants import e, k
# paths = ['../quasiNeutral_partialAblation/','../Poisson_partialAblation/']
# paths = ['../2024-10-02_14.30.44/']
# paths = ['../quasiNeutral_fullAblation/','../Poisson_fullAblation/']
-# paths = ['../2025-04-10_11.59.02/']
-paths = ['../polytropic_80ns_T30/']
+paths = ['../2025-04-09_16.45.52/']
labels = [path[3:-1] for path in paths]
for path, label in zip(paths, labels):
@@ -22,7 +21,7 @@ for path, label in zip(paths, labels):
start = 80
end = 85#len(filesPhi)
every = 1
- fig, ax = plt.subplots(3, sharex='all')
+ fig, ax = plt.subplots(4, sharex='all')
ax[1].set_yscale('log')
ax[1].set_ylim(bottom=1e10, top=1e24)
_, r, _, _, _ = readPhi.read(filesPhi[0])
@@ -51,6 +50,7 @@ for path, label in zip(paths, labels):
ax[1].plot(r, sum_Zni)
ax[1].plot(r, n_e, color='k', linestyle='dashed')
ax[2].plot(r, ave_ui)
+ ax[3].plot(r, ave_Ti)
ax[0].set_title(label)
ax[0].legend()
diff --git a/scripts_python/readF.py b/scripts_python/readF.py
index 37ac329..0c8cdf6 100644
--- a/scripts_python/readF.py
+++ b/scripts_python/readF.py
@@ -8,7 +8,7 @@ def read(filename):
df = pandas.read_csv(filename,skiprows=2,nrows=1)
Z = df['Z'].to_numpy()[0]
- df = pandas.read_csv(filename,skiprows=4,nrows=1,header=None)
+ df = pandas.read_csv(filename,skiprows=2,nrows=1,header=None)
x = df.to_numpy()[0][1:]
df = pandas.read_csv(filename,skiprows=5,header=None)
f = []
diff --git a/src/makefile b/src/makefile
deleted file mode 100644
index 8baded5..0000000
--- a/src/makefile
+++ /dev/null
@@ -1,16 +0,0 @@
-OBJECTS = $(OBJDIR)/constantParameters.o \
- $(OBJDIR)/input.o \
- $(OBJDIR)/output.o \
- $(OBJDIR)/referenceValues.o \
- $(OBJDIR)/tableBoundary.o \
- $(OBJDIR)/tableTNZ.o
-
-
-all: $(OUTPUT)
-
-$(OUTPUT): modules.o $(OUTPUT).f90
- $(FC) $(FCFLAGS) -o $(OBJDIR)/$(OUTPUT).o -c $(OUTPUT).f90
- $(FC) $(FCFLAGS) -o $(TOPDIR)/$(OUTPUT) $(OBJECTS) $(OBJDIR)/$(OUTPUT).o -lopenblas
-
-modules.o:
- $(MAKE) -C modules all
diff --git a/src/modules/input.f90 b/src/modules/input.f90
deleted file mode 100644
index 5b2e832..0000000
--- a/src/modules/input.f90
+++ /dev/null
@@ -1,207 +0,0 @@
-module input
- use constantParameters, only: dp
- implicit none
-
- character(:), allocatable:: inputFile
- integer:: inputFile_id, inputFile_io
-
-
- contains
- subroutine openInputFile()
-
- inquire(file=inputFile, iostat=inputfile_io)
-
- if (inputFile_io /= 0) then
- write (*, '("Error: input file ", a, " does not exist")') inputFile
- return
-
- end if
-
- open(action='read', file=inputFile, iostat=inputFile_io, newunit=inputFile_id)
-
- end subroutine openInputFile
-
- subroutine checkIO(subroutineName)
-
- character(len=*), intent(in):: subroutineName
-
- if (inputFile_io < 0) then
- write (*, '("End-of-file found when reading in subroutine: ",a)') subroutineName
- error stop
-
- elseif (inputFile_io > 0) then
- write (*, '("Error condition ", i3," found when reading in subroutine: ",a)') inputFile_io, subroutineName
- error stop
-
- end if
-
- inputFile_io = 0
-
- end subroutine checkIO
-
- subroutine readReference()
- use constantParameters, only: dp, kb, qe, eps_0, ev_to_K, cm3_to_m3, PI
- use referenceValues
-
- namelist /reference/ m_ref, Temp_ref, n_ref
-
- read(nml=reference, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- ! Set reference numbers (in SI units)
- Temp_ref = Temp_ref * eV_to_K
- n_ref = n_ref
- t_ref = sqrt(eps_0 * m_ref / (n_ref * 1.0_dp * qe**2)) ! 1.0_dp represents Z = 1 for reference values
- u_ref = sqrt(kb * Temp_ref / m_ref)
- L_ref = u_ref * t_ref
- phi_ref = kb * Temp_ref / qe
-
- call checkIO('readReference')
-
- end subroutine readReference
-
- subroutine readGrid(r0, rf, dr, v0, vf, nv)
- use referenceValues, only: L_ref, u_ref
-
- real(dp), intent(out):: r0, rf, dr
- real(dp), intent(out):: v0, vf
- integer, intent(out):: nv
- namelist /grid/ r0, rf, dr, v0, vf, nv
-
- read(nml=grid, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readGrid')
-
- r0 = r0/L_ref
- rf = rf/L_ref
- dr = dr/L_ref
-
- v0 = v0/u_ref
- vf = vf/u_ref
-
- end subroutine readGrid
-
- subroutine readOutput(folder_alloc, outputStep)
-
- character(:), allocatable, intent(out):: folder_alloc
- real(dp), intent(out):: outputStep
- character(len=128):: folder
- namelist /output/ folder, outputStep
-
- read(nml=output, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readOutput')
-
- folder_alloc = trim(folder)
-
- end subroutine readOutput
-
- subroutine readTime(t0, tf, CFL)
- use referenceValues, only: t_ref
-
- real(dp), intent(out):: t0, tf, CFL
-
- namelist /time/ t0, tf, CFL
-
- read(nml=time, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readTime')
-
- t0 = t0/t_ref
- tf = tf/t_ref
-
- end subroutine readTime
-
- subroutine readDetector(rCum)
- use referenceValues, only: L_ref
-
- real(dp), intent(out):: rCum
- namelist /detector/ rCum
-
- read(nml=detector, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readDetector')
-
- ! Set position to calculate cumulative sum of f (non-dimensional units)
- rCum = rCum/L_ref
-
- end subroutine readDetector
-
- subroutine readBoundary(bc)
- use tableBoundary
-
- type(tableBC), intent(out):: bc
- character(len=128):: filename
- character(:), allocatable:: filename_dynamic ! Needed to pass as an argument, might delete
- namelist /boundary/ filename
-
- read(nml=boundary, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readBoundary')
-
- filename_dynamic = trim(filename)
-
- call bc%init(filename_dynamic)
-
- end subroutine readBoundary
-
- subroutine readZ(Zlist, nz, Tene_to_Z)
- use tableTNZ
-
- real(dp), allocatable, intent(out):: Zlist(:)
- integer, intent(out):: nz
- type(tableTn_to_Z), intent(out):: Tene_to_Z
- real(dp), allocatable:: ZList_dummy(:)
- character(len=128):: filename
- character(:), allocatable:: filename_dynamic ! Needed to pass as an argument, might delete
- namelist /Zbins/ ZList, filename
-
- ! List of dummy size
- allocate(ZList(1:99))
- ZList = -1.0_dp
-
- ! Read namelist
- read(nml=Zbins, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readZ')
-
- ! Get the real Z bins
- nz = count(ZList > 0.0_dp)
- allocate(ZList_dummy(1:nz))
- ZList_dummy = ZList(1:nz)
-
- ! Copy to final list
- deallocate(ZList)
- ZList = ZList_dummy
- deallocate(ZList_dummy)
-
- filename_dynamic = trim(filename)
- call Tene_to_Z%init(filename_dynamic)
-
- end subroutine readZ
-
- subroutine readParallel(nThreads)
-
- integer, intent(out):: nThreads
- namelist /parallel/ nThreads
-
- read(nml=parallel, unit=inputFile_id, iostat=inputFile_io)
- rewind(unit=inputFile_id)
-
- call checkIO('readParallel')
-
- end subroutine readParallel
-
- subroutine closeInputFile()
-
- close(inputFile_id)
-
- end subroutine closeInputFile
-
-end module input
diff --git a/src/modules/makefile b/src/modules/makefile
deleted file mode 100644
index 30e0954..0000000
--- a/src/modules/makefile
+++ /dev/null
@@ -1,15 +0,0 @@
-OBJS = constantParameters.o \
- input.o \
- output.o \
- referenceValues.o \
- tableBoundary.o \
- tableTNZ.o
-
-all: $(OBJS)
-
-input.o: referenceValues.o tableBoundary.o tableTNZ.o input.f90
- $(FC) $(FCFLAGS) -c $(subst .o,.f90,$@) -o $(OBJDIR)/$@
-
-%.o: %.f90
- $(FC) $(FCFLAGS) -c $< -o $(OBJDIR)/$@
-
diff --git a/src/vlaplex.f90 b/vlaplex.f90
similarity index 68%
rename from src/vlaplex.f90
rename to vlaplex.f90
index 4c5d4fa..4682862 100644
--- a/src/vlaplex.f90
+++ b/vlaplex.f90
@@ -1,13 +1,37 @@
+ module eos
+ use constantParameters, only: dp
+ implicit none
+
+ private
+ public:: T_to_Z
+
+ contains
+ pure function T_to_Z(T) result(Z)
+ use constantParameters, only: eV_to_K
+ use referenceValues, only: Temp_ref
+ implicit none
+
+ real(dp), intent(in):: T
+ real(dp):: Z
+
+ Z = 22.5 * (Temp_ref * T / eV_to_K / 100.0)**0.6
+
+ end function T_to_Z
+
+end module eos
+
program VlaPlEx
use constantParameters, only: dp, kb, qe, eps_0, ev_to_K, cm3_to_m3, PI
- use input
use output
use referenceValues
- use tableBoundary
- use tableTNZ
+ use eos, only: T_to_Z
+ use moduleTableBC
+ use moduleTableTtoZ
+ use moduleTableTtoZne
use omp_lib
implicit none
+ real(dp), parameter:: m_i = 1.9712258e-25_dp ! Tin atom mass in kg
real(dp), parameter:: gamma_i = 1.0_dp ! Adiabatic coefficient for ions
real(dp), parameter:: m_e = 9.1093837e-31_dp ! Electron mass in kg
real(dp), parameter:: gamma_e = 4.0_dp / 3.0_dp ! Adiabatic coefficient for electrons
@@ -20,10 +44,10 @@ program VlaPlEx
real(dp):: v0, vf
real(dp), allocatable, dimension(:):: v
real(dp):: t0, tf
- real(dp):: CFL
real(dp):: time
real(dp):: dr, dv, dt
integer:: nr, nv, nt, nz
+ integer:: nzMin, nzMax
integer:: i, iz, j, t, z_inj
integer:: j0 ! First integer of positive velocity
@@ -31,8 +55,13 @@ program VlaPlEx
real(dp):: Zave_bc, Zave_bc_old ! Average charge state
real(dp):: u_bc ! Injection velocity
real(dp):: n_bc ! Injection density
+ real(dp):: c_s ! Ion sound speed
type(tableBC):: boundaryConditions
- type(tableTn_to_Z):: Tene_to_Z
+ character(:), allocatable:: bc_file
+ type(tableTtoZ):: TtoZ
+ character(:), allocatable:: TtoZ_file
+ type(tableTtoZne):: TtoZne
+ character(:), allocatable:: TtoZne_file
real(dp), allocatable, dimension(:,:,:):: f_i, f_i_old
real(dp), allocatable, dimension(:):: f0 ! Boundary at r = x_0
@@ -43,7 +72,7 @@ program VlaPlEx
real(dp), allocatable, dimension(:,:):: T_i
real(dp), allocatable, dimension(:):: n_e
real(dp), allocatable, dimension(:):: Zave
- real(dp), allocatable, dimension(:):: Zlist
+ real(dp), allocatable, dimension(:):: Z_list
real(dp), allocatable, dimension(:):: diag, diag_low, diag_high
real(dp), allocatable, dimension(:,:):: A
real(dp), allocatable, dimension(:):: Res
@@ -53,54 +82,58 @@ program VlaPlEx
real(dp), allocatable, dimension(:):: phi, phi_old, E, db_dphi
real(dp):: phiConv
real(dp):: phi0
- real(dp):: T_e0
+ real(dp):: T_e
! real(dp):: phiF
integer:: k
- integer:: nThreads ! number of threads for OpenMP
-
real(dp), allocatable, dimension(:,:):: fCum_i
real(dp):: rCum
integer:: rCum_index
- real(dp):: outputStep
- character(:), allocatable:: folder
-
- character(len=128):: arg
-
- CALL get_command_argument(1, arg)
- if (arg == '') then
- write (*, '(a)') "No input file provided"
- return
-
- end if
- inputFile = trim(arg)
- call openInputFile()
- call readReference()
- call readParallel(nThreads)
- call readGrid(r0, rf, dr, v0, vf, nv)
- call readOutput(folder, outputStep)
- call readTime(t0, tf, CFL)
- call readDetector(rCum)
- call readBoundary(boundaryConditions)
- call readZ(Zlist, nz, Tene_to_Z)
- call closeInputFile()
! Set number of threads
- call omp_set_num_threads(nThreads)
+ call omp_set_num_threads(16)
- ! Grid in the position space
+ ! Set reference numbers (in SI units)
+ Temp_ref = 30.0_dp * eV_to_K
+ n_ref = 1.0e20_dp * cm3_to_m3
+ t_ref = sqrt(eps_0 * m_i / (n_ref * 1.0_dp * qe**2)) ! 1.0_dp represents Z = 1 for reference values
+ u_ref = sqrt(kb * Temp_ref / m_i)
+ L_ref = u_ref * t_ref
+ phi_ref = kb * Temp_ref / qe
+
+ ! Set input parameters (remember these have to be in non-dimensional units)
+ c_s = sqrt(11.0_dp * gamma_i * 1.0_dp)
+ bc_file = 'bc.csv'
+ call boundaryConditions%init(bc_file)
+ TtoZ_file = 'average_TtoZ_curve.csv'
+ call TtoZ%init(TtoZ_file)
+ TtoZne_file = 'Zave_values_per_Ne.csv'
+ call TtoZne%init(TtoZne_file)
+
+ ! Set domain boundaries (non-dimensional units)
+ r0 = 10.0e-6_dp / L_ref
+ rf = 2.0e-3_dp / L_ref
+ dr = 1.0e-6_dp / L_ref
nr = nint((rf - r0) / dr) + 1
dr = (rf - r0) / float(nr-1)
+
allocate(r(1:nr))
do i = 1, nr
r(i) = dr * float(i-1) + r0
end do
+ ! Set position to calculate cumulative sum of f (non-dimensional units)
+ rCum = 1.0e-3 / L_ref
+
! Index for cumulative sum
rCum_index = minloc(abs(r - rCum), 1)
- ! Grid in the velocity space
- dv = (vf - v0) / float(nv-1)
+ v0 =-0.5e1_dp*c_s
+ vf = 1.5e1_dp*c_s
+ dv = 2.0e-1_dp
+ nv = nint((vf - v0) / dv) + 1
+ dv = (vf - v0) / float(nv-1)
+
allocate(v(1:nv))
do j = 1, nv
v(j) = dv * float(j-1) + v0
@@ -112,11 +145,13 @@ program VlaPlEx
j0 = j0 + 1
end if
- dt = CFL*dr/vf
+ t0 = 0.0_dp
+ tf = 3.0e-7_dp / t_ref
+ dt = 5.0e-2_dp*dr/c_s
nt = nint((tf - t0) / dt)
dt = (tf - t0) / float(nt)
- everyOutput = nint(outputStep/t_ref/dt)
+ everyOutput = nint(1.0e-9_dp/t_ref/dt)
if (everyOutput == 0) then
everyOutput = 1
@@ -128,30 +163,41 @@ program VlaPlEx
end if
+ write(*, '(A,ES0.4e3)') 'CFL: ', dt*vf/dr
+
+ nzMin = 3
+ nzMax = 13
+ nz = nzMax - nzMin + 1
+ nz = nz + 1 ! Add bin for low Z plasma
! Allocate vectors
allocate(f_i(1:nz,1:nr,1:nv), f_i_old(1:nz,1:nr,1:nv))
allocate(n_i(1:nz,1:nr))
allocate(sum_ni(1:nr))
allocate(u_i(1:nz,1:nr), E_i(1:nr), T_i(1:nz,1:nr))
allocate(Zave(1:nr))
+ allocate(Z_list(1:nz))
allocate(n_e(1:nr))
allocate(phi(1:nr), phi_old(1:nr), E(1:nr))
allocate(fCum_i(1:nz,1:nv))
- f_i = 0.0_dp
- f_i_old = 0.0_dp
- n_i = 0.0_dp
- sum_ni = 0.0_dp
- u_i = 0.0_dp
- E_i = 0.0_dp
- T_i = 0.0_dp
- n_e = 0.0_dp
- T_e0 = 0.0_dp
- Zave = 0.0_dp
+ f_i = 0.0_dp
+ f_i_old = 0.0_dp
+ n_i = 0.0_dp
+ sum_ni = 0.0_dp
+ u_i = 0.0_dp
+ E_i = 0.0_dp
+ T_i = 0.0_dp
+ n_e = 0.0_dp
+ T_e = 0.0_dp
+ Zave = 0.0_dp
+ Z_list(1) = 0.1_dp ! Low Z bin
+ do iz = nzMin, nzMax
+ Z_list(iz-nzMin+1+1) = float(iz)
+ end do
Zave_bc_old = 0.0_dp
- phi = 0.0_dp
- phi_old = 0.0_dp
- E = 0.0_dp
- fCum_i = 0.0_dp
+ phi = 0.0_dp
+ phi_old = 0.0_dp
+ E = 0.0_dp
+ fCum_i = 0.0_dp
! Allocate matrix for Poisson equation
allocate(diag(1:nr), diag_low(1:nr-1), diag_high(1:nr-1))
@@ -195,15 +241,15 @@ program VlaPlEx
f0 = 0.0_dp
! Output initial values
- call createPath(folder)
+ call createPath()
call setTimeFormat(nt)
t = 0
call writeOutputRef()
! call writeOutputF(t, dt, nr, r, nv, v, f_i_old)
- call writeOutputFCum(t, dt, nz, r(rCum_index), nv, v, fCum_i, Zlist)
+ call writeOutputFCum(t, dt, nz, r(rCum_index), nv, v, fCum_i, Z_list)
call writeOutputPhi(t, dt, nr, r, phi, E, n_e)
- call writeOutputMom(t, dt, nz, nr, r, n_i, u_i, T_i, Zlist)
- call writeOutputZList(nz, Zlist)
+ call writeOutputMom(t, dt, nz, nr, r, n_i, u_i, T_i, Z_list)
+ call writeOutputZList(nz, Z_list)
! Main loop
do t = 1, nt
@@ -211,15 +257,15 @@ program VlaPlEx
! Get boundary conditions for specific time
call boundaryConditions%get(time, n_bc, u_bc, Temp_bc)
- ! Find new \bar{Z}_i based on T_e0 = Temp_bc and n_e = n_bc
- call Tene_to_Z%get(Temp_bc, n_bc, Zave_bc)
+ ! Find new \bar{Z}_i based on T_e = Temp_bc and n_e = n_bc
+ call TtoZne%get(Temp_bc, n_bc, Zave_bc)
! Assign Z(T,n) to bin
- z_inj = minloc(abs(Zlist - Zave_bc),1)
+ z_inj = minloc(abs(Z_list - Zave_bc),1)
! Calculate inject (sonic) speed
- u_bc = sqrt(Zlist(z_inj)* Temp_bc)
+ u_bc = sqrt(Z_list(z_inj)* Temp_bc)
! Calculate ion density to inject
- n_bc = n_bc / Zlist(z_inj)
- call writeOutputBoundary(t, dt, n_bc, u_bc, Temp_bc, Zave_bc, Zlist(z_inj))
+ n_bc = n_bc / Z_list(z_inj)
+ call writeOutputBoundary(t, dt, n_bc, u_bc, Temp_bc, Zave_bc, Z_list(z_inj))
! f0(j0:nv) = v(j0:nv)**2 / sqrt(PI*Temp_bc**3) * exp(-(v(j0:nv) - u_bc)**2 / Temp_bc)
f0(j0:nv) = 1.0_dp / sqrt(PI*Temp_bc) * exp(-(v(j0:nv) - u_bc)**2 / Temp_bc)
@@ -229,7 +275,7 @@ program VlaPlEx
f_i_old(z_inj,1,j0:nv) = f0
f_i(:,1,j0:nv) = f_i_old(:,1,j0:nv)
- T_e0 = Temp_bc
+ T_e = Temp_bc
! r = rf, v<0
f_i_old(:,nr,1:j0-1) = 0.0_dp
@@ -248,12 +294,12 @@ program VlaPlEx
! Advect negative velocity
if (i < nr) then
f_i(iz,i,1:j0-1) = f_i_old(iz,i,1:j0-1) - v(1:j0-1)*dt/dr/r(i)**2*(r(i+1)**2*f_i_old(iz,i+1,1:j0-1) - &
- r(i )**2*f_i_old(iz,i ,1:j0-1))
+ r(i )**2*f_i_old(iz,i ,1:j0-1))
end if
! Advect positive velocity
if (i > 1) then
f_i(iz,i,j0:nv) = f_i_old(iz,i, j0:nv) - v( j0:nv)*dt/dr/r(i)**2*(r(i )**2*f_i_old(iz,i , j0:nv) - &
- r(i-1)**2*f_i_old(iz,i-1, j0:nv))
+ r(i-1)**2*f_i_old(iz,i-1, j0:nv))
end if
n_i(iz,i) = sum(f_i(iz,i,:))*dv
@@ -270,7 +316,7 @@ program VlaPlEx
end do
!$omp end parallel do
- sum_ni = sum_ni + Zlist(iz) * n_i(iz,:)
+ sum_ni = sum_ni + Z_list(iz) * n_i(iz,:)
end do
! Assume quasi-neutrality to start iterating
@@ -308,12 +354,12 @@ program VlaPlEx
! phi0=phi(1) ! Neumann
! Calculate distribution of electrons
- ! n_e = sum_ni(1) * exp((phi- phi0) / T_e0) ! Isothermal (Boltzmann)
- n_e = sum_ni(1) * (1.0_dp + (gamma_e - 1.0_dp)/gamma_e*(phi-phi0)/T_e0)**gamma_e_exp !Polytropic
+ ! n_e = sum_ni(1) * exp((phi- phi0) / T_e) ! Isothermal (Boltzmann)
+ n_e = sum_ni(1) * (1.0_dp + (gamma_e - 1.0_dp)/gamma_e*(phi-phi0)/T_e)**gamma_e_exp !Polytropic
! Diagonal matrix for Newton integration scheme
- ! db_dphi = n_e / T_e0 ! Isothermal (Boltzmann)
- db_dphi = sum_ni(1) / (gamma_e * T_e0) * &
- (1.0_dp + (gamma_e - 1.0_dp)/gamma_e*(phi-phi0)/T_e0)**gamma_e_dexp !Polytropic
+ ! db_dphi = n_e / T_e ! Isothermal (Boltzmann)
+ db_dphi = sum_ni(1) / (gamma_e * T_e) * &
+ (1.0_dp + (gamma_e - 1.0_dp)/gamma_e*(phi-phi0)/T_e)**gamma_e_dexp !Polytropic
! Check if the solution has converged
phiConv = maxval(abs(Res),1)
@@ -324,7 +370,7 @@ program VlaPlEx
! ! Calculate new potential to ensure 0 current at the edge
! if (n_i(nr) > n_epsilon) then
- ! phiF = phi0 + T_e0 * log((2.0_dp*sqrt(pi)*Zave(nr)*n_i(nr)*u_i(nr)) / (Zave(1)*n_i(1)*sqrt(m_i*T_e0/m_e)))
+ ! phiF = phi0 + T_e * log((2.0_dp*sqrt(pi)*Zave(nr)*n_i(nr)*u_i(nr)) / (Zave(1)*n_i(1)*sqrt(m_i*T_e/m_e)))
!
! else
! phiF = phi(nr-5)
@@ -356,18 +402,18 @@ program VlaPlEx
! i = 1, v<0
i = 1
if (E(i) >= 0.0_dp) then
- f_i(iz,i,2:j0-2) = f_i_old(iz,i,2:j0-2) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,2:j0-2) - f_i_old(iz,i,1:j0-3))
+ f_i(iz,i,2:j0-2) = f_i_old(iz,i,2:j0-2) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,2:j0-2) - f_i_old(iz,i,1:j0-3))
else
- f_i(iz,i,2:j0-2) = f_i_old(iz,i,2:j0-2) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,3:j0-1) - f_i_old(iz,i,2:j0-2))
+ f_i(iz,i,2:j0-2) = f_i_old(iz,i,2:j0-2) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,3:j0-1) - f_i_old(iz,i,2:j0-2))
end if
! i = 2, nr-1; all v
!$omp parallel do
do i = 2, nr-1
if (E(i) >= 0.0_dp) then
- f_i(iz,i,2:nv-1) = f_i_old(iz,i,2:nv-1) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,2:nv-1) - f_i_old(iz,i,1:nv-2))
+ f_i(iz,i,2:nv-1) = f_i_old(iz,i,2:nv-1) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,2:nv-1) - f_i_old(iz,i,1:nv-2))
else
- f_i(iz,i,2:nv-1) = f_i_old(iz,i,2:nv-1) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,3:nv) - f_i_old(iz,i,2:nv-1))
+ f_i(iz,i,2:nv-1) = f_i_old(iz,i,2:nv-1) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,3:nv) - f_i_old(iz,i,2:nv-1))
end if
@@ -376,9 +422,9 @@ program VlaPlEx
! i = nr, v>=0
i = nr
if (E(i) >= 0.0_dp) then
- f_i(iz,i,j0+1:nv-1) = f_i_old(iz,i,j0+1:nv-1) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,j0+1:nv-1) - f_i_old(iz,i,j0:nv-2))
+ f_i(iz,i,j0+1:nv-1) = f_i_old(iz,i,j0+1:nv-1) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,j0+1:nv-1) - f_i_old(iz,i,j0:nv-2))
else
- f_i(iz,i,j0+1:nv-1) = f_i_old(iz,i,j0+1:nv-1) - Zlist(iz)*E(i)*dt/dv*(f_i_old(iz,i,j0+2:nv) - f_i_old(iz,i,j0+1:nv-1))
+ f_i(iz,i,j0+1:nv-1) = f_i_old(iz,i,j0+1:nv-1) - Z_list(iz)*E(i)*dt/dv*(f_i_old(iz,i,j0+2:nv) - f_i_old(iz,i,j0+1:nv-1))
end if
end do
@@ -389,14 +435,14 @@ program VlaPlEx
if (all(n_i(iz,:) < n_epsilon) .and. iz .ne. z_inj) then
cycle
end if
- fCum_i(iz,:) = fCum_i(iz,:) + f_i_old(iz,rCum_index,:)*dt*(v+dv/2.0)*dv
+ fCum_i(iz,:) = fCum_i(iz,:) + f_i_old(iz,rCum_index,:)
end do
! Write output
if (mod(t,everyOutput) == 0 .or. t == nt) then
- ! call writeOutputF(t, dt, nz, nr, r, nv, v, f_i_old, Zlist)
+ ! call writeOutputF(t, dt, nz, nr, r, nv, v, f_i_old, Z_list)
call writeOutputPhi(t, dt, nr, r, phi, E, n_e)
- call writeOutputMom(t, dt, nz, nr, r, n_i, u_i, T_i, Zlist)
- call writeOutputFCum(t, dt, nz, r(rCum_index), nv, v, fCum_i, Zlist)
+ call writeOutputMom(t, dt, nz, nr, r, n_i, u_i, T_i, Z_list)
+ call writeOutputFCum(t, dt, nz, r(rCum_index), nv, v, fCum_i, Z_list)
end if