From d4f4757e27bec882c43a2abf7fbec5eb935e2d6a Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 07:01:13 -0500
Subject: [PATCH 01/23] Update build scripts

---
 .gitignore         |  4 +++
 .travis.yml        | 32 ++++++++++++++++++++
 CMakeLists.txt     | 75 +++++++++++++++++++++++-----------------------
 src/CMakeLists.txt |  2 +-
 4 files changed, 74 insertions(+), 39 deletions(-)

diff --git a/.gitignore b/.gitignore
index 4e04204..3f37d3f 100644
--- a/.gitignore
+++ b/.gitignore
@@ -48,3 +48,7 @@ Makefile
 cmake_install.cmake
 install_manifest.txt
 CTestTestfile.cmake
+
+# VS Code Stuff
+launch.json
+settings.json
diff --git a/.travis.yml b/.travis.yml
index 0b15fbc..50a75b6 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -9,6 +9,38 @@ before_install:
 install:
   - sudo apt-get install -qq gfortran-7
   - sudo update-alternatives --install /usr/bin/gfortran gfortran /usr/bin/gfortran-7 90
+  - sudo apt install git
+  - sudo apt install cmake
+  - sudo git clone https://github.com/Reference-LAPACK/lapack.git
+  - pushd lapack
+  - sudo mkdir build
+  - pushd build
+  - sudo cmake -DCMAKE_INSTALL_LIBDIR=$HOME/.local/lapack ..
+  - sudo cmake
+  - sudo make
+  - sudo make install
+  - popd
+  - popd
+  - sudo git clone https://github.com/jchristopherson/ferror.git
+  - pushd ferror
+  - sudo mkdir build
+  - pushd build
+  - sudo cmake -DCMAKE_INSTALL_LIBDIR=$HOME/.local/ferror ..
+  - sudo cmake
+  - sudo make
+  - sudo make install
+  - popd
+  - popd
+  - sudo git clone https://github.com/jchristopherson/linalg.git
+  - pushd linalg
+  - sudo mkdir build
+  - pushd build
+  - sudo cmake -DCMAKE_INSTALL_LIBDIR=$HOME/.local/linalg ..
+  - sudo cmake
+  - sudo make
+  - sudo make install
+  - popd
+  - popd
 
 before_script:
     - mkdir build
diff --git a/CMakeLists.txt b/CMakeLists.txt
index 9e404dd..eb5694b 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -4,14 +4,14 @@ project(nonlin Fortran)
 
 # Define version information
 set(NONLIN_MAJOR_VERSION 1)
-set(NONLIN_MINOR_VERSION 3)
+set(NONLIN_MINOR_VERSION 4)
 set(NONLIN_PATCH_VERSION 0)
 set(NONLIN_VERSION ${NONLIN_MAJOR_VERSION}.${NONLIN_MINOR_VERSION}.${NONLIN_PATCH_VERSION})
 
 # Set a default build type if none was specified
 if(NOT CMAKE_BUILD_TYPE AND NOT CMAKE_CONFIGURATION_TYPES)
-  message(STATUS "Setting build type to 'Release' as none was specified.")
-  set(CMAKE_BUILD_TYPE Release CACHE STRING "Choose the type of build." FORCE)
+  message(STATUS "Setting build type to 'Debug' as none was specified.")
+  set(CMAKE_BUILD_TYPE Debug CACHE STRING "Choose the type of build." FORCE)
   # Set the possible values of build type for cmake-gui
   set_property(CACHE CMAKE_BUILD_TYPE PROPERTY STRINGS "Debug" "Release")
 endif()
@@ -19,33 +19,8 @@ endif()
 # By default, shared library
 option(BUILD_SHARED_LIBS "Build shared libraries" ON)
 
-# Locate Dependencies
-find_package(ferror 1.3.0)
-find_package(linalg 1.5.0)
-
-# If FERROR is not installed on the system, build the default implementation
-if (${ferror_FOUND})
-    message(STATUS "An acceptable version of FERROR (v" ${ferror_VERSION} ") was found, and will be utilized.")
-    set(FERROR_LIBRARIES ferror)
-    get_target_property(ferror_LibLocation ferror LOCATION)
-endif()
-
-# If LINALG is not installed on the system, build the default implementation
-if (${linalg_FOUND})
-    message(STATUS "An acceptable version of LINALG (v" ${linalg_VERSION} ") was found, and will be utilized.")
-    set(LINALG_LIBRARIES linalg)
-    get_target_property(linalg_LibLocation linalg LOCATION)
-else()
-    message(STATUS "LINALG not found.  The default implementation will be used.")
-    add_subdirectory(src/external/linalg)
-    set(linalg_INCLUDE_DIRS src/external/linalg/include)
-    set(LINALG_LIBRARIES linalg)
-    set(linalg_LibLocation ${linalg_BINARY_DIR})
-    include_directories(src/external/linalg/src/external/ferror/include)
-endif()
-
-# Include the dependency module files
-include_directories(${linalg_INCLUDE_DIRS} ${ferror_INCLUDE_DIRS})
+# Get compiler info
+get_filename_component (Fortran_COMPILER_NAME ${CMAKE_Fortran_COMPILER} NAME)
 
 # Export all symbols on Windows when building shared libraries
 SET(CMAKE_WINDOWS_EXPORT_ALL_SYMBOLS TRUE)
@@ -92,13 +67,10 @@ if (NOT CMAKE_LIBRARY_OUTPUT_DIRECTORY)
     endif()
 endif()
 
-# FFLAGS depend on the compiler
-get_filename_component (Fortran_COMPILER_NAME ${CMAKE_Fortran_COMPILER} NAME)
-
 if (Fortran_COMPILER_NAME MATCHES "gfortran.*")
   # gfortran
-  set(CMAKE_Fortran_FLAGS_RELEASE "-funroll-all-loops -fno-f2c -O3")
-  set (CMAKE_Fortran_FLAGS_DEBUG   "-fno-f2c -O0 -g -Wall -Wno-c-binding-type")
+  set(CMAKE_Fortran_FLAGS_RELEASE "-funroll-all-loops -fno-f2c -O3 -Wl,--allow-multiple-definition")
+  set (CMAKE_Fortran_FLAGS_DEBUG   "-fno-f2c -O0 -g -Wall -Wno-c-binding-type -Wl,--allow-multiple-definition")
 elseif (Fortran_COMPILER_NAME MATCHES "ifort.*")
   # ifort (untested)
   set (CMAKE_Fortran_FLAGS_RELEASE "-f77rtl -O3")
@@ -107,9 +79,36 @@ else (Fortran_COMPILER_NAME MATCHES "gfortran.*")
   message ("CMAKE_Fortran_COMPILER full path: " ${CMAKE_Fortran_COMPILER})
   message ("Fortran compiler: " ${Fortran_COMPILER_NAME})
   message ("No optimized Fortran compiler flags are known, we just try -O2...")
-  set (CMAKE_Fortran_FLAGS_RELEASE "-O2")
-  set (CMAKE_Fortran_FLAGS_DEBUG   "-O0 -g -Wall")
-endif (Fortran_COMPILER_NAME MATCHES "gfortran.*")
+  set (CMAKE_Fortran_FLAGS_RELEASE "-O2 -Wl,--allow-multiple-definition")
+  set (CMAKE_Fortran_FLAGS_DEBUG   "-O0 -g -Wall -Wl,--allow-multiple-definition")
+endif ()
+
+# Locate Dependencies
+# find_package(BLAS)
+# find_package(LAPACK)
+find_package(ferror 1.3.0)
+find_package(linalg 1.6.0)
+
+# if (BLAS_FOUND)
+#   message(STATUS "BLAS library found.")
+# endif()
+
+# if (LAPACK_FOUND)
+#   message(STATUS "LAPACK library found.")
+# endif()
+
+if (ferror_FOUND)
+  message(STATUS "FERROR library found.")
+  set(ferror_LIBRARIES ferror)
+endif()
+
+if (linalg_FOUND)
+    message(STATUS "LINALG library found.")
+    set(linalg_LIBRARIES linalg)
+endif()
+
+# Include the dependency module files
+# include_directories(${linalg_INCLUDE_DIRS} ${ferror_INCLUDE_DIRS})
 
 # Locate the source directory
 add_subdirectory(src)
diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt
index 94fae98..a6027e9 100644
--- a/src/CMakeLists.txt
+++ b/src/CMakeLists.txt
@@ -25,7 +25,7 @@ set(nonlin_sources
 
 # Build the library
 add_library(nonlin ${nonlin_sources})
-target_link_libraries(nonlin ${LINALG_LIBRARIES} ${FERROR_LIBRARIES})
+target_link_libraries(nonlin ${linalg_LIBRARIES} ${ferror_LIBRARIES})
 
 # ------------------------------------------------------------------------------
 # INSTALLATION INSTRUCTIONS

From 495cc6732d128c7df948febcefc56777fefa622f Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 07:08:13 -0500
Subject: [PATCH 02/23] Remmove  submodules

---
 .gitmodules         | 3 ---
 src/external/linalg | 1 -
 2 files changed, 4 deletions(-)
 delete mode 160000 src/external/linalg

diff --git a/.gitmodules b/.gitmodules
index 88da711..e69de29 100644
--- a/.gitmodules
+++ b/.gitmodules
@@ -1,3 +0,0 @@
-[submodule "src/external/linalg"]
-	path = src/external/linalg
-	url = https://github.com/jchristopherson/linalg.git
diff --git a/src/external/linalg b/src/external/linalg
deleted file mode 160000
index 0d46167..0000000
--- a/src/external/linalg
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 0d46167f147ae9aba8bdbdcc1aaad7ccd53d876b

From 8c2dd97617144a3e4a15a69ff4533075faaa9598 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 07:08:25 -0500
Subject: [PATCH 03/23] Remove gitmodules

---
 .gitmodules | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 delete mode 100644 .gitmodules

diff --git a/.gitmodules b/.gitmodules
deleted file mode 100644
index e69de29..0000000

From 7a7129e858a77e437f8392f735e27dcf7941a638 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 07:11:56 -0500
Subject: [PATCH 04/23] Update travis

---
 .travis.yml | 40 +++++++++++++++++++++++++++++++++++++++-
 1 file changed, 39 insertions(+), 1 deletion(-)

diff --git a/.travis.yml b/.travis.yml
index 50a75b6..3b5d7fd 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -6,11 +6,49 @@ before_install:
   - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test
   - sudo apt-get update -qq
 
+# the install step will take care of deploying a newer cmake version
+# FROM: https://riptutorial.com/cmake/example/4723/configure-travis-ci-with-newest-cmake
+install:    
+  # first we create a directory for the CMake binaries
+  - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
+  - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
+  # we use wget to fetch the cmake binaries
+  - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.3.2-Linux-x86_64.tar.gz
+  # this is optional, but useful:
+  # do a quick md5 check to ensure that the archive we downloaded did not get compromised
+  - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.3.2-Linux-x86_64.tar.gz" > cmake_md5.txt
+  - md5sum -c cmake_md5.txt
+  # extract the binaries; the output here is quite lengthy,
+  # so we swallow it to not clutter up the travis console
+  - tar -xvf cmake-3.3.2-Linux-x86_64.tar.gz > /dev/null
+  - mv cmake-3.3.2-Linux-x86_64 cmake-install
+  # add both the top-level directory and the bin directory from the archive
+  # to the system PATH. By adding it to the front of the path we hide the
+  # preinstalled CMake with our own.
+  - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
+  # don't forget to switch back to the main build directory once you are done
+  - cd ${TRAVIS_BUILD_DIR}
+
+before_script:
+  # create a build folder for the out-of-source build
+  - mkdir build
+  # switch to build directory
+  - cd build
+  # run cmake; here we assume that the project's
+  # top-level CMakeLists.txt is located at '..'
+  - cmake ..
+
+script:
+  # once CMake has done its job we just build using make as usual
+  - make
+  # if the project uses ctest we can run the tests like this
+  - make test
+
 install:
   - sudo apt-get install -qq gfortran-7
   - sudo update-alternatives --install /usr/bin/gfortran gfortran /usr/bin/gfortran-7 90
   - sudo apt install git
-  - sudo apt install cmake
+  # - sudo apt install cmake
   - sudo git clone https://github.com/Reference-LAPACK/lapack.git
   - pushd lapack
   - sudo mkdir build

From 6457a995e4b74a903394a9ed928f93c581655e9c Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 07:16:08 -0500
Subject: [PATCH 05/23] Work with travis script

---
 .travis.yml | 71 ++++++++++++++++++++++++++++++++++-------------------
 1 file changed, 46 insertions(+), 25 deletions(-)

diff --git a/.travis.yml b/.travis.yml
index 3b5d7fd..38c5a25 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -8,46 +8,67 @@ before_install:
 
 # the install step will take care of deploying a newer cmake version
 # FROM: https://riptutorial.com/cmake/example/4723/configure-travis-ci-with-newest-cmake
-install:    
+# install:    
+#   # first we create a directory for the CMake binaries
+#   - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
+#   - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
+#   # we use wget to fetch the cmake binaries
+#   - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.3.2-Linux-x86_64.tar.gz
+#   # this is optional, but useful:
+#   # do a quick md5 check to ensure that the archive we downloaded did not get compromised
+#   - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.3.2-Linux-x86_64.tar.gz" > cmake_md5.txt
+#   - md5sum -c cmake_md5.txt
+#   # extract the binaries; the output here is quite lengthy,
+#   # so we swallow it to not clutter up the travis console
+#   - tar -xvf cmake-3.3.2-Linux-x86_64.tar.gz > /dev/null
+#   - mv cmake-3.3.2-Linux-x86_64 cmake-install
+#   # add both the top-level directory and the bin directory from the archive
+#   # to the system PATH. By adding it to the front of the path we hide the
+#   # preinstalled CMake with our own.
+#   - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
+#   # don't forget to switch back to the main build directory once you are done
+#   - cd ${TRAVIS_BUILD_DIR}
+
+# before_script:
+#   # create a build folder for the out-of-source build
+#   - mkdir build
+#   # switch to build directory
+#   - cd build
+#   # run cmake; here we assume that the project's
+#   # top-level CMakeLists.txt is located at '..'
+#   - cmake ..
+
+# script:
+#   # once CMake has done its job we just build using make as usual
+#   - make
+#   # if the project uses ctest we can run the tests like this
+#   - make test
+
+install:
+  - sudo apt-get install -qq gfortran-7
+  - sudo update-alternatives --install /usr/bin/gfortran gfortran /usr/bin/gfortran-7 90
+  - sudo apt install git
+# CMAKE STUFF
   # first we create a directory for the CMake binaries
   - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
   - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
   # we use wget to fetch the cmake binaries
-  - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.3.2-Linux-x86_64.tar.gz
+  - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.7.0-Linux-x86_64.tar.gz
   # this is optional, but useful:
   # do a quick md5 check to ensure that the archive we downloaded did not get compromised
-  - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.3.2-Linux-x86_64.tar.gz" > cmake_md5.txt
+  - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.7.0-Linux-x86_64.tar.gz" > cmake_md5.txt
   - md5sum -c cmake_md5.txt
   # extract the binaries; the output here is quite lengthy,
   # so we swallow it to not clutter up the travis console
-  - tar -xvf cmake-3.3.2-Linux-x86_64.tar.gz > /dev/null
-  - mv cmake-3.3.2-Linux-x86_64 cmake-install
+  - tar -xvf cmake-3.7.0-Linux-x86_64.tar.gz > /dev/null
+  - mv cmake-3.7.0-Linux-x86_64 cmake-install
   # add both the top-level directory and the bin directory from the archive
   # to the system PATH. By adding it to the front of the path we hide the
   # preinstalled CMake with our own.
   - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
   # don't forget to switch back to the main build directory once you are done
   - cd ${TRAVIS_BUILD_DIR}
-
-before_script:
-  # create a build folder for the out-of-source build
-  - mkdir build
-  # switch to build directory
-  - cd build
-  # run cmake; here we assume that the project's
-  # top-level CMakeLists.txt is located at '..'
-  - cmake ..
-
-script:
-  # once CMake has done its job we just build using make as usual
-  - make
-  # if the project uses ctest we can run the tests like this
-  - make test
-
-install:
-  - sudo apt-get install -qq gfortran-7
-  - sudo update-alternatives --install /usr/bin/gfortran gfortran /usr/bin/gfortran-7 90
-  - sudo apt install git
+# END CMAKE STUFF
   # - sudo apt install cmake
   - sudo git clone https://github.com/Reference-LAPACK/lapack.git
   - pushd lapack

From adddf257100e4becfd15978480514b5021a376b7 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 12:39:36 -0500
Subject: [PATCH 06/23] Updating CMake

---
 .travis.yml | 67 ++++++++++++++++++++++++++++++++++++-----------------
 1 file changed, 46 insertions(+), 21 deletions(-)

diff --git a/.travis.yml b/.travis.yml
index 38c5a25..8be94e1 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -44,32 +44,53 @@ before_install:
 #   # if the project uses ctest we can run the tests like this
 #   - make test
 
+# ALSO CHECK: https://github.com/gujans/travis-gtest-cmake-example/blob/master/.travis.yml
+
 install:
+  # Install gfortran
   - sudo apt-get install -qq gfortran-7
   - sudo update-alternatives --install /usr/bin/gfortran gfortran /usr/bin/gfortran-7 90
+
+  # Install git
   - sudo apt install git
-# CMAKE STUFF
-  # first we create a directory for the CMake binaries
-  - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
-  - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
-  # we use wget to fetch the cmake binaries
-  - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.7.0-Linux-x86_64.tar.gz
-  # this is optional, but useful:
-  # do a quick md5 check to ensure that the archive we downloaded did not get compromised
-  - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.7.0-Linux-x86_64.tar.gz" > cmake_md5.txt
-  - md5sum -c cmake_md5.txt
-  # extract the binaries; the output here is quite lengthy,
-  # so we swallow it to not clutter up the travis console
-  - tar -xvf cmake-3.7.0-Linux-x86_64.tar.gz > /dev/null
-  - mv cmake-3.7.0-Linux-x86_64 cmake-install
-  # add both the top-level directory and the bin directory from the archive
-  # to the system PATH. By adding it to the front of the path we hide the
-  # preinstalled CMake with our own.
-  - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
-  # don't forget to switch back to the main build directory once you are done
-  - cd ${TRAVIS_BUILD_DIR}
-# END CMAKE STUFF
+
+  # Download and install CMake
+  - sudo git clone https://github.com/Kitware/CMake.git
+  - pushd CMake
+  - sudo mkdir build
+  - pushd build
+  - sudo cmake -DCMAKE_INSTALL_LIBDIR=$HOME/.local/CMake ..
+  - sudo cmake
+  - sudo make
+  - sudo make install
+  - popd
+  - popd
+
+# # CMAKE STUFF
+#   # first we create a directory for the CMake binaries
+#   - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
+#   - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
+#   # we use wget to fetch the cmake binaries
+#   - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.7.0-Linux-x86_64.tar.gz
+#   # this is optional, but useful:
+#   # do a quick md5 check to ensure that the archive we downloaded did not get compromised
+#   - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.7.0-Linux-x86_64.tar.gz" > cmake_md5.txt
+#   - md5sum -c cmake_md5.txt
+#   # extract the binaries; the output here is quite lengthy,
+#   # so we swallow it to not clutter up the travis console
+#   - tar -xvf cmake-3.7.0-Linux-x86_64.tar.gz > /dev/null
+#   - mv cmake-3.7.0-Linux-x86_64 cmake-install
+#   # add both the top-level directory and the bin directory from the archive
+#   # to the system PATH. By adding it to the front of the path we hide the
+#   # preinstalled CMake with our own.
+#   - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
+#   # don't forget to switch back to the main build directory once you are done
+#   - cd ${TRAVIS_BUILD_DIR}
+# # END CMAKE STUFF
+
   # - sudo apt install cmake
+
+  # Download and install LAPACK
   - sudo git clone https://github.com/Reference-LAPACK/lapack.git
   - pushd lapack
   - sudo mkdir build
@@ -80,6 +101,8 @@ install:
   - sudo make install
   - popd
   - popd
+
+  # Download and install FERROR
   - sudo git clone https://github.com/jchristopherson/ferror.git
   - pushd ferror
   - sudo mkdir build
@@ -90,6 +113,8 @@ install:
   - sudo make install
   - popd
   - popd
+
+  # Download and install LINALG
   - sudo git clone https://github.com/jchristopherson/linalg.git
   - pushd linalg
   - sudo mkdir build

From 4f25885214bae80ebe2b93fdf37f6e471a730071 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 12:42:34 -0500
Subject: [PATCH 07/23] Update travis

---
 .travis.yml | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/.travis.yml b/.travis.yml
index 8be94e1..4c1e147 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -54,7 +54,10 @@ install:
   # Install git
   - sudo apt install git
 
-  # Download and install CMake
+  # Use the default version of CMake to build a newer version
+  - sudo apt install cmake
+
+  # Download and install a newer version of CMake
   - sudo git clone https://github.com/Kitware/CMake.git
   - pushd CMake
   - sudo mkdir build

From d1add6c0c398a4589ae39a9de854afedc0848e28 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Sun, 22 Mar 2020 16:15:30 -0500
Subject: [PATCH 08/23] Update scripts

---
 src/CMakeLists.txt   |  3 ++-
 src/nonlin_c_api.f90 | 12 ++++++++++++
 2 files changed, 14 insertions(+), 1 deletion(-)
 create mode 100644 src/nonlin_c_api.f90

diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt
index a6027e9..1577a15 100644
--- a/src/CMakeLists.txt
+++ b/src/CMakeLists.txt
@@ -25,7 +25,8 @@ set(nonlin_sources
 
 # Build the library
 add_library(nonlin ${nonlin_sources})
-target_link_libraries(nonlin ${linalg_LIBRARIES} ${ferror_LIBRARIES})
+# target_link_libraries(nonlin ${linalg_LIBRARIES} ${ferror_LIBRARIES})
+target_link_libraries(nonlin linalg ferror)
 
 # ------------------------------------------------------------------------------
 # INSTALLATION INSTRUCTIONS
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
new file mode 100644
index 0000000..defd81a
--- /dev/null
+++ b/src/nonlin_c_api.f90
@@ -0,0 +1,12 @@
+! nonlin_c_api.f90
+
+!> @brief Defines a C-friendly API to the NONLIN library.
+module nonlin_c_api
+    use iso_c_binding
+    use nonlin_constants
+    use nonlin_core
+    use nonlin_solve
+    use nonlin_least_squares
+    implicit none
+contains
+end module

From 0bb7dda21ca281f0b6bb2067666022801bd7e7b5 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 05:00:38 -0500
Subject: [PATCH 09/23] Update build scripts

---
 CMakeLists.txt     | 2 +-
 src/CMakeLists.txt | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index eb5694b..c512fdb 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -17,7 +17,7 @@ if(NOT CMAKE_BUILD_TYPE AND NOT CMAKE_CONFIGURATION_TYPES)
 endif()
 
 # By default, shared library
-option(BUILD_SHARED_LIBS "Build shared libraries" ON)
+option(BUILD_SHARED_LIBS "Build shared libraries" OFF)
 
 # Get compiler info
 get_filename_component (Fortran_COMPILER_NAME ${CMAKE_Fortran_COMPILER} NAME)
diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt
index 1577a15..d19a509 100644
--- a/src/CMakeLists.txt
+++ b/src/CMakeLists.txt
@@ -21,12 +21,12 @@ set(nonlin_sources
     nonlin_solve_newton.f90
     nonlin_solve_brent.f90
     nonlin_solve_newton1var.f90
+    nonlin_c_api.f90
 )
 
 # Build the library
 add_library(nonlin ${nonlin_sources})
-# target_link_libraries(nonlin ${linalg_LIBRARIES} ${ferror_LIBRARIES})
-target_link_libraries(nonlin linalg ferror)
+target_link_libraries(nonlin ${linalg_LIBRARIES} ${ferror_LIBRARIES})
 
 # ------------------------------------------------------------------------------
 # INSTALLATION INSTRUCTIONS

From f8421272f07d73d2aacb6ae6b3b43bcc80389d42 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 05:08:42 -0500
Subject: [PATCH 10/23] Update documentation

---
 doc/Doxyfile                                  | 354 +++++---
 doc/html/annotated.html                       |  22 +-
 doc/html/classes.html                         | 100 ++-
 .../dir_68267d1309a1af8e8297ef4c3efbcdba.html |  12 +-
 .../dir_68267d1309a1af8e8297ef4c3efbcdba.js   |   1 +
 doc/html/doxygen.css                          | 296 +++++--
 doc/html/dynsections.js                       |   8 +-
 doc/html/files.html                           |  53 +-
 doc/html/functions.html                       |  16 +-
 doc/html/functions_func.html                  |  16 +-
 doc/html/functions_vars.html                  |  10 +-
 doc/html/hierarchy.html                       |  12 +-
 doc/html/hierarchy.js                         |   2 +-
 doc/html/index.html                           | 143 +++-
 ...erfacenonlin__core_1_1fcn1var-members.html |  10 +-
 .../interfacenonlin__core_1_1fcn1var.html     |  12 +-
 ...erfacenonlin__core_1_1fcnnvar-members.html |  10 +-
 .../interfacenonlin__core_1_1fcnnvar.html     |  12 +-
 ...cenonlin__core_1_1gradientfcn-members.html |  10 +-
 .../interfacenonlin__core_1_1gradientfcn.html |  12 +-
 ...cenonlin__core_1_1jacobianfcn-members.html |  10 +-
 .../interfacenonlin__core_1_1jacobianfcn.html |  12 +-
 ...core_1_1nonlin__optimize__fcn-members.html |  10 +-
 ...nonlin__core_1_1nonlin__optimize__fcn.html |  14 +-
 ...onlin__core_1_1nonlin__solver-members.html |  10 +-
 ...terfacenonlin__core_1_1nonlin__solver.html |  14 +-
 ..._core_1_1nonlin__solver__1var-members.html |  10 +-
 ...enonlin__core_1_1nonlin__solver__1var.html |  16 +-
 ...terfacenonlin__core_1_1vecfcn-members.html |  10 +-
 doc/html/interfacenonlin__core_1_1vecfcn.html |  12 +-
 ...omials_1_1assignment_07_0A_08-members.html |  20 +-
 ...n__polynomials_1_1assignment_07_0A_08.html |  32 +-
 ...lin__polynomials_1_1assignment_07_0A_08.js |   8 +-
 ...olynomials_1_1operator_07-_08-members.html |  10 +-
 ...onlin__polynomials_1_1operator_07-_08.html |  14 +-
 ...ynomials_1_1operator_07_09_08-members.html |  10 +-
 ...lin__polynomials_1_1operator_07_09_08.html |  14 +-
 ...lynomials_1_1operator_07_5_08-members.html |  10 +-
 ...nlin__polynomials_1_1operator_07_5_08.html |  18 +-
 doc/html/jquery.js                            | 120 +--
 doc/html/menu.js                              |   2 +-
 doc/html/menudata.js                          |  13 +-
 doc/html/namespacemembers.html                |  10 +-
 doc/html/namespacemembers_func.html           |  10 +-
 doc/html/namespacemembers_vars.html           |  10 +-
 doc/html/namespacenonlin__c__api.html         | 111 +++
 doc/html/namespacenonlin__constants.html      |  16 +-
 doc/html/namespacenonlin__core.html           |  24 +-
 doc/html/namespacenonlin__least__squares.html | 145 +++-
 doc/html/namespacenonlin__linesearch.html     |  36 +-
 doc/html/namespacenonlin__optimize.html       |  16 +-
 doc/html/namespacenonlin__polynomials.html    | 145 +++-
 doc/html/namespacenonlin__polynomials.js      |   2 +-
 doc/html/namespacenonlin__solve.html          |  18 +-
 doc/html/namespaces.html                      |  25 +-
 doc/html/namespaces_dup.js                    |   1 +
 doc/html/navtree.css                          |   2 +-
 doc/html/navtree.js                           |  50 +-
 doc/html/navtreedata.js                       |  13 +-
 doc/html/navtreeindex0.js                     |  66 +-
 doc/html/nonlin__c__api_8f90_source.html      | 122 +++
 doc/html/nonlin__constants_8f90_source.html   |  34 +-
 doc/html/nonlin__core_8f90_source.html        | 596 ++++++++++++-
 ...nlin__equation__optimizer_8f90_source.html |  60 +-
 .../nonlin__equation__solver_8f90_source.html |  88 +-
 ...n__equation__solver__1var_8f90_source.html |  88 +-
 .../nonlin__fcn1var__helper_8f90_source.html  |  95 ++-
 .../nonlin__fcnnvar__helper_8f90_source.html  | 131 ++-
 .../nonlin__least__squares_8f90_source.html   | 707 +++++++++++++++-
 doc/html/nonlin__linesearch_8f90_source.html  | 537 +++++++++++-
 doc/html/nonlin__optimize_8f90_source.html    | 200 ++++-
 .../nonlin__optimize__bfgs_8f90_source.html   | 250 +++++-
 ...n__optimize__line__search_8f90_source.html |  76 +-
 ...n__optimize__nelder__mead_8f90_source.html | 343 +++++++-
 doc/html/nonlin__polynomials_8f90_source.html | 794 +++++++++++++++++-
 doc/html/nonlin__solve_8f90_source.html       | 278 +++++-
 .../nonlin__solve__brent_8f90_source.html     | 218 ++++-
 ...nlin__solve__line__search_8f90_source.html |  62 +-
 ...nonlin__solve__newton1var_8f90_source.html | 229 ++++-
 .../nonlin__solve__newton_8f90_source.html    | 256 +++++-
 ...lin__solve__quasi__newton_8f90_source.html | 343 +++++++-
 .../nonlin__vecfcn__helper_8f90_source.html   | 190 ++++-
 doc/html/resize.js                            |   2 +-
 doc/html/search/all_0.html                    |   4 +-
 doc/html/search/all_0.js                      |   2 +-
 doc/html/search/all_1.html                    |   4 +-
 doc/html/search/all_1.js                      |   4 +-
 doc/html/search/all_10.html                   |   4 +-
 doc/html/search/all_10.js                     |  46 +-
 doc/html/search/all_11.html                   |   4 +-
 doc/html/search/all_11.js                     |   2 +-
 doc/html/search/all_12.html                   |   4 +-
 doc/html/search/all_12.js                     |   6 +-
 doc/html/search/all_13.html                   |   4 +-
 doc/html/search/all_13.js                     |   4 +-
 doc/html/search/all_2.html                    |   4 +-
 doc/html/search/all_2.js                      |   8 +-
 doc/html/search/all_3.html                    |   4 +-
 doc/html/search/all_3.js                      |   4 +-
 doc/html/search/all_4.html                    |   4 +-
 doc/html/search/all_4.js                      |  10 +-
 doc/html/search/all_5.html                    |   4 +-
 doc/html/search/all_5.js                      |  16 +-
 doc/html/search/all_6.html                    |   4 +-
 doc/html/search/all_6.js                      |  50 +-
 doc/html/search/all_7.html                    |   4 +-
 doc/html/search/all_7.js                      |  20 +-
 doc/html/search/all_8.html                    |   4 +-
 doc/html/search/all_8.js                      |   6 +-
 doc/html/search/all_9.html                    |   4 +-
 doc/html/search/all_9.js                      |  38 +-
 doc/html/search/all_a.html                    |   4 +-
 doc/html/search/all_a.js                      |  44 +-
 doc/html/search/all_b.html                    |   4 +-
 doc/html/search/all_b.js                      |  43 +-
 doc/html/search/all_c.html                    |   4 +-
 doc/html/search/all_c.js                      |   8 +-
 doc/html/search/all_d.html                    |   4 +-
 doc/html/search/all_d.js                      |  30 +-
 doc/html/search/all_e.html                    |   4 +-
 doc/html/search/all_e.js                      |   2 +-
 doc/html/search/all_f.html                    |   4 +-
 doc/html/search/all_f.js                      |   2 +-
 doc/html/search/classes_0.html                |   4 +-
 doc/html/search/classes_0.js                  |   2 +-
 doc/html/search/classes_1.html                |   4 +-
 doc/html/search/classes_1.js                  |   4 +-
 doc/html/search/classes_2.html                |   4 +-
 doc/html/search/classes_2.js                  |   6 +-
 doc/html/search/classes_3.html                |   4 +-
 doc/html/search/classes_3.js                  |   8 +-
 doc/html/search/classes_4.html                |   4 +-
 doc/html/search/classes_4.js                  |   2 +-
 doc/html/search/classes_5.html                |   4 +-
 doc/html/search/classes_5.js                  |   2 +-
 doc/html/search/classes_6.html                |   4 +-
 doc/html/search/classes_6.js                  |   2 +-
 doc/html/search/classes_7.html                |   4 +-
 doc/html/search/classes_7.js                  |   8 +-
 doc/html/search/classes_8.html                |   4 +-
 doc/html/search/classes_8.js                  |  12 +-
 doc/html/search/classes_9.html                |   4 +-
 doc/html/search/classes_9.js                  |   6 +-
 doc/html/search/classes_a.html                |   4 +-
 doc/html/search/classes_a.js                  |   2 +-
 doc/html/search/classes_b.html                |   4 +-
 doc/html/search/classes_b.js                  |   2 +-
 doc/html/search/classes_c.html                |   4 +-
 doc/html/search/classes_c.js                  |   6 +-
 doc/html/search/functions_0.html              |   4 +-
 doc/html/search/functions_0.js                |   2 +-
 doc/html/search/functions_1.html              |   4 +-
 doc/html/search/functions_1.js                |   4 +-
 doc/html/search/functions_2.html              |   4 +-
 doc/html/search/functions_2.js                |   4 +-
 doc/html/search/functions_3.html              |   4 +-
 doc/html/search/functions_3.js                |   6 +-
 doc/html/search/functions_4.html              |   4 +-
 doc/html/search/functions_4.js                |  46 +-
 doc/html/search/functions_5.html              |   4 +-
 doc/html/search/functions_5.js                |  16 +-
 doc/html/search/functions_6.html              |   4 +-
 doc/html/search/functions_6.js                |   2 +-
 doc/html/search/functions_7.html              |   4 +-
 doc/html/search/functions_7.js                |  30 +-
 doc/html/search/functions_8.html              |   4 +-
 doc/html/search/functions_8.js                |   2 +-
 doc/html/search/functions_9.html              |   4 +-
 doc/html/search/functions_9.js                |   2 +-
 doc/html/search/functions_a.html              |   4 +-
 doc/html/search/functions_a.js                |  28 +-
 doc/html/search/functions_b.html              |   4 +-
 doc/html/search/functions_b.js                |   2 +-
 doc/html/search/functions_c.html              |   4 +-
 doc/html/search/functions_c.js                |  46 +-
 doc/html/search/functions_d.html              |   4 +-
 doc/html/search/functions_d.js                |   2 +-
 doc/html/search/mag_sel.png                   | Bin 563 -> 465 bytes
 doc/html/search/namespaces_0.html             |   4 +-
 doc/html/search/namespaces_0.js               |  15 +-
 doc/html/search/nomatches.html                |   2 +-
 doc/html/search/search_l.png                  | Bin 604 -> 567 bytes
 doc/html/search/search_r.png                  | Bin 612 -> 553 bytes
 doc/html/search/variables_0.html              |   4 +-
 doc/html/search/variables_0.js                |   6 +-
 doc/html/search/variables_1.html              |   4 +-
 doc/html/search/variables_1.js                |   2 +-
 doc/html/search/variables_2.html              |   4 +-
 doc/html/search/variables_2.js                |   2 +-
 doc/html/search/variables_3.html              |   4 +-
 doc/html/search/variables_3.js                |   2 +-
 doc/html/search/variables_4.html              |   4 +-
 doc/html/search/variables_4.js                |   2 +-
 doc/html/search/variables_5.html              |   4 +-
 doc/html/search/variables_5.js                |  42 +-
 doc/html/search/variables_6.html              |   4 +-
 doc/html/search/variables_6.js                |  16 +-
 doc/html/search/variables_7.html              |   4 +-
 doc/html/search/variables_7.js                |   4 +-
 ...__core_1_1equation__optimizer-members.html |  10 +-
 ...ctnonlin__core_1_1equation__optimizer.html | 124 ++-
 ...lin__core_1_1equation__solver-members.html |  10 +-
 ...tructnonlin__core_1_1equation__solver.html | 201 +++--
 ...ore_1_1equation__solver__1var-members.html |  10 +-
 ...onlin__core_1_1equation__solver__1var.html | 137 ++-
 ...nlin__core_1_1fcn1var__helper-members.html |  10 +-
 ...structnonlin__core_1_1fcn1var__helper.html | 133 ++-
 ...nlin__core_1_1fcnnvar__helper-members.html |  10 +-
 ...structnonlin__core_1_1fcnnvar__helper.html | 197 ++++-
 ...__core_1_1iteration__behavior-members.html |  10 +-
 ...ctnonlin__core_1_1iteration__behavior.html |  12 +-
 ...ctnonlin__core_1_1value__pair-members.html |  10 +-
 .../structnonlin__core_1_1value__pair.html    |  12 +-
 ...onlin__core_1_1vecfcn__helper-members.html |  10 +-
 .../structnonlin__core_1_1vecfcn__helper.html | 209 ++++-
 ...res_1_1least__squares__solver-members.html |  29 +-
 ...st__squares_1_1least__squares__solver.html |  18 +-
 ...n__linesearch_1_1line__search-members.html |  10 +-
 ...uctnonlin__linesearch_1_1line__search.html |  12 +-
 ...tructnonlin__optimize_1_1bfgs-members.html |  16 +-
 doc/html/structnonlin__optimize_1_1bfgs.html  |  70 +-
 ...ze_1_1line__search__optimizer-members.html |  33 +-
 ...__optimize_1_1line__search__optimizer.html |  60 +-
 ...lin__optimize_1_1nelder__mead-members.html |  25 +-
 ...tructnonlin__optimize_1_1nelder__mead.html |  95 ++-
 ...in__polynomials_1_1polynomial-members.html |  10 +-
 ...ructnonlin__polynomials_1_1polynomial.html |  12 +-
 ...onlin__solve_1_1brent__solver-members.html |  27 +-
 .../structnonlin__solve_1_1brent__solver.html |  65 +-
 ...solve_1_1line__search__solver-members.html |  33 +-
 ...nonlin__solve_1_1line__search__solver.html |  52 +-
 ...solve_1_1newton__1var__solver-members.html |  27 +-
 ...nonlin__solve_1_1newton__1var__solver.html |  79 +-
 ...nlin__solve_1_1newton__solver-members.html |  35 +-
 ...structnonlin__solve_1_1newton__solver.html |  70 +-
 ...olve_1_1quasi__newton__solver-members.html |  37 +-
 ...onlin__solve_1_1quasi__newton__solver.html |  85 +-
 doc/html/tabs.css                             |   2 +-
 238 files changed, 8856 insertions(+), 1966 deletions(-)
 create mode 100644 doc/html/namespacenonlin__c__api.html
 create mode 100644 doc/html/nonlin__c__api_8f90_source.html

diff --git a/doc/Doxyfile b/doc/Doxyfile
index 7c65b3c..4098ba7 100644
--- a/doc/Doxyfile
+++ b/doc/Doxyfile
@@ -1,4 +1,4 @@
-# Doxyfile 1.8.11
+# Doxyfile 1.8.16
 
 # This file describes the settings to be used by the documentation system
 # doxygen (www.doxygen.org) for a project.
@@ -17,11 +17,11 @@
 # Project related configuration options
 #---------------------------------------------------------------------------
 
-# This tag specifies the encoding used for all characters in the config file
-# that follow. The default is UTF-8 which is also the encoding used for all text
-# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
-# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
-# for the list of possible encodings.
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
 # The default value is: UTF-8.
 
 DOXYFILE_ENCODING      = UTF-8
@@ -38,7 +38,7 @@ PROJECT_NAME           = nonlin
 # could be handy for archiving the generated documentation or if some version
 # control system is used.
 
-PROJECT_NUMBER         = 1.3.0
+PROJECT_NUMBER         = 1.4.0
 
 # Using the PROJECT_BRIEF tag one can provide an optional one line description
 # for a project that appears at the top of each page and should give viewer a
@@ -51,7 +51,7 @@ PROJECT_BRIEF          = "A library that provides routines to compute the soluti
 # pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
 # the logo to the output directory.
 
-PROJECT_LOGO           = 
+PROJECT_LOGO           =
 
 # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
 # into which the generated documentation will be written. If a relative path is
@@ -93,6 +93,14 @@ ALLOW_UNICODE_NAMES    = NO
 
 OUTPUT_LANGUAGE        = English
 
+# The OUTPUT_TEXT_DIRECTION tag is used to specify the direction in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all generated output in the proper direction.
+# Possible values are: None, LTR, RTL and Context.
+# The default value is: None.
+
+OUTPUT_TEXT_DIRECTION  = None
+
 # If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
 # descriptions after the members that are listed in the file and class
 # documentation (similar to Javadoc). Set to NO to disable this.
@@ -162,7 +170,7 @@ FULL_PATH_NAMES        = YES
 # will be relative from the directory where doxygen is started.
 # This tag requires that the tag FULL_PATH_NAMES is set to YES.
 
-STRIP_FROM_PATH        = 
+STRIP_FROM_PATH        =
 
 # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
 # path mentioned in the documentation of a class, which tells the reader which
@@ -171,7 +179,7 @@ STRIP_FROM_PATH        =
 # specify the list of include paths that are normally passed to the compiler
 # using the -I flag.
 
-STRIP_FROM_INC_PATH    = 
+STRIP_FROM_INC_PATH    =
 
 # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
 # less readable) file names. This can be useful is your file systems doesn't
@@ -189,6 +197,16 @@ SHORT_NAMES            = NO
 
 JAVADOC_AUTOBRIEF      = NO
 
+# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER         = NO
+
 # If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
 # line (until the first dot) of a Qt-style comment as the brief description. If
 # set to NO, the Qt-style will behave just like regular Qt-style comments (thus
@@ -236,15 +254,20 @@ TAB_SIZE               = 4
 # will allow you to put the command \sideeffect (or @sideeffect) in the
 # documentation, which will result in a user-defined paragraph with heading
 # "Side Effects:". You can put \n's in the value part of an alias to insert
-# newlines.
+# newlines (in the resulting output). You can put ^^ in the value part of an
+# alias to insert a newline as if a physical newline was in the original file.
+# When you need a literal { or } or , in the value part of an alias you have to
+# escape them by means of a backslash (\), this can lead to conflicts with the
+# commands \{ and \} for these it is advised to use the version @{ and @} or use
+# a double escape (\\{ and \\})
 
-ALIASES                = 
+ALIASES                =
 
 # This tag can be used to specify a number of word-keyword mappings (TCL only).
 # A mapping has the form "name=value". For example adding "class=itcl::class"
 # will allow you to use the command class in the itcl::class meaning.
 
-TCL_SUBST              = 
+TCL_SUBST              =
 
 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
 # only. Doxygen will then generate output that is more tailored for C. For
@@ -274,28 +297,37 @@ OPTIMIZE_FOR_FORTRAN   = YES
 
 OPTIMIZE_OUTPUT_VHDL   = NO
 
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE  = NO
+
 # Doxygen selects the parser to use depending on the extension of the files it
 # parses. With this tag you can assign which parser to use for a given
 # extension. Doxygen has a built-in mapping, but you can override or extend it
 # using this tag. The format is ext=language, where ext is a file extension, and
 # language is one of the parsers supported by doxygen: IDL, Java, Javascript,
-# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
-# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
-# Fortran. In the later case the parser tries to guess whether the code is fixed
-# or free formatted code, this is the default for Fortran type files), VHDL. For
-# instance to make doxygen treat .inc files as Fortran files (default is PHP),
-# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice,
+# Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files), VHDL, tcl. For instance to make doxygen treat
+# .inc files as Fortran files (default is PHP), and .f files as C (default is
+# Fortran), use: inc=Fortran f=C.
 #
 # Note: For files without extension you can use no_extension as a placeholder.
 #
 # Note that for custom extensions you also need to set FILE_PATTERNS otherwise
 # the files are not read by doxygen.
 
-EXTENSION_MAPPING      = 
+EXTENSION_MAPPING      =
 
 # If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
 # according to the Markdown format, which allows for more readable
-# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
 # The output of markdown processing is further processed by doxygen, so you can
 # mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
 # case of backward compatibilities issues.
@@ -303,6 +335,15 @@ EXTENSION_MAPPING      =
 
 MARKDOWN_SUPPORT       = YES
 
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 5
+
 # When enabled doxygen tries to link words that correspond to documented
 # classes, or namespaces to their corresponding documentation. Such a link can
 # be prevented in individual cases by putting a % sign in front of the word or
@@ -328,7 +369,7 @@ BUILTIN_STL_SUPPORT    = NO
 CPP_CLI_SUPPORT        = NO
 
 # Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
-# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
 # will parse them like normal C++ but will assume all classes use public instead
 # of private inheritance when no explicit protection keyword is present.
 # The default value is: NO.
@@ -434,6 +475,12 @@ EXTRACT_ALL            = NO
 
 EXTRACT_PRIVATE        = YES
 
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL   = NO
+
 # If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
 # scope will be included in the documentation.
 # The default value is: NO.
@@ -512,7 +559,7 @@ INTERNAL_DOCS          = NO
 # names in lower-case letters. If set to YES, upper-case letters are also
 # allowed. This is useful if you have classes or files whose names only differ
 # in case and if your file system supports case sensitive file names. Windows
-# and Mac users are advised to set this option to NO.
+# (including Cygwin) ands Mac users are advised to set this option to NO.
 # The default value is: system dependent.
 
 CASE_SENSE_NAMES       = NO
@@ -639,7 +686,7 @@ GENERATE_DEPRECATEDLIST= YES
 # sections, marked by \if <section_label> ... \endif and \cond <section_label>
 # ... \endcond blocks.
 
-ENABLED_SECTIONS       = 
+ENABLED_SECTIONS       =
 
 # The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
 # initial value of a variable or macro / define can have for it to appear in the
@@ -681,7 +728,7 @@ SHOW_NAMESPACES        = YES
 # by doxygen. Whatever the program writes to standard output is used as the file
 # version. For an example see the documentation.
 
-FILE_VERSION_FILTER    = 
+FILE_VERSION_FILTER    =
 
 # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
 # by doxygen. The layout file controls the global structure of the generated
@@ -694,17 +741,17 @@ FILE_VERSION_FILTER    =
 # DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
 # tag is left empty.
 
-LAYOUT_FILE            = 
+LAYOUT_FILE            =
 
 # The CITE_BIB_FILES tag can be used to specify one or more bib files containing
 # the reference definitions. This must be a list of .bib files. The .bib
 # extension is automatically appended if omitted. This requires the bibtex tool
-# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
 # For LaTeX the style of the bibliography can be controlled using
 # LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
 # search path. See also \cite for info how to create references.
 
-CITE_BIB_FILES         = 
+CITE_BIB_FILES         =
 
 #---------------------------------------------------------------------------
 # Configuration options related to warning and progress messages
@@ -744,7 +791,8 @@ WARN_IF_DOC_ERROR      = YES
 # This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
 # are documented, but have no documentation for their parameters or return
 # value. If set to NO, doxygen will only warn about wrong or incomplete
-# parameter documentation, but not about the absence of documentation.
+# parameter documentation, but not about the absence of documentation. If
+# EXTRACT_ALL is set to YES then this flag will automatically be disabled.
 # The default value is: NO.
 
 WARN_NO_PARAMDOC       = NO
@@ -769,7 +817,7 @@ WARN_FORMAT            = "$file:$line: $text"
 # messages should be written. If left blank the output is written to standard
 # error (stderr).
 
-WARN_LOGFILE           = 
+WARN_LOGFILE           =
 
 #---------------------------------------------------------------------------
 # Configuration options related to the input files
@@ -786,7 +834,7 @@ INPUT                  = ../src
 # This tag can be used to specify the character encoding of the source files
 # that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
 # libiconv (or the iconv built into libc) for the transcoding. See the libiconv
-# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# documentation (see: https://www.gnu.org/software/libiconv/) for the list of
 # possible encodings.
 # The default value is: UTF-8.
 
@@ -803,8 +851,8 @@ INPUT_ENCODING         = UTF-8
 # If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
 # *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
 # *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
-# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
-# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,
+# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf, *.qsf and *.ice.
 
 FILE_PATTERNS          = *.c \
                          *.cc \
@@ -863,7 +911,7 @@ RECURSIVE              = NO
 # Note that relative paths are relative to the directory from which doxygen is
 # run.
 
-EXCLUDE                = 
+EXCLUDE                =
 
 # The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
 # directories that are symbolic links (a Unix file system feature) are excluded
@@ -879,7 +927,7 @@ EXCLUDE_SYMLINKS       = NO
 # Note that the wildcards are matched against the file with absolute path, so to
 # exclude all test directories for example use the pattern */test/*
 
-EXCLUDE_PATTERNS       = 
+EXCLUDE_PATTERNS       =
 
 # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
 # (namespaces, classes, functions, etc.) that should be excluded from the
@@ -890,13 +938,13 @@ EXCLUDE_PATTERNS       =
 # Note that the wildcards are matched against the file with absolute path, so to
 # exclude all test directories use the pattern */test/*
 
-EXCLUDE_SYMBOLS        = 
+EXCLUDE_SYMBOLS        =
 
 # The EXAMPLE_PATH tag can be used to specify one or more files or directories
 # that contain example code fragments that are included (see the \include
 # command).
 
-EXAMPLE_PATH           = 
+EXAMPLE_PATH           =
 
 # If the value of the EXAMPLE_PATH tag contains directories, you can use the
 # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
@@ -937,7 +985,7 @@ IMAGE_PATH             = ../images
 # need to set EXTENSION_MAPPING for the extension otherwise the files are not
 # properly processed by doxygen.
 
-INPUT_FILTER           = 
+INPUT_FILTER           =
 
 # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
 # basis. Doxygen will compare the file name with each pattern and apply the
@@ -950,7 +998,7 @@ INPUT_FILTER           =
 # need to set EXTENSION_MAPPING for the extension otherwise the files are not
 # properly processed by doxygen.
 
-FILTER_PATTERNS        = 
+FILTER_PATTERNS        =
 
 # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
 # INPUT_FILTER) will also be used to filter the input files that are used for
@@ -965,14 +1013,14 @@ FILTER_SOURCE_FILES    = NO
 # *.ext= (so without naming a filter).
 # This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
 
-FILTER_SOURCE_PATTERNS = 
+FILTER_SOURCE_PATTERNS =
 
 # If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
 # is part of the input, its contents will be placed on the main page
 # (index.html). This can be useful if you have a project on for instance GitHub
 # and want to reuse the introduction page also for the doxygen output.
 
-USE_MDFILE_AS_MAINPAGE = 
+USE_MDFILE_AS_MAINPAGE =
 
 #---------------------------------------------------------------------------
 # Configuration options related to source browsing
@@ -1001,7 +1049,7 @@ INLINE_SOURCES         = NO
 STRIP_CODE_COMMENTS    = YES
 
 # If the REFERENCED_BY_RELATION tag is set to YES then for each documented
-# function all documented functions referencing it will be listed.
+# entity all documented functions referencing it will be listed.
 # The default value is: NO.
 
 REFERENCED_BY_RELATION = NO
@@ -1033,12 +1081,12 @@ SOURCE_TOOLTIPS        = YES
 # If the USE_HTAGS tag is set to YES then the references to source code will
 # point to the HTML generated by the htags(1) tool instead of doxygen built-in
 # source browser. The htags tool is part of GNU's global source tagging system
-# (see http://www.gnu.org/software/global/global.html). You will need version
+# (see https://www.gnu.org/software/global/global.html). You will need version
 # 4.8.6 or higher.
 #
 # To use it do the following:
 # - Install the latest version of global
-# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
 # - Make sure the INPUT points to the root of the source tree
 # - Run doxygen as normal
 #
@@ -1066,7 +1114,7 @@ VERBATIM_HEADERS       = YES
 # rich C++ code for which doxygen's built-in parser lacks the necessary type
 # information.
 # Note: The availability of this option depends on whether or not doxygen was
-# generated with the -Duse-libclang=ON option for CMake.
+# generated with the -Duse_libclang=ON option for CMake.
 # The default value is: NO.
 
 CLANG_ASSISTED_PARSING = NO
@@ -1077,7 +1125,17 @@ CLANG_ASSISTED_PARSING = NO
 # specified with INPUT and INCLUDE_PATH.
 # This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
 
-CLANG_OPTIONS          = 
+CLANG_OPTIONS          =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) used when the files
+# were built. This is equivalent to specifying the "-p" option to a clang tool,
+# such as clang-check. These options will then be passed to the parser.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH    =
 
 #---------------------------------------------------------------------------
 # Configuration options related to the alphabetical class index
@@ -1103,7 +1161,7 @@ COLS_IN_ALPHA_INDEX    = 5
 # while generating the index headers.
 # This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
 
-IGNORE_PREFIX          = 
+IGNORE_PREFIX          =
 
 #---------------------------------------------------------------------------
 # Configuration options related to the HTML output
@@ -1147,7 +1205,7 @@ HTML_FILE_EXTENSION    = .html
 # of the possible markers and block names see the documentation.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_HEADER            = 
+HTML_HEADER            =
 
 # The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
 # generated HTML page. If the tag is left blank doxygen will generate a standard
@@ -1157,7 +1215,7 @@ HTML_HEADER            =
 # that doxygen normally uses.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_FOOTER            = 
+HTML_FOOTER            =
 
 # The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
 # sheet that is used by each HTML page. It can be used to fine-tune the look of
@@ -1169,7 +1227,7 @@ HTML_FOOTER            =
 # obsolete.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_STYLESHEET        = 
+HTML_STYLESHEET        =
 
 # The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
 # cascading style sheets that are included after the standard style sheets
@@ -1182,7 +1240,7 @@ HTML_STYLESHEET        =
 # list). For an example see the documentation.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_EXTRA_STYLESHEET  = 
+HTML_EXTRA_STYLESHEET  =
 
 # The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
 # other source files which should be copied to the HTML output directory. Note
@@ -1192,12 +1250,12 @@ HTML_EXTRA_STYLESHEET  =
 # files will be copied as-is; there are no commands or markers available.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_EXTRA_FILES       = 
+HTML_EXTRA_FILES       =
 
 # The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
 # will adjust the colors in the style sheet and background images according to
 # this color. Hue is specified as an angle on a colorwheel, see
-# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
 # 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
 # purple, and 360 is red again.
 # Minimum value: 0, maximum value: 359, default value: 220.
@@ -1233,6 +1291,17 @@ HTML_COLORSTYLE_GAMMA  = 80
 
 HTML_TIMESTAMP         = NO
 
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via Javascript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have Javascript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS     = YES
+
 # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
 # documentation will contain sections that can be hidden and shown after the
 # page has loaded.
@@ -1256,13 +1325,13 @@ HTML_INDEX_NUM_ENTRIES = 100
 
 # If the GENERATE_DOCSET tag is set to YES, additional index files will be
 # generated that can be used as input for Apple's Xcode 3 integrated development
-# environment (see: http://developer.apple.com/tools/xcode/), introduced with
-# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# environment (see: https://developer.apple.com/xcode/), introduced with OSX
+# 10.5 (Leopard). To create a documentation set, doxygen will generate a
 # Makefile in the HTML output directory. Running make will produce the docset in
 # that directory and running make install will install the docset in
 # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
-# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
-# for more information.
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
 # The default value is: NO.
 # This tag requires that the tag GENERATE_HTML is set to YES.
 
@@ -1301,7 +1370,7 @@ DOCSET_PUBLISHER_NAME  = Publisher
 # If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
 # additional HTML index files: index.hhp, index.hhc, and index.hhk. The
 # index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
-# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# (see: https://www.microsoft.com/en-us/download/details.aspx?id=21138) on
 # Windows.
 #
 # The HTML Help Workshop contains a compiler that can convert all HTML output
@@ -1321,7 +1390,7 @@ GENERATE_HTMLHELP      = NO
 # written to the html output directory.
 # This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-CHM_FILE               = 
+CHM_FILE               =
 
 # The HHC_LOCATION tag can be used to specify the location (absolute path
 # including file name) of the HTML help compiler (hhc.exe). If non-empty,
@@ -1329,7 +1398,7 @@ CHM_FILE               =
 # The file has to be specified with full path.
 # This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-HHC_LOCATION           = 
+HHC_LOCATION           =
 
 # The GENERATE_CHI flag controls if a separate .chi index file is generated
 # (YES) or that it should be included in the master .chm file (NO).
@@ -1342,7 +1411,7 @@ GENERATE_CHI           = NO
 # and project file content.
 # This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-CHM_INDEX_ENCODING     = 
+CHM_INDEX_ENCODING     =
 
 # The BINARY_TOC flag controls whether a binary table of contents is generated
 # (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
@@ -1373,11 +1442,11 @@ GENERATE_QHP           = NO
 # the HTML output folder.
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
-QCH_FILE               = 
+QCH_FILE               =
 
 # The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
 # Project output. For more information please see Qt Help Project / Namespace
-# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
 # The default value is: org.doxygen.Project.
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
@@ -1385,7 +1454,7 @@ QHP_NAMESPACE          = org.doxygen.Project
 
 # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
 # Help Project output. For more information please see Qt Help Project / Virtual
-# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# Folders (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-
 # folders).
 # The default value is: doc.
 # This tag requires that the tag GENERATE_QHP is set to YES.
@@ -1394,33 +1463,33 @@ QHP_VIRTUAL_FOLDER     = doc
 
 # If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
 # filter to add. For more information please see Qt Help Project / Custom
-# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# Filters (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-
 # filters).
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
-QHP_CUST_FILTER_NAME   = 
+QHP_CUST_FILTER_NAME   =
 
 # The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
 # custom filter to add. For more information please see Qt Help Project / Custom
-# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# Filters (see: https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-
 # filters).
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
-QHP_CUST_FILTER_ATTRS  = 
+QHP_CUST_FILTER_ATTRS  =
 
 # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
 # project's filter section matches. Qt Help Project / Filter Attributes (see:
-# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
-QHP_SECT_FILTER_ATTRS  = 
+QHP_SECT_FILTER_ATTRS  =
 
 # The QHG_LOCATION tag can be used to specify the location of Qt's
 # qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
 # generated .qhp file.
 # This tag requires that the tag GENERATE_QHP is set to YES.
 
-QHG_LOCATION           = 
+QHG_LOCATION           =
 
 # If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
 # generated, together with the HTML files, they form an Eclipse help plugin. To
@@ -1503,7 +1572,7 @@ EXT_LINKS_IN_WINDOW    = NO
 
 FORMULA_FONTSIZE       = 10
 
-# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
 # generated for formulas are transparent PNGs. Transparent PNGs are not
 # supported properly for IE 6.0, but are supported on all modern browsers.
 #
@@ -1515,7 +1584,7 @@ FORMULA_FONTSIZE       = 10
 FORMULA_TRANSPARENT    = YES
 
 # Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
-# http://www.mathjax.org) which uses client side Javascript for the rendering
+# https://www.mathjax.org) which uses client side Javascript for the rendering
 # instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
 # installed or if you want to formulas look prettier in the HTML output. When
 # enabled you may also need to install MathJax separately and configure the path
@@ -1542,8 +1611,8 @@ MATHJAX_FORMAT         = HTML-CSS
 # MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
 # Content Delivery Network so you can quickly see the result without installing
 # MathJax. However, it is strongly recommended to install a local copy of
-# MathJax from http://www.mathjax.org before deployment.
-# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# MathJax from https://www.mathjax.org before deployment.
+# The default value is: https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/.
 # This tag requires that the tag USE_MATHJAX is set to YES.
 
 MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
@@ -1553,7 +1622,7 @@ MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
 # MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
 # This tag requires that the tag USE_MATHJAX is set to YES.
 
-MATHJAX_EXTENSIONS     = 
+MATHJAX_EXTENSIONS     =
 
 # The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
 # of code that will be used on startup of the MathJax code. See the MathJax site
@@ -1561,7 +1630,7 @@ MATHJAX_EXTENSIONS     =
 # example see the documentation.
 # This tag requires that the tag USE_MATHJAX is set to YES.
 
-MATHJAX_CODEFILE       = 
+MATHJAX_CODEFILE       =
 
 # When the SEARCHENGINE tag is enabled doxygen will generate a search box for
 # the HTML output. The underlying search engine uses javascript and DHTML and
@@ -1604,7 +1673,7 @@ SERVER_BASED_SEARCH    = NO
 #
 # Doxygen ships with an example indexer (doxyindexer) and search engine
 # (doxysearch.cgi) which are based on the open source search engine library
-# Xapian (see: http://xapian.org/).
+# Xapian (see: https://xapian.org/).
 #
 # See the section "External Indexing and Searching" for details.
 # The default value is: NO.
@@ -1617,11 +1686,11 @@ EXTERNAL_SEARCH        = NO
 #
 # Doxygen ships with an example indexer (doxyindexer) and search engine
 # (doxysearch.cgi) which are based on the open source search engine library
-# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Xapian (see: https://xapian.org/). See the section "External Indexing and
 # Searching" for details.
 # This tag requires that the tag SEARCHENGINE is set to YES.
 
-SEARCHENGINE_URL       = 
+SEARCHENGINE_URL       =
 
 # When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
 # search data is written to a file for indexing by an external tool. With the
@@ -1637,7 +1706,7 @@ SEARCHDATA_FILE        = searchdata.xml
 # projects and redirect the results back to the right project.
 # This tag requires that the tag SEARCHENGINE is set to YES.
 
-EXTERNAL_SEARCH_ID     = 
+EXTERNAL_SEARCH_ID     =
 
 # The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
 # projects other than the one defined by this configuration file, but that are
@@ -1647,7 +1716,7 @@ EXTERNAL_SEARCH_ID     =
 # EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
 # This tag requires that the tag SEARCHENGINE is set to YES.
 
-EXTRA_SEARCH_MAPPINGS  = 
+EXTRA_SEARCH_MAPPINGS  =
 
 #---------------------------------------------------------------------------
 # Configuration options related to the LaTeX output
@@ -1669,21 +1738,35 @@ LATEX_OUTPUT           = latex
 # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
 # invoked.
 #
-# Note that when enabling USE_PDFLATEX this option is only used for generating
-# bitmaps for formulas in the HTML output, but not in the Makefile that is
-# written to the output directory.
-# The default file is: latex.
+# Note that when not enabling USE_PDFLATEX the default is latex when enabling
+# USE_PDFLATEX the default is pdflatex and when in the later case latex is
+# chosen this is overwritten by pdflatex. For specific output languages the
+# default can have been set differently, this depends on the implementation of
+# the output language.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_CMD_NAME         = latex
 
 # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
 # index for LaTeX.
+# Note: This tag is used in the Makefile / make.bat.
+# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
+# (.tex).
 # The default file is: makeindex.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
 MAKEINDEX_CMD_NAME     = makeindex
 
+# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
+# generate index for LaTeX. In case there is no backslash (\) as first character
+# it will be automatically added in the LaTeX code.
+# Note: This tag is used in the generated output file (.tex).
+# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
+# The default value is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_MAKEINDEX_CMD    = makeindex
+
 # If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
 # documents. This may be useful for small projects and may help to save some
 # trees in general.
@@ -1711,7 +1794,7 @@ PAPER_TYPE             = a4
 # If left blank no extra packages will be included.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
-EXTRA_PACKAGES         = 
+EXTRA_PACKAGES         =
 
 # The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
 # generated LaTeX document. The header should contain everything until the first
@@ -1727,7 +1810,7 @@ EXTRA_PACKAGES         =
 # to HTML_HEADER.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
-LATEX_HEADER           = 
+LATEX_HEADER           =
 
 # The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
 # generated LaTeX document. The footer should contain everything after the last
@@ -1738,7 +1821,7 @@ LATEX_HEADER           =
 # Note: Only use a user-defined footer if you know what you are doing!
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
-LATEX_FOOTER           = 
+LATEX_FOOTER           =
 
 # The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
 # LaTeX style sheets that are included after the standard style sheets created
@@ -1749,7 +1832,7 @@ LATEX_FOOTER           =
 # list).
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
-LATEX_EXTRA_STYLESHEET = 
+LATEX_EXTRA_STYLESHEET =
 
 # The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
 # other source files which should be copied to the LATEX_OUTPUT output
@@ -1757,7 +1840,7 @@ LATEX_EXTRA_STYLESHEET =
 # markers available.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
-LATEX_EXTRA_FILES      = 
+LATEX_EXTRA_FILES      =
 
 # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
 # prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
@@ -1804,7 +1887,7 @@ LATEX_SOURCE_CODE      = NO
 
 # The LATEX_BIB_STYLE tag can be used to specify the style to use for the
 # bibliography, e.g. plainnat, or ieeetr. See
-# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
 # The default value is: plain.
 # This tag requires that the tag GENERATE_LATEX is set to YES.
 
@@ -1818,6 +1901,14 @@ LATEX_BIB_STYLE        = plain
 
 LATEX_TIMESTAMP        = NO
 
+# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
+# path from which the emoji images will be read. If a relative path is entered,
+# it will be relative to the LATEX_OUTPUT directory. If left blank the
+# LATEX_OUTPUT directory will be used.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EMOJI_DIRECTORY  =
+
 #---------------------------------------------------------------------------
 # Configuration options related to the RTF output
 #---------------------------------------------------------------------------
@@ -1857,22 +1948,22 @@ COMPACT_RTF            = YES
 
 RTF_HYPERLINKS         = YES
 
-# Load stylesheet definitions from file. Syntax is similar to doxygen's config
-# file, i.e. a series of assignments. You only have to provide replacements,
-# missing definitions are set to their default value.
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# configuration file, i.e. a series of assignments. You only have to provide
+# replacements, missing definitions are set to their default value.
 #
 # See also section "Doxygen usage" for information on how to generate the
 # default style sheet that doxygen normally uses.
 # This tag requires that the tag GENERATE_RTF is set to YES.
 
-RTF_STYLESHEET_FILE    = 
+RTF_STYLESHEET_FILE    =
 
 # Set optional variables used in the generation of an RTF document. Syntax is
-# similar to doxygen's config file. A template extensions file can be generated
-# using doxygen -e rtf extensionFile.
+# similar to doxygen's configuration file. A template extensions file can be
+# generated using doxygen -e rtf extensionFile.
 # This tag requires that the tag GENERATE_RTF is set to YES.
 
-RTF_EXTENSIONS_FILE    = 
+RTF_EXTENSIONS_FILE    =
 
 # If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
 # with syntax highlighting in the RTF output.
@@ -1917,7 +2008,7 @@ MAN_EXTENSION          = .3
 # MAN_EXTENSION with the initial . removed.
 # This tag requires that the tag GENERATE_MAN is set to YES.
 
-MAN_SUBDIR             = 
+MAN_SUBDIR             =
 
 # If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
 # will generate one additional man file for each entity documented in the real
@@ -1955,6 +2046,13 @@ XML_OUTPUT             = xml
 
 XML_PROGRAMLISTING     = YES
 
+# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
+# namespace members in file scope as well, matching the HTML output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_NS_MEMB_FILE_SCOPE = NO
+
 #---------------------------------------------------------------------------
 # Configuration options related to the DOCBOOK output
 #---------------------------------------------------------------------------
@@ -1987,9 +2085,9 @@ DOCBOOK_PROGRAMLISTING = NO
 #---------------------------------------------------------------------------
 
 # If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
-# AutoGen Definitions (see http://autogen.sf.net) file that captures the
-# structure of the code including all documentation. Note that this feature is
-# still experimental and incomplete at the moment.
+# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
+# the structure of the code including all documentation. Note that this feature
+# is still experimental and incomplete at the moment.
 # The default value is: NO.
 
 GENERATE_AUTOGEN_DEF   = NO
@@ -2030,7 +2128,7 @@ PERLMOD_PRETTY         = YES
 # overwrite each other's variables.
 # This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
-PERLMOD_MAKEVAR_PREFIX = 
+PERLMOD_MAKEVAR_PREFIX =
 
 #---------------------------------------------------------------------------
 # Configuration options related to the preprocessor
@@ -2071,7 +2169,7 @@ SEARCH_INCLUDES        = YES
 # preprocessor.
 # This tag requires that the tag SEARCH_INCLUDES is set to YES.
 
-INCLUDE_PATH           = 
+INCLUDE_PATH           =
 
 # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
 # patterns (like *.h and *.hpp) to filter out the header-files in the
@@ -2079,7 +2177,7 @@ INCLUDE_PATH           =
 # used.
 # This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
-INCLUDE_FILE_PATTERNS  = 
+INCLUDE_FILE_PATTERNS  =
 
 # The PREDEFINED tag can be used to specify one or more macro names that are
 # defined before the preprocessor is started (similar to the -D option of e.g.
@@ -2089,7 +2187,7 @@ INCLUDE_FILE_PATTERNS  =
 # recursively expanded use the := operator instead of the = operator.
 # This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
-PREDEFINED             = 
+PREDEFINED             =
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
@@ -2098,7 +2196,7 @@ PREDEFINED             =
 # definition found in the source code.
 # This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
-EXPAND_AS_DEFINED      = 
+EXPAND_AS_DEFINED      =
 
 # If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
 # remove all references to function-like macros that are alone on a line, have
@@ -2127,13 +2225,13 @@ SKIP_FUNCTION_MACROS   = YES
 # the path). If a tag file is not located in the directory in which doxygen is
 # run, you must also specify the path to the tagfile here.
 
-TAGFILES               = 
+TAGFILES               =
 
 # When a file name is specified after GENERATE_TAGFILE, doxygen will create a
 # tag file that is based on the input files it reads. See section "Linking to
 # external documentation" for more information about the usage of tag files.
 
-GENERATE_TAGFILE       = 
+GENERATE_TAGFILE       =
 
 # If the ALLEXTERNALS tag is set to YES, all external class will be listed in
 # the class index. If set to NO, only the inherited external classes will be
@@ -2156,12 +2254,6 @@ EXTERNAL_GROUPS        = YES
 
 EXTERNAL_PAGES         = YES
 
-# The PERL_PATH should be the absolute path and name of the perl script
-# interpreter (i.e. the result of 'which perl').
-# The default file (with absolute path) is: /usr/bin/perl.
-
-PERL_PATH              = /usr/bin/perl
-
 #---------------------------------------------------------------------------
 # Configuration options related to the dot tool
 #---------------------------------------------------------------------------
@@ -2175,21 +2267,12 @@ PERL_PATH              = /usr/bin/perl
 
 CLASS_DIAGRAMS         = YES
 
-# You can define message sequence charts within doxygen comments using the \msc
-# command. Doxygen will then run the mscgen tool (see:
-# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
-# documentation. The MSCGEN_PATH tag allows you to specify the directory where
-# the mscgen tool resides. If left empty the tool is assumed to be found in the
-# default search path.
-
-MSCGEN_PATH            = 
-
 # You can include diagrams made with dia in doxygen documentation. Doxygen will
 # then run dia to produce the diagram and insert it in the documentation. The
 # DIA_PATH tag allows you to specify the directory where the dia binary resides.
 # If left empty dia is assumed to be found in the default search path.
 
-DIA_PATH               = 
+DIA_PATH               =
 
 # If set to YES the inheritance and collaboration graphs will hide inheritance
 # and usage relations if the target is undocumented or is not a class.
@@ -2238,7 +2321,7 @@ DOT_FONTSIZE           = 10
 # the path where dot can find it using this tag.
 # This tag requires that the tag HAVE_DOT is set to YES.
 
-DOT_FONTPATH           = 
+DOT_FONTPATH           =
 
 # If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
 # each documented class showing the direct and indirect inheritance relations.
@@ -2382,26 +2465,26 @@ INTERACTIVE_SVG        = NO
 # found. If left blank, it is assumed the dot tool can be found in the path.
 # This tag requires that the tag HAVE_DOT is set to YES.
 
-DOT_PATH               = 
+DOT_PATH               =
 
 # The DOTFILE_DIRS tag can be used to specify one or more directories that
 # contain dot files that are included in the documentation (see the \dotfile
 # command).
 # This tag requires that the tag HAVE_DOT is set to YES.
 
-DOTFILE_DIRS           = 
+DOTFILE_DIRS           =
 
 # The MSCFILE_DIRS tag can be used to specify one or more directories that
 # contain msc files that are included in the documentation (see the \mscfile
 # command).
 
-MSCFILE_DIRS           = 
+MSCFILE_DIRS           =
 
 # The DIAFILE_DIRS tag can be used to specify one or more directories that
 # contain dia files that are included in the documentation (see the \diafile
 # command).
 
-DIAFILE_DIRS           = 
+DIAFILE_DIRS           =
 
 # When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
 # path where java can find the plantuml.jar file. If left blank, it is assumed
@@ -2409,12 +2492,17 @@ DIAFILE_DIRS           =
 # generate a warning when it encounters a \startuml command in this case and
 # will not generate output for the diagram.
 
-PLANTUML_JAR_PATH      = 
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
+
+PLANTUML_CFG_FILE      =
 
 # When using plantuml, the specified paths are searched for files specified by
 # the !include statement in a plantuml block.
 
-PLANTUML_INCLUDE_PATH  = 
+PLANTUML_INCLUDE_PATH  =
 
 # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
 # that will be shown in the graph. If the number of nodes in a graph becomes
diff --git a/doc/html/annotated.html b/doc/html/annotated.html
index ec7d530..ae5fcab 100644
--- a/doc/html/annotated.html
+++ b/doc/html/annotated.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Data Types List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -93,7 +93,7 @@
 <div class="contents">
 <div class="textblock">Here are the data types with brief descriptions:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
-<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core ">nonlin_core</a></b> </td></tr>
+<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b> </td></tr>
 <tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
 <tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver.html" target="_self">equation_solver</a></td><td class="desc">A base class for various solvers of nonlinear systems of equations </td></tr>
 <tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver__1var.html" target="_self">equation_solver_1var</a></td><td class="desc">A base class for various solvers of equations of one variable </td></tr>
@@ -110,21 +110,21 @@
 <tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1value__pair.html" target="_self">value_pair</a></td><td class="desc">Defines a pair of numeric values </td></tr>
 <tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1vecfcn.html" target="_self">vecfcn</a></td><td class="desc">Describes an M-element vector-valued function of N-variables </td></tr>
 <tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1vecfcn__helper.html" target="_self">vecfcn_helper</a></td><td class="desc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver </td></tr>
-<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares ">nonlin_least_squares</a></b> </td></tr>
+<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b> </td></tr>
 <tr id="row_1_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" target="_self">least_squares_solver</a></td><td class="desc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems </td></tr>
-<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch ">nonlin_linesearch</a></b> </td></tr>
+<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b> </td></tr>
 <tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__linesearch_1_1line__search.html" target="_self">line_search</a></td><td class="desc">Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems </td></tr>
-<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize ">nonlin_optimize</a></b> </td></tr>
+<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b> </td></tr>
 <tr id="row_3_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
 <tr id="row_3_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
 <tr id="row_3_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1nelder__mead.html" target="_self">nelder_mead</a></td><td class="desc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables </td></tr>
 <tr id="row_4_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__polynomials.html" target="_self">nonlin_polynomials</a></td><td class="desc"><b>polynomials</b> </td></tr>
-<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html" target="_self">assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
+<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html" target="_self">assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
 <tr id="row_4_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html" target="_self">operator(*)</a></td><td class="desc">Defines polynomial multiplication </td></tr>
 <tr id="row_4_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html" target="_self">operator(+)</a></td><td class="desc">Defines polynomial addition </td></tr>
 <tr id="row_4_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html" target="_self">operator(-)</a></td><td class="desc">Defines polynomial subtraction </td></tr>
 <tr id="row_4_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__polynomials_1_1polynomial.html" target="_self">polynomial</a></td><td class="desc">Defines a polynomial, and associated routines for performing polynomial operations </td></tr>
-<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve ">nonlin_solve</a></b> </td></tr>
+<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b> </td></tr>
 <tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1brent__solver.html" target="_self">brent_solver</a></td><td class="desc">Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives </td></tr>
 <tr id="row_5_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1line__search__solver.html" target="_self">line_search_solver</a></td><td class="desc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior </td></tr>
 <tr id="row_5_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html" target="_self">newton_1var_solver</a></td><td class="desc">Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations </td></tr>
@@ -139,7 +139,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/classes.html b/doc/html/classes.html
index 0ef2ae1..8d8fc1b 100644
--- a/doc/html/classes.html
+++ b/doc/html/classes.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Data Types</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -94,31 +94,75 @@
 <div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
 <table class="classindex">
 <tr><td rowspan="2" valign="bottom"><a name="letter_a"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;a&#160;&#160;</div></td></tr></table>
-</td><td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table>
-</td><td rowspan="2" valign="bottom"><a name="letter_j"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;j&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;q&#160;&#160;</div></td></tr></table>
-</td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td></tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">assignment(=)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td></tr>
+</td>
+<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table>
+</td>
+<td rowspan="2" valign="bottom"><a name="letter_j"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;j&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;q&#160;&#160;</div></td></tr></table>
+</td>
+</tr>
+<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">assignment(=)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+</tr>
 <tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;b&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_v"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;v&#160;&#160;</div></td></tr></table>
-</td></tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__optimize_1_1bfgs.html">bfgs</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a> (<a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_o"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;o&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="structnonlin__linesearch_1_1line__search.html">line_search</a> (<a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td></tr>
+</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_v"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;v&#160;&#160;</div></td></tr></table>
+</td>
+</tr>
+<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="structnonlin__optimize_1_1bfgs.html">bfgs</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a> (<a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_o"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;o&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__linesearch_1_1line__search.html">line_search</a> (<a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+</tr>
 <tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;e&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td></tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">operator(+)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td><td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table>
-</td><td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
-</td><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html">operator(-)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td><td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver.html">equation_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
-</td><td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td><td valign="top"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td><td></td></tr>
-<tr><td></td><td></td><td></td><td valign="top"><a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td><td></td></tr>
+</td>
+<td valign="top"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">operator(+)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td></td></tr>
+<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table>
+</td>
+<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html">operator(-)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td></td></tr>
+<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver.html">equation_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
+</td>
+<td></td></tr>
+<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<td></td></tr>
+<tr><td></td><td></td><td></td><td valign="top"><a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td></td></tr>
 <tr><td></td><td></td><td></td><td></td><td></td></tr>
 </table>
 <div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
@@ -129,7 +173,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.html b/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.html
index 3d2e785..c34152d 100644
--- a/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.html
+++ b/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src Directory Reference</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src Directory Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -99,7 +99,7 @@
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.js b/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.js
index 1f77704..a34d06a 100644
--- a/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.js
+++ b/doc/html/dir_68267d1309a1af8e8297ef4c3efbcdba.js
@@ -1,5 +1,6 @@
 var dir_68267d1309a1af8e8297ef4c3efbcdba =
 [
+    [ "nonlin_c_api.f90", "nonlin__c__api_8f90_source.html", null ],
     [ "nonlin_constants.f90", "nonlin__constants_8f90_source.html", null ],
     [ "nonlin_core.f90", "nonlin__core_8f90_source.html", null ],
     [ "nonlin_equation_optimizer.f90", "nonlin__equation__optimizer_8f90_source.html", null ],
diff --git a/doc/html/doxygen.css b/doc/html/doxygen.css
index 266c8b3..5bc13aa 100644
--- a/doc/html/doxygen.css
+++ b/doc/html/doxygen.css
@@ -1,4 +1,4 @@
-/* The standard CSS for doxygen 1.8.14 */
+/* The standard CSS for doxygen 1.8.16 */
 
 body, table, div, p, dl {
 	font: 400 14px/22px Roboto,sans-serif;
@@ -53,11 +53,13 @@ dt {
 	font-weight: bold;
 }
 
-div.multicol {
+ul.multicol {
 	-moz-column-gap: 1em;
 	-webkit-column-gap: 1em;
+	column-gap: 1em;
 	-moz-column-count: 3;
 	-webkit-column-count: 3;
+	column-count: 3;
 }
 
 p.startli, p.startdd {
@@ -80,6 +82,15 @@ p.endtd {
 	margin-bottom: 2px;
 }
 
+p.interli {
+}
+
+p.interdd {
+}
+
+p.intertd {
+}
+
 /* @end */
 
 caption {
@@ -134,12 +145,12 @@ a.qindex {
 a.qindexHL {
 	font-weight: bold;
 	background-color: #9CAFD4;
-	color: #ffffff;
+	color: #FFFFFF;
 	border: 1px double #869DCA;
 }
 
 .contents a.qindexHL:visited {
-        color: #ffffff;
+        color: #FFFFFF;
 }
 
 a.el {
@@ -163,6 +174,25 @@ dl.el {
 	margin-left: -1cm;
 }
 
+ul {
+  overflow: hidden; /*Fixed: list item bullets overlap floating elements*/
+}
+
+#side-nav ul {
+  overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */
+}
+
+#main-nav ul {
+  overflow: visible; /* reset ul rule for the navigation bar drop down lists */
+}
+
+.fragment {
+  text-align: left;
+  direction: ltr;
+  overflow-x: auto; /*Fixed: fragment lines overlap floating elements*/
+  overflow-y: hidden;
+}
+
 pre.fragment {
         border: 1px solid #C4CFE5;
         background-color: #FBFCFD;
@@ -177,8 +207,8 @@ pre.fragment {
 }
 
 div.fragment {
-        padding: 0px;
-        margin: 4px 8px 4px 2px;
+  padding: 0 0 1px 0; /*Fixed: last line underline overlap border*/
+  margin: 4px 8px 4px 2px;
 	background-color: #FBFCFD;
 	border: 1px solid #C4CFE5;
 }
@@ -248,7 +278,7 @@ span.lineno a:hover {
 div.ah, span.ah {
 	background-color: black;
 	font-weight: bold;
-	color: #ffffff;
+	color: #FFFFFF;
 	margin-bottom: 3px;
 	margin-top: 3px;
 	padding: 0.2em;
@@ -324,7 +354,7 @@ img.formulaDsp {
 	
 }
 
-img.formulaInl {
+img.formulaInl, img.inline {
 	vertical-align: middle;
 }
 
@@ -402,6 +432,13 @@ blockquote {
         padding: 0 12px 0 16px;
 }
 
+blockquote.DocNodeRTL {
+   border-left: 0;
+   border-right: 2px solid #9CAFD4;
+   margin: 0 4px 0 24px;
+   padding: 0 16px 0 12px;
+}
+
 /* @end */
 
 /*
@@ -666,17 +703,17 @@ dl.reflist dd {
         padding-left: 0px;
 }       
 
-.params .paramname, .retval .paramname {
+.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname {
         font-weight: bold;
         vertical-align: top;
 }
         
-.params .paramtype {
+.params .paramtype, .tparams .paramtype {
         font-style: italic;
         vertical-align: top;
 }       
         
-.params .paramdir {
+.params .paramdir, .tparams .paramdir {
         font-family: "courier new",courier,monospace;
         vertical-align: top;
 }
@@ -1081,72 +1118,143 @@ div.headertitle
 	padding: 5px 5px 5px 10px;
 }
 
-dl
-{
-        padding: 0 0 0 10px;
+.PageDocRTL-title div.headertitle {
+  text-align: right;
+  direction: rtl;
 }
 
-/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug */
-dl.section
-{
+dl {
+        padding: 0 0 0 0;
+}
+
+/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug, dl.examples */
+dl.section {
 	margin-left: 0px;
 	padding-left: 0px;
 }
 
-dl.note
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #D0C000;
+dl.section.DocNodeRTL {
+  margin-right: 0px;
+  padding-right: 0px;
 }
 
-dl.warning, dl.attention
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #FF0000;
+dl.note {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #D0C000;
 }
 
-dl.pre, dl.post, dl.invariant
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #00D000;
+dl.note.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #D0C000;
+}
+
+dl.warning, dl.attention {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #FF0000;
 }
 
-dl.deprecated
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #505050;
+dl.warning.DocNodeRTL, dl.attention.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #FF0000;
 }
 
-dl.todo
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #00C0E0;
+dl.pre, dl.post, dl.invariant {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #00D000;
 }
 
-dl.test
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #3030E0;
+dl.pre.DocNodeRTL, dl.post.DocNodeRTL, dl.invariant.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #00D000;
 }
 
-dl.bug
-{
-        margin-left:-7px;
-        padding-left: 3px;
-        border-left:4px solid;
-        border-color: #C08050;
+dl.deprecated {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #505050;
+}
+
+dl.deprecated.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #505050;
+}
+
+dl.todo {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #00C0E0;
+}
+
+dl.todo.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #00C0E0;
+}
+
+dl.test {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #3030E0;
+}
+
+dl.test.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #3030E0;
+}
+
+dl.bug {
+  margin-left: -7px;
+  padding-left: 3px;
+  border-left: 4px solid;
+  border-color: #C08050;
+}
+
+dl.bug.DocNodeRTL {
+  margin-left: 0;
+  padding-left: 0;
+  border-left: 0;
+  margin-right: -7px;
+  padding-right: 3px;
+  border-right: 4px solid;
+  border-color: #C08050;
 }
 
 dl.section dd {
@@ -1263,6 +1371,11 @@ div.toc {
         width: 200px;
 }
 
+.PageDocRTL-title div.toc {
+  float: left !important;
+  text-align: right;
+}
+
 div.toc li {
         background: url("bdwn.png") no-repeat scroll 0 5px transparent;
         font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif;
@@ -1271,6 +1384,12 @@ div.toc li {
         padding-top: 2px;
 }
 
+.PageDocRTL-title div.toc li {
+  background-position-x: right !important;
+  padding-left: 0 !important;
+  padding-right: 10px;
+}
+
 div.toc h3 {
         font: bold 12px/1.2 Arial,FreeSans,sans-serif;
 	color: #4665A2;
@@ -1300,6 +1419,26 @@ div.toc li.level4 {
         margin-left: 45px;
 }
 
+.PageDocRTL-title div.toc li.level1 {
+  margin-left: 0 !important;
+  margin-right: 0;
+}
+
+.PageDocRTL-title div.toc li.level2 {
+  margin-left: 0 !important;
+  margin-right: 15px;
+}
+
+.PageDocRTL-title div.toc li.level3 {
+  margin-left: 0 !important;
+  margin-right: 30px;
+}
+
+.PageDocRTL-title div.toc li.level4 {
+  margin-left: 0 !important;
+  margin-right: 45px;
+}
+
 .inherit_header {
         font-weight: bold;
         color: gray;
@@ -1413,7 +1552,7 @@ tr.heading h2 {
 }
 
 #powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after {
-	border-top-color: #ffffff;
+	border-top-color: #FFFFFF;
 	border-width: 10px;
 	margin: 0px -10px;
 }
@@ -1441,7 +1580,7 @@ tr.heading h2 {
 }
 
 #powerTip.s:after, #powerTip.se:after, #powerTip.sw:after {
-	border-bottom-color: #ffffff;
+	border-bottom-color: #FFFFFF;
 	border-width: 10px;
 	margin: 0px -10px;
 }
@@ -1468,7 +1607,7 @@ tr.heading h2 {
 	left: 100%;
 }
 #powerTip.e:after {
-	border-left-color: #ffffff;
+	border-left-color: #FFFFFF;
 	border-width: 10px;
 	top: 50%;
 	margin-top: -10px;
@@ -1484,7 +1623,7 @@ tr.heading h2 {
 	right: 100%;
 }
 #powerTip.w:after {
-	border-right-color: #ffffff;
+	border-right-color: #FFFFFF;
 	border-width: 10px;
 	top: 50%;
 	margin-top: -10px;
@@ -1592,5 +1731,36 @@ th.markdownTableHeadCenter, td.markdownTableBodyCenter {
 	text-align: center
 }
 
+.DocNodeRTL {
+  text-align: right;
+  direction: rtl;
+}
+
+.DocNodeLTR {
+  text-align: left;
+  direction: ltr;
+}
+
+table.DocNodeRTL {
+   width: auto;
+   margin-right: 0;
+   margin-left: auto;
+}
+
+table.DocNodeLTR {
+   width: auto;
+   margin-right: auto;
+   margin-left: 0;
+}
 
+tt, code, kbd, samp
+{
+  display: inline-block;
+  direction:ltr; 
+}
 /* @end */
+
+u {
+	text-decoration: underline;
+}
+
diff --git a/doc/html/dynsections.js b/doc/html/dynsections.js
index 537e3e4..c8e84aa 100644
--- a/doc/html/dynsections.js
+++ b/doc/html/dynsections.js
@@ -60,7 +60,7 @@ function toggleLevel(level)
       $(this).show();
     } else if (l==level+1) {
       i.removeClass('iconfclosed iconfopen').addClass('iconfclosed');
-      a.html('&#9654;');
+      a.html('&#9658;');
       $(this).show();
     } else {
       $(this).hide();
@@ -87,7 +87,7 @@ function toggleFolder(id)
     // replace down arrow by right arrow for current row
     var currentRowSpans = currentRow.find("span");
     currentRowSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed");
-    currentRowSpans.filter(".arrow").html('&#9654;');
+    currentRowSpans.filter(".arrow").html('&#9658;');
     rows.filter("[id^=row_"+id+"]").hide(); // hide all children
   } else { // we are SHOWING
     // replace right arrow by down arrow for current row
@@ -97,7 +97,7 @@ function toggleFolder(id)
     // replace down arrows by right arrows for child rows
     var childRowsSpans = childRows.find("span");
     childRowsSpans.filter(".iconfopen").removeClass("iconfopen").addClass("iconfclosed");
-    childRowsSpans.filter(".arrow").html('&#9654;');
+    childRowsSpans.filter(".arrow").html('&#9658;');
     childRows.show(); //show all children
   }
   updateStripes();
@@ -121,7 +121,7 @@ function toggleInherit(id)
 
 $(document).ready(function() {
   $('.code,.codeRef').each(function() {
-    $(this).data('powertip',$('#'+$(this).attr('href').replace(/.*\//,'').replace(/[^a-z_A-Z0-9]/g,'_')).html());
+    $(this).data('powertip',$('#a'+$(this).attr('href').replace(/.*\//,'').replace(/[^a-z_A-Z0-9]/g,'_')).html());
     $(this).powerTip({ placement: 's', smartPlacement: true, mouseOnToPopup: true });
   });
 });
diff --git a/doc/html/files.html b/doc/html/files.html
index d6722ad..81d29a0 100644
--- a/doc/html/files.html
+++ b/doc/html/files.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: File List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -94,27 +94,28 @@
 <div class="textblock">Here is a list of all documented files with brief descriptions:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
 <tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span id="img_0_" class="iconfopen" onclick="toggleFolder('0_')">&#160;</span><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html" target="_self">src</a></td><td class="desc"></td></tr>
-<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__constants_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_constants.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__core_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_core.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__optimizer_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_optimizer.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver__1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver_1var.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcn1var__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcn1var_helper.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcnnvar__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcnnvar_helper.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__least__squares_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_least_squares.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__linesearch_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_linesearch.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__bfgs_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_bfgs.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_line_search.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__nelder__mead_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_nelder_mead.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__polynomials_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_polynomials.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__brent_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_brent.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_16_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_line_search.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_17_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_18_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton1var.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_19_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__quasi__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_quasi_newton.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_20_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__vecfcn__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_vecfcn_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__c__api_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_c_api.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__constants_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_constants.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__core_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_core.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__optimizer_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_optimizer.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver__1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver_1var.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcn1var__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcn1var_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcnnvar__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcnnvar_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__least__squares_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_least_squares.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__linesearch_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_linesearch.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__bfgs_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_bfgs.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_line_search.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__nelder__mead_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_nelder_mead.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__polynomials_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_polynomials.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_16_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__brent_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_brent.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_17_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_line_search.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_18_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_19_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton1var.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_20_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__quasi__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_quasi_newton.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_21_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__vecfcn__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_vecfcn_helper.f90</b></td><td class="desc"></td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
@@ -124,7 +125,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/functions.html b/doc/html/functions.html
index eb77306..1d08553 100644
--- a/doc/html/functions.html
+++ b/doc/html/functions.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Data Fields</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -349,16 +349,16 @@ <h3><a id="index_o"></a>- o -</h3><ul>
 
 <h3><a id="index_p"></a>- p -</h3><ul>
 <li>poly_dbl_equals()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_dbl_mult()
 : <a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac">nonlin_polynomials::operator(*)</a>
 </li>
 <li>poly_equals()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_equals_array()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_poly_add()
 : <a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe">nonlin_polynomials::operator(+)</a>
@@ -486,7 +486,7 @@ <h3><a id="index_x"></a>- x -</h3><ul>
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/functions_func.html b/doc/html/functions_func.html
index 00387a6..04797db 100644
--- a/doc/html/functions_func.html
+++ b/doc/html/functions_func.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Data Fields - Functions/Subroutines</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -247,16 +247,16 @@ <h3><a id="index_o"></a>- o -</h3><ul>
 
 <h3><a id="index_p"></a>- p -</h3><ul>
 <li>poly_dbl_equals()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_dbl_mult()
 : <a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac">nonlin_polynomials::operator(*)</a>
 </li>
 <li>poly_equals()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_equals_array()
-: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">nonlin_polynomials::assignment(=)</a>
+: <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">nonlin_polynomials::assignment(=)</a>
 </li>
 <li>poly_poly_add()
 : <a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe">nonlin_polynomials::operator(+)</a>
@@ -374,7 +374,7 @@ <h3><a id="index_s"></a>- s -</h3><ul>
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/functions_vars.html b/doc/html/functions_vars.html
index 59997b3..a816922 100644
--- a/doc/html/functions_vars.html
+++ b/doc/html/functions_vars.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Data Fields - Variables</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -226,7 +226,7 @@ <h3><a id="index_x"></a>- x -</h3><ul>
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/hierarchy.html b/doc/html/hierarchy.html
index db5f169..1851427 100644
--- a/doc/html/hierarchy.html
+++ b/doc/html/hierarchy.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Class Hierarchy</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -93,7 +93,7 @@
 <div class="contents">
 <div class="textblock">This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span>]</div><table class="directory">
-<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html" target="_self">nonlin_polynomials::assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
+<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html" target="_self">nonlin_polynomials::assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
 <tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">nonlin_core::equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
 <tr id="row_1_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">nonlin_optimize::line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
 <tr id="row_1_0_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">nonlin_optimize::bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
@@ -133,7 +133,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/hierarchy.js b/doc/html/hierarchy.js
index 39129f0..cbb9d9e 100644
--- a/doc/html/hierarchy.js
+++ b/doc/html/hierarchy.js
@@ -1,6 +1,6 @@
 var hierarchy =
 [
-    [ "nonlin_polynomials::assignment(=)", "interfacenonlin__polynomials_1_1assignment_07_0A_08.html", null ],
+    [ "nonlin_polynomials::assignment(=)", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html", null ],
     [ "nonlin_core::equation_optimizer", "structnonlin__core_1_1equation__optimizer.html", [
       [ "nonlin_optimize::line_search_optimizer", "structnonlin__optimize_1_1line__search__optimizer.html", [
         [ "nonlin_optimize::bfgs", "structnonlin__optimize_1_1bfgs.html", null ]
diff --git a/doc/html/index.html b/doc/html/index.html
index 5f8c27b..9f13865 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Main Page</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -86,7 +86,7 @@
 </iframe>
 </div>
 
-<div class="header">
+<div class="PageDoc"><div class="header">
   <div class="headertitle">
 <div class="title">nonlin Documentation</div>  </div>
 </div><!--header-->
@@ -95,18 +95,141 @@
 Introduction</h1>
 <p>NONLIN is a library that provides routines for solving least squares problems, systems of equations, and single equations. The library provides function optimization routines. There are also specific routines and data types optimized for operation on polynomials.</p>
 <dl class="section user"><dt></dt><dd>The example below illustrates two techniques of determining the roots of a polynomial using routines and data types provided by this library. <div class="image">
-<img src="Cubic_Roots_Example.png" alt="Cubic_Roots_Example.png"/>
+<img src="Cubic_Roots_Example.png" alt=""/>
 </div>
- <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local variables</span></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_1var_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div><div class="line"></div><div class="line">    <span class="comment">! Define the search limits</span></div><div class="line">    limits%x1 = 2.0d0</div><div class="line">    limits%x2 = -2.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Establish the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Allow the solver to print out updates at each iteration</span></div><div class="line">    <span class="keyword">call </span>solver%set_print_status(.true.)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output, residual, and details regarding the iteration</span></div><div class="line">    print *, <span class="stringliteral">&quot;&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, tracking%iter_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Derivative Evaluations: &quot;</span>, tracking%jacobian_count</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Derivative: &quot;</span>, tracking%converge_on_zero_diff</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function:</span></div><div class="line">    <span class="comment">! f(x) = x**3 - 2 * x - 1</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = x**3 - 2.0d0 * x - 1.0d0</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Iteration: 1</div><div class="line">Function Evaluations: 4</div><div class="line">Jacobian Evaluations: 2</div><div class="line">Change in Variable: 0.500E+00</div><div class="line">Residual: -.125E+00</div><div class="line"></div><div class="line">Iteration: 2</div><div class="line">Function Evaluations: 5</div><div class="line">Jacobian Evaluations: 3</div><div class="line">Change in Variable: 0.125E+01</div><div class="line">Residual: -.208E+01</div><div class="line"></div><div class="line">Iteration: 3</div><div class="line">Function Evaluations: 6</div><div class="line">Jacobian Evaluations: 4</div><div class="line">Change in Variable: 0.625E+00</div><div class="line">Residual: -.115E+01</div><div class="line"></div><div class="line">Iteration: 4</div><div class="line">Function Evaluations: 7</div><div class="line">Jacobian Evaluations: 5</div><div class="line">Change in Variable: -.313E+00</div><div class="line">Residual: 0.436E+00</div><div class="line"></div><div class="line">Iteration: 5</div><div class="line">Function Evaluations: 8</div><div class="line">Jacobian Evaluations: 6</div><div class="line">Change in Variable: 0.665E-01</div><div class="line">Residual: 0.221E-01</div><div class="line"></div><div class="line">Iteration: 6</div><div class="line">Function Evaluations: 9</div><div class="line">Jacobian Evaluations: 7</div><div class="line">Change in Variable: 0.375E-02</div><div class="line">Residual: 0.685E-04</div><div class="line"></div><div class="line">The solution: 1.61803</div><div class="line">The residual:  0.665E-09</div><div class="line">Iterations: 7</div><div class="line">Function Evaluations: 11</div><div class="line">Derivative Evaluations: 8</div><div class="line">Converge on Function Value: T</div><div class="line">Converge on Change in Variable: F</div><div class="line">Converge on Derivative: F</div></div><!-- fragment --> </dd></dl>
-<dl class="section user"><dt></dt><dd>An alternative for determining the roots of a polynomial is to use the polynomial type from this library, and determine the roots using the functionallity of that type. The following example illustrates just such an approach. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(polynomial) :: f</div><div class="line">    <span class="keywordtype">real(real64)</span> :: coeffs(4)</div><div class="line">    <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">allocatable</span> :: rts(:)</div><div class="line">    <span class="keywordtype">integer(int32)</span> :: i</div><div class="line"></div><div class="line">    <span class="comment">! Define the polynomial (x**3 - 2 * x - 1)</span></div><div class="line">    coeffs = [-1.0d0, -2.0d0, 0.0d0, 1.0d0]</div><div class="line">    f = coeffs</div><div class="line"></div><div class="line">    <span class="comment">! Compute the polynomial roots</span></div><div class="line">    rts = f%roots()</div><div class="line"></div><div class="line">    <span class="comment">! Display the results</span></div><div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(rts)</div><div class="line">        print <span class="stringliteral">&#39;(AI0AF9.6AF9.6A)&#39;</span>, <span class="stringliteral">&quot;Root &quot;</span>, i, <span class="stringliteral">&quot; = (&quot;</span>, <span class="keywordtype">real(rts(i), real64)</span>, &amp;</div><div class="line">            <span class="stringliteral">&quot;, &quot;</span>, aimag(rts(i)), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keywordflow">    end do</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Root 1 = (-1.000000,  0.000000)</div><div class="line">Root 2 = (-0.618034,  0.000000)</div><div class="line">Root 3 = ( 1.618034,  0.000000)</div></div><!-- fragment --> </dd></dl>
-</div></div><!-- contents -->
+ <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_1var_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the search limits</span></div>
+<div class="line">    limits%x1 = 2.0d0</div>
+<div class="line">    limits%x2 = -2.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Establish the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Allow the solver to print out updates at each iteration</span></div>
+<div class="line">    <span class="keyword">call </span>solver%set_print_status(.true.)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output, residual, and details regarding the iteration</span></div>
+<div class="line">    print *, <span class="stringliteral">&quot;&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, tracking%iter_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Derivative Evaluations: &quot;</span>, tracking%jacobian_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Derivative: &quot;</span>, tracking%converge_on_zero_diff</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function:</span></div>
+<div class="line">    <span class="comment">! f(x) = x**3 - 2 * x - 1</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = x**3 - 2.0d0 * x - 1.0d0</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Iteration: 1</div>
+<div class="line">Function Evaluations: 4</div>
+<div class="line">Jacobian Evaluations: 2</div>
+<div class="line">Change in Variable: 0.500E+00</div>
+<div class="line">Residual: -.125E+00</div>
+<div class="line"> </div>
+<div class="line">Iteration: 2</div>
+<div class="line">Function Evaluations: 5</div>
+<div class="line">Jacobian Evaluations: 3</div>
+<div class="line">Change in Variable: 0.125E+01</div>
+<div class="line">Residual: -.208E+01</div>
+<div class="line"> </div>
+<div class="line">Iteration: 3</div>
+<div class="line">Function Evaluations: 6</div>
+<div class="line">Jacobian Evaluations: 4</div>
+<div class="line">Change in Variable: 0.625E+00</div>
+<div class="line">Residual: -.115E+01</div>
+<div class="line"> </div>
+<div class="line">Iteration: 4</div>
+<div class="line">Function Evaluations: 7</div>
+<div class="line">Jacobian Evaluations: 5</div>
+<div class="line">Change in Variable: -.313E+00</div>
+<div class="line">Residual: 0.436E+00</div>
+<div class="line"> </div>
+<div class="line">Iteration: 5</div>
+<div class="line">Function Evaluations: 8</div>
+<div class="line">Jacobian Evaluations: 6</div>
+<div class="line">Change in Variable: 0.665E-01</div>
+<div class="line">Residual: 0.221E-01</div>
+<div class="line"> </div>
+<div class="line">Iteration: 6</div>
+<div class="line">Function Evaluations: 9</div>
+<div class="line">Jacobian Evaluations: 7</div>
+<div class="line">Change in Variable: 0.375E-02</div>
+<div class="line">Residual: 0.685E-04</div>
+<div class="line"> </div>
+<div class="line">The solution: 1.61803</div>
+<div class="line">The residual:  0.665E-09</div>
+<div class="line">Iterations: 7</div>
+<div class="line">Function Evaluations: 11</div>
+<div class="line">Derivative Evaluations: 8</div>
+<div class="line">Converge on Function Value: T</div>
+<div class="line">Converge on Change in Variable: F</div>
+<div class="line">Converge on Derivative: F</div>
+</div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt></dt><dd>An alternative for determining the roots of a polynomial is to use the polynomial type from this library, and determine the roots using the functionallity of that type. The following example illustrates just such an approach. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(polynomial) :: f</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: coeffs(4)</div>
+<div class="line">    <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">allocatable</span> :: rts(:)</div>
+<div class="line">    <span class="keywordtype">integer(int32)</span> :: i</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the polynomial (x**3 - 2 * x - 1)</span></div>
+<div class="line">    coeffs = [-1.0d0, -2.0d0, 0.0d0, 1.0d0]</div>
+<div class="line">    f = coeffs</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Compute the polynomial roots</span></div>
+<div class="line">    rts = f%roots()</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the results</span></div>
+<div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(rts)</div>
+<div class="line">        print <span class="stringliteral">&#39;(AI0AF9.6AF9.6A)&#39;</span>, <span class="stringliteral">&quot;Root &quot;</span>, i, <span class="stringliteral">&quot; = (&quot;</span>, real(rts(i), real64), &amp;</div>
+<div class="line">            <span class="stringliteral">&quot;, &quot;</span>, aimag(rts(i)), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keywordflow">    end do</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Root 1 = (-1.000000,  0.000000)</div>
+<div class="line">Root 2 = (-0.618034,  0.000000)</div>
+<div class="line">Root 3 = ( 1.618034,  0.000000)</div>
+</div><!-- fragment --> </dd></dl>
+</div></div><!-- PageDoc -->
+</div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__polynomials_html"><div class="ttname"><a href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="ttdoc">polynomials</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00013">nonlin_polynomials.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1fcn1var-members.html b/doc/html/interfacenonlin__core_1_1fcn1var-members.html
index f63b57d..80ba70f 100644
--- a/doc/html/interfacenonlin__core_1_1fcn1var-members.html
+++ b/doc/html/interfacenonlin__core_1_1fcn1var-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1fcn1var.html b/doc/html/interfacenonlin__core_1_1fcn1var.html
index 476b76f..bef2180 100644
--- a/doc/html/interfacenonlin__core_1_1fcn1var.html
+++ b/doc/html/interfacenonlin__core_1_1fcn1var.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::fcn1var Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00198">198</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -126,7 +126,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1fcnnvar-members.html b/doc/html/interfacenonlin__core_1_1fcnnvar-members.html
index 42303f6..fce1c26 100644
--- a/doc/html/interfacenonlin__core_1_1fcnnvar-members.html
+++ b/doc/html/interfacenonlin__core_1_1fcnnvar-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1fcnnvar.html b/doc/html/interfacenonlin__core_1_1fcnnvar.html
index e5179d2..cb1675b 100644
--- a/doc/html/interfacenonlin__core_1_1fcnnvar.html
+++ b/doc/html/interfacenonlin__core_1_1fcnnvar.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::fcnnvar Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00230">230</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -126,7 +126,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1gradientfcn-members.html b/doc/html/interfacenonlin__core_1_1gradientfcn-members.html
index 9819cff..197ba76 100644
--- a/doc/html/interfacenonlin__core_1_1gradientfcn-members.html
+++ b/doc/html/interfacenonlin__core_1_1gradientfcn-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1gradientfcn.html b/doc/html/interfacenonlin__core_1_1gradientfcn.html
index 41d5137..a50db10 100644
--- a/doc/html/interfacenonlin__core_1_1gradientfcn.html
+++ b/doc/html/interfacenonlin__core_1_1gradientfcn.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::gradientfcn Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00242">242</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -126,7 +126,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1jacobianfcn-members.html b/doc/html/interfacenonlin__core_1_1jacobianfcn-members.html
index c1df452..e53c7e1 100644
--- a/doc/html/interfacenonlin__core_1_1jacobianfcn-members.html
+++ b/doc/html/interfacenonlin__core_1_1jacobianfcn-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1jacobianfcn.html b/doc/html/interfacenonlin__core_1_1jacobianfcn.html
index b6c9806..b1f3c72 100644
--- a/doc/html/interfacenonlin__core_1_1jacobianfcn.html
+++ b/doc/html/interfacenonlin__core_1_1jacobianfcn.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::jacobianfcn Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00220">220</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -126,7 +126,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn-members.html b/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn-members.html
index 3496dc8..a889a80 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn-members.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn.html b/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn.html
index c2bbd7d..ebd4c7c 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__optimize__fcn.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::nonlin_optimize_fcn Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -109,7 +109,7 @@
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The equation_optimizer-based object. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object containing the equation to optimize. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object containing the equation to optimize. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, the initial guess at the optimal point. On output, the updated optimal point estimate. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">fout</td><td>An optional output, that if provided, returns the value of the function at <code>x</code>. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">ib</td><td>An optional output, that if provided, allows the caller to obtain iteration performance statistics. </td></tr>
@@ -120,7 +120,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01969">1969</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -130,7 +130,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__solver-members.html b/doc/html/interfacenonlin__core_1_1nonlin__solver-members.html
index c65a6ca..38ee6a2 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__solver-members.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__solver.html b/doc/html/interfacenonlin__core_1_1nonlin__solver.html
index 6765b01..577c6e5 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__solver.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::nonlin_solver Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -109,7 +109,7 @@
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The equation_solver-based object. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object containing the equations to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object containing the equations to solve. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an N-element array containing an initial estimate to the solution. On output, the updated solution estimate. N is the number of variables. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">fvec</td><td>An M-element array that, on output, will contain the values of each equation as evaluated at the variable values given in <code>x</code>. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">ib</td><td>An optional output, that if provided, allows the caller to obtain iteration performance statistics. </td></tr>
@@ -120,7 +120,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01902">1902</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -130,7 +130,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__solver__1var-members.html b/doc/html/interfacenonlin__core_1_1nonlin__solver__1var-members.html
index 2d8516a..0e9a2e3 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__solver__1var-members.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__solver__1var-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1nonlin__solver__1var.html b/doc/html/interfacenonlin__core_1_1nonlin__solver__1var.html
index 49a098f..ee8a2dd 100644
--- a/doc/html/interfacenonlin__core_1_1nonlin__solver__1var.html
+++ b/doc/html/interfacenonlin__core_1_1nonlin__solver__1var.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::nonlin_solver_1var Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -109,9 +109,9 @@
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The equation_solver_1var-based object. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object containing the equation to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object containing the equation to solve. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input the initial guess at the solution. On output the updated solution estimate. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A <a class="el" href="structnonlin__core_1_1value__pair.html" title="Defines a pair of numeric values. ">value_pair</a> object defining the search limits. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A <a class="el" href="structnonlin__core_1_1value__pair.html" title="Defines a pair of numeric values.">value_pair</a> object defining the search limits. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An optional parameter used to return the function residual as computed at <code>x</code>. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">ib</td><td>An optional output, that if provided, allows the caller to obtain iteration performance statistics. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">err</td><td>An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. The possible error codes returned will likely vary from solver to solver. </td></tr>
@@ -121,7 +121,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01935">1935</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -131,7 +131,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1vecfcn-members.html b/doc/html/interfacenonlin__core_1_1vecfcn-members.html
index 1867d77..7315125 100644
--- a/doc/html/interfacenonlin__core_1_1vecfcn-members.html
+++ b/doc/html/interfacenonlin__core_1_1vecfcn-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__core_1_1vecfcn.html b/doc/html/interfacenonlin__core_1_1vecfcn.html
index c34bfeb..b35cda5 100644
--- a/doc/html/interfacenonlin__core_1_1vecfcn.html
+++ b/doc/html/interfacenonlin__core_1_1vecfcn.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::vecfcn Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00209">209</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -126,7 +126,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08-members.html b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08-members.html
index a639247..a5a8e0e 100644
--- a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08-members.html
+++ b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -68,7 +68,7 @@
 </div>
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
-$(document).ready(function(){initNavTree('interfacenonlin__polynomials_1_1assignment_07_0A_08.html','');});
+$(document).ready(function(){initNavTree('interfacenonlin__polynomials_1_1assignment_07_0a_08.html','');});
 /* @license-end */
 </script>
 <div id="doc-content">
@@ -92,11 +92,11 @@
 </div><!--header-->
 <div class="contents">
 
-<p>This is the complete list of members for <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">nonlin_polynomials::assignment(=)</a>, including all inherited members.</p>
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">nonlin_polynomials::assignment(=)</a>, including all inherited members.</p>
 <table class="directory">
-  <tr class="even"><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7">poly_dbl_equals</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">poly_equals</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">poly_equals_array</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7">poly_dbl_equals</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">poly_equals</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">poly_equals_array</a>(x, y)</td><td class="entry"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">nonlin_polynomials::assignment(=)</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -104,7 +104,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.html b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.html
index 3f6c3d0..c43699b 100644
--- a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.html
+++ b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials::assignment(=) Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -68,7 +68,7 @@
 </div>
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
-$(document).ready(function(){initNavTree('interfacenonlin__polynomials_1_1assignment_07_0A_08.html','');});
+$(document).ready(function(){initNavTree('interfacenonlin__polynomials_1_1assignment_07_0a_08.html','');});
 /* @license-end */
 </script>
 <div id="doc-content">
@@ -89,25 +89,25 @@
 <div class="header">
   <div class="summary">
 <a href="#pri-methods">Private Member Functions</a> &#124;
-<a href="interfacenonlin__polynomials_1_1assignment_07_0A_08-members.html">List of all members</a>  </div>
+<a href="interfacenonlin__polynomials_1_1assignment_07_0a_08-members.html">List of all members</a>  </div>
   <div class="headertitle">
 <div class="title">nonlin_polynomials::assignment(=) Interface Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
 
 <p>Defines polynomial assignment.  
- <a href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#details">More...</a></p>
+ <a href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:aa933c5db5d91ce002ac7bc22af9a10e7"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">poly_equals</a> (x, y)</td></tr>
-<tr class="memdesc:aa933c5db5d91ce002ac7bc22af9a10e7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of one polynomial to another.  <a href="#aa933c5db5d91ce002ac7bc22af9a10e7">More...</a><br /></td></tr>
+<tr class="memitem:aa933c5db5d91ce002ac7bc22af9a10e7"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">poly_equals</a> (x, y)</td></tr>
+<tr class="memdesc:aa933c5db5d91ce002ac7bc22af9a10e7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of one polynomial to another.  <a href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7">More...</a><br /></td></tr>
 <tr class="separator:aa933c5db5d91ce002ac7bc22af9a10e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aece2a1a5690e79ae3868f5f2461028a7"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7">poly_dbl_equals</a> (x, y)</td></tr>
-<tr class="memdesc:aece2a1a5690e79ae3868f5f2461028a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns a number to each coefficient of the polynomial.  <a href="#aece2a1a5690e79ae3868f5f2461028a7">More...</a><br /></td></tr>
+<tr class="memitem:aece2a1a5690e79ae3868f5f2461028a7"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7">poly_dbl_equals</a> (x, y)</td></tr>
+<tr class="memdesc:aece2a1a5690e79ae3868f5f2461028a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns a number to each coefficient of the polynomial.  <a href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7">More...</a><br /></td></tr>
 <tr class="separator:aece2a1a5690e79ae3868f5f2461028a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac530b91d73ec6ea8bf1da5bd86a330d0"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">poly_equals_array</a> (x, y)</td></tr>
-<tr class="memdesc:ac530b91d73ec6ea8bf1da5bd86a330d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of an array as polynomial coefficients.  <a href="#ac530b91d73ec6ea8bf1da5bd86a330d0">More...</a><br /></td></tr>
+<tr class="memitem:ac530b91d73ec6ea8bf1da5bd86a330d0"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">poly_equals_array</a> (x, y)</td></tr>
+<tr class="memdesc:ac530b91d73ec6ea8bf1da5bd86a330d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of an array as polynomial coefficients.  <a href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0">More...</a><br /></td></tr>
 <tr class="separator:ac530b91d73ec6ea8bf1da5bd86a330d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -257,17 +257,17 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac530b91d73ec6ea8bf1da5bd
 </div>
 </div>
 <hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">assignment(=)</a></li>
+    <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">assignment(=)</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.js b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.js
index ad20024..3141d13 100644
--- a/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.js
+++ b/doc/html/interfacenonlin__polynomials_1_1assignment_07_0A_08.js
@@ -1,6 +1,6 @@
-var interfacenonlin__polynomials_1_1assignment_07_0A_08 =
+var interfacenonlin__polynomials_1_1assignment_07_0a_08 =
 [
-    [ "poly_dbl_equals", "interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7", null ],
-    [ "poly_equals", "interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7", null ],
-    [ "poly_equals_array", "interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0", null ]
+    [ "poly_dbl_equals", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7", null ],
+    [ "poly_equals", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7", null ],
+    [ "poly_equals_array", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0", null ]
 ];
\ No newline at end of file
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07-_08-members.html b/doc/html/interfacenonlin__polynomials_1_1operator_07-_08-members.html
index e0ab31d..95d9489 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07-_08-members.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07-_08-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07-_08.html b/doc/html/interfacenonlin__polynomials_1_1operator_07-_08.html
index 0db6ab6..0b03e0e 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07-_08.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07-_08.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials::operator(-) Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,7 +101,7 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
 <tr class="memitem:a6099c1ec4563719acc5fba0f94e35de3"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3">poly_poly_subtract</a> (x, y)</td></tr>
-<tr class="memdesc:a6099c1ec4563719acc5fba0f94e35de3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Subtracts two polynomials.  <a href="#a6099c1ec4563719acc5fba0f94e35de3">More...</a><br /></td></tr>
+<tr class="memdesc:a6099c1ec4563719acc5fba0f94e35de3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Subtracts two polynomials.  <a href="interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3">More...</a><br /></td></tr>
 <tr class="separator:a6099c1ec4563719acc5fba0f94e35de3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -158,7 +158,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6099c1ec4563719acc5fba0f
 </div>
 </div>
 <hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -168,7 +168,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6099c1ec4563719acc5fba0f
     <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html">operator(-)</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08-members.html b/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08-members.html
index 5d1dcbb..c2bda0b 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08-members.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,7 +102,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08.html b/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08.html
index 4c2766e..4216984 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07_09_08.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials::operator(+) Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,7 +101,7 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
 <tr class="memitem:aea07755e91685ec15a37482a3642bbbe"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe">poly_poly_add</a> (x, y)</td></tr>
-<tr class="memdesc:aea07755e91685ec15a37482a3642bbbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two polynomials.  <a href="#aea07755e91685ec15a37482a3642bbbe">More...</a><br /></td></tr>
+<tr class="memdesc:aea07755e91685ec15a37482a3642bbbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two polynomials.  <a href="interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe">More...</a><br /></td></tr>
 <tr class="separator:aea07755e91685ec15a37482a3642bbbe"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -158,7 +158,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aea07755e91685ec15a37482a
 </div>
 </div>
 <hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -168,7 +168,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aea07755e91685ec15a37482a
     <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">operator(+)</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08-members.html b/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08-members.html
index f5ce761..fd4580f 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08-members.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,7 +104,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08.html b/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08.html
index 6833a4e..c579f6d 100644
--- a/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08.html
+++ b/doc/html/interfacenonlin__polynomials_1_1operator_07_5_08.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials::operator(*) Interface Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,13 +101,13 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
 <tr class="memitem:a7ae53843289e39b9c63cf368f2ed7389"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389">poly_poly_mult</a> (x, y)</td></tr>
-<tr class="memdesc:a7ae53843289e39b9c63cf368f2ed7389"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies two polynomials.  <a href="#a7ae53843289e39b9c63cf368f2ed7389">More...</a><br /></td></tr>
+<tr class="memdesc:a7ae53843289e39b9c63cf368f2ed7389"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies two polynomials.  <a href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389">More...</a><br /></td></tr>
 <tr class="separator:a7ae53843289e39b9c63cf368f2ed7389"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a93e4ce5fb2c616a1c6477f6fb8addfac"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac">poly_dbl_mult</a> (x, y)</td></tr>
-<tr class="memdesc:a93e4ce5fb2c616a1c6477f6fb8addfac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="#a93e4ce5fb2c616a1c6477f6fb8addfac">More...</a><br /></td></tr>
+<tr class="memdesc:a93e4ce5fb2c616a1c6477f6fb8addfac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac">More...</a><br /></td></tr>
 <tr class="separator:a93e4ce5fb2c616a1c6477f6fb8addfac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6b49c2080eeab1817c53f2d3a7fb4736"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736">dbl_poly_mult</a> (x, y)</td></tr>
-<tr class="memdesc:a6b49c2080eeab1817c53f2d3a7fb4736"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="#a6b49c2080eeab1817c53f2d3a7fb4736">More...</a><br /></td></tr>
+<tr class="memdesc:a6b49c2080eeab1817c53f2d3a7fb4736"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736">More...</a><br /></td></tr>
 <tr class="separator:a6b49c2080eeab1817c53f2d3a7fb4736"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -260,7 +260,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7ae53843289e39b9c63cf368
 </div>
 </div>
 <hr/>The documentation for this interface was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -270,7 +270,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7ae53843289e39b9c63cf368
     <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/jquery.js b/doc/html/jquery.js
index 2771c74..103c32d 100644
--- a/doc/html/jquery.js
+++ b/doc/html/jquery.js
@@ -1,99 +1,26 @@
-/*
- @licstart  The following is the entire license notice for the
- JavaScript code in this file.
+/*! jQuery v3.4.1 | (c) JS Foundation and other contributors | jquery.org/license */
+!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],E=C.document,r=Object.getPrototypeOf,s=t.slice,g=t.concat,u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.4.1",k=function(e,t){return new k.fn.init(e,t)},p=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;function d(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}k.fn=k.prototype={jquery:f,constructor:k,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=k.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return k.each(this,e)},map:function(n){return this.pushStack(k.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},k.extend=k.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||m(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(k.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||k.isPlainObject(n)?n:{},i=!1,a[t]=k.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},k.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=v.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t){b(e,{nonce:t&&t.nonce})},each:function(e,t){var n,r=0;if(d(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},trim:function(e){return null==e?"":(e+"").replace(p,"")},makeArray:function(e,t){var n=t||[];return null!=e&&(d(Object(e))?k.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(d(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g.apply([],a)},guid:1,support:y}),"function"==typeof Symbol&&(k.fn[Symbol.iterator]=t[Symbol.iterator]),k.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var h=function(n){var e,d,b,o,i,h,f,g,w,u,l,T,C,a,E,v,s,c,y,k="sizzle"+1*new Date,m=n.document,S=0,r=0,p=ue(),x=ue(),N=ue(),A=ue(),D=function(e,t){return e===t&&(l=!0),0},j={}.hasOwnProperty,t=[],q=t.pop,L=t.push,H=t.push,O=t.slice,P=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},R="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",I="(?:\\\\.|[\\w-]|[^\0-\\xa0])+",W="\\["+M+"*("+I+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+I+"))|)"+M+"*\\]",$=":("+I+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+W+")*)|.*)\\)|)",F=new RegExp(M+"+","g"),B=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),_=new RegExp("^"+M+"*,"+M+"*"),z=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp($),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+$),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),ne=function(e,t,n){var r="0x"+t-65536;return r!=r||n?t:r<0?String.fromCharCode(r+65536):String.fromCharCode(r>>10|55296,1023&r|56320)},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(m.childNodes),m.childNodes),t[m.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&((e?e.ownerDocument||e:m)!==C&&T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!A[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&U.test(t)){(s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=k),o=(l=h(t)).length;while(o--)l[o]="#"+s+" "+xe(l[o]);c=l.join(","),f=ee.test(t)&&ye(e.parentNode)||e}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){A(t,!0)}finally{s===k&&e.removeAttribute("id")}}}return g(t.replace(B,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[k]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:m;return r!==C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),m!==C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=k,!C.getElementsByName||!C.getElementsByName(k).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){a.appendChild(e).innerHTML="<a id='"+k+"'></a><select id='"+k+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+k+"-]").length||v.push("~="),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+k+"+*").length||v.push(".#.+[+~]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",$)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)===(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e===C||e.ownerDocument===m&&y(m,e)?-1:t===C||t.ownerDocument===m&&y(m,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e===C?-1:t===C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]===m?-1:s[r]===m?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if((e.ownerDocument||e)!==C&&T(e),d.matchesSelector&&E&&!A[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){A(t,!0)}return 0<se(t,C,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!==C&&T(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!==C&&T(e);var n=b.attrHandle[t.toLowerCase()],r=n&&j.call(b.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:d.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!d.detectDuplicates,u=!d.sortStable&&e.slice(0),e.sort(D),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(b=se.selectors={cacheLength:50,createPseudo:le,match:G,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=p[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&p(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(F," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),x="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=x&&e.nodeName.toLowerCase(),p=!n&&!x,d=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(x?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[k]||(a[k]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===S&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[S,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[k]||(a[k]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===S&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++d&&(p&&((i=(o=a[k]||(a[k]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[S,d]),a===e))break;return(d-=v)===g||d%g==0&&0<=d/g}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[k]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=P(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace(B,"$1"));return s[k]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return V.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===C.activeElement&&(!C.hasFocus||C.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return J.test(e.nodeName)},input:function(e){return Q.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=de(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=he(e);function me(){}function xe(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function be(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,p=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[S,p];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[k]||(e[k]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===S&&r[1]===p)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Te(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Ce(d,h,g,v,y,e){return v&&!v[k]&&(v=Ce(v)),y&&!y[k]&&(y=Ce(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!d||!e&&h?c:Te(c,s,d,n,r),p=g?y||(e?d:l||v)?[]:t:f;if(g&&g(f,p,n,r),v){i=Te(p,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(p[u[o]]=!(f[u[o]]=a))}if(e){if(y||d){if(y){i=[],o=p.length;while(o--)(a=p[o])&&i.push(f[o]=a);y(null,p=[],i,r)}o=p.length;while(o--)(a=p[o])&&-1<(i=y?P(e,a):s[o])&&(e[i]=!(t[i]=a))}}else p=Te(p===t?p.splice(l,p.length):p),y?y(null,t,p,r):H.apply(t,p)})}function Ee(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=be(function(e){return e===i},a,!0),l=be(function(e){return-1<P(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[be(we(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[k]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return Ce(1<s&&we(c),1<s&&xe(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace(B,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&xe(e))}c.push(t)}return we(c)}return me.prototype=b.filters=b.pseudos,b.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=x[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=_.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=z.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(B," ")}),a=a.slice(n.length)),b.filter)!(r=G[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):x(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,x,r,i=[],o=[],a=N[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[k]?i.push(a):o.push(a);(a=N(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=S+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t===C||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument===C||(T(o),n=!E);while(s=v[a++])if(s(o,t||C,n)){r.push(o);break}i&&(S=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=q.call(r));f=Te(f)}H.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(S=h,w=p),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=G.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&xe(o)))return H.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},d.sortStable=k.split("").sort(D).join("")===k,d.detectDuplicates=!!l,T(),d.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(C.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),d.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(R,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(C);k.find=h,k.expr=h.selectors,k.expr[":"]=k.expr.pseudos,k.uniqueSort=k.unique=h.uniqueSort,k.text=h.getText,k.isXMLDoc=h.isXML,k.contains=h.contains,k.escapeSelector=h.escape;var T=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&k(e).is(n))break;r.push(e)}return r},S=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},N=k.expr.match.needsContext;function A(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var D=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?k.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?k.grep(e,function(e){return e===n!==r}):"string"!=typeof n?k.grep(e,function(e){return-1<i.call(n,e)!==r}):k.filter(n,e,r)}k.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?k.find.matchesSelector(r,e)?[r]:[]:k.find.matches(e,k.grep(t,function(e){return 1===e.nodeType}))},k.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(k(e).filter(function(){for(t=0;t<r;t++)if(k.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)k.find(e,i[t],n);return 1<r?k.uniqueSort(n):n},filter:function(e){return this.pushStack(j(this,e||[],!1))},not:function(e){return this.pushStack(j(this,e||[],!0))},is:function(e){return!!j(this,"string"==typeof e&&N.test(e)?k(e):e||[],!1).length}});var q,L=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(k.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||q,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:L.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof k?t[0]:t,k.merge(this,k.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),D.test(r[1])&&k.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(k):k.makeArray(e,this)}).prototype=k.fn,q=k(E);var H=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}k.fn.extend({has:function(e){var t=k(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(k.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&k(e);if(!N.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&k.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?k.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(k(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(k.uniqueSort(k.merge(this.get(),k(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),k.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return T(e,"parentNode")},parentsUntil:function(e,t,n){return T(e,"parentNode",n)},next:function(e){return P(e,"nextSibling")},prev:function(e){return P(e,"previousSibling")},nextAll:function(e){return T(e,"nextSibling")},prevAll:function(e){return T(e,"previousSibling")},nextUntil:function(e,t,n){return T(e,"nextSibling",n)},prevUntil:function(e,t,n){return T(e,"previousSibling",n)},siblings:function(e){return S((e.parentNode||{}).firstChild,e)},children:function(e){return S(e.firstChild)},contents:function(e){return"undefined"!=typeof e.contentDocument?e.contentDocument:(A(e,"template")&&(e=e.content||e),k.merge([],e.childNodes))}},function(r,i){k.fn[r]=function(e,t){var n=k.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=k.filter(t,n)),1<this.length&&(O[r]||k.uniqueSort(n),H.test(r)&&n.reverse()),this.pushStack(n)}});var R=/[^\x20\t\r\n\f]+/g;function M(e){return e}function I(e){throw e}function W(e,t,n,r){var i;try{e&&m(i=e.promise)?i.call(e).done(t).fail(n):e&&m(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}k.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},k.each(e.match(R)||[],function(e,t){n[t]=!0}),n):k.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){k.each(e,function(e,t){m(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==w(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return k.each(arguments,function(e,t){var n;while(-1<(n=k.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<k.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},k.extend({Deferred:function(e){var o=[["notify","progress",k.Callbacks("memory"),k.Callbacks("memory"),2],["resolve","done",k.Callbacks("once memory"),k.Callbacks("once memory"),0,"resolved"],["reject","fail",k.Callbacks("once memory"),k.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return k.Deferred(function(r){k.each(o,function(e,t){var n=m(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&m(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,m(t)?s?t.call(e,l(u,o,M,s),l(u,o,I,s)):(u++,t.call(e,l(u,o,M,s),l(u,o,I,s),l(u,o,M,o.notifyWith))):(a!==M&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){k.Deferred.exceptionHook&&k.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==I&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(k.Deferred.getStackHook&&(t.stackTrace=k.Deferred.getStackHook()),C.setTimeout(t))}}return k.Deferred(function(e){o[0][3].add(l(0,e,m(r)?r:M,e.notifyWith)),o[1][3].add(l(0,e,m(t)?t:M)),o[2][3].add(l(0,e,m(n)?n:I))}).promise()},promise:function(e){return null!=e?k.extend(e,a):a}},s={};return k.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=k.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(W(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||m(i[t]&&i[t].then)))return o.then();while(t--)W(i[t],a(t),o.reject);return o.promise()}});var $=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;k.Deferred.exceptionHook=function(e,t){C.console&&C.console.warn&&e&&$.test(e.name)&&C.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},k.readyException=function(e){C.setTimeout(function(){throw e})};var F=k.Deferred();function B(){E.removeEventListener("DOMContentLoaded",B),C.removeEventListener("load",B),k.ready()}k.fn.ready=function(e){return F.then(e)["catch"](function(e){k.readyException(e)}),this},k.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--k.readyWait:k.isReady)||(k.isReady=!0)!==e&&0<--k.readyWait||F.resolveWith(E,[k])}}),k.ready.then=F.then,"complete"===E.readyState||"loading"!==E.readyState&&!E.documentElement.doScroll?C.setTimeout(k.ready):(E.addEventListener("DOMContentLoaded",B),C.addEventListener("load",B));var _=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===w(n))for(s in i=!0,n)_(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,m(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(k(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},z=/^-ms-/,U=/-([a-z])/g;function X(e,t){return t.toUpperCase()}function V(e){return e.replace(z,"ms-").replace(U,X)}var G=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function Y(){this.expando=k.expando+Y.uid++}Y.uid=1,Y.prototype={cache:function(e){var t=e[this.expando];return t||(t={},G(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[V(t)]=n;else for(r in t)i[V(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][V(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(V):(t=V(t))in r?[t]:t.match(R)||[]).length;while(n--)delete r[t[n]]}(void 0===t||k.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!k.isEmptyObject(t)}};var Q=new Y,J=new Y,K=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,Z=/[A-Z]/g;function ee(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(Z,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:K.test(i)?JSON.parse(i):i)}catch(e){}J.set(e,t,n)}else n=void 0;return n}k.extend({hasData:function(e){return J.hasData(e)||Q.hasData(e)},data:function(e,t,n){return J.access(e,t,n)},removeData:function(e,t){J.remove(e,t)},_data:function(e,t,n){return Q.access(e,t,n)},_removeData:function(e,t){Q.remove(e,t)}}),k.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=J.get(o),1===o.nodeType&&!Q.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=V(r.slice(5)),ee(o,r,i[r]));Q.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){J.set(this,n)}):_(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=J.get(o,n))?t:void 0!==(t=ee(o,n))?t:void 0;this.each(function(){J.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){J.remove(this,e)})}}),k.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Q.get(e,t),n&&(!r||Array.isArray(n)?r=Q.access(e,t,k.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=k.queue(e,t),r=n.length,i=n.shift(),o=k._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){k.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Q.get(e,n)||Q.access(e,n,{empty:k.Callbacks("once memory").add(function(){Q.remove(e,[t+"queue",n])})})}}),k.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?k.queue(this[0],t):void 0===n?this:this.each(function(){var e=k.queue(this,t,n);k._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&k.dequeue(this,t)})},dequeue:function(e){return this.each(function(){k.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=k.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Q.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var te=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,ne=new RegExp("^(?:([+-])=|)("+te+")([a-z%]*)$","i"),re=["Top","Right","Bottom","Left"],ie=E.documentElement,oe=function(e){return k.contains(e.ownerDocument,e)},ae={composed:!0};ie.getRootNode&&(oe=function(e){return k.contains(e.ownerDocument,e)||e.getRootNode(ae)===e.ownerDocument});var se=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&oe(e)&&"none"===k.css(e,"display")},ue=function(e,t,n,r){var i,o,a={};for(o in t)a[o]=e.style[o],e.style[o]=t[o];for(o in i=n.apply(e,r||[]),t)e.style[o]=a[o];return i};function le(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return k.css(e,t,"")},u=s(),l=n&&n[3]||(k.cssNumber[t]?"":"px"),c=e.nodeType&&(k.cssNumber[t]||"px"!==l&&+u)&&ne.exec(k.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)k.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,k.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ce={};function fe(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Q.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&se(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ce[s])||(o=a.body.appendChild(a.createElement(s)),u=k.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ce[s]=u)))):"none"!==n&&(l[c]="none",Q.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}k.fn.extend({show:function(){return fe(this,!0)},hide:function(){return fe(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){se(this)?k(this).show():k(this).hide()})}});var pe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i,ge={option:[1,"<select multiple='multiple'>","</select>"],thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?k.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n<r;n++)Q.set(e[n],"globalEval",!t||Q.get(t[n],"globalEval"))}ge.optgroup=ge.option,ge.tbody=ge.tfoot=ge.colgroup=ge.caption=ge.thead,ge.th=ge.td;var me,xe,be=/<|&#?\w+;/;function we(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===w(o))k.merge(p,o.nodeType?[o]:o);else if(be.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=ge[s]||ge._default,a.innerHTML=u[1]+k.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;k.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<k.inArray(o,r))i&&i.push(o);else if(l=oe(o),a=ve(f.appendChild(o),"script"),l&&ye(a),n){c=0;while(o=a[c++])he.test(o.type||"")&&n.push(o)}return f}me=E.createDocumentFragment().appendChild(E.createElement("div")),(xe=E.createElement("input")).setAttribute("type","radio"),xe.setAttribute("checked","checked"),xe.setAttribute("name","t"),me.appendChild(xe),y.checkClone=me.cloneNode(!0).cloneNode(!0).lastChild.checked,me.innerHTML="<textarea>x</textarea>",y.noCloneChecked=!!me.cloneNode(!0).lastChild.defaultValue;var Te=/^key/,Ce=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Ee=/^([^.]*)(?:\.(.+)|)/;function ke(){return!0}function Se(){return!1}function Ne(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ae(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ae(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Se;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return k().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=k.guid++)),e.each(function(){k.event.add(this,t,i,r,n)})}function De(e,i,o){o?(Q.set(e,i,!1),k.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Q.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(k.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Q.set(this,i,r),t=o(this,i),this[i](),r!==(n=Q.get(this,i))||t?Q.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Q.set(this,i,{value:k.event.trigger(k.extend(r[0],k.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Q.get(e,i)&&k.event.add(e,i,ke)}k.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.get(t);if(v){n.handler&&(n=(o=n).handler,i=o.selector),i&&k.find.matchesSelector(ie,i),n.guid||(n.guid=k.guid++),(u=v.events)||(u=v.events={}),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof k&&k.event.triggered!==e.type?k.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(R)||[""]).length;while(l--)d=g=(s=Ee.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=k.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=k.event.special[d]||{},c=k.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&k.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),k.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.hasData(e)&&Q.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(R)||[""]).length;while(l--)if(d=g=(s=Ee.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=k.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||k.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)k.event.remove(e,d+t[l],n,r,!0);k.isEmptyObject(u)&&Q.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=k.event.fix(e),u=new Array(arguments.length),l=(Q.get(this,"events")||{})[s.type]||[],c=k.event.special[s.type]||{};for(u[0]=s,t=1;t<arguments.length;t++)u[t]=arguments[t];if(s.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,s)){a=k.event.handlers.call(this,s,l),t=0;while((i=a[t++])&&!s.isPropagationStopped()){s.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!s.isImmediatePropagationStopped())s.rnamespace&&!1!==o.namespace&&!s.rnamespace.test(o.namespace)||(s.handleObj=o,s.data=o.data,void 0!==(r=((k.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,u))&&!1===(s.result=r)&&(s.preventDefault(),s.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,s),s.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<k(i,this).index(l):k.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(k.Event.prototype,t,{enumerable:!0,configurable:!0,get:m(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[k.expando]?e:new k.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&De(t,"click",ke),!1},trigger:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&De(t,"click"),!0},_default:function(e){var t=e.target;return pe.test(t.type)&&t.click&&A(t,"input")&&Q.get(t,"click")||A(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},k.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},k.Event=function(e,t){if(!(this instanceof k.Event))return new k.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?ke:Se,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&k.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[k.expando]=!0},k.Event.prototype={constructor:k.Event,isDefaultPrevented:Se,isPropagationStopped:Se,isImmediatePropagationStopped:Se,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=ke,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=ke,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=ke,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},k.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:function(e){var t=e.button;return null==e.which&&Te.test(e.type)?null!=e.charCode?e.charCode:e.keyCode:!e.which&&void 0!==t&&Ce.test(e.type)?1&t?1:2&t?3:4&t?2:0:e.which}},k.event.addProp),k.each({focus:"focusin",blur:"focusout"},function(e,t){k.event.special[e]={setup:function(){return De(this,e,Ne),!1},trigger:function(){return De(this,e),!0},delegateType:t}}),k.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){k.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||k.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),k.fn.extend({on:function(e,t,n,r){return Ae(this,e,t,n,r)},one:function(e,t,n,r){return Ae(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,k(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=Se),this.each(function(){k.event.remove(this,e,n,t)})}});var je=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([a-z][^\/\0>\x20\t\r\n\f]*)[^>]*)\/>/gi,qe=/<script|<style|<link/i,Le=/checked\s*(?:[^=]|=\s*.checked.)/i,He=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;function Oe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&k(e).children("tbody")[0]||e}function Pe(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Re(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Me(e,t){var n,r,i,o,a,s,u,l;if(1===t.nodeType){if(Q.hasData(e)&&(o=Q.access(e),a=Q.set(t,o),l=o.events))for(i in delete a.handle,a.events={},l)for(n=0,r=l[i].length;n<r;n++)k.event.add(t,i,l[i][n]);J.hasData(e)&&(s=J.access(e),u=k.extend({},s),J.set(t,u))}}function Ie(n,r,i,o){r=g.apply([],r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=m(d);if(h||1<f&&"string"==typeof d&&!y.checkClone&&Le.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),Ie(t,r,i,o)});if(f&&(t=(e=we(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=k.map(ve(e,"script"),Pe)).length;c<f;c++)u=e,c!==p&&(u=k.clone(u,!0,!0),s&&k.merge(a,ve(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,k.map(a,Re),c=0;c<s;c++)u=a[c],he.test(u.type||"")&&!Q.access(u,"globalEval")&&k.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?k._evalUrl&&!u.noModule&&k._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")}):b(u.textContent.replace(He,""),u,l))}return n}function We(e,t,n){for(var r,i=t?k.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||k.cleanData(ve(r)),r.parentNode&&(n&&oe(r)&&ye(ve(r,"script")),r.parentNode.removeChild(r));return e}k.extend({htmlPrefilter:function(e){return e.replace(je,"<$1></$2>")},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=oe(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||k.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&pe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ve(e),a=a||ve(c),r=0,i=o.length;r<i;r++)Me(o[r],a[r]);else Me(e,c);return 0<(a=ve(c,"script")).length&&ye(a,!f&&ve(e,"script")),c},cleanData:function(e){for(var t,n,r,i=k.event.special,o=0;void 0!==(n=e[o]);o++)if(G(n)){if(t=n[Q.expando]){if(t.events)for(r in t.events)i[r]?k.event.remove(n,r):k.removeEvent(n,r,t.handle);n[Q.expando]=void 0}n[J.expando]&&(n[J.expando]=void 0)}}}),k.fn.extend({detach:function(e){return We(this,e,!0)},remove:function(e){return We(this,e)},text:function(e){return _(this,function(e){return void 0===e?k.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return Ie(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||Oe(this,e).appendChild(e)})},prepend:function(){return Ie(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=Oe(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return Ie(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return Ie(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(k.cleanData(ve(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return k.clone(this,e,t)})},html:function(e){return _(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!qe.test(e)&&!ge[(de.exec(e)||["",""])[1].toLowerCase()]){e=k.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(k.cleanData(ve(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return Ie(this,arguments,function(e){var t=this.parentNode;k.inArray(this,n)<0&&(k.cleanData(ve(this)),t&&t.replaceChild(e,this))},n)}}),k.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){k.fn[e]=function(e){for(var t,n=[],r=k(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),k(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var $e=new RegExp("^("+te+")(?!px)[a-z%]+$","i"),Fe=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=C),t.getComputedStyle(e)},Be=new RegExp(re.join("|"),"i");function _e(e,t,n){var r,i,o,a,s=e.style;return(n=n||Fe(e))&&(""!==(a=n.getPropertyValue(t)||n[t])||oe(e)||(a=k.style(e,t)),!y.pixelBoxStyles()&&$e.test(a)&&Be.test(t)&&(r=s.width,i=s.minWidth,o=s.maxWidth,s.minWidth=s.maxWidth=s.width=a,a=n.width,s.width=r,s.minWidth=i,s.maxWidth=o)),void 0!==a?a+"":a}function ze(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(u){s.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",u.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",ie.appendChild(s).appendChild(u);var e=C.getComputedStyle(u);n="1%"!==e.top,a=12===t(e.marginLeft),u.style.right="60%",o=36===t(e.right),r=36===t(e.width),u.style.position="absolute",i=12===t(u.offsetWidth/3),ie.removeChild(s),u=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s=E.createElement("div"),u=E.createElement("div");u.style&&(u.style.backgroundClip="content-box",u.cloneNode(!0).style.backgroundClip="",y.clearCloneStyle="content-box"===u.style.backgroundClip,k.extend(y,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),a},scrollboxSize:function(){return e(),i}}))}();var Ue=["Webkit","Moz","ms"],Xe=E.createElement("div").style,Ve={};function Ge(e){var t=k.cssProps[e]||Ve[e];return t||(e in Xe?e:Ve[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=Ue.length;while(n--)if((e=Ue[n]+t)in Xe)return e}(e)||e)}var Ye=/^(none|table(?!-c[ea]).+)/,Qe=/^--/,Je={position:"absolute",visibility:"hidden",display:"block"},Ke={letterSpacing:"0",fontWeight:"400"};function Ze(e,t,n){var r=ne.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function et(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=k.css(e,n+re[a],!0,i)),r?("content"===n&&(u-=k.css(e,"padding"+re[a],!0,i)),"margin"!==n&&(u-=k.css(e,"border"+re[a]+"Width",!0,i))):(u+=k.css(e,"padding"+re[a],!0,i),"padding"!==n?u+=k.css(e,"border"+re[a]+"Width",!0,i):s+=k.css(e,"border"+re[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function tt(e,t,n){var r=Fe(e),i=(!y.boxSizingReliable()||n)&&"border-box"===k.css(e,"boxSizing",!1,r),o=i,a=_e(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if($e.test(a)){if(!n)return a;a="auto"}return(!y.boxSizingReliable()&&i||"auto"===a||!parseFloat(a)&&"inline"===k.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===k.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+et(e,t,n||(i?"border":"content"),o,r,a)+"px"}function nt(e,t,n,r,i){return new nt.prototype.init(e,t,n,r,i)}k.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=_e(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=V(t),u=Qe.test(t),l=e.style;if(u||(t=Ge(s)),a=k.cssHooks[t]||k.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=ne.exec(n))&&i[1]&&(n=le(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(k.cssNumber[s]?"":"px")),y.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=V(t);return Qe.test(t)||(t=Ge(s)),(a=k.cssHooks[t]||k.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=_e(e,t,r)),"normal"===i&&t in Ke&&(i=Ke[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),k.each(["height","width"],function(e,u){k.cssHooks[u]={get:function(e,t,n){if(t)return!Ye.test(k.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?tt(e,u,n):ue(e,Je,function(){return tt(e,u,n)})},set:function(e,t,n){var r,i=Fe(e),o=!y.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===k.css(e,"boxSizing",!1,i),s=n?et(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-et(e,u,"border",!1,i)-.5)),s&&(r=ne.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=k.css(e,u)),Ze(0,t,s)}}}),k.cssHooks.marginLeft=ze(y.reliableMarginLeft,function(e,t){if(t)return(parseFloat(_e(e,"marginLeft"))||e.getBoundingClientRect().left-ue(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),k.each({margin:"",padding:"",border:"Width"},function(i,o){k.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+re[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(k.cssHooks[i+o].set=Ze)}),k.fn.extend({css:function(e,t){return _(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Fe(e),i=t.length;a<i;a++)o[t[a]]=k.css(e,t[a],!1,r);return o}return void 0!==n?k.style(e,t,n):k.css(e,t)},e,t,1<arguments.length)}}),((k.Tween=nt).prototype={constructor:nt,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||k.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(k.cssNumber[n]?"":"px")},cur:function(){var e=nt.propHooks[this.prop];return e&&e.get?e.get(this):nt.propHooks._default.get(this)},run:function(e){var t,n=nt.propHooks[this.prop];return this.options.duration?this.pos=t=k.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):nt.propHooks._default.set(this),this}}).init.prototype=nt.prototype,(nt.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=k.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){k.fx.step[e.prop]?k.fx.step[e.prop](e):1!==e.elem.nodeType||!k.cssHooks[e.prop]&&null==e.elem.style[Ge(e.prop)]?e.elem[e.prop]=e.now:k.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=nt.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},k.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},k.fx=nt.prototype.init,k.fx.step={};var rt,it,ot,at,st=/^(?:toggle|show|hide)$/,ut=/queueHooks$/;function lt(){it&&(!1===E.hidden&&C.requestAnimationFrame?C.requestAnimationFrame(lt):C.setTimeout(lt,k.fx.interval),k.fx.tick())}function ct(){return C.setTimeout(function(){rt=void 0}),rt=Date.now()}function ft(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=re[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function pt(e,t,n){for(var r,i=(dt.tweeners[t]||[]).concat(dt.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function dt(o,e,t){var n,a,r=0,i=dt.prefilters.length,s=k.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=rt||ct(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:k.extend({},e),opts:k.extend(!0,{specialEasing:{},easing:k.easing._default},t),originalProperties:e,originalOptions:t,startTime:rt||ct(),duration:t.duration,tweens:[],createTween:function(e,t){var n=k.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=V(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=k.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=dt.prefilters[r].call(l,o,c,l.opts))return m(n.stop)&&(k._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return k.map(c,pt,l),m(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),k.fx.timer(k.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}k.Animation=k.extend(dt,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return le(n.elem,e,ne.exec(t),n),n}]},tweener:function(e,t){m(e)?(t=e,e=["*"]):e=e.match(R);for(var n,r=0,i=e.length;r<i;r++)n=e[r],dt.tweeners[n]=dt.tweeners[n]||[],dt.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&se(e),v=Q.get(e,"fxshow");for(r in n.queue||(null==(a=k._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,k.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],st.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||k.style(e,r)}if((u=!k.isEmptyObject(t))||!k.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=Q.get(e,"display")),"none"===(c=k.css(e,"display"))&&(l?c=l:(fe([e],!0),l=e.style.display||l,c=k.css(e,"display"),fe([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===k.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=Q.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&fe([e],!0),p.done(function(){for(r in g||fe([e]),Q.remove(e,"fxshow"),d)k.style(e,r,d[r])})),u=pt(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?dt.prefilters.unshift(e):dt.prefilters.push(e)}}),k.speed=function(e,t,n){var r=e&&"object"==typeof e?k.extend({},e):{complete:n||!n&&t||m(e)&&e,duration:e,easing:n&&t||t&&!m(t)&&t};return k.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in k.fx.speeds?r.duration=k.fx.speeds[r.duration]:r.duration=k.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){m(r.old)&&r.old.call(this),r.queue&&k.dequeue(this,r.queue)},r},k.fn.extend({fadeTo:function(e,t,n,r){return this.filter(se).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=k.isEmptyObject(t),o=k.speed(e,n,r),a=function(){var e=dt(this,k.extend({},t),o);(i||Q.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&!1!==i&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=k.timers,r=Q.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&ut.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||k.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=Q.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=k.timers,o=n?n.length:0;for(t.finish=!0,k.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),k.each(["toggle","show","hide"],function(e,r){var i=k.fn[r];k.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(ft(r,!0),e,t,n)}}),k.each({slideDown:ft("show"),slideUp:ft("hide"),slideToggle:ft("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){k.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),k.timers=[],k.fx.tick=function(){var e,t=0,n=k.timers;for(rt=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||k.fx.stop(),rt=void 0},k.fx.timer=function(e){k.timers.push(e),k.fx.start()},k.fx.interval=13,k.fx.start=function(){it||(it=!0,lt())},k.fx.stop=function(){it=null},k.fx.speeds={slow:600,fast:200,_default:400},k.fn.delay=function(r,e){return r=k.fx&&k.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=C.setTimeout(e,r);t.stop=function(){C.clearTimeout(n)}})},ot=E.createElement("input"),at=E.createElement("select").appendChild(E.createElement("option")),ot.type="checkbox",y.checkOn=""!==ot.value,y.optSelected=at.selected,(ot=E.createElement("input")).value="t",ot.type="radio",y.radioValue="t"===ot.value;var ht,gt=k.expr.attrHandle;k.fn.extend({attr:function(e,t){return _(this,k.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){k.removeAttr(this,e)})}}),k.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?k.prop(e,t,n):(1===o&&k.isXMLDoc(e)||(i=k.attrHooks[t.toLowerCase()]||(k.expr.match.bool.test(t)?ht:void 0)),void 0!==n?null===n?void k.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=k.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!y.radioValue&&"radio"===t&&A(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(R);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),ht={set:function(e,t,n){return!1===t?k.removeAttr(e,n):e.setAttribute(n,n),n}},k.each(k.expr.match.bool.source.match(/\w+/g),function(e,t){var a=gt[t]||k.find.attr;gt[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=gt[o],gt[o]=r,r=null!=a(e,t,n)?o:null,gt[o]=i),r}});var vt=/^(?:input|select|textarea|button)$/i,yt=/^(?:a|area)$/i;function mt(e){return(e.match(R)||[]).join(" ")}function xt(e){return e.getAttribute&&e.getAttribute("class")||""}function bt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(R)||[]}k.fn.extend({prop:function(e,t){return _(this,k.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[k.propFix[e]||e]})}}),k.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&k.isXMLDoc(e)||(t=k.propFix[t]||t,i=k.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=k.find.attr(e,"tabindex");return t?parseInt(t,10):vt.test(e.nodeName)||yt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),y.optSelected||(k.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),k.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){k.propFix[this.toLowerCase()]=this}),k.fn.extend({addClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){k(this).addClass(t.call(this,e,xt(this)))});if((e=bt(t)).length)while(n=this[u++])if(i=xt(n),r=1===n.nodeType&&" "+mt(i)+" "){a=0;while(o=e[a++])r.indexOf(" "+o+" ")<0&&(r+=o+" ");i!==(s=mt(r))&&n.setAttribute("class",s)}return this},removeClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){k(this).removeClass(t.call(this,e,xt(this)))});if(!arguments.length)return this.attr("class","");if((e=bt(t)).length)while(n=this[u++])if(i=xt(n),r=1===n.nodeType&&" "+mt(i)+" "){a=0;while(o=e[a++])while(-1<r.indexOf(" "+o+" "))r=r.replace(" "+o+" "," ");i!==(s=mt(r))&&n.setAttribute("class",s)}return this},toggleClass:function(i,t){var o=typeof i,a="string"===o||Array.isArray(i);return"boolean"==typeof t&&a?t?this.addClass(i):this.removeClass(i):m(i)?this.each(function(e){k(this).toggleClass(i.call(this,e,xt(this),t),t)}):this.each(function(){var e,t,n,r;if(a){t=0,n=k(this),r=bt(i);while(e=r[t++])n.hasClass(e)?n.removeClass(e):n.addClass(e)}else void 0!==i&&"boolean"!==o||((e=xt(this))&&Q.set(this,"__className__",e),this.setAttribute&&this.setAttribute("class",e||!1===i?"":Q.get(this,"__className__")||""))})},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+mt(xt(n))+" ").indexOf(t))return!0;return!1}});var wt=/\r/g;k.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=m(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,k(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=k.map(t,function(e){return null==e?"":e+""})),(r=k.valHooks[this.type]||k.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=k.valHooks[t.type]||k.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(wt,""):null==e?"":e:void 0}}),k.extend({valHooks:{option:{get:function(e){var t=k.find.attr(e,"value");return null!=t?t:mt(k.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!A(n.parentNode,"optgroup"))){if(t=k(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=k.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<k.inArray(k.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),k.each(["radio","checkbox"],function(){k.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<k.inArray(k(e).val(),t)}},y.checkOn||(k.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),y.focusin="onfocusin"in C;var Tt=/^(?:focusinfocus|focusoutblur)$/,Ct=function(e){e.stopPropagation()};k.extend(k.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||E],d=v.call(e,"type")?e.type:e,h=v.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||E,3!==n.nodeType&&8!==n.nodeType&&!Tt.test(d+k.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[k.expando]?e:new k.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:k.makeArray(t,[e]),c=k.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||d,Tt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||E)&&p.push(a.defaultView||a.parentWindow||C)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(Q.get(o,"events")||{})[e.type]&&Q.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&G(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!G(n)||u&&m(n[d])&&!x(n)&&((a=n[u])&&(n[u]=null),k.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,Ct),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,Ct),k.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=k.extend(new k.Event,n,{type:e,isSimulated:!0});k.event.trigger(r,null,t)}}),k.fn.extend({trigger:function(e,t){return this.each(function(){k.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return k.event.trigger(e,t,n,!0)}}),y.focusin||k.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){k.event.simulate(r,e.target,k.event.fix(e))};k.event.special[r]={setup:function(){var e=this.ownerDocument||this,t=Q.access(e,r);t||e.addEventListener(n,i,!0),Q.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this,t=Q.access(e,r)-1;t?Q.access(e,r,t):(e.removeEventListener(n,i,!0),Q.remove(e,r))}}});var Et=C.location,kt=Date.now(),St=/\?/;k.parseXML=function(e){var t;if(!e||"string"!=typeof e)return null;try{t=(new C.DOMParser).parseFromString(e,"text/xml")}catch(e){t=void 0}return t&&!t.getElementsByTagName("parsererror").length||k.error("Invalid XML: "+e),t};var Nt=/\[\]$/,At=/\r?\n/g,Dt=/^(?:submit|button|image|reset|file)$/i,jt=/^(?:input|select|textarea|keygen)/i;function qt(n,e,r,i){var t;if(Array.isArray(e))k.each(e,function(e,t){r||Nt.test(n)?i(n,t):qt(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==w(e))i(n,e);else for(t in e)qt(n+"["+t+"]",e[t],r,i)}k.param=function(e,t){var n,r=[],i=function(e,t){var n=m(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!k.isPlainObject(e))k.each(e,function(){i(this.name,this.value)});else for(n in e)qt(n,e[n],t,i);return r.join("&")},k.fn.extend({serialize:function(){return k.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=k.prop(this,"elements");return e?k.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!k(this).is(":disabled")&&jt.test(this.nodeName)&&!Dt.test(e)&&(this.checked||!pe.test(e))}).map(function(e,t){var n=k(this).val();return null==n?null:Array.isArray(n)?k.map(n,function(e){return{name:t.name,value:e.replace(At,"\r\n")}}):{name:t.name,value:n.replace(At,"\r\n")}}).get()}});var Lt=/%20/g,Ht=/#.*$/,Ot=/([?&])_=[^&]*/,Pt=/^(.*?):[ \t]*([^\r\n]*)$/gm,Rt=/^(?:GET|HEAD)$/,Mt=/^\/\//,It={},Wt={},$t="*/".concat("*"),Ft=E.createElement("a");function Bt(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(R)||[];if(m(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function _t(t,i,o,a){var s={},u=t===Wt;function l(e){var r;return s[e]=!0,k.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function zt(e,t){var n,r,i=k.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&k.extend(!0,e,r),e}Ft.href=Et.href,k.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:Et.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(Et.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":$t,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":k.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?zt(zt(e,k.ajaxSettings),t):zt(k.ajaxSettings,e)},ajaxPrefilter:Bt(It),ajaxTransport:Bt(Wt),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=k.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?k(y):k.event,x=k.Deferred(),b=k.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=Pt.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||Et.href)+"").replace(Mt,Et.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(R)||[""],null==v.crossDomain){r=E.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Ft.protocol+"//"+Ft.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=k.param(v.data,v.traditional)),_t(It,v,t,T),h)return T;for(i in(g=k.event&&v.global)&&0==k.active++&&k.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Rt.test(v.type),f=v.url.replace(Ht,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(Lt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(St.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(Ot,"$1"),o=(St.test(f)?"&":"?")+"_="+kt+++o),v.url=f+o),v.ifModified&&(k.lastModified[f]&&T.setRequestHeader("If-Modified-Since",k.lastModified[f]),k.etag[f]&&T.setRequestHeader("If-None-Match",k.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+$t+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=_t(Wt,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=C.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&C.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(k.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(k.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--k.active||k.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return k.get(e,t,n,"json")},getScript:function(e,t){return k.get(e,void 0,t,"script")}}),k.each(["get","post"],function(e,i){k[i]=function(e,t,n,r){return m(t)&&(r=r||n,n=t,t=void 0),k.ajax(k.extend({url:e,type:i,dataType:r,data:t,success:n},k.isPlainObject(e)&&e))}}),k._evalUrl=function(e,t){return k.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){k.globalEval(e,t)}})},k.fn.extend({wrapAll:function(e){var t;return this[0]&&(m(e)&&(e=e.call(this[0])),t=k(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return m(n)?this.each(function(e){k(this).wrapInner(n.call(this,e))}):this.each(function(){var e=k(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=m(t);return this.each(function(e){k(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){k(this).replaceWith(this.childNodes)}),this}}),k.expr.pseudos.hidden=function(e){return!k.expr.pseudos.visible(e)},k.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},k.ajaxSettings.xhr=function(){try{return new C.XMLHttpRequest}catch(e){}};var Ut={0:200,1223:204},Xt=k.ajaxSettings.xhr();y.cors=!!Xt&&"withCredentials"in Xt,y.ajax=Xt=!!Xt,k.ajaxTransport(function(i){var o,a;if(y.cors||Xt&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(Ut[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&C.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),k.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),k.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return k.globalEval(e),e}}}),k.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),k.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=k("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Vt,Gt=[],Yt=/(=)\?(?=&|$)|\?\?/;k.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Gt.pop()||k.expando+"_"+kt++;return this[e]=!0,e}}),k.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Yt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Yt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Yt,"$1"+r):!1!==e.jsonp&&(e.url+=(St.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||k.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?k(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Gt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Vt=E.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===Vt.childNodes.length),k.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=D.exec(e))?[t.createElement(i[1])]:(i=we([e],t,o),o&&o.length&&k(o).remove(),k.merge([],i.childNodes)));var r,i,o},k.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=mt(e.slice(s)),e=e.slice(0,s)),m(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&k.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?k("<div>").append(k.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},k.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){k.fn[t]=function(e){return this.on(t,e)}}),k.expr.pseudos.animated=function(t){return k.grep(k.timers,function(e){return t===e.elem}).length},k.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=k.css(e,"position"),c=k(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=k.css(e,"top"),u=k.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,k.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},k.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){k.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===k.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===k.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=k(e).offset()).top+=k.css(e,"borderTopWidth",!0),i.left+=k.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-k.css(r,"marginTop",!0),left:t.left-i.left-k.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===k.css(e,"position"))e=e.offsetParent;return e||ie})}}),k.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;k.fn[t]=function(e){return _(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),k.each(["top","left"],function(e,n){k.cssHooks[n]=ze(y.pixelPosition,function(e,t){if(t)return t=_e(e,n),$e.test(t)?k(e).position()[n]+"px":t})}),k.each({Height:"height",Width:"width"},function(a,s){k.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){k.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return _(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?k.css(e,t,i):k.style(e,t,n,i)},s,n?e:void 0,n)}})}),k.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){k.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}}),k.fn.extend({hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),k.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)}}),k.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),m(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||k.guid++,i},k.holdReady=function(e){e?k.readyWait++:k.ready(!0)},k.isArray=Array.isArray,k.parseJSON=JSON.parse,k.nodeName=A,k.isFunction=m,k.isWindow=x,k.camelCase=V,k.type=w,k.now=Date.now,k.isNumeric=function(e){var t=k.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},"function"==typeof define&&define.amd&&define("jquery",[],function(){return k});var Qt=C.jQuery,Jt=C.$;return k.noConflict=function(e){return C.$===k&&(C.$=Jt),e&&C.jQuery===k&&(C.jQuery=Qt),k},e||(C.jQuery=C.$=k),k});
+/*! jQuery UI - v1.12.1 - 2019-01-27
+* http://jqueryui.com
+* Includes: widget.js, position.js, data.js, disable-selection.js, focusable.js, form-reset-mixin.js, jquery-1-7.js, keycode.js, labels.js, scroll-parent.js, tabbable.js, unique-id.js, widgets/resizable.js, widgets/mouse.js
+* Copyright jQuery Foundation and other contributors; Licensed MIT */
 
- Copyright (C) 1997-2017 by Dimitri van Heesch
-
- Permission is hereby granted, free of charge, to any person obtaining
- a copy of this software and associated documentation files (the
- "Software"), to deal in the Software without restriction, including
- without limitation the rights to use, copy, modify, merge, publish,
- distribute, sublicense, and/or sell copies of the Software, and to
- permit persons to whom the Software is furnished to do so, subject to
- the following conditions:
-
- The above copyright notice and this permission notice shall be included
- in all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
- IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
- CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
- TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
- SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
- @licend  The above is the entire license notice
- for the JavaScript code in this file
- */
-/*!
- * jQuery JavaScript Library v1.7.1
- * http://jquery.com/
- *
- * Copyright 2011, John Resig
- * Dual licensed under the MIT or GPL Version 2 licenses.
- * http://jquery.org/license
- *
- * Includes Sizzle.js
- * http://sizzlejs.com/
- * Copyright 2011, The Dojo Foundation
- * Released under the MIT, BSD, and GPL Licenses.
- *
- * Date: Mon Nov 21 21:11:03 2011 -0500
- */
-(function(bb,L){var av=bb.document,bu=bb.navigator,bl=bb.location;var b=(function(){var bF=function(b0,b1){return new bF.fn.init(b0,b1,bD)},bU=bb.jQuery,bH=bb.$,bD,bY=/^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/,bM=/\S/,bI=/^\s+/,bE=/\s+$/,bA=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,bN=/^[\],:{}\s]*$/,bW=/\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,bP=/"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,bJ=/(?:^|:|,)(?:\s*\[)+/g,by=/(webkit)[ \/]([\w.]+)/,bR=/(opera)(?:.*version)?[ \/]([\w.]+)/,bQ=/(msie) ([\w.]+)/,bS=/(mozilla)(?:.*? rv:([\w.]+))?/,bB=/-([a-z]|[0-9])/ig,bZ=/^-ms-/,bT=function(b0,b1){return(b1+"").toUpperCase()},bX=bu.userAgent,bV,bC,e,bL=Object.prototype.toString,bG=Object.prototype.hasOwnProperty,bz=Array.prototype.push,bK=Array.prototype.slice,bO=String.prototype.trim,bv=Array.prototype.indexOf,bx={};bF.fn=bF.prototype={constructor:bF,init:function(b0,b4,b3){var b2,b5,b1,b6;if(!b0){return this}if(b0.nodeType){this.context=this[0]=b0;this.length=1;return this}if(b0==="body"&&!b4&&av.body){this.context=av;this[0]=av.body;this.selector=b0;this.length=1;return this}if(typeof b0==="string"){if(b0.charAt(0)==="<"&&b0.charAt(b0.length-1)===">"&&b0.length>=3){b2=[null,b0,null]}else{b2=bY.exec(b0)}if(b2&&(b2[1]||!b4)){if(b2[1]){b4=b4 instanceof bF?b4[0]:b4;b6=(b4?b4.ownerDocument||b4:av);b1=bA.exec(b0);if(b1){if(bF.isPlainObject(b4)){b0=[av.createElement(b1[1])];bF.fn.attr.call(b0,b4,true)}else{b0=[b6.createElement(b1[1])]}}else{b1=bF.buildFragment([b2[1]],[b6]);b0=(b1.cacheable?bF.clone(b1.fragment):b1.fragment).childNodes}return bF.merge(this,b0)}else{b5=av.getElementById(b2[2]);if(b5&&b5.parentNode){if(b5.id!==b2[2]){return b3.find(b0)}this.length=1;this[0]=b5}this.context=av;this.selector=b0;return this}}else{if(!b4||b4.jquery){return(b4||b3).find(b0)}else{return this.constructor(b4).find(b0)}}}else{if(bF.isFunction(b0)){return b3.ready(b0)}}if(b0.selector!==L){this.selector=b0.selector;this.context=b0.context}return bF.makeArray(b0,this)},selector:"",jquery:"1.7.1",length:0,size:function(){return this.length},toArray:function(){return bK.call(this,0)},get:function(b0){return b0==null?this.toArray():(b0<0?this[this.length+b0]:this[b0])},pushStack:function(b1,b3,b0){var b2=this.constructor();if(bF.isArray(b1)){bz.apply(b2,b1)}else{bF.merge(b2,b1)}b2.prevObject=this;b2.context=this.context;if(b3==="find"){b2.selector=this.selector+(this.selector?" ":"")+b0}else{if(b3){b2.selector=this.selector+"."+b3+"("+b0+")"}}return b2},each:function(b1,b0){return bF.each(this,b1,b0)},ready:function(b0){bF.bindReady();bC.add(b0);return this},eq:function(b0){b0=+b0;return b0===-1?this.slice(b0):this.slice(b0,b0+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(bK.apply(this,arguments),"slice",bK.call(arguments).join(","))},map:function(b0){return this.pushStack(bF.map(this,function(b2,b1){return b0.call(b2,b1,b2)}))},end:function(){return this.prevObject||this.constructor(null)},push:bz,sort:[].sort,splice:[].splice};bF.fn.init.prototype=bF.fn;bF.extend=bF.fn.extend=function(){var b9,b2,b0,b1,b6,b7,b5=arguments[0]||{},b4=1,b3=arguments.length,b8=false;if(typeof b5==="boolean"){b8=b5;b5=arguments[1]||{};b4=2}if(typeof b5!=="object"&&!bF.isFunction(b5)){b5={}}if(b3===b4){b5=this;--b4}for(;b4<b3;b4++){if((b9=arguments[b4])!=null){for(b2 in b9){b0=b5[b2];b1=b9[b2];if(b5===b1){continue}if(b8&&b1&&(bF.isPlainObject(b1)||(b6=bF.isArray(b1)))){if(b6){b6=false;b7=b0&&bF.isArray(b0)?b0:[]}else{b7=b0&&bF.isPlainObject(b0)?b0:{}}b5[b2]=bF.extend(b8,b7,b1)}else{if(b1!==L){b5[b2]=b1}}}}}return b5};bF.extend({noConflict:function(b0){if(bb.$===bF){bb.$=bH}if(b0&&bb.jQuery===bF){bb.jQuery=bU}return bF},isReady:false,readyWait:1,holdReady:function(b0){if(b0){bF.readyWait++}else{bF.ready(true)}},ready:function(b0){if((b0===true&&!--bF.readyWait)||(b0!==true&&!bF.isReady)){if(!av.body){return setTimeout(bF.ready,1)}bF.isReady=true;if(b0!==true&&--bF.readyWait>0){return}bC.fireWith(av,[bF]);if(bF.fn.trigger){bF(av).trigger("ready").off("ready")}}},bindReady:function(){if(bC){return}bC=bF.Callbacks("once memory");if(av.readyState==="complete"){return setTimeout(bF.ready,1)}if(av.addEventListener){av.addEventListener("DOMContentLoaded",e,false);bb.addEventListener("load",bF.ready,false)}else{if(av.attachEvent){av.attachEvent("onreadystatechange",e);bb.attachEvent("onload",bF.ready);var b0=false;try{b0=bb.frameElement==null}catch(b1){}if(av.documentElement.doScroll&&b0){bw()}}}},isFunction:function(b0){return bF.type(b0)==="function"},isArray:Array.isArray||function(b0){return bF.type(b0)==="array"},isWindow:function(b0){return b0&&typeof b0==="object"&&"setInterval" in b0},isNumeric:function(b0){return !isNaN(parseFloat(b0))&&isFinite(b0)},type:function(b0){return b0==null?String(b0):bx[bL.call(b0)]||"object"},isPlainObject:function(b2){if(!b2||bF.type(b2)!=="object"||b2.nodeType||bF.isWindow(b2)){return false}try{if(b2.constructor&&!bG.call(b2,"constructor")&&!bG.call(b2.constructor.prototype,"isPrototypeOf")){return false}}catch(b1){return false}var b0;for(b0 in b2){}return b0===L||bG.call(b2,b0)},isEmptyObject:function(b1){for(var b0 in b1){return false}return true},error:function(b0){throw new Error(b0)},parseJSON:function(b0){if(typeof b0!=="string"||!b0){return null}b0=bF.trim(b0);if(bb.JSON&&bb.JSON.parse){return bb.JSON.parse(b0)}if(bN.test(b0.replace(bW,"@").replace(bP,"]").replace(bJ,""))){return(new Function("return "+b0))()}bF.error("Invalid JSON: "+b0)},parseXML:function(b2){var b0,b1;try{if(bb.DOMParser){b1=new DOMParser();b0=b1.parseFromString(b2,"text/xml")}else{b0=new ActiveXObject("Microsoft.XMLDOM");b0.async="false";b0.loadXML(b2)}}catch(b3){b0=L}if(!b0||!b0.documentElement||b0.getElementsByTagName("parsererror").length){bF.error("Invalid XML: "+b2)}return b0},noop:function(){},globalEval:function(b0){if(b0&&bM.test(b0)){(bb.execScript||function(b1){bb["eval"].call(bb,b1)})(b0)}},camelCase:function(b0){return b0.replace(bZ,"ms-").replace(bB,bT)},nodeName:function(b1,b0){return b1.nodeName&&b1.nodeName.toUpperCase()===b0.toUpperCase()},each:function(b3,b6,b2){var b1,b4=0,b5=b3.length,b0=b5===L||bF.isFunction(b3);if(b2){if(b0){for(b1 in b3){if(b6.apply(b3[b1],b2)===false){break}}}else{for(;b4<b5;){if(b6.apply(b3[b4++],b2)===false){break}}}}else{if(b0){for(b1 in b3){if(b6.call(b3[b1],b1,b3[b1])===false){break}}}else{for(;b4<b5;){if(b6.call(b3[b4],b4,b3[b4++])===false){break}}}}return b3},trim:bO?function(b0){return b0==null?"":bO.call(b0)}:function(b0){return b0==null?"":b0.toString().replace(bI,"").replace(bE,"")},makeArray:function(b3,b1){var b0=b1||[];if(b3!=null){var b2=bF.type(b3);if(b3.length==null||b2==="string"||b2==="function"||b2==="regexp"||bF.isWindow(b3)){bz.call(b0,b3)}else{bF.merge(b0,b3)}}return b0},inArray:function(b2,b3,b1){var b0;if(b3){if(bv){return bv.call(b3,b2,b1)}b0=b3.length;b1=b1?b1<0?Math.max(0,b0+b1):b1:0;for(;b1<b0;b1++){if(b1 in b3&&b3[b1]===b2){return b1}}}return -1},merge:function(b4,b2){var b3=b4.length,b1=0;if(typeof b2.length==="number"){for(var b0=b2.length;b1<b0;b1++){b4[b3++]=b2[b1]}}else{while(b2[b1]!==L){b4[b3++]=b2[b1++]}}b4.length=b3;return b4},grep:function(b1,b6,b0){var b2=[],b5;b0=!!b0;for(var b3=0,b4=b1.length;b3<b4;b3++){b5=!!b6(b1[b3],b3);if(b0!==b5){b2.push(b1[b3])}}return b2},map:function(b0,b7,b8){var b5,b6,b4=[],b2=0,b1=b0.length,b3=b0 instanceof bF||b1!==L&&typeof b1==="number"&&((b1>0&&b0[0]&&b0[b1-1])||b1===0||bF.isArray(b0));if(b3){for(;b2<b1;b2++){b5=b7(b0[b2],b2,b8);if(b5!=null){b4[b4.length]=b5}}}else{for(b6 in b0){b5=b7(b0[b6],b6,b8);if(b5!=null){b4[b4.length]=b5}}}return b4.concat.apply([],b4)},guid:1,proxy:function(b4,b3){if(typeof b3==="string"){var b2=b4[b3];b3=b4;b4=b2}if(!bF.isFunction(b4)){return L}var b0=bK.call(arguments,2),b1=function(){return b4.apply(b3,b0.concat(bK.call(arguments)))};b1.guid=b4.guid=b4.guid||b1.guid||bF.guid++;return b1},access:function(b0,b8,b6,b2,b5,b7){var b1=b0.length;if(typeof b8==="object"){for(var b3 in b8){bF.access(b0,b3,b8[b3],b2,b5,b6)}return b0}if(b6!==L){b2=!b7&&b2&&bF.isFunction(b6);for(var b4=0;b4<b1;b4++){b5(b0[b4],b8,b2?b6.call(b0[b4],b4,b5(b0[b4],b8)):b6,b7)}return b0}return b1?b5(b0[0],b8):L},now:function(){return(new Date()).getTime()},uaMatch:function(b1){b1=b1.toLowerCase();var b0=by.exec(b1)||bR.exec(b1)||bQ.exec(b1)||b1.indexOf("compatible")<0&&bS.exec(b1)||[];return{browser:b0[1]||"",version:b0[2]||"0"}},sub:function(){function b0(b3,b4){return new b0.fn.init(b3,b4)}bF.extend(true,b0,this);b0.superclass=this;b0.fn=b0.prototype=this();b0.fn.constructor=b0;b0.sub=this.sub;b0.fn.init=function b2(b3,b4){if(b4&&b4 instanceof bF&&!(b4 instanceof b0)){b4=b0(b4)}return bF.fn.init.call(this,b3,b4,b1)};b0.fn.init.prototype=b0.fn;var b1=b0(av);return b0},browser:{}});bF.each("Boolean Number String Function Array Date RegExp Object".split(" "),function(b1,b0){bx["[object "+b0+"]"]=b0.toLowerCase()});bV=bF.uaMatch(bX);if(bV.browser){bF.browser[bV.browser]=true;bF.browser.version=bV.version}if(bF.browser.webkit){bF.browser.safari=true}if(bM.test("\xA0")){bI=/^[\s\xA0]+/;bE=/[\s\xA0]+$/}bD=bF(av);if(av.addEventListener){e=function(){av.removeEventListener("DOMContentLoaded",e,false);bF.ready()}}else{if(av.attachEvent){e=function(){if(av.readyState==="complete"){av.detachEvent("onreadystatechange",e);bF.ready()}}}}function bw(){if(bF.isReady){return}try{av.documentElement.doScroll("left")}catch(b0){setTimeout(bw,1);return}bF.ready()}return bF})();var a2={};function X(e){var bv=a2[e]={},bw,bx;e=e.split(/\s+/);for(bw=0,bx=e.length;bw<bx;bw++){bv[e[bw]]=true}return bv}b.Callbacks=function(bw){bw=bw?(a2[bw]||X(bw)):{};var bB=[],bC=[],bx,by,bv,bz,bA,bE=function(bF){var bG,bJ,bI,bH,bK;for(bG=0,bJ=bF.length;bG<bJ;bG++){bI=bF[bG];bH=b.type(bI);if(bH==="array"){bE(bI)}else{if(bH==="function"){if(!bw.unique||!bD.has(bI)){bB.push(bI)}}}}},e=function(bG,bF){bF=bF||[];bx=!bw.memory||[bG,bF];by=true;bA=bv||0;bv=0;bz=bB.length;for(;bB&&bA<bz;bA++){if(bB[bA].apply(bG,bF)===false&&bw.stopOnFalse){bx=true;break}}by=false;if(bB){if(!bw.once){if(bC&&bC.length){bx=bC.shift();bD.fireWith(bx[0],bx[1])}}else{if(bx===true){bD.disable()}else{bB=[]}}}},bD={add:function(){if(bB){var bF=bB.length;bE(arguments);if(by){bz=bB.length}else{if(bx&&bx!==true){bv=bF;e(bx[0],bx[1])}}}return this},remove:function(){if(bB){var bF=arguments,bH=0,bI=bF.length;for(;bH<bI;bH++){for(var bG=0;bG<bB.length;bG++){if(bF[bH]===bB[bG]){if(by){if(bG<=bz){bz--;if(bG<=bA){bA--}}}bB.splice(bG--,1);if(bw.unique){break}}}}}return this},has:function(bG){if(bB){var bF=0,bH=bB.length;for(;bF<bH;bF++){if(bG===bB[bF]){return true}}}return false},empty:function(){bB=[];return this},disable:function(){bB=bC=bx=L;return this},disabled:function(){return !bB},lock:function(){bC=L;if(!bx||bx===true){bD.disable()}return this},locked:function(){return !bC},fireWith:function(bG,bF){if(bC){if(by){if(!bw.once){bC.push([bG,bF])}}else{if(!(bw.once&&bx)){e(bG,bF)}}}return this},fire:function(){bD.fireWith(this,arguments);return this},fired:function(){return !!bx}};return bD};var aJ=[].slice;b.extend({Deferred:function(by){var bx=b.Callbacks("once memory"),bw=b.Callbacks("once memory"),bv=b.Callbacks("memory"),e="pending",bA={resolve:bx,reject:bw,notify:bv},bC={done:bx.add,fail:bw.add,progress:bv.add,state:function(){return e},isResolved:bx.fired,isRejected:bw.fired,then:function(bE,bD,bF){bB.done(bE).fail(bD).progress(bF);return this},always:function(){bB.done.apply(bB,arguments).fail.apply(bB,arguments);return this},pipe:function(bF,bE,bD){return b.Deferred(function(bG){b.each({done:[bF,"resolve"],fail:[bE,"reject"],progress:[bD,"notify"]},function(bI,bL){var bH=bL[0],bK=bL[1],bJ;if(b.isFunction(bH)){bB[bI](function(){bJ=bH.apply(this,arguments);if(bJ&&b.isFunction(bJ.promise)){bJ.promise().then(bG.resolve,bG.reject,bG.notify)}else{bG[bK+"With"](this===bB?bG:this,[bJ])}})}else{bB[bI](bG[bK])}})}).promise()},promise:function(bE){if(bE==null){bE=bC}else{for(var bD in bC){bE[bD]=bC[bD]}}return bE}},bB=bC.promise({}),bz;for(bz in bA){bB[bz]=bA[bz].fire;bB[bz+"With"]=bA[bz].fireWith}bB.done(function(){e="resolved"},bw.disable,bv.lock).fail(function(){e="rejected"},bx.disable,bv.lock);if(by){by.call(bB,bB)}return bB},when:function(bA){var bx=aJ.call(arguments,0),bv=0,e=bx.length,bB=new Array(e),bw=e,by=e,bC=e<=1&&bA&&b.isFunction(bA.promise)?bA:b.Deferred(),bE=bC.promise();function bD(bF){return function(bG){bx[bF]=arguments.length>1?aJ.call(arguments,0):bG;if(!(--bw)){bC.resolveWith(bC,bx)}}}function bz(bF){return function(bG){bB[bF]=arguments.length>1?aJ.call(arguments,0):bG;bC.notifyWith(bE,bB)}}if(e>1){for(;bv<e;bv++){if(bx[bv]&&bx[bv].promise&&b.isFunction(bx[bv].promise)){bx[bv].promise().then(bD(bv),bC.reject,bz(bv))}else{--bw}}if(!bw){bC.resolveWith(bC,bx)}}else{if(bC!==bA){bC.resolveWith(bC,e?[bA]:[])}}return bE}});b.support=(function(){var bJ,bI,bF,bG,bx,bE,bA,bD,bz,bK,bB,by,bw,bv=av.createElement("div"),bH=av.documentElement;bv.setAttribute("className","t");bv.innerHTML="   <link/><table></table><a href='/a' style='top:1px;float:left;opacity:.55;'>a</a><input type='checkbox'/>";bI=bv.getElementsByTagName("*");bF=bv.getElementsByTagName("a")[0];if(!bI||!bI.length||!bF){return{}}bG=av.createElement("select");bx=bG.appendChild(av.createElement("option"));bE=bv.getElementsByTagName("input")[0];bJ={leadingWhitespace:(bv.firstChild.nodeType===3),tbody:!bv.getElementsByTagName("tbody").length,htmlSerialize:!!bv.getElementsByTagName("link").length,style:/top/.test(bF.getAttribute("style")),hrefNormalized:(bF.getAttribute("href")==="/a"),opacity:/^0.55/.test(bF.style.opacity),cssFloat:!!bF.style.cssFloat,checkOn:(bE.value==="on"),optSelected:bx.selected,getSetAttribute:bv.className!=="t",enctype:!!av.createElement("form").enctype,html5Clone:av.createElement("nav").cloneNode(true).outerHTML!=="<:nav></:nav>",submitBubbles:true,changeBubbles:true,focusinBubbles:false,deleteExpando:true,noCloneEvent:true,inlineBlockNeedsLayout:false,shrinkWrapBlocks:false,reliableMarginRight:true};bE.checked=true;bJ.noCloneChecked=bE.cloneNode(true).checked;bG.disabled=true;bJ.optDisabled=!bx.disabled;try{delete bv.test}catch(bC){bJ.deleteExpando=false}if(!bv.addEventListener&&bv.attachEvent&&bv.fireEvent){bv.attachEvent("onclick",function(){bJ.noCloneEvent=false});bv.cloneNode(true).fireEvent("onclick")}bE=av.createElement("input");bE.value="t";bE.setAttribute("type","radio");bJ.radioValue=bE.value==="t";bE.setAttribute("checked","checked");bv.appendChild(bE);bD=av.createDocumentFragment();bD.appendChild(bv.lastChild);bJ.checkClone=bD.cloneNode(true).cloneNode(true).lastChild.checked;bJ.appendChecked=bE.checked;bD.removeChild(bE);bD.appendChild(bv);bv.innerHTML="";if(bb.getComputedStyle){bA=av.createElement("div");bA.style.width="0";bA.style.marginRight="0";bv.style.width="2px";bv.appendChild(bA);bJ.reliableMarginRight=(parseInt((bb.getComputedStyle(bA,null)||{marginRight:0}).marginRight,10)||0)===0}if(bv.attachEvent){for(by in {submit:1,change:1,focusin:1}){bB="on"+by;bw=(bB in bv);if(!bw){bv.setAttribute(bB,"return;");bw=(typeof bv[bB]==="function")}bJ[by+"Bubbles"]=bw}}bD.removeChild(bv);bD=bG=bx=bA=bv=bE=null;b(function(){var bM,bU,bV,bT,bN,bO,bL,bS,bR,e,bP,bQ=av.getElementsByTagName("body")[0];if(!bQ){return}bL=1;bS="position:absolute;top:0;left:0;width:1px;height:1px;margin:0;";bR="visibility:hidden;border:0;";e="style='"+bS+"border:5px solid #000;padding:0;'";bP="<div "+e+"><div></div></div><table "+e+" cellpadding='0' cellspacing='0'><tr><td></td></tr></table>";bM=av.createElement("div");bM.style.cssText=bR+"width:0;height:0;position:static;top:0;margin-top:"+bL+"px";bQ.insertBefore(bM,bQ.firstChild);bv=av.createElement("div");bM.appendChild(bv);bv.innerHTML="<table><tr><td style='padding:0;border:0;display:none'></td><td>t</td></tr></table>";bz=bv.getElementsByTagName("td");bw=(bz[0].offsetHeight===0);bz[0].style.display="";bz[1].style.display="none";bJ.reliableHiddenOffsets=bw&&(bz[0].offsetHeight===0);bv.innerHTML="";bv.style.width=bv.style.paddingLeft="1px";b.boxModel=bJ.boxModel=bv.offsetWidth===2;if(typeof bv.style.zoom!=="undefined"){bv.style.display="inline";bv.style.zoom=1;bJ.inlineBlockNeedsLayout=(bv.offsetWidth===2);bv.style.display="";bv.innerHTML="<div style='width:4px;'></div>";bJ.shrinkWrapBlocks=(bv.offsetWidth!==2)}bv.style.cssText=bS+bR;bv.innerHTML=bP;bU=bv.firstChild;bV=bU.firstChild;bN=bU.nextSibling.firstChild.firstChild;bO={doesNotAddBorder:(bV.offsetTop!==5),doesAddBorderForTableAndCells:(bN.offsetTop===5)};bV.style.position="fixed";bV.style.top="20px";bO.fixedPosition=(bV.offsetTop===20||bV.offsetTop===15);bV.style.position=bV.style.top="";bU.style.overflow="hidden";bU.style.position="relative";bO.subtractsBorderForOverflowNotVisible=(bV.offsetTop===-5);bO.doesNotIncludeMarginInBodyOffset=(bQ.offsetTop!==bL);bQ.removeChild(bM);bv=bM=null;b.extend(bJ,bO)});return bJ})();var aS=/^(?:\{.*\}|\[.*\])$/,aA=/([A-Z])/g;b.extend({cache:{},uuid:0,expando:"jQuery"+(b.fn.jquery+Math.random()).replace(/\D/g,""),noData:{embed:true,object:"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",applet:true},hasData:function(e){e=e.nodeType?b.cache[e[b.expando]]:e[b.expando];return !!e&&!S(e)},data:function(bx,bv,bz,by){if(!b.acceptData(bx)){return}var bG,bA,bD,bE=b.expando,bC=typeof bv==="string",bF=bx.nodeType,e=bF?b.cache:bx,bw=bF?bx[bE]:bx[bE]&&bE,bB=bv==="events";if((!bw||!e[bw]||(!bB&&!by&&!e[bw].data))&&bC&&bz===L){return}if(!bw){if(bF){bx[bE]=bw=++b.uuid}else{bw=bE}}if(!e[bw]){e[bw]={};if(!bF){e[bw].toJSON=b.noop}}if(typeof bv==="object"||typeof bv==="function"){if(by){e[bw]=b.extend(e[bw],bv)}else{e[bw].data=b.extend(e[bw].data,bv)}}bG=bA=e[bw];if(!by){if(!bA.data){bA.data={}}bA=bA.data}if(bz!==L){bA[b.camelCase(bv)]=bz}if(bB&&!bA[bv]){return bG.events}if(bC){bD=bA[bv];if(bD==null){bD=bA[b.camelCase(bv)]}}else{bD=bA}return bD},removeData:function(bx,bv,by){if(!b.acceptData(bx)){return}var bB,bA,bz,bC=b.expando,bD=bx.nodeType,e=bD?b.cache:bx,bw=bD?bx[bC]:bC;if(!e[bw]){return}if(bv){bB=by?e[bw]:e[bw].data;if(bB){if(!b.isArray(bv)){if(bv in bB){bv=[bv]}else{bv=b.camelCase(bv);if(bv in bB){bv=[bv]}else{bv=bv.split(" ")}}}for(bA=0,bz=bv.length;bA<bz;bA++){delete bB[bv[bA]]}if(!(by?S:b.isEmptyObject)(bB)){return}}}if(!by){delete e[bw].data;if(!S(e[bw])){return}}if(b.support.deleteExpando||!e.setInterval){delete e[bw]}else{e[bw]=null}if(bD){if(b.support.deleteExpando){delete bx[bC]}else{if(bx.removeAttribute){bx.removeAttribute(bC)}else{bx[bC]=null}}}},_data:function(bv,e,bw){return b.data(bv,e,bw,true)},acceptData:function(bv){if(bv.nodeName){var e=b.noData[bv.nodeName.toLowerCase()];if(e){return !(e===true||bv.getAttribute("classid")!==e)}}return true}});b.fn.extend({data:function(by,bA){var bB,e,bw,bz=null;if(typeof by==="undefined"){if(this.length){bz=b.data(this[0]);if(this[0].nodeType===1&&!b._data(this[0],"parsedAttrs")){e=this[0].attributes;for(var bx=0,bv=e.length;bx<bv;bx++){bw=e[bx].name;if(bw.indexOf("data-")===0){bw=b.camelCase(bw.substring(5));a5(this[0],bw,bz[bw])}}b._data(this[0],"parsedAttrs",true)}}return bz}else{if(typeof by==="object"){return this.each(function(){b.data(this,by)})}}bB=by.split(".");bB[1]=bB[1]?"."+bB[1]:"";if(bA===L){bz=this.triggerHandler("getData"+bB[1]+"!",[bB[0]]);if(bz===L&&this.length){bz=b.data(this[0],by);bz=a5(this[0],by,bz)}return bz===L&&bB[1]?this.data(bB[0]):bz}else{return this.each(function(){var bC=b(this),bD=[bB[0],bA];bC.triggerHandler("setData"+bB[1]+"!",bD);b.data(this,by,bA);bC.triggerHandler("changeData"+bB[1]+"!",bD)})}},removeData:function(e){return this.each(function(){b.removeData(this,e)})}});function a5(bx,bw,by){if(by===L&&bx.nodeType===1){var bv="data-"+bw.replace(aA,"-$1").toLowerCase();by=bx.getAttribute(bv);if(typeof by==="string"){try{by=by==="true"?true:by==="false"?false:by==="null"?null:b.isNumeric(by)?parseFloat(by):aS.test(by)?b.parseJSON(by):by}catch(bz){}b.data(bx,bw,by)}else{by=L}}return by}function S(bv){for(var e in bv){if(e==="data"&&b.isEmptyObject(bv[e])){continue}if(e!=="toJSON"){return false}}return true}function bi(by,bx,bA){var bw=bx+"defer",bv=bx+"queue",e=bx+"mark",bz=b._data(by,bw);if(bz&&(bA==="queue"||!b._data(by,bv))&&(bA==="mark"||!b._data(by,e))){setTimeout(function(){if(!b._data(by,bv)&&!b._data(by,e)){b.removeData(by,bw,true);bz.fire()}},0)}}b.extend({_mark:function(bv,e){if(bv){e=(e||"fx")+"mark";b._data(bv,e,(b._data(bv,e)||0)+1)}},_unmark:function(by,bx,bv){if(by!==true){bv=bx;bx=by;by=false}if(bx){bv=bv||"fx";var e=bv+"mark",bw=by?0:((b._data(bx,e)||1)-1);if(bw){b._data(bx,e,bw)}else{b.removeData(bx,e,true);bi(bx,bv,"mark")}}},queue:function(bv,e,bx){var bw;if(bv){e=(e||"fx")+"queue";bw=b._data(bv,e);if(bx){if(!bw||b.isArray(bx)){bw=b._data(bv,e,b.makeArray(bx))}else{bw.push(bx)}}return bw||[]}},dequeue:function(by,bx){bx=bx||"fx";var bv=b.queue(by,bx),bw=bv.shift(),e={};if(bw==="inprogress"){bw=bv.shift()}if(bw){if(bx==="fx"){bv.unshift("inprogress")}b._data(by,bx+".run",e);bw.call(by,function(){b.dequeue(by,bx)},e)}if(!bv.length){b.removeData(by,bx+"queue "+bx+".run",true);bi(by,bx,"queue")}}});b.fn.extend({queue:function(e,bv){if(typeof e!=="string"){bv=e;e="fx"}if(bv===L){return b.queue(this[0],e)}return this.each(function(){var bw=b.queue(this,e,bv);if(e==="fx"&&bw[0]!=="inprogress"){b.dequeue(this,e)}})},dequeue:function(e){return this.each(function(){b.dequeue(this,e)})},delay:function(bv,e){bv=b.fx?b.fx.speeds[bv]||bv:bv;e=e||"fx";return this.queue(e,function(bx,bw){var by=setTimeout(bx,bv);bw.stop=function(){clearTimeout(by)}})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(bD,bw){if(typeof bD!=="string"){bw=bD;bD=L}bD=bD||"fx";var e=b.Deferred(),bv=this,by=bv.length,bB=1,bz=bD+"defer",bA=bD+"queue",bC=bD+"mark",bx;function bE(){if(!(--bB)){e.resolveWith(bv,[bv])}}while(by--){if((bx=b.data(bv[by],bz,L,true)||(b.data(bv[by],bA,L,true)||b.data(bv[by],bC,L,true))&&b.data(bv[by],bz,b.Callbacks("once memory"),true))){bB++;bx.add(bE)}}bE();return e.promise()}});var aP=/[\n\t\r]/g,af=/\s+/,aU=/\r/g,g=/^(?:button|input)$/i,D=/^(?:button|input|object|select|textarea)$/i,l=/^a(?:rea)?$/i,ao=/^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,F=b.support.getSetAttribute,be,aY,aF;b.fn.extend({attr:function(e,bv){return b.access(this,e,bv,true,b.attr)},removeAttr:function(e){return this.each(function(){b.removeAttr(this,e)})},prop:function(e,bv){return b.access(this,e,bv,true,b.prop)},removeProp:function(e){e=b.propFix[e]||e;return this.each(function(){try{this[e]=L;delete this[e]}catch(bv){}})},addClass:function(by){var bA,bw,bv,bx,bz,bB,e;if(b.isFunction(by)){return this.each(function(bC){b(this).addClass(by.call(this,bC,this.className))})}if(by&&typeof by==="string"){bA=by.split(af);for(bw=0,bv=this.length;bw<bv;bw++){bx=this[bw];if(bx.nodeType===1){if(!bx.className&&bA.length===1){bx.className=by}else{bz=" "+bx.className+" ";for(bB=0,e=bA.length;bB<e;bB++){if(!~bz.indexOf(" "+bA[bB]+" ")){bz+=bA[bB]+" "}}bx.className=b.trim(bz)}}}}return this},removeClass:function(bz){var bA,bw,bv,by,bx,bB,e;if(b.isFunction(bz)){return this.each(function(bC){b(this).removeClass(bz.call(this,bC,this.className))})}if((bz&&typeof bz==="string")||bz===L){bA=(bz||"").split(af);for(bw=0,bv=this.length;bw<bv;bw++){by=this[bw];if(by.nodeType===1&&by.className){if(bz){bx=(" "+by.className+" ").replace(aP," ");for(bB=0,e=bA.length;bB<e;bB++){bx=bx.replace(" "+bA[bB]+" "," ")}by.className=b.trim(bx)}else{by.className=""}}}}return this},toggleClass:function(bx,bv){var bw=typeof bx,e=typeof bv==="boolean";if(b.isFunction(bx)){return this.each(function(by){b(this).toggleClass(bx.call(this,by,this.className,bv),bv)})}return this.each(function(){if(bw==="string"){var bA,bz=0,by=b(this),bB=bv,bC=bx.split(af);while((bA=bC[bz++])){bB=e?bB:!by.hasClass(bA);by[bB?"addClass":"removeClass"](bA)}}else{if(bw==="undefined"||bw==="boolean"){if(this.className){b._data(this,"__className__",this.className)}this.className=this.className||bx===false?"":b._data(this,"__className__")||""}}})},hasClass:function(e){var bx=" "+e+" ",bw=0,bv=this.length;for(;bw<bv;bw++){if(this[bw].nodeType===1&&(" "+this[bw].className+" ").replace(aP," ").indexOf(bx)>-1){return true}}return false},val:function(bx){var e,bv,by,bw=this[0];if(!arguments.length){if(bw){e=b.valHooks[bw.nodeName.toLowerCase()]||b.valHooks[bw.type];if(e&&"get" in e&&(bv=e.get(bw,"value"))!==L){return bv}bv=bw.value;return typeof bv==="string"?bv.replace(aU,""):bv==null?"":bv}return}by=b.isFunction(bx);return this.each(function(bA){var bz=b(this),bB;if(this.nodeType!==1){return}if(by){bB=bx.call(this,bA,bz.val())}else{bB=bx}if(bB==null){bB=""}else{if(typeof bB==="number"){bB+=""}else{if(b.isArray(bB)){bB=b.map(bB,function(bC){return bC==null?"":bC+""})}}}e=b.valHooks[this.nodeName.toLowerCase()]||b.valHooks[this.type];if(!e||!("set" in e)||e.set(this,bB,"value")===L){this.value=bB}})}});b.extend({valHooks:{option:{get:function(e){var bv=e.attributes.value;return !bv||bv.specified?e.value:e.text}},select:{get:function(e){var bA,bv,bz,bx,by=e.selectedIndex,bB=[],bC=e.options,bw=e.type==="select-one";if(by<0){return null}bv=bw?by:0;bz=bw?by+1:bC.length;for(;bv<bz;bv++){bx=bC[bv];if(bx.selected&&(b.support.optDisabled?!bx.disabled:bx.getAttribute("disabled")===null)&&(!bx.parentNode.disabled||!b.nodeName(bx.parentNode,"optgroup"))){bA=b(bx).val();if(bw){return bA}bB.push(bA)}}if(bw&&!bB.length&&bC.length){return b(bC[by]).val()}return bB},set:function(bv,bw){var e=b.makeArray(bw);b(bv).find("option").each(function(){this.selected=b.inArray(b(this).val(),e)>=0});if(!e.length){bv.selectedIndex=-1}return e}}},attrFn:{val:true,css:true,html:true,text:true,data:true,width:true,height:true,offset:true},attr:function(bA,bx,bB,bz){var bw,e,by,bv=bA.nodeType;if(!bA||bv===3||bv===8||bv===2){return}if(bz&&bx in b.attrFn){return b(bA)[bx](bB)}if(typeof bA.getAttribute==="undefined"){return b.prop(bA,bx,bB)}by=bv!==1||!b.isXMLDoc(bA);if(by){bx=bx.toLowerCase();e=b.attrHooks[bx]||(ao.test(bx)?aY:be)}if(bB!==L){if(bB===null){b.removeAttr(bA,bx);return}else{if(e&&"set" in e&&by&&(bw=e.set(bA,bB,bx))!==L){return bw}else{bA.setAttribute(bx,""+bB);return bB}}}else{if(e&&"get" in e&&by&&(bw=e.get(bA,bx))!==null){return bw}else{bw=bA.getAttribute(bx);return bw===null?L:bw}}},removeAttr:function(bx,bz){var by,bA,bv,e,bw=0;if(bz&&bx.nodeType===1){bA=bz.toLowerCase().split(af);e=bA.length;for(;bw<e;bw++){bv=bA[bw];if(bv){by=b.propFix[bv]||bv;b.attr(bx,bv,"");bx.removeAttribute(F?bv:by);if(ao.test(bv)&&by in bx){bx[by]=false}}}}},attrHooks:{type:{set:function(e,bv){if(g.test(e.nodeName)&&e.parentNode){b.error("type property can't be changed")}else{if(!b.support.radioValue&&bv==="radio"&&b.nodeName(e,"input")){var bw=e.value;e.setAttribute("type",bv);if(bw){e.value=bw}return bv}}}},value:{get:function(bv,e){if(be&&b.nodeName(bv,"button")){return be.get(bv,e)}return e in bv?bv.value:null},set:function(bv,bw,e){if(be&&b.nodeName(bv,"button")){return be.set(bv,bw,e)}bv.value=bw}}},propFix:{tabindex:"tabIndex",readonly:"readOnly","for":"htmlFor","class":"className",maxlength:"maxLength",cellspacing:"cellSpacing",cellpadding:"cellPadding",rowspan:"rowSpan",colspan:"colSpan",usemap:"useMap",frameborder:"frameBorder",contenteditable:"contentEditable"},prop:function(bz,bx,bA){var bw,e,by,bv=bz.nodeType;if(!bz||bv===3||bv===8||bv===2){return}by=bv!==1||!b.isXMLDoc(bz);if(by){bx=b.propFix[bx]||bx;e=b.propHooks[bx]}if(bA!==L){if(e&&"set" in e&&(bw=e.set(bz,bA,bx))!==L){return bw}else{return(bz[bx]=bA)}}else{if(e&&"get" in e&&(bw=e.get(bz,bx))!==null){return bw}else{return bz[bx]}}},propHooks:{tabIndex:{get:function(bv){var e=bv.getAttributeNode("tabindex");return e&&e.specified?parseInt(e.value,10):D.test(bv.nodeName)||l.test(bv.nodeName)&&bv.href?0:L}}}});b.attrHooks.tabindex=b.propHooks.tabIndex;aY={get:function(bv,e){var bx,bw=b.prop(bv,e);return bw===true||typeof bw!=="boolean"&&(bx=bv.getAttributeNode(e))&&bx.nodeValue!==false?e.toLowerCase():L},set:function(bv,bx,e){var bw;if(bx===false){b.removeAttr(bv,e)}else{bw=b.propFix[e]||e;if(bw in bv){bv[bw]=true}bv.setAttribute(e,e.toLowerCase())}return e}};if(!F){aF={name:true,id:true};be=b.valHooks.button={get:function(bw,bv){var e;e=bw.getAttributeNode(bv);return e&&(aF[bv]?e.nodeValue!=="":e.specified)?e.nodeValue:L},set:function(bw,bx,bv){var e=bw.getAttributeNode(bv);if(!e){e=av.createAttribute(bv);bw.setAttributeNode(e)}return(e.nodeValue=bx+"")}};b.attrHooks.tabindex.set=be.set;b.each(["width","height"],function(bv,e){b.attrHooks[e]=b.extend(b.attrHooks[e],{set:function(bw,bx){if(bx===""){bw.setAttribute(e,"auto");return bx}}})});b.attrHooks.contenteditable={get:be.get,set:function(bv,bw,e){if(bw===""){bw="false"}be.set(bv,bw,e)}}}if(!b.support.hrefNormalized){b.each(["href","src","width","height"],function(bv,e){b.attrHooks[e]=b.extend(b.attrHooks[e],{get:function(bx){var bw=bx.getAttribute(e,2);return bw===null?L:bw}})})}if(!b.support.style){b.attrHooks.style={get:function(e){return e.style.cssText.toLowerCase()||L},set:function(e,bv){return(e.style.cssText=""+bv)}}}if(!b.support.optSelected){b.propHooks.selected=b.extend(b.propHooks.selected,{get:function(bv){var e=bv.parentNode;if(e){e.selectedIndex;if(e.parentNode){e.parentNode.selectedIndex}}return null}})}if(!b.support.enctype){b.propFix.enctype="encoding"}if(!b.support.checkOn){b.each(["radio","checkbox"],function(){b.valHooks[this]={get:function(e){return e.getAttribute("value")===null?"on":e.value}}})}b.each(["radio","checkbox"],function(){b.valHooks[this]=b.extend(b.valHooks[this],{set:function(e,bv){if(b.isArray(bv)){return(e.checked=b.inArray(b(e).val(),bv)>=0)}}})});var bd=/^(?:textarea|input|select)$/i,n=/^([^\.]*)?(?:\.(.+))?$/,J=/\bhover(\.\S+)?\b/,aO=/^key/,bf=/^(?:mouse|contextmenu)|click/,T=/^(?:focusinfocus|focusoutblur)$/,U=/^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,Y=function(e){var bv=U.exec(e);if(bv){bv[1]=(bv[1]||"").toLowerCase();bv[3]=bv[3]&&new RegExp("(?:^|\\s)"+bv[3]+"(?:\\s|$)")}return bv},j=function(bw,e){var bv=bw.attributes||{};return((!e[1]||bw.nodeName.toLowerCase()===e[1])&&(!e[2]||(bv.id||{}).value===e[2])&&(!e[3]||e[3].test((bv["class"]||{}).value)))},bt=function(e){return b.event.special.hover?e:e.replace(J,"mouseenter$1 mouseleave$1")};b.event={add:function(bx,bC,bJ,bA,by){var bD,bB,bK,bI,bH,bF,e,bG,bv,bz,bw,bE;if(bx.nodeType===3||bx.nodeType===8||!bC||!bJ||!(bD=b._data(bx))){return}if(bJ.handler){bv=bJ;bJ=bv.handler}if(!bJ.guid){bJ.guid=b.guid++}bK=bD.events;if(!bK){bD.events=bK={}}bB=bD.handle;if(!bB){bD.handle=bB=function(bL){return typeof b!=="undefined"&&(!bL||b.event.triggered!==bL.type)?b.event.dispatch.apply(bB.elem,arguments):L};bB.elem=bx}bC=b.trim(bt(bC)).split(" ");for(bI=0;bI<bC.length;bI++){bH=n.exec(bC[bI])||[];bF=bH[1];e=(bH[2]||"").split(".").sort();bE=b.event.special[bF]||{};bF=(by?bE.delegateType:bE.bindType)||bF;bE=b.event.special[bF]||{};bG=b.extend({type:bF,origType:bH[1],data:bA,handler:bJ,guid:bJ.guid,selector:by,quick:Y(by),namespace:e.join(".")},bv);bw=bK[bF];if(!bw){bw=bK[bF]=[];bw.delegateCount=0;if(!bE.setup||bE.setup.call(bx,bA,e,bB)===false){if(bx.addEventListener){bx.addEventListener(bF,bB,false)}else{if(bx.attachEvent){bx.attachEvent("on"+bF,bB)}}}}if(bE.add){bE.add.call(bx,bG);if(!bG.handler.guid){bG.handler.guid=bJ.guid}}if(by){bw.splice(bw.delegateCount++,0,bG)}else{bw.push(bG)}b.event.global[bF]=true}bx=null},global:{},remove:function(bJ,bE,bv,bH,bB){var bI=b.hasData(bJ)&&b._data(bJ),bF,bx,bz,bL,bC,bA,bG,bw,by,bK,bD,e;if(!bI||!(bw=bI.events)){return}bE=b.trim(bt(bE||"")).split(" ");for(bF=0;bF<bE.length;bF++){bx=n.exec(bE[bF])||[];bz=bL=bx[1];bC=bx[2];if(!bz){for(bz in bw){b.event.remove(bJ,bz+bE[bF],bv,bH,true)}continue}by=b.event.special[bz]||{};bz=(bH?by.delegateType:by.bindType)||bz;bD=bw[bz]||[];bA=bD.length;bC=bC?new RegExp("(^|\\.)"+bC.split(".").sort().join("\\.(?:.*\\.)?")+"(\\.|$)"):null;for(bG=0;bG<bD.length;bG++){e=bD[bG];if((bB||bL===e.origType)&&(!bv||bv.guid===e.guid)&&(!bC||bC.test(e.namespace))&&(!bH||bH===e.selector||bH==="**"&&e.selector)){bD.splice(bG--,1);if(e.selector){bD.delegateCount--}if(by.remove){by.remove.call(bJ,e)}}}if(bD.length===0&&bA!==bD.length){if(!by.teardown||by.teardown.call(bJ,bC)===false){b.removeEvent(bJ,bz,bI.handle)}delete bw[bz]}}if(b.isEmptyObject(bw)){bK=bI.handle;if(bK){bK.elem=null}b.removeData(bJ,["events","handle"],true)}},customEvent:{getData:true,setData:true,changeData:true},trigger:function(bv,bD,bA,bJ){if(bA&&(bA.nodeType===3||bA.nodeType===8)){return}var bG=bv.type||bv,bx=[],e,bw,bC,bH,bz,by,bF,bE,bB,bI;if(T.test(bG+b.event.triggered)){return}if(bG.indexOf("!")>=0){bG=bG.slice(0,-1);bw=true}if(bG.indexOf(".")>=0){bx=bG.split(".");bG=bx.shift();bx.sort()}if((!bA||b.event.customEvent[bG])&&!b.event.global[bG]){return}bv=typeof bv==="object"?bv[b.expando]?bv:new b.Event(bG,bv):new b.Event(bG);bv.type=bG;bv.isTrigger=true;bv.exclusive=bw;bv.namespace=bx.join(".");bv.namespace_re=bv.namespace?new RegExp("(^|\\.)"+bx.join("\\.(?:.*\\.)?")+"(\\.|$)"):null;by=bG.indexOf(":")<0?"on"+bG:"";if(!bA){e=b.cache;for(bC in e){if(e[bC].events&&e[bC].events[bG]){b.event.trigger(bv,bD,e[bC].handle.elem,true)}}return}bv.result=L;if(!bv.target){bv.target=bA}bD=bD!=null?b.makeArray(bD):[];bD.unshift(bv);bF=b.event.special[bG]||{};if(bF.trigger&&bF.trigger.apply(bA,bD)===false){return}bB=[[bA,bF.bindType||bG]];if(!bJ&&!bF.noBubble&&!b.isWindow(bA)){bI=bF.delegateType||bG;bH=T.test(bI+bG)?bA:bA.parentNode;bz=null;for(;bH;bH=bH.parentNode){bB.push([bH,bI]);bz=bH}if(bz&&bz===bA.ownerDocument){bB.push([bz.defaultView||bz.parentWindow||bb,bI])}}for(bC=0;bC<bB.length&&!bv.isPropagationStopped();bC++){bH=bB[bC][0];bv.type=bB[bC][1];bE=(b._data(bH,"events")||{})[bv.type]&&b._data(bH,"handle");if(bE){bE.apply(bH,bD)}bE=by&&bH[by];if(bE&&b.acceptData(bH)&&bE.apply(bH,bD)===false){bv.preventDefault()}}bv.type=bG;if(!bJ&&!bv.isDefaultPrevented()){if((!bF._default||bF._default.apply(bA.ownerDocument,bD)===false)&&!(bG==="click"&&b.nodeName(bA,"a"))&&b.acceptData(bA)){if(by&&bA[bG]&&((bG!=="focus"&&bG!=="blur")||bv.target.offsetWidth!==0)&&!b.isWindow(bA)){bz=bA[by];if(bz){bA[by]=null}b.event.triggered=bG;bA[bG]();b.event.triggered=L;if(bz){bA[by]=bz}}}}return bv.result},dispatch:function(e){e=b.event.fix(e||bb.event);var bz=((b._data(this,"events")||{})[e.type]||[]),bA=bz.delegateCount,bG=[].slice.call(arguments,0),by=!e.exclusive&&!e.namespace,bH=[],bC,bB,bK,bx,bF,bE,bv,bD,bI,bw,bJ;bG[0]=e;e.delegateTarget=this;if(bA&&!e.target.disabled&&!(e.button&&e.type==="click")){bx=b(this);bx.context=this.ownerDocument||this;for(bK=e.target;bK!=this;bK=bK.parentNode||this){bE={};bD=[];bx[0]=bK;for(bC=0;bC<bA;bC++){bI=bz[bC];bw=bI.selector;if(bE[bw]===L){bE[bw]=(bI.quick?j(bK,bI.quick):bx.is(bw))}if(bE[bw]){bD.push(bI)}}if(bD.length){bH.push({elem:bK,matches:bD})}}}if(bz.length>bA){bH.push({elem:this,matches:bz.slice(bA)})}for(bC=0;bC<bH.length&&!e.isPropagationStopped();bC++){bv=bH[bC];e.currentTarget=bv.elem;for(bB=0;bB<bv.matches.length&&!e.isImmediatePropagationStopped();bB++){bI=bv.matches[bB];if(by||(!e.namespace&&!bI.namespace)||e.namespace_re&&e.namespace_re.test(bI.namespace)){e.data=bI.data;e.handleObj=bI;bF=((b.event.special[bI.origType]||{}).handle||bI.handler).apply(bv.elem,bG);if(bF!==L){e.result=bF;if(bF===false){e.preventDefault();e.stopPropagation()}}}}}return e.result},props:"attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),fixHooks:{},keyHooks:{props:"char charCode key keyCode".split(" "),filter:function(bv,e){if(bv.which==null){bv.which=e.charCode!=null?e.charCode:e.keyCode}return bv}},mouseHooks:{props:"button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "),filter:function(bx,bw){var by,bz,e,bv=bw.button,bA=bw.fromElement;if(bx.pageX==null&&bw.clientX!=null){by=bx.target.ownerDocument||av;bz=by.documentElement;e=by.body;bx.pageX=bw.clientX+(bz&&bz.scrollLeft||e&&e.scrollLeft||0)-(bz&&bz.clientLeft||e&&e.clientLeft||0);bx.pageY=bw.clientY+(bz&&bz.scrollTop||e&&e.scrollTop||0)-(bz&&bz.clientTop||e&&e.clientTop||0)}if(!bx.relatedTarget&&bA){bx.relatedTarget=bA===bx.target?bw.toElement:bA}if(!bx.which&&bv!==L){bx.which=(bv&1?1:(bv&2?3:(bv&4?2:0)))}return bx}},fix:function(bw){if(bw[b.expando]){return bw}var bv,bz,e=bw,bx=b.event.fixHooks[bw.type]||{},by=bx.props?this.props.concat(bx.props):this.props;bw=b.Event(e);for(bv=by.length;bv;){bz=by[--bv];bw[bz]=e[bz]}if(!bw.target){bw.target=e.srcElement||av}if(bw.target.nodeType===3){bw.target=bw.target.parentNode}if(bw.metaKey===L){bw.metaKey=bw.ctrlKey}return bx.filter?bx.filter(bw,e):bw},special:{ready:{setup:b.bindReady},load:{noBubble:true},focus:{delegateType:"focusin"},blur:{delegateType:"focusout"},beforeunload:{setup:function(bw,bv,e){if(b.isWindow(this)){this.onbeforeunload=e}},teardown:function(bv,e){if(this.onbeforeunload===e){this.onbeforeunload=null}}}},simulate:function(bw,by,bx,bv){var bz=b.extend(new b.Event(),bx,{type:bw,isSimulated:true,originalEvent:{}});if(bv){b.event.trigger(bz,null,by)}else{b.event.dispatch.call(by,bz)}if(bz.isDefaultPrevented()){bx.preventDefault()}}};b.event.handle=b.event.dispatch;b.removeEvent=av.removeEventListener?function(bv,e,bw){if(bv.removeEventListener){bv.removeEventListener(e,bw,false)}}:function(bv,e,bw){if(bv.detachEvent){bv.detachEvent("on"+e,bw)}};b.Event=function(bv,e){if(!(this instanceof b.Event)){return new b.Event(bv,e)}if(bv&&bv.type){this.originalEvent=bv;this.type=bv.type;this.isDefaultPrevented=(bv.defaultPrevented||bv.returnValue===false||bv.getPreventDefault&&bv.getPreventDefault())?i:bk}else{this.type=bv}if(e){b.extend(this,e)}this.timeStamp=bv&&bv.timeStamp||b.now();this[b.expando]=true};function bk(){return false}function i(){return true}b.Event.prototype={preventDefault:function(){this.isDefaultPrevented=i;var bv=this.originalEvent;if(!bv){return}if(bv.preventDefault){bv.preventDefault()}else{bv.returnValue=false}},stopPropagation:function(){this.isPropagationStopped=i;var bv=this.originalEvent;if(!bv){return}if(bv.stopPropagation){bv.stopPropagation()}bv.cancelBubble=true},stopImmediatePropagation:function(){this.isImmediatePropagationStopped=i;this.stopPropagation()},isDefaultPrevented:bk,isPropagationStopped:bk,isImmediatePropagationStopped:bk};b.each({mouseenter:"mouseover",mouseleave:"mouseout"},function(bv,e){b.event.special[bv]={delegateType:e,bindType:e,handle:function(bz){var bB=this,bA=bz.relatedTarget,by=bz.handleObj,bw=by.selector,bx;if(!bA||(bA!==bB&&!b.contains(bB,bA))){bz.type=by.origType;bx=by.handler.apply(this,arguments);bz.type=e}return bx}}});if(!b.support.submitBubbles){b.event.special.submit={setup:function(){if(b.nodeName(this,"form")){return false}b.event.add(this,"click._submit keypress._submit",function(bx){var bw=bx.target,bv=b.nodeName(bw,"input")||b.nodeName(bw,"button")?bw.form:L;if(bv&&!bv._submit_attached){b.event.add(bv,"submit._submit",function(e){if(this.parentNode&&!e.isTrigger){b.event.simulate("submit",this.parentNode,e,true)}});bv._submit_attached=true}})},teardown:function(){if(b.nodeName(this,"form")){return false}b.event.remove(this,"._submit")}}}if(!b.support.changeBubbles){b.event.special.change={setup:function(){if(bd.test(this.nodeName)){if(this.type==="checkbox"||this.type==="radio"){b.event.add(this,"propertychange._change",function(e){if(e.originalEvent.propertyName==="checked"){this._just_changed=true}});b.event.add(this,"click._change",function(e){if(this._just_changed&&!e.isTrigger){this._just_changed=false;b.event.simulate("change",this,e,true)}})}return false}b.event.add(this,"beforeactivate._change",function(bw){var bv=bw.target;if(bd.test(bv.nodeName)&&!bv._change_attached){b.event.add(bv,"change._change",function(e){if(this.parentNode&&!e.isSimulated&&!e.isTrigger){b.event.simulate("change",this.parentNode,e,true)}});bv._change_attached=true}})},handle:function(bv){var e=bv.target;if(this!==e||bv.isSimulated||bv.isTrigger||(e.type!=="radio"&&e.type!=="checkbox")){return bv.handleObj.handler.apply(this,arguments)}},teardown:function(){b.event.remove(this,"._change");return bd.test(this.nodeName)}}}if(!b.support.focusinBubbles){b.each({focus:"focusin",blur:"focusout"},function(bx,e){var bv=0,bw=function(by){b.event.simulate(e,by.target,b.event.fix(by),true)};b.event.special[e]={setup:function(){if(bv++===0){av.addEventListener(bx,bw,true)}},teardown:function(){if(--bv===0){av.removeEventListener(bx,bw,true)}}}})}b.fn.extend({on:function(bw,e,bz,by,bv){var bA,bx;if(typeof bw==="object"){if(typeof e!=="string"){bz=e;e=L}for(bx in bw){this.on(bx,e,bz,bw[bx],bv)}return this}if(bz==null&&by==null){by=e;bz=e=L}else{if(by==null){if(typeof e==="string"){by=bz;bz=L}else{by=bz;bz=e;e=L}}}if(by===false){by=bk}else{if(!by){return this}}if(bv===1){bA=by;by=function(bB){b().off(bB);return bA.apply(this,arguments)};by.guid=bA.guid||(bA.guid=b.guid++)}return this.each(function(){b.event.add(this,bw,by,bz,e)})},one:function(bv,e,bx,bw){return this.on.call(this,bv,e,bx,bw,1)},off:function(bw,e,by){if(bw&&bw.preventDefault&&bw.handleObj){var bv=bw.handleObj;b(bw.delegateTarget).off(bv.namespace?bv.type+"."+bv.namespace:bv.type,bv.selector,bv.handler);return this}if(typeof bw==="object"){for(var bx in bw){this.off(bx,e,bw[bx])}return this}if(e===false||typeof e==="function"){by=e;e=L}if(by===false){by=bk}return this.each(function(){b.event.remove(this,bw,by,e)})},bind:function(e,bw,bv){return this.on(e,null,bw,bv)},unbind:function(e,bv){return this.off(e,null,bv)},live:function(e,bw,bv){b(this.context).on(e,this.selector,bw,bv);return this},die:function(e,bv){b(this.context).off(e,this.selector||"**",bv);return this},delegate:function(e,bv,bx,bw){return this.on(bv,e,bx,bw)},undelegate:function(e,bv,bw){return arguments.length==1?this.off(e,"**"):this.off(bv,e,bw)},trigger:function(e,bv){return this.each(function(){b.event.trigger(e,bv,this)})},triggerHandler:function(e,bv){if(this[0]){return b.event.trigger(e,bv,this[0],true)}},toggle:function(bx){var bv=arguments,e=bx.guid||b.guid++,bw=0,by=function(bz){var bA=(b._data(this,"lastToggle"+bx.guid)||0)%bw;b._data(this,"lastToggle"+bx.guid,bA+1);bz.preventDefault();return bv[bA].apply(this,arguments)||false};by.guid=e;while(bw<bv.length){bv[bw++].guid=e}return this.click(by)},hover:function(e,bv){return this.mouseenter(e).mouseleave(bv||e)}});b.each(("blur focus focusin focusout load resize scroll unload click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup error contextmenu").split(" "),function(bv,e){b.fn[e]=function(bx,bw){if(bw==null){bw=bx;bx=null}return arguments.length>0?this.on(e,null,bx,bw):this.trigger(e)};if(b.attrFn){b.attrFn[e]=true}if(aO.test(e)){b.event.fixHooks[e]=b.event.keyHooks}if(bf.test(e)){b.event.fixHooks[e]=b.event.mouseHooks}});
+(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):t(jQuery)})(function(t){function e(t){for(var e=t.css("visibility");"inherit"===e;)t=t.parent(),e=t.css("visibility");return"hidden"!==e}t.ui=t.ui||{},t.ui.version="1.12.1";var i=0,s=Array.prototype.slice;t.cleanData=function(e){return function(i){var s,n,o;for(o=0;null!=(n=i[o]);o++)try{s=t._data(n,"events"),s&&s.remove&&t(n).triggerHandler("remove")}catch(a){}e(i)}}(t.cleanData),t.widget=function(e,i,s){var n,o,a,r={},h=e.split(".")[0];e=e.split(".")[1];var l=h+"-"+e;return s||(s=i,i=t.Widget),t.isArray(s)&&(s=t.extend.apply(null,[{}].concat(s))),t.expr[":"][l.toLowerCase()]=function(e){return!!t.data(e,l)},t[h]=t[h]||{},n=t[h][e],o=t[h][e]=function(t,e){return this._createWidget?(arguments.length&&this._createWidget(t,e),void 0):new o(t,e)},t.extend(o,n,{version:s.version,_proto:t.extend({},s),_childConstructors:[]}),a=new i,a.options=t.widget.extend({},a.options),t.each(s,function(e,s){return t.isFunction(s)?(r[e]=function(){function t(){return i.prototype[e].apply(this,arguments)}function n(t){return i.prototype[e].apply(this,t)}return function(){var e,i=this._super,o=this._superApply;return this._super=t,this._superApply=n,e=s.apply(this,arguments),this._super=i,this._superApply=o,e}}(),void 0):(r[e]=s,void 0)}),o.prototype=t.widget.extend(a,{widgetEventPrefix:n?a.widgetEventPrefix||e:e},r,{constructor:o,namespace:h,widgetName:e,widgetFullName:l}),n?(t.each(n._childConstructors,function(e,i){var s=i.prototype;t.widget(s.namespace+"."+s.widgetName,o,i._proto)}),delete n._childConstructors):i._childConstructors.push(o),t.widget.bridge(e,o),o},t.widget.extend=function(e){for(var i,n,o=s.call(arguments,1),a=0,r=o.length;r>a;a++)for(i in o[a])n=o[a][i],o[a].hasOwnProperty(i)&&void 0!==n&&(e[i]=t.isPlainObject(n)?t.isPlainObject(e[i])?t.widget.extend({},e[i],n):t.widget.extend({},n):n);return e},t.widget.bridge=function(e,i){var n=i.prototype.widgetFullName||e;t.fn[e]=function(o){var a="string"==typeof o,r=s.call(arguments,1),h=this;return a?this.length||"instance"!==o?this.each(function(){var i,s=t.data(this,n);return"instance"===o?(h=s,!1):s?t.isFunction(s[o])&&"_"!==o.charAt(0)?(i=s[o].apply(s,r),i!==s&&void 0!==i?(h=i&&i.jquery?h.pushStack(i.get()):i,!1):void 0):t.error("no such method '"+o+"' for "+e+" widget instance"):t.error("cannot call methods on "+e+" prior to initialization; "+"attempted to call method '"+o+"'")}):h=void 0:(r.length&&(o=t.widget.extend.apply(null,[o].concat(r))),this.each(function(){var e=t.data(this,n);e?(e.option(o||{}),e._init&&e._init()):t.data(this,n,new i(o,this))})),h}},t.Widget=function(){},t.Widget._childConstructors=[],t.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"<div>",options:{classes:{},disabled:!1,create:null},_createWidget:function(e,s){s=t(s||this.defaultElement||this)[0],this.element=t(s),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=t(),this.hoverable=t(),this.focusable=t(),this.classesElementLookup={},s!==this&&(t.data(s,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===s&&this.destroy()}}),this.document=t(s.style?s.ownerDocument:s.document||s),this.window=t(this.document[0].defaultView||this.document[0].parentWindow)),this.options=t.widget.extend({},this.options,this._getCreateOptions(),e),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:t.noop,_create:t.noop,_init:t.noop,destroy:function(){var e=this;this._destroy(),t.each(this.classesElementLookup,function(t,i){e._removeClass(i,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:t.noop,widget:function(){return this.element},option:function(e,i){var s,n,o,a=e;if(0===arguments.length)return t.widget.extend({},this.options);if("string"==typeof e)if(a={},s=e.split("."),e=s.shift(),s.length){for(n=a[e]=t.widget.extend({},this.options[e]),o=0;s.length-1>o;o++)n[s[o]]=n[s[o]]||{},n=n[s[o]];if(e=s.pop(),1===arguments.length)return void 0===n[e]?null:n[e];n[e]=i}else{if(1===arguments.length)return void 0===this.options[e]?null:this.options[e];a[e]=i}return this._setOptions(a),this},_setOptions:function(t){var e;for(e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(e){var i,s,n;for(i in e)n=this.classesElementLookup[i],e[i]!==this.options.classes[i]&&n&&n.length&&(s=t(n.get()),this._removeClass(n,i),s.addClass(this._classes({element:s,keys:i,classes:e,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(e){function i(i,o){var a,r;for(r=0;i.length>r;r++)a=n.classesElementLookup[i[r]]||t(),a=e.add?t(t.unique(a.get().concat(e.element.get()))):t(a.not(e.element).get()),n.classesElementLookup[i[r]]=a,s.push(i[r]),o&&e.classes[i[r]]&&s.push(e.classes[i[r]])}var s=[],n=this;return e=t.extend({element:this.element,classes:this.options.classes||{}},e),this._on(e.element,{remove:"_untrackClassesElement"}),e.keys&&i(e.keys.match(/\S+/g)||[],!0),e.extra&&i(e.extra.match(/\S+/g)||[]),s.join(" ")},_untrackClassesElement:function(e){var i=this;t.each(i.classesElementLookup,function(s,n){-1!==t.inArray(e.target,n)&&(i.classesElementLookup[s]=t(n.not(e.target).get()))})},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){s="boolean"==typeof s?s:i;var n="string"==typeof t||null===t,o={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s};return o.element.toggleClass(this._classes(o),s),this},_on:function(e,i,s){var n,o=this;"boolean"!=typeof e&&(s=i,i=e,e=!1),s?(i=n=t(i),this.bindings=this.bindings.add(i)):(s=i,i=this.element,n=this.widget()),t.each(s,function(s,a){function r(){return e||o.options.disabled!==!0&&!t(this).hasClass("ui-state-disabled")?("string"==typeof a?o[a]:a).apply(o,arguments):void 0}"string"!=typeof a&&(r.guid=a.guid=a.guid||r.guid||t.guid++);var h=s.match(/^([\w:-]*)\s*(.*)$/),l=h[1]+o.eventNamespace,c=h[2];c?n.on(l,c,r):i.on(l,r)})},_off:function(e,i){i=(i||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,e.off(i).off(i),this.bindings=t(this.bindings.not(e).get()),this.focusable=t(this.focusable.not(e).get()),this.hoverable=t(this.hoverable.not(e).get())},_delay:function(t,e){function i(){return("string"==typeof t?s[t]:t).apply(s,arguments)}var s=this;return setTimeout(i,e||0)},_hoverable:function(e){this.hoverable=this.hoverable.add(e),this._on(e,{mouseenter:function(e){this._addClass(t(e.currentTarget),null,"ui-state-hover")},mouseleave:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-hover")}})},_focusable:function(e){this.focusable=this.focusable.add(e),this._on(e,{focusin:function(e){this._addClass(t(e.currentTarget),null,"ui-state-focus")},focusout:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-focus")}})},_trigger:function(e,i,s){var n,o,a=this.options[e];if(s=s||{},i=t.Event(i),i.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase(),i.target=this.element[0],o=i.originalEvent)for(n in o)n in i||(i[n]=o[n]);return this.element.trigger(i,s),!(t.isFunction(a)&&a.apply(this.element[0],[i].concat(s))===!1||i.isDefaultPrevented())}},t.each({show:"fadeIn",hide:"fadeOut"},function(e,i){t.Widget.prototype["_"+e]=function(s,n,o){"string"==typeof n&&(n={effect:n});var a,r=n?n===!0||"number"==typeof n?i:n.effect||i:e;n=n||{},"number"==typeof n&&(n={duration:n}),a=!t.isEmptyObject(n),n.complete=o,n.delay&&s.delay(n.delay),a&&t.effects&&t.effects.effect[r]?s[e](n):r!==e&&s[r]?s[r](n.duration,n.easing,o):s.queue(function(i){t(this)[e](),o&&o.call(s[0]),i()})}}),t.widget,function(){function e(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function i(e,i){return parseInt(t.css(e,i),10)||0}function s(e){var i=e[0];return 9===i.nodeType?{width:e.width(),height:e.height(),offset:{top:0,left:0}}:t.isWindow(i)?{width:e.width(),height:e.height(),offset:{top:e.scrollTop(),left:e.scrollLeft()}}:i.preventDefault?{width:0,height:0,offset:{top:i.pageY,left:i.pageX}}:{width:e.outerWidth(),height:e.outerHeight(),offset:e.offset()}}var n,o=Math.max,a=Math.abs,r=/left|center|right/,h=/top|center|bottom/,l=/[\+\-]\d+(\.[\d]+)?%?/,c=/^\w+/,u=/%$/,d=t.fn.position;t.position={scrollbarWidth:function(){if(void 0!==n)return n;var e,i,s=t("<div style='display:block;position:absolute;width:50px;height:50px;overflow:hidden;'><div style='height:100px;width:auto;'></div></div>"),o=s.children()[0];return t("body").append(s),e=o.offsetWidth,s.css("overflow","scroll"),i=o.offsetWidth,e===i&&(i=s[0].clientWidth),s.remove(),n=e-i},getScrollInfo:function(e){var i=e.isWindow||e.isDocument?"":e.element.css("overflow-x"),s=e.isWindow||e.isDocument?"":e.element.css("overflow-y"),n="scroll"===i||"auto"===i&&e.width<e.element[0].scrollWidth,o="scroll"===s||"auto"===s&&e.height<e.element[0].scrollHeight;return{width:o?t.position.scrollbarWidth():0,height:n?t.position.scrollbarWidth():0}},getWithinInfo:function(e){var i=t(e||window),s=t.isWindow(i[0]),n=!!i[0]&&9===i[0].nodeType,o=!s&&!n;return{element:i,isWindow:s,isDocument:n,offset:o?t(e).offset():{left:0,top:0},scrollLeft:i.scrollLeft(),scrollTop:i.scrollTop(),width:i.outerWidth(),height:i.outerHeight()}}},t.fn.position=function(n){if(!n||!n.of)return d.apply(this,arguments);n=t.extend({},n);var u,p,f,m,g,_,v=t(n.of),b=t.position.getWithinInfo(n.within),y=t.position.getScrollInfo(b),w=(n.collision||"flip").split(" "),x={};return _=s(v),v[0].preventDefault&&(n.at="left top"),p=_.width,f=_.height,m=_.offset,g=t.extend({},m),t.each(["my","at"],function(){var t,e,i=(n[this]||"").split(" ");1===i.length&&(i=r.test(i[0])?i.concat(["center"]):h.test(i[0])?["center"].concat(i):["center","center"]),i[0]=r.test(i[0])?i[0]:"center",i[1]=h.test(i[1])?i[1]:"center",t=l.exec(i[0]),e=l.exec(i[1]),x[this]=[t?t[0]:0,e?e[0]:0],n[this]=[c.exec(i[0])[0],c.exec(i[1])[0]]}),1===w.length&&(w[1]=w[0]),"right"===n.at[0]?g.left+=p:"center"===n.at[0]&&(g.left+=p/2),"bottom"===n.at[1]?g.top+=f:"center"===n.at[1]&&(g.top+=f/2),u=e(x.at,p,f),g.left+=u[0],g.top+=u[1],this.each(function(){var s,r,h=t(this),l=h.outerWidth(),c=h.outerHeight(),d=i(this,"marginLeft"),_=i(this,"marginTop"),k=l+d+i(this,"marginRight")+y.width,C=c+_+i(this,"marginBottom")+y.height,D=t.extend({},g),T=e(x.my,h.outerWidth(),h.outerHeight());"right"===n.my[0]?D.left-=l:"center"===n.my[0]&&(D.left-=l/2),"bottom"===n.my[1]?D.top-=c:"center"===n.my[1]&&(D.top-=c/2),D.left+=T[0],D.top+=T[1],s={marginLeft:d,marginTop:_},t.each(["left","top"],function(e,i){t.ui.position[w[e]]&&t.ui.position[w[e]][i](D,{targetWidth:p,targetHeight:f,elemWidth:l,elemHeight:c,collisionPosition:s,collisionWidth:k,collisionHeight:C,offset:[u[0]+T[0],u[1]+T[1]],my:n.my,at:n.at,within:b,elem:h})}),n.using&&(r=function(t){var e=m.left-D.left,i=e+p-l,s=m.top-D.top,r=s+f-c,u={target:{element:v,left:m.left,top:m.top,width:p,height:f},element:{element:h,left:D.left,top:D.top,width:l,height:c},horizontal:0>i?"left":e>0?"right":"center",vertical:0>r?"top":s>0?"bottom":"middle"};l>p&&p>a(e+i)&&(u.horizontal="center"),c>f&&f>a(s+r)&&(u.vertical="middle"),u.important=o(a(e),a(i))>o(a(s),a(r))?"horizontal":"vertical",n.using.call(this,t,u)}),h.offset(t.extend(D,{using:r}))})},t.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,a=s.width,r=t.left-e.collisionPosition.marginLeft,h=n-r,l=r+e.collisionWidth-a-n;e.collisionWidth>a?h>0&&0>=l?(i=t.left+h+e.collisionWidth-a-n,t.left+=h-i):t.left=l>0&&0>=h?n:h>l?n+a-e.collisionWidth:n:h>0?t.left+=h:l>0?t.left-=l:t.left=o(t.left-r,t.left)},top:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollTop:s.offset.top,a=e.within.height,r=t.top-e.collisionPosition.marginTop,h=n-r,l=r+e.collisionHeight-a-n;e.collisionHeight>a?h>0&&0>=l?(i=t.top+h+e.collisionHeight-a-n,t.top+=h-i):t.top=l>0&&0>=h?n:h>l?n+a-e.collisionHeight:n:h>0?t.top+=h:l>0?t.top-=l:t.top=o(t.top-r,t.top)}},flip:{left:function(t,e){var i,s,n=e.within,o=n.offset.left+n.scrollLeft,r=n.width,h=n.isWindow?n.scrollLeft:n.offset.left,l=t.left-e.collisionPosition.marginLeft,c=l-h,u=l+e.collisionWidth-r-h,d="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,p="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,f=-2*e.offset[0];0>c?(i=t.left+d+p+f+e.collisionWidth-r-o,(0>i||a(c)>i)&&(t.left+=d+p+f)):u>0&&(s=t.left-e.collisionPosition.marginLeft+d+p+f-h,(s>0||u>a(s))&&(t.left+=d+p+f))},top:function(t,e){var i,s,n=e.within,o=n.offset.top+n.scrollTop,r=n.height,h=n.isWindow?n.scrollTop:n.offset.top,l=t.top-e.collisionPosition.marginTop,c=l-h,u=l+e.collisionHeight-r-h,d="top"===e.my[1],p=d?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,f="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,m=-2*e.offset[1];0>c?(s=t.top+p+f+m+e.collisionHeight-r-o,(0>s||a(c)>s)&&(t.top+=p+f+m)):u>0&&(i=t.top-e.collisionPosition.marginTop+p+f+m-h,(i>0||u>a(i))&&(t.top+=p+f+m))}},flipfit:{left:function(){t.ui.position.flip.left.apply(this,arguments),t.ui.position.fit.left.apply(this,arguments)},top:function(){t.ui.position.flip.top.apply(this,arguments),t.ui.position.fit.top.apply(this,arguments)}}}}(),t.ui.position,t.extend(t.expr[":"],{data:t.expr.createPseudo?t.expr.createPseudo(function(e){return function(i){return!!t.data(i,e)}}):function(e,i,s){return!!t.data(e,s[3])}}),t.fn.extend({disableSelection:function(){var t="onselectstart"in document.createElement("div")?"selectstart":"mousedown";return function(){return this.on(t+".ui-disableSelection",function(t){t.preventDefault()})}}(),enableSelection:function(){return this.off(".ui-disableSelection")}}),t.ui.focusable=function(i,s){var n,o,a,r,h,l=i.nodeName.toLowerCase();return"area"===l?(n=i.parentNode,o=n.name,i.href&&o&&"map"===n.nodeName.toLowerCase()?(a=t("img[usemap='#"+o+"']"),a.length>0&&a.is(":visible")):!1):(/^(input|select|textarea|button|object)$/.test(l)?(r=!i.disabled,r&&(h=t(i).closest("fieldset")[0],h&&(r=!h.disabled))):r="a"===l?i.href||s:s,r&&t(i).is(":visible")&&e(t(i)))},t.extend(t.expr[":"],{focusable:function(e){return t.ui.focusable(e,null!=t.attr(e,"tabindex"))}}),t.ui.focusable,t.fn.form=function(){return"string"==typeof this[0].form?this.closest("form"):t(this[0].form)},t.ui.formResetMixin={_formResetHandler:function(){var e=t(this);setTimeout(function(){var i=e.data("ui-form-reset-instances");t.each(i,function(){this.refresh()})})},_bindFormResetHandler:function(){if(this.form=this.element.form(),this.form.length){var t=this.form.data("ui-form-reset-instances")||[];t.length||this.form.on("reset.ui-form-reset",this._formResetHandler),t.push(this),this.form.data("ui-form-reset-instances",t)}},_unbindFormResetHandler:function(){if(this.form.length){var e=this.form.data("ui-form-reset-instances");e.splice(t.inArray(this,e),1),e.length?this.form.data("ui-form-reset-instances",e):this.form.removeData("ui-form-reset-instances").off("reset.ui-form-reset")}}},"1.7"===t.fn.jquery.substring(0,3)&&(t.each(["Width","Height"],function(e,i){function s(e,i,s,o){return t.each(n,function(){i-=parseFloat(t.css(e,"padding"+this))||0,s&&(i-=parseFloat(t.css(e,"border"+this+"Width"))||0),o&&(i-=parseFloat(t.css(e,"margin"+this))||0)}),i}var n="Width"===i?["Left","Right"]:["Top","Bottom"],o=i.toLowerCase(),a={innerWidth:t.fn.innerWidth,innerHeight:t.fn.innerHeight,outerWidth:t.fn.outerWidth,outerHeight:t.fn.outerHeight};t.fn["inner"+i]=function(e){return void 0===e?a["inner"+i].call(this):this.each(function(){t(this).css(o,s(this,e)+"px")})},t.fn["outer"+i]=function(e,n){return"number"!=typeof e?a["outer"+i].call(this,e):this.each(function(){t(this).css(o,s(this,e,!0,n)+"px")})}}),t.fn.addBack=function(t){return this.add(null==t?this.prevObject:this.prevObject.filter(t))}),t.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},t.ui.escapeSelector=function(){var t=/([!"#$%&'()*+,./:;<=>?@[\]^`{|}~])/g;return function(e){return e.replace(t,"\\$1")}}(),t.fn.labels=function(){var e,i,s,n,o;return this[0].labels&&this[0].labels.length?this.pushStack(this[0].labels):(n=this.eq(0).parents("label"),s=this.attr("id"),s&&(e=this.eq(0).parents().last(),o=e.add(e.length?e.siblings():this.siblings()),i="label[for='"+t.ui.escapeSelector(s)+"']",n=n.add(o.find(i).addBack(i))),this.pushStack(n))},t.fn.scrollParent=function(e){var i=this.css("position"),s="absolute"===i,n=e?/(auto|scroll|hidden)/:/(auto|scroll)/,o=this.parents().filter(function(){var e=t(this);return s&&"static"===e.css("position")?!1:n.test(e.css("overflow")+e.css("overflow-y")+e.css("overflow-x"))}).eq(0);return"fixed"!==i&&o.length?o:t(this[0].ownerDocument||document)},t.extend(t.expr[":"],{tabbable:function(e){var i=t.attr(e,"tabindex"),s=null!=i;return(!s||i>=0)&&t.ui.focusable(e,s)}}),t.fn.extend({uniqueId:function(){var t=0;return function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}}(),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&t(this).removeAttr("id")})}}),t.ui.ie=!!/msie [\w.]+/.exec(navigator.userAgent.toLowerCase());var n=!1;t(document).on("mouseup",function(){n=!1}),t.widget("ui.mouse",{version:"1.12.1",options:{cancel:"input, textarea, button, select, option",distance:1,delay:0},_mouseInit:function(){var e=this;this.element.on("mousedown."+this.widgetName,function(t){return e._mouseDown(t)}).on("click."+this.widgetName,function(i){return!0===t.data(i.target,e.widgetName+".preventClickEvent")?(t.removeData(i.target,e.widgetName+".preventClickEvent"),i.stopImmediatePropagation(),!1):void 0}),this.started=!1},_mouseDestroy:function(){this.element.off("."+this.widgetName),this._mouseMoveDelegate&&this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate)},_mouseDown:function(e){if(!n){this._mouseMoved=!1,this._mouseStarted&&this._mouseUp(e),this._mouseDownEvent=e;var i=this,s=1===e.which,o="string"==typeof this.options.cancel&&e.target.nodeName?t(e.target).closest(this.options.cancel).length:!1;return s&&!o&&this._mouseCapture(e)?(this.mouseDelayMet=!this.options.delay,this.mouseDelayMet||(this._mouseDelayTimer=setTimeout(function(){i.mouseDelayMet=!0},this.options.delay)),this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(e)!==!1,!this._mouseStarted)?(e.preventDefault(),!0):(!0===t.data(e.target,this.widgetName+".preventClickEvent")&&t.removeData(e.target,this.widgetName+".preventClickEvent"),this._mouseMoveDelegate=function(t){return i._mouseMove(t)},this._mouseUpDelegate=function(t){return i._mouseUp(t)},this.document.on("mousemove."+this.widgetName,this._mouseMoveDelegate).on("mouseup."+this.widgetName,this._mouseUpDelegate),e.preventDefault(),n=!0,!0)):!0}},_mouseMove:function(e){if(this._mouseMoved){if(t.ui.ie&&(!document.documentMode||9>document.documentMode)&&!e.button)return this._mouseUp(e);if(!e.which)if(e.originalEvent.altKey||e.originalEvent.ctrlKey||e.originalEvent.metaKey||e.originalEvent.shiftKey)this.ignoreMissingWhich=!0;else if(!this.ignoreMissingWhich)return this._mouseUp(e)}return(e.which||e.button)&&(this._mouseMoved=!0),this._mouseStarted?(this._mouseDrag(e),e.preventDefault()):(this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(this._mouseDownEvent,e)!==!1,this._mouseStarted?this._mouseDrag(e):this._mouseUp(e)),!this._mouseStarted)},_mouseUp:function(e){this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate),this._mouseStarted&&(this._mouseStarted=!1,e.target===this._mouseDownEvent.target&&t.data(e.target,this.widgetName+".preventClickEvent",!0),this._mouseStop(e)),this._mouseDelayTimer&&(clearTimeout(this._mouseDelayTimer),delete this._mouseDelayTimer),this.ignoreMissingWhich=!1,n=!1,e.preventDefault()},_mouseDistanceMet:function(t){return Math.max(Math.abs(this._mouseDownEvent.pageX-t.pageX),Math.abs(this._mouseDownEvent.pageY-t.pageY))>=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),t.ui.plugin={add:function(e,i,s){var n,o=t.ui[e].prototype;for(n in s)o.plugins[n]=o.plugins[n]||[],o.plugins[n].push([i,s[n]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;o.length>n;n++)t.options[o[n][0]]&&o[n][1].apply(t.element,i)}},t.widget("ui.resizable",t.ui.mouse,{version:"1.12.1",widgetEventPrefix:"resize",options:{alsoResize:!1,animate:!1,animateDuration:"slow",animateEasing:"swing",aspectRatio:!1,autoHide:!1,classes:{"ui-resizable-se":"ui-icon ui-icon-gripsmall-diagonal-se"},containment:!1,ghost:!1,grid:!1,handles:"e,s,se",helper:!1,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:90,resize:null,start:null,stop:null},_num:function(t){return parseFloat(t)||0},_isNumber:function(t){return!isNaN(parseFloat(t))},_hasScroll:function(e,i){if("hidden"===t(e).css("overflow"))return!1;var s=i&&"left"===i?"scrollLeft":"scrollTop",n=!1;return e[s]>0?!0:(e[s]=1,n=e[s]>0,e[s]=0,n)},_create:function(){var e,i=this.options,s=this;this._addClass("ui-resizable"),t.extend(this,{_aspectRatio:!!i.aspectRatio,aspectRatio:i.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:i.helper||i.ghost||i.animate?i.helper||"ui-resizable-helper":null}),this.element[0].nodeName.match(/^(canvas|textarea|input|select|button|img)$/i)&&(this.element.wrap(t("<div class='ui-wrapper' style='overflow: hidden;'></div>").css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})),this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,e={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(e),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(e),this._proportionallyResize()),this._setupHandles(),i.autoHide&&t(this.element).on("mouseenter",function(){i.disabled||(s._removeClass("ui-resizable-autohide"),s._handles.show())}).on("mouseleave",function(){i.disabled||s.resizing||(s._addClass("ui-resizable-autohide"),s._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy();var e,i=function(e){t(e).removeData("resizable").removeData("ui-resizable").off(".resizable").find(".ui-resizable-handle").remove()};return this.elementIsWrapper&&(i(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),i(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;default:}},_setupHandles:function(){var e,i,s,n,o,a=this.options,r=this;if(this.handles=a.handles||(t(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=t(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),s=this.handles.split(","),this.handles={},i=0;s.length>i;i++)e=t.trim(s[i]),n="ui-resizable-"+e,o=t("<div>"),this._addClass(o,"ui-resizable-handle "+n),o.css({zIndex:a.zIndex}),this.handles[e]=".ui-resizable-"+e,this.element.append(o);this._renderAxis=function(e){var i,s,n,o;e=e||this.element;for(i in this.handles)this.handles[i].constructor===String?this.handles[i]=this.element.children(this.handles[i]).first().show():(this.handles[i].jquery||this.handles[i].nodeType)&&(this.handles[i]=t(this.handles[i]),this._on(this.handles[i],{mousedown:r._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(s=t(this.handles[i],this.element),o=/sw|ne|nw|se|n|s/.test(i)?s.outerHeight():s.outerWidth(),n=["padding",/ne|nw|n/.test(i)?"Top":/se|sw|s/.test(i)?"Bottom":/^e$/.test(i)?"Right":"Left"].join(""),e.css(n,o),this._proportionallyResize()),this._handles=this._handles.add(this.handles[i])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){r.resizing||(this.className&&(o=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),r.axis=o&&o[1]?o[1]:"se")}),a.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._handles.remove()},_mouseCapture:function(e){var i,s,n=!1;for(i in this.handles)s=t(this.handles[i])[0],(s===e.target||t.contains(s,e.target))&&(n=!0);return!this.options.disabled&&n},_mouseStart:function(e){var i,s,n,o=this.options,a=this.element;return this.resizing=!0,this._renderProxy(),i=this._num(this.helper.css("left")),s=this._num(this.helper.css("top")),o.containment&&(i+=t(o.containment).scrollLeft()||0,s+=t(o.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:i,top:s},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{width:a.width(),height:a.height()},this.originalSize=this._helper?{width:a.outerWidth(),height:a.outerHeight()}:{width:a.width(),height:a.height()},this.sizeDiff={width:a.outerWidth()-a.width(),height:a.outerHeight()-a.height()},this.originalPosition={left:i,top:s},this.originalMousePosition={left:e.pageX,top:e.pageY},this.aspectRatio="number"==typeof o.aspectRatio?o.aspectRatio:this.originalSize.width/this.originalSize.height||1,n=t(".ui-resizable-"+this.axis).css("cursor"),t("body").css("cursor","auto"===n?this.axis+"-resize":n),this._addClass("ui-resizable-resizing"),this._propagate("start",e),!0},_mouseDrag:function(e){var i,s,n=this.originalMousePosition,o=this.axis,a=e.pageX-n.left||0,r=e.pageY-n.top||0,h=this._change[o];return this._updatePrevProperties(),h?(i=h.apply(this,[e,a,r]),this._updateVirtualBoundaries(e.shiftKey),(this._aspectRatio||e.shiftKey)&&(i=this._updateRatio(i,e)),i=this._respectSize(i,e),this._updateCache(i),this._propagate("resize",e),s=this._applyChanges(),!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),t.isEmptyObject(s)||(this._updatePrevProperties(),this._trigger("resize",e,this.ui()),this._applyChanges()),!1):!1},_mouseStop:function(e){this.resizing=!1;var i,s,n,o,a,r,h,l=this.options,c=this;return this._helper&&(i=this._proportionallyResizeElements,s=i.length&&/textarea/i.test(i[0].nodeName),n=s&&this._hasScroll(i[0],"left")?0:c.sizeDiff.height,o=s?0:c.sizeDiff.width,a={width:c.helper.width()-o,height:c.helper.height()-n},r=parseFloat(c.element.css("left"))+(c.position.left-c.originalPosition.left)||null,h=parseFloat(c.element.css("top"))+(c.position.top-c.originalPosition.top)||null,l.animate||this.element.css(t.extend(a,{top:h,left:r})),c.helper.height(c.size.height),c.helper.width(c.size.width),this._helper&&!l.animate&&this._proportionallyResize()),t("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",e),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s,n,o,a=this.options;o={minWidth:this._isNumber(a.minWidth)?a.minWidth:0,maxWidth:this._isNumber(a.maxWidth)?a.maxWidth:1/0,minHeight:this._isNumber(a.minHeight)?a.minHeight:0,maxHeight:this._isNumber(a.maxHeight)?a.maxHeight:1/0},(this._aspectRatio||t)&&(e=o.minHeight*this.aspectRatio,s=o.minWidth/this.aspectRatio,i=o.maxHeight*this.aspectRatio,n=o.maxWidth/this.aspectRatio,e>o.minWidth&&(o.minWidth=e),s>o.minHeight&&(o.minHeight=s),o.maxWidth>i&&(o.maxWidth=i),o.maxHeight>n&&(o.maxHeight=n)),this._vBoundaries=o},_updateCache:function(t){this.offset=this.helper.offset(),this._isNumber(t.left)&&(this.position.left=t.left),this._isNumber(t.top)&&(this.position.top=t.top),this._isNumber(t.height)&&(this.size.height=t.height),this._isNumber(t.width)&&(this.size.width=t.width)},_updateRatio:function(t){var e=this.position,i=this.size,s=this.axis;return this._isNumber(t.height)?t.width=t.height*this.aspectRatio:this._isNumber(t.width)&&(t.height=t.width/this.aspectRatio),"sw"===s&&(t.left=e.left+(i.width-t.width),t.top=null),"nw"===s&&(t.top=e.top+(i.height-t.height),t.left=e.left+(i.width-t.width)),t},_respectSize:function(t){var e=this._vBoundaries,i=this.axis,s=this._isNumber(t.width)&&e.maxWidth&&e.maxWidth<t.width,n=this._isNumber(t.height)&&e.maxHeight&&e.maxHeight<t.height,o=this._isNumber(t.width)&&e.minWidth&&e.minWidth>t.width,a=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,r=this.originalPosition.left+this.originalSize.width,h=this.originalPosition.top+this.originalSize.height,l=/sw|nw|w/.test(i),c=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),a&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=r-e.minWidth),s&&l&&(t.left=r-e.maxWidth),a&&c&&(t.top=h-e.minHeight),n&&c&&(t.top=h-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];4>e;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;this._proportionallyResizeElements.length>e;e++)t=this._proportionallyResizeElements[e],this.outerDimensions||(this.outerDimensions=this._getPaddingPlusBorderDimensions(t)),t.css({height:i.height()-this.outerDimensions.height||0,width:i.width()-this.outerDimensions.width||0})},_renderProxy:function(){var e=this.element,i=this.options;this.elementOffset=e.offset(),this._helper?(this.helper=this.helper||t("<div style='overflow:hidden;'></div>"),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++i.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element
+},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize,s=this.originalPosition;return{left:s.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize,n=this.originalPosition;return{top:n.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},sw:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[e,i,s]))},ne:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},nw:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[e,i,s]))}},_propagate:function(e,i){t.ui.plugin.call(this,e,[i,this.ui()]),"resize"!==e&&this._trigger(e,i,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),t.ui.plugin.add("resizable","animate",{stop:function(e){var i=t(this).resizable("instance"),s=i.options,n=i._proportionallyResizeElements,o=n.length&&/textarea/i.test(n[0].nodeName),a=o&&i._hasScroll(n[0],"left")?0:i.sizeDiff.height,r=o?0:i.sizeDiff.width,h={width:i.size.width-r,height:i.size.height-a},l=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left)||null,c=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(t.extend(h,c&&l?{top:c,left:l}:{}),{duration:s.animateDuration,easing:s.animateEasing,step:function(){var s={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};n&&n.length&&t(n[0]).css({width:s.width,height:s.height}),i._updateCache(s),i._propagate("resize",e)}})}}),t.ui.plugin.add("resizable","containment",{start:function(){var e,i,s,n,o,a,r,h=t(this).resizable("instance"),l=h.options,c=h.element,u=l.containment,d=u instanceof t?u.get(0):/parent/.test(u)?c.parent().get(0):u;d&&(h.containerElement=t(d),/document/.test(u)||u===document?(h.containerOffset={left:0,top:0},h.containerPosition={left:0,top:0},h.parentData={element:t(document),left:0,top:0,width:t(document).width(),height:t(document).height()||document.body.parentNode.scrollHeight}):(e=t(d),i=[],t(["Top","Right","Left","Bottom"]).each(function(t,s){i[t]=h._num(e.css("padding"+s))}),h.containerOffset=e.offset(),h.containerPosition=e.position(),h.containerSize={height:e.innerHeight()-i[3],width:e.innerWidth()-i[1]},s=h.containerOffset,n=h.containerSize.height,o=h.containerSize.width,a=h._hasScroll(d,"left")?d.scrollWidth:o,r=h._hasScroll(d)?d.scrollHeight:n,h.parentData={element:d,left:s.left,top:s.top,width:a,height:r}))},resize:function(e){var i,s,n,o,a=t(this).resizable("instance"),r=a.options,h=a.containerOffset,l=a.position,c=a._aspectRatio||e.shiftKey,u={top:0,left:0},d=a.containerElement,p=!0;d[0]!==document&&/static/.test(d.css("position"))&&(u=h),l.left<(a._helper?h.left:0)&&(a.size.width=a.size.width+(a._helper?a.position.left-h.left:a.position.left-u.left),c&&(a.size.height=a.size.width/a.aspectRatio,p=!1),a.position.left=r.helper?h.left:0),l.top<(a._helper?h.top:0)&&(a.size.height=a.size.height+(a._helper?a.position.top-h.top:a.position.top),c&&(a.size.width=a.size.height*a.aspectRatio,p=!1),a.position.top=a._helper?h.top:0),n=a.containerElement.get(0)===a.element.parent().get(0),o=/relative|absolute/.test(a.containerElement.css("position")),n&&o?(a.offset.left=a.parentData.left+a.position.left,a.offset.top=a.parentData.top+a.position.top):(a.offset.left=a.element.offset().left,a.offset.top=a.element.offset().top),i=Math.abs(a.sizeDiff.width+(a._helper?a.offset.left-u.left:a.offset.left-h.left)),s=Math.abs(a.sizeDiff.height+(a._helper?a.offset.top-u.top:a.offset.top-h.top)),i+a.size.width>=a.parentData.width&&(a.size.width=a.parentData.width-i,c&&(a.size.height=a.size.width/a.aspectRatio,p=!1)),s+a.size.height>=a.parentData.height&&(a.size.height=a.parentData.height-s,c&&(a.size.width=a.size.height*a.aspectRatio,p=!1)),p||(a.position.left=a.prevPosition.left,a.position.top=a.prevPosition.top,a.size.width=a.prevSize.width,a.size.height=a.prevSize.height)},stop:function(){var e=t(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.containerPosition,o=e.containerElement,a=t(e.helper),r=a.offset(),h=a.outerWidth()-e.sizeDiff.width,l=a.outerHeight()-e.sizeDiff.height;e._helper&&!i.animate&&/relative/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l}),e._helper&&!i.animate&&/static/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l})}}),t.ui.plugin.add("resizable","alsoResize",{start:function(){var e=t(this).resizable("instance"),i=e.options;t(i.alsoResize).each(function(){var e=t(this);e.data("ui-resizable-alsoresize",{width:parseFloat(e.width()),height:parseFloat(e.height()),left:parseFloat(e.css("left")),top:parseFloat(e.css("top"))})})},resize:function(e,i){var s=t(this).resizable("instance"),n=s.options,o=s.originalSize,a=s.originalPosition,r={height:s.size.height-o.height||0,width:s.size.width-o.width||0,top:s.position.top-a.top||0,left:s.position.left-a.left||0};t(n.alsoResize).each(function(){var e=t(this),s=t(this).data("ui-resizable-alsoresize"),n={},o=e.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];t.each(o,function(t,e){var i=(s[e]||0)+(r[e]||0);i&&i>=0&&(n[e]=i||null)}),e.css(n)})},stop:function(){t(this).removeData("ui-resizable-alsoresize")}}),t.ui.plugin.add("resizable","ghost",{start:function(){var e=t(this).resizable("instance"),i=e.size;e.ghost=e.originalElement.clone(),e.ghost.css({opacity:.25,display:"block",position:"relative",height:i.height,width:i.width,margin:0,left:0,top:0}),e._addClass(e.ghost,"ui-resizable-ghost"),t.uiBackCompat!==!1&&"string"==typeof e.options.ghost&&e.ghost.addClass(this.options.ghost),e.ghost.appendTo(e.helper)},resize:function(){var e=t(this).resizable("instance");e.ghost&&e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})},stop:function(){var e=t(this).resizable("instance");e.ghost&&e.helper&&e.helper.get(0).removeChild(e.ghost.get(0))}}),t.ui.plugin.add("resizable","grid",{resize:function(){var e,i=t(this).resizable("instance"),s=i.options,n=i.size,o=i.originalSize,a=i.originalPosition,r=i.axis,h="number"==typeof s.grid?[s.grid,s.grid]:s.grid,l=h[0]||1,c=h[1]||1,u=Math.round((n.width-o.width)/l)*l,d=Math.round((n.height-o.height)/c)*c,p=o.width+u,f=o.height+d,m=s.maxWidth&&p>s.maxWidth,g=s.maxHeight&&f>s.maxHeight,_=s.minWidth&&s.minWidth>p,v=s.minHeight&&s.minHeight>f;s.grid=h,_&&(p+=l),v&&(f+=c),m&&(p-=l),g&&(f-=c),/^(se|s|e)$/.test(r)?(i.size.width=p,i.size.height=f):/^(ne)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.top=a.top-d):/^(sw)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.left=a.left-u):((0>=f-c||0>=p-l)&&(e=i._getPaddingPlusBorderDimensions(this)),f-c>0?(i.size.height=f,i.position.top=a.top-d):(f=c-e.height,i.size.height=f,i.position.top=a.top+o.height-f),p-l>0?(i.size.width=p,i.position.left=a.left-u):(p=l-e.width,i.size.width=p,i.position.left=a.left+o.width-p))}}),t.ui.resizable});/**
+ * Copyright (c) 2007 Ariel Flesler - aflesler ○ gmail • com | https://github.com/flesler
+ * Licensed under MIT
+ * @author Ariel Flesler
+ * @version 2.1.2
+ */
+;(function(f){"use strict";"function"===typeof define&&define.amd?define(["jquery"],f):"undefined"!==typeof module&&module.exports?module.exports=f(require("jquery")):f(jQuery)})(function($){"use strict";function n(a){return!a.nodeName||-1!==$.inArray(a.nodeName.toLowerCase(),["iframe","#document","html","body"])}function h(a){return $.isFunction(a)||$.isPlainObject(a)?a:{top:a,left:a}}var p=$.scrollTo=function(a,d,b){return $(window).scrollTo(a,d,b)};p.defaults={axis:"xy",duration:0,limit:!0};$.fn.scrollTo=function(a,d,b){"object"=== typeof d&&(b=d,d=0);"function"===typeof b&&(b={onAfter:b});"max"===a&&(a=9E9);b=$.extend({},p.defaults,b);d=d||b.duration;var u=b.queue&&1<b.axis.length;u&&(d/=2);b.offset=h(b.offset);b.over=h(b.over);return this.each(function(){function k(a){var k=$.extend({},b,{queue:!0,duration:d,complete:a&&function(){a.call(q,e,b)}});r.animate(f,k)}if(null!==a){var l=n(this),q=l?this.contentWindow||window:this,r=$(q),e=a,f={},t;switch(typeof e){case "number":case "string":if(/^([+-]=?)?\d+(\.\d+)?(px|%)?$/.test(e)){e= h(e);break}e=l?$(e):$(e,q);case "object":if(e.length===0)return;if(e.is||e.style)t=(e=$(e)).offset()}var v=$.isFunction(b.offset)&&b.offset(q,e)||b.offset;$.each(b.axis.split(""),function(a,c){var d="x"===c?"Left":"Top",m=d.toLowerCase(),g="scroll"+d,h=r[g](),n=p.max(q,c);t?(f[g]=t[m]+(l?0:h-r.offset()[m]),b.margin&&(f[g]-=parseInt(e.css("margin"+d),10)||0,f[g]-=parseInt(e.css("border"+d+"Width"),10)||0),f[g]+=v[m]||0,b.over[m]&&(f[g]+=e["x"===c?"width":"height"]()*b.over[m])):(d=e[m],f[g]=d.slice&& "%"===d.slice(-1)?parseFloat(d)/100*n:d);b.limit&&/^\d+$/.test(f[g])&&(f[g]=0>=f[g]?0:Math.min(f[g],n));!a&&1<b.axis.length&&(h===f[g]?f={}:u&&(k(b.onAfterFirst),f={}))});k(b.onAfter)}})};p.max=function(a,d){var b="x"===d?"Width":"Height",h="scroll"+b;if(!n(a))return a[h]-$(a)[b.toLowerCase()]();var b="client"+b,k=a.ownerDocument||a.document,l=k.documentElement,k=k.body;return Math.max(l[h],k[h])-Math.min(l[b],k[b])};$.Tween.propHooks.scrollLeft=$.Tween.propHooks.scrollTop={get:function(a){return $(a.elem)[a.prop]()}, set:function(a){var d=this.get(a);if(a.options.interrupt&&a._last&&a._last!==d)return $(a.elem).stop();var b=Math.round(a.now);d!==b&&($(a.elem)[a.prop](b),a._last=this.get(a))}};return p});
 /*!
- * Sizzle CSS Selector Engine
- *  Copyright 2011, The Dojo Foundation
- *  Released under the MIT, BSD, and GPL Licenses.
- *  More information: http://sizzlejs.com/
- */
-(function(){var bH=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^\[\]]*\]|['"][^'"]*['"]|[^\[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,bC="sizcache"+(Math.random()+"").replace(".",""),bI=0,bL=Object.prototype.toString,bB=false,bA=true,bK=/\\/g,bO=/\r\n/g,bQ=/\W/;[0,0].sort(function(){bA=false;return 0});var by=function(bV,e,bY,bZ){bY=bY||[];e=e||av;var b1=e;if(e.nodeType!==1&&e.nodeType!==9){return[]}if(!bV||typeof bV!=="string"){return bY}var bS,b3,b6,bR,b2,b5,b4,bX,bU=true,bT=by.isXML(e),bW=[],b0=bV;do{bH.exec("");bS=bH.exec(b0);if(bS){b0=bS[3];bW.push(bS[1]);if(bS[2]){bR=bS[3];break}}}while(bS);if(bW.length>1&&bD.exec(bV)){if(bW.length===2&&bE.relative[bW[0]]){b3=bM(bW[0]+bW[1],e,bZ)}else{b3=bE.relative[bW[0]]?[e]:by(bW.shift(),e);while(bW.length){bV=bW.shift();if(bE.relative[bV]){bV+=bW.shift()}b3=bM(bV,b3,bZ)}}}else{if(!bZ&&bW.length>1&&e.nodeType===9&&!bT&&bE.match.ID.test(bW[0])&&!bE.match.ID.test(bW[bW.length-1])){b2=by.find(bW.shift(),e,bT);e=b2.expr?by.filter(b2.expr,b2.set)[0]:b2.set[0]}if(e){b2=bZ?{expr:bW.pop(),set:bF(bZ)}:by.find(bW.pop(),bW.length===1&&(bW[0]==="~"||bW[0]==="+")&&e.parentNode?e.parentNode:e,bT);b3=b2.expr?by.filter(b2.expr,b2.set):b2.set;if(bW.length>0){b6=bF(b3)}else{bU=false}while(bW.length){b5=bW.pop();b4=b5;if(!bE.relative[b5]){b5=""}else{b4=bW.pop()}if(b4==null){b4=e}bE.relative[b5](b6,b4,bT)}}else{b6=bW=[]}}if(!b6){b6=b3}if(!b6){by.error(b5||bV)}if(bL.call(b6)==="[object Array]"){if(!bU){bY.push.apply(bY,b6)}else{if(e&&e.nodeType===1){for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&(b6[bX]===true||b6[bX].nodeType===1&&by.contains(e,b6[bX]))){bY.push(b3[bX])}}}else{for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&b6[bX].nodeType===1){bY.push(b3[bX])}}}}}else{bF(b6,bY)}if(bR){by(bR,b1,bY,bZ);by.uniqueSort(bY)}return bY};by.uniqueSort=function(bR){if(bJ){bB=bA;bR.sort(bJ);if(bB){for(var e=1;e<bR.length;e++){if(bR[e]===bR[e-1]){bR.splice(e--,1)}}}}return bR};by.matches=function(e,bR){return by(e,null,null,bR)};by.matchesSelector=function(e,bR){return by(bR,null,null,[e]).length>0};by.find=function(bX,e,bY){var bW,bS,bU,bT,bV,bR;if(!bX){return[]}for(bS=0,bU=bE.order.length;bS<bU;bS++){bV=bE.order[bS];if((bT=bE.leftMatch[bV].exec(bX))){bR=bT[1];bT.splice(1,1);if(bR.substr(bR.length-1)!=="\\"){bT[1]=(bT[1]||"").replace(bK,"");bW=bE.find[bV](bT,e,bY);if(bW!=null){bX=bX.replace(bE.match[bV],"");break}}}}if(!bW){bW=typeof e.getElementsByTagName!=="undefined"?e.getElementsByTagName("*"):[]}return{set:bW,expr:bX}};by.filter=function(b1,b0,b4,bU){var bW,e,bZ,b6,b3,bR,bT,bV,b2,bS=b1,b5=[],bY=b0,bX=b0&&b0[0]&&by.isXML(b0[0]);while(b1&&b0.length){for(bZ in bE.filter){if((bW=bE.leftMatch[bZ].exec(b1))!=null&&bW[2]){bR=bE.filter[bZ];bT=bW[1];e=false;bW.splice(1,1);if(bT.substr(bT.length-1)==="\\"){continue}if(bY===b5){b5=[]}if(bE.preFilter[bZ]){bW=bE.preFilter[bZ](bW,bY,b4,b5,bU,bX);if(!bW){e=b6=true}else{if(bW===true){continue}}}if(bW){for(bV=0;(b3=bY[bV])!=null;bV++){if(b3){b6=bR(b3,bW,bV,bY);b2=bU^b6;if(b4&&b6!=null){if(b2){e=true}else{bY[bV]=false}}else{if(b2){b5.push(b3);e=true}}}}}if(b6!==L){if(!b4){bY=b5}b1=b1.replace(bE.match[bZ],"");if(!e){return[]}break}}}if(b1===bS){if(e==null){by.error(b1)}else{break}}bS=b1}return bY};by.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)};var bw=by.getText=function(bU){var bS,bT,e=bU.nodeType,bR="";if(e){if(e===1||e===9){if(typeof bU.textContent==="string"){return bU.textContent}else{if(typeof bU.innerText==="string"){return bU.innerText.replace(bO,"")}else{for(bU=bU.firstChild;bU;bU=bU.nextSibling){bR+=bw(bU)}}}}else{if(e===3||e===4){return bU.nodeValue}}}else{for(bS=0;(bT=bU[bS]);bS++){if(bT.nodeType!==8){bR+=bw(bT)}}}return bR};var bE=by.selectors={order:["ID","NAME","TAG"],match:{ID:/#((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,CLASS:/\.((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,NAME:/\[name=['"]*((?:[\w\u00c0-\uFFFF\-]|\\.)+)['"]*\]/,ATTR:/\[\s*((?:[\w\u00c0-\uFFFF\-]|\\.)+)\s*(?:(\S?=)\s*(?:(['"])(.*?)\3|(#?(?:[\w\u00c0-\uFFFF\-]|\\.)*)|)|)\s*\]/,TAG:/^((?:[\w\u00c0-\uFFFF\*\-]|\\.)+)/,CHILD:/:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,POS:/:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,PSEUDO:/:((?:[\w\u00c0-\uFFFF\-]|\\.)+)(?:\((['"]?)((?:\([^\)]+\)|[^\(\)]*)+)\2\))?/},leftMatch:{},attrMap:{"class":"className","for":"htmlFor"},attrHandle:{href:function(e){return e.getAttribute("href")},type:function(e){return e.getAttribute("type")}},relative:{"+":function(bW,bR){var bT=typeof bR==="string",bV=bT&&!bQ.test(bR),bX=bT&&!bV;if(bV){bR=bR.toLowerCase()}for(var bS=0,e=bW.length,bU;bS<e;bS++){if((bU=bW[bS])){while((bU=bU.previousSibling)&&bU.nodeType!==1){}bW[bS]=bX||bU&&bU.nodeName.toLowerCase()===bR?bU||false:bU===bR}}if(bX){by.filter(bR,bW,true)}},">":function(bW,bR){var bV,bU=typeof bR==="string",bS=0,e=bW.length;if(bU&&!bQ.test(bR)){bR=bR.toLowerCase();for(;bS<e;bS++){bV=bW[bS];if(bV){var bT=bV.parentNode;bW[bS]=bT.nodeName.toLowerCase()===bR?bT:false}}}else{for(;bS<e;bS++){bV=bW[bS];if(bV){bW[bS]=bU?bV.parentNode:bV.parentNode===bR}}if(bU){by.filter(bR,bW,true)}}},"":function(bT,bR,bV){var bU,bS=bI++,e=bN;if(typeof bR==="string"&&!bQ.test(bR)){bR=bR.toLowerCase();bU=bR;e=bv}e("parentNode",bR,bS,bT,bU,bV)},"~":function(bT,bR,bV){var bU,bS=bI++,e=bN;if(typeof bR==="string"&&!bQ.test(bR)){bR=bR.toLowerCase();bU=bR;e=bv}e("previousSibling",bR,bS,bT,bU,bV)}},find:{ID:function(bR,bS,bT){if(typeof bS.getElementById!=="undefined"&&!bT){var e=bS.getElementById(bR[1]);return e&&e.parentNode?[e]:[]}},NAME:function(bS,bV){if(typeof bV.getElementsByName!=="undefined"){var bR=[],bU=bV.getElementsByName(bS[1]);for(var bT=0,e=bU.length;bT<e;bT++){if(bU[bT].getAttribute("name")===bS[1]){bR.push(bU[bT])}}return bR.length===0?null:bR}},TAG:function(e,bR){if(typeof bR.getElementsByTagName!=="undefined"){return bR.getElementsByTagName(e[1])}}},preFilter:{CLASS:function(bT,bR,bS,e,bW,bX){bT=" "+bT[1].replace(bK,"")+" ";if(bX){return bT}for(var bU=0,bV;(bV=bR[bU])!=null;bU++){if(bV){if(bW^(bV.className&&(" "+bV.className+" ").replace(/[\t\n\r]/g," ").indexOf(bT)>=0)){if(!bS){e.push(bV)}}else{if(bS){bR[bU]=false}}}}return false},ID:function(e){return e[1].replace(bK,"")},TAG:function(bR,e){return bR[1].replace(bK,"").toLowerCase()},CHILD:function(e){if(e[1]==="nth"){if(!e[2]){by.error(e[0])}e[2]=e[2].replace(/^\+|\s*/g,"");var bR=/(-?)(\d*)(?:n([+\-]?\d*))?/.exec(e[2]==="even"&&"2n"||e[2]==="odd"&&"2n+1"||!/\D/.test(e[2])&&"0n+"+e[2]||e[2]);e[2]=(bR[1]+(bR[2]||1))-0;e[3]=bR[3]-0}else{if(e[2]){by.error(e[0])}}e[0]=bI++;return e},ATTR:function(bU,bR,bS,e,bV,bW){var bT=bU[1]=bU[1].replace(bK,"");if(!bW&&bE.attrMap[bT]){bU[1]=bE.attrMap[bT]}bU[4]=(bU[4]||bU[5]||"").replace(bK,"");if(bU[2]==="~="){bU[4]=" "+bU[4]+" "}return bU},PSEUDO:function(bU,bR,bS,e,bV){if(bU[1]==="not"){if((bH.exec(bU[3])||"").length>1||/^\w/.test(bU[3])){bU[3]=by(bU[3],null,null,bR)}else{var bT=by.filter(bU[3],bR,bS,true^bV);if(!bS){e.push.apply(e,bT)}return false}}else{if(bE.match.POS.test(bU[0])||bE.match.CHILD.test(bU[0])){return true}}return bU},POS:function(e){e.unshift(true);return e}},filters:{enabled:function(e){return e.disabled===false&&e.type!=="hidden"},disabled:function(e){return e.disabled===true},checked:function(e){return e.checked===true},selected:function(e){if(e.parentNode){e.parentNode.selectedIndex}return e.selected===true},parent:function(e){return !!e.firstChild},empty:function(e){return !e.firstChild},has:function(bS,bR,e){return !!by(e[3],bS).length},header:function(e){return(/h\d/i).test(e.nodeName)},text:function(bS){var e=bS.getAttribute("type"),bR=bS.type;return bS.nodeName.toLowerCase()==="input"&&"text"===bR&&(e===bR||e===null)},radio:function(e){return e.nodeName.toLowerCase()==="input"&&"radio"===e.type},checkbox:function(e){return e.nodeName.toLowerCase()==="input"&&"checkbox"===e.type},file:function(e){return e.nodeName.toLowerCase()==="input"&&"file"===e.type},password:function(e){return e.nodeName.toLowerCase()==="input"&&"password"===e.type},submit:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"submit"===bR.type},image:function(e){return e.nodeName.toLowerCase()==="input"&&"image"===e.type},reset:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"reset"===bR.type},button:function(bR){var e=bR.nodeName.toLowerCase();return e==="input"&&"button"===bR.type||e==="button"},input:function(e){return(/input|select|textarea|button/i).test(e.nodeName)},focus:function(e){return e===e.ownerDocument.activeElement}},setFilters:{first:function(bR,e){return e===0},last:function(bS,bR,e,bT){return bR===bT.length-1},even:function(bR,e){return e%2===0},odd:function(bR,e){return e%2===1},lt:function(bS,bR,e){return bR<e[3]-0},gt:function(bS,bR,e){return bR>e[3]-0},nth:function(bS,bR,e){return e[3]-0===bR},eq:function(bS,bR,e){return e[3]-0===bR}},filter:{PSEUDO:function(bS,bX,bW,bY){var e=bX[1],bR=bE.filters[e];if(bR){return bR(bS,bW,bX,bY)}else{if(e==="contains"){return(bS.textContent||bS.innerText||bw([bS])||"").indexOf(bX[3])>=0}else{if(e==="not"){var bT=bX[3];for(var bV=0,bU=bT.length;bV<bU;bV++){if(bT[bV]===bS){return false}}return true}else{by.error(e)}}}},CHILD:function(bS,bU){var bT,b0,bW,bZ,e,bV,bY,bX=bU[1],bR=bS;switch(bX){case"only":case"first":while((bR=bR.previousSibling)){if(bR.nodeType===1){return false}}if(bX==="first"){return true}bR=bS;case"last":while((bR=bR.nextSibling)){if(bR.nodeType===1){return false}}return true;case"nth":bT=bU[2];b0=bU[3];if(bT===1&&b0===0){return true}bW=bU[0];bZ=bS.parentNode;if(bZ&&(bZ[bC]!==bW||!bS.nodeIndex)){bV=0;for(bR=bZ.firstChild;bR;bR=bR.nextSibling){if(bR.nodeType===1){bR.nodeIndex=++bV}}bZ[bC]=bW}bY=bS.nodeIndex-b0;if(bT===0){return bY===0}else{return(bY%bT===0&&bY/bT>=0)}}},ID:function(bR,e){return bR.nodeType===1&&bR.getAttribute("id")===e},TAG:function(bR,e){return(e==="*"&&bR.nodeType===1)||!!bR.nodeName&&bR.nodeName.toLowerCase()===e},CLASS:function(bR,e){return(" "+(bR.className||bR.getAttribute("class"))+" ").indexOf(e)>-1},ATTR:function(bV,bT){var bS=bT[1],e=by.attr?by.attr(bV,bS):bE.attrHandle[bS]?bE.attrHandle[bS](bV):bV[bS]!=null?bV[bS]:bV.getAttribute(bS),bW=e+"",bU=bT[2],bR=bT[4];return e==null?bU==="!=":!bU&&by.attr?e!=null:bU==="="?bW===bR:bU==="*="?bW.indexOf(bR)>=0:bU==="~="?(" "+bW+" ").indexOf(bR)>=0:!bR?bW&&e!==false:bU==="!="?bW!==bR:bU==="^="?bW.indexOf(bR)===0:bU==="$="?bW.substr(bW.length-bR.length)===bR:bU==="|="?bW===bR||bW.substr(0,bR.length+1)===bR+"-":false},POS:function(bU,bR,bS,bV){var e=bR[2],bT=bE.setFilters[e];if(bT){return bT(bU,bS,bR,bV)}}}};var bD=bE.match.POS,bx=function(bR,e){return"\\"+(e-0+1)};for(var bz in bE.match){bE.match[bz]=new RegExp(bE.match[bz].source+(/(?![^\[]*\])(?![^\(]*\))/.source));bE.leftMatch[bz]=new RegExp(/(^(?:.|\r|\n)*?)/.source+bE.match[bz].source.replace(/\\(\d+)/g,bx))}var bF=function(bR,e){bR=Array.prototype.slice.call(bR,0);if(e){e.push.apply(e,bR);return e}return bR};try{Array.prototype.slice.call(av.documentElement.childNodes,0)[0].nodeType}catch(bP){bF=function(bU,bT){var bS=0,bR=bT||[];if(bL.call(bU)==="[object Array]"){Array.prototype.push.apply(bR,bU)}else{if(typeof bU.length==="number"){for(var e=bU.length;bS<e;bS++){bR.push(bU[bS])}}else{for(;bU[bS];bS++){bR.push(bU[bS])}}}return bR}}var bJ,bG;if(av.documentElement.compareDocumentPosition){bJ=function(bR,e){if(bR===e){bB=true;return 0}if(!bR.compareDocumentPosition||!e.compareDocumentPosition){return bR.compareDocumentPosition?-1:1}return bR.compareDocumentPosition(e)&4?-1:1}}else{bJ=function(bY,bX){if(bY===bX){bB=true;return 0}else{if(bY.sourceIndex&&bX.sourceIndex){return bY.sourceIndex-bX.sourceIndex}}var bV,bR,bS=[],e=[],bU=bY.parentNode,bW=bX.parentNode,bZ=bU;if(bU===bW){return bG(bY,bX)}else{if(!bU){return -1}else{if(!bW){return 1}}}while(bZ){bS.unshift(bZ);bZ=bZ.parentNode}bZ=bW;while(bZ){e.unshift(bZ);bZ=bZ.parentNode}bV=bS.length;bR=e.length;for(var bT=0;bT<bV&&bT<bR;bT++){if(bS[bT]!==e[bT]){return bG(bS[bT],e[bT])}}return bT===bV?bG(bY,e[bT],-1):bG(bS[bT],bX,1)};bG=function(bR,e,bS){if(bR===e){return bS}var bT=bR.nextSibling;while(bT){if(bT===e){return -1}bT=bT.nextSibling}return 1}}(function(){var bR=av.createElement("div"),bS="script"+(new Date()).getTime(),e=av.documentElement;bR.innerHTML="<a name='"+bS+"'/>";e.insertBefore(bR,e.firstChild);if(av.getElementById(bS)){bE.find.ID=function(bU,bV,bW){if(typeof bV.getElementById!=="undefined"&&!bW){var bT=bV.getElementById(bU[1]);return bT?bT.id===bU[1]||typeof bT.getAttributeNode!=="undefined"&&bT.getAttributeNode("id").nodeValue===bU[1]?[bT]:L:[]}};bE.filter.ID=function(bV,bT){var bU=typeof bV.getAttributeNode!=="undefined"&&bV.getAttributeNode("id");return bV.nodeType===1&&bU&&bU.nodeValue===bT}}e.removeChild(bR);e=bR=null})();(function(){var e=av.createElement("div");e.appendChild(av.createComment(""));if(e.getElementsByTagName("*").length>0){bE.find.TAG=function(bR,bV){var bU=bV.getElementsByTagName(bR[1]);if(bR[1]==="*"){var bT=[];for(var bS=0;bU[bS];bS++){if(bU[bS].nodeType===1){bT.push(bU[bS])}}bU=bT}return bU}}e.innerHTML="<a href='#'></a>";if(e.firstChild&&typeof e.firstChild.getAttribute!=="undefined"&&e.firstChild.getAttribute("href")!=="#"){bE.attrHandle.href=function(bR){return bR.getAttribute("href",2)}}e=null})();if(av.querySelectorAll){(function(){var e=by,bT=av.createElement("div"),bS="__sizzle__";bT.innerHTML="<p class='TEST'></p>";if(bT.querySelectorAll&&bT.querySelectorAll(".TEST").length===0){return}by=function(b4,bV,bZ,b3){bV=bV||av;if(!b3&&!by.isXML(bV)){var b2=/^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec(b4);if(b2&&(bV.nodeType===1||bV.nodeType===9)){if(b2[1]){return bF(bV.getElementsByTagName(b4),bZ)}else{if(b2[2]&&bE.find.CLASS&&bV.getElementsByClassName){return bF(bV.getElementsByClassName(b2[2]),bZ)}}}if(bV.nodeType===9){if(b4==="body"&&bV.body){return bF([bV.body],bZ)}else{if(b2&&b2[3]){var bY=bV.getElementById(b2[3]);if(bY&&bY.parentNode){if(bY.id===b2[3]){return bF([bY],bZ)}}else{return bF([],bZ)}}}try{return bF(bV.querySelectorAll(b4),bZ)}catch(b0){}}else{if(bV.nodeType===1&&bV.nodeName.toLowerCase()!=="object"){var bW=bV,bX=bV.getAttribute("id"),bU=bX||bS,b6=bV.parentNode,b5=/^\s*[+~]/.test(b4);if(!bX){bV.setAttribute("id",bU)}else{bU=bU.replace(/'/g,"\\$&")}if(b5&&b6){bV=bV.parentNode}try{if(!b5||b6){return bF(bV.querySelectorAll("[id='"+bU+"'] "+b4),bZ)}}catch(b1){}finally{if(!bX){bW.removeAttribute("id")}}}}}return e(b4,bV,bZ,b3)};for(var bR in e){by[bR]=e[bR]}bT=null})()}(function(){var e=av.documentElement,bS=e.matchesSelector||e.mozMatchesSelector||e.webkitMatchesSelector||e.msMatchesSelector;if(bS){var bU=!bS.call(av.createElement("div"),"div"),bR=false;try{bS.call(av.documentElement,"[test!='']:sizzle")}catch(bT){bR=true}by.matchesSelector=function(bW,bY){bY=bY.replace(/\=\s*([^'"\]]*)\s*\]/g,"='$1']");if(!by.isXML(bW)){try{if(bR||!bE.match.PSEUDO.test(bY)&&!/!=/.test(bY)){var bV=bS.call(bW,bY);if(bV||!bU||bW.document&&bW.document.nodeType!==11){return bV}}}catch(bX){}}return by(bY,null,null,[bW]).length>0}}})();(function(){var e=av.createElement("div");e.innerHTML="<div class='test e'></div><div class='test'></div>";if(!e.getElementsByClassName||e.getElementsByClassName("e").length===0){return}e.lastChild.className="e";if(e.getElementsByClassName("e").length===1){return}bE.order.splice(1,0,"CLASS");bE.find.CLASS=function(bR,bS,bT){if(typeof bS.getElementsByClassName!=="undefined"&&!bT){return bS.getElementsByClassName(bR[1])}};e=null})();function bv(bR,bW,bV,bZ,bX,bY){for(var bT=0,bS=bZ.length;bT<bS;bT++){var e=bZ[bT];if(e){var bU=false;e=e[bR];while(e){if(e[bC]===bV){bU=bZ[e.sizset];break}if(e.nodeType===1&&!bY){e[bC]=bV;e.sizset=bT}if(e.nodeName.toLowerCase()===bW){bU=e;break}e=e[bR]}bZ[bT]=bU}}}function bN(bR,bW,bV,bZ,bX,bY){for(var bT=0,bS=bZ.length;bT<bS;bT++){var e=bZ[bT];if(e){var bU=false;e=e[bR];while(e){if(e[bC]===bV){bU=bZ[e.sizset];break}if(e.nodeType===1){if(!bY){e[bC]=bV;e.sizset=bT}if(typeof bW!=="string"){if(e===bW){bU=true;break}}else{if(by.filter(bW,[e]).length>0){bU=e;break}}}e=e[bR]}bZ[bT]=bU}}}if(av.documentElement.contains){by.contains=function(bR,e){return bR!==e&&(bR.contains?bR.contains(e):true)}}else{if(av.documentElement.compareDocumentPosition){by.contains=function(bR,e){return !!(bR.compareDocumentPosition(e)&16)}}else{by.contains=function(){return false}}}by.isXML=function(e){var bR=(e?e.ownerDocument||e:0).documentElement;return bR?bR.nodeName!=="HTML":false};var bM=function(bS,e,bW){var bV,bX=[],bU="",bY=e.nodeType?[e]:e;while((bV=bE.match.PSEUDO.exec(bS))){bU+=bV[0];bS=bS.replace(bE.match.PSEUDO,"")}bS=bE.relative[bS]?bS+"*":bS;for(var bT=0,bR=bY.length;bT<bR;bT++){by(bS,bY[bT],bX,bW)}return by.filter(bU,bX)};by.attr=b.attr;by.selectors.attrMap={};b.find=by;b.expr=by.selectors;b.expr[":"]=b.expr.filters;b.unique=by.uniqueSort;b.text=by.getText;b.isXMLDoc=by.isXML;b.contains=by.contains})();var ab=/Until$/,aq=/^(?:parents|prevUntil|prevAll)/,a9=/,/,bp=/^.[^:#\[\.,]*$/,P=Array.prototype.slice,H=b.expr.match.POS,ay={children:true,contents:true,next:true,prev:true};b.fn.extend({find:function(e){var bw=this,by,bv;if(typeof e!=="string"){return b(e).filter(function(){for(by=0,bv=bw.length;by<bv;by++){if(b.contains(bw[by],this)){return true}}})}var bx=this.pushStack("","find",e),bA,bB,bz;for(by=0,bv=this.length;by<bv;by++){bA=bx.length;b.find(e,this[by],bx);if(by>0){for(bB=bA;bB<bx.length;bB++){for(bz=0;bz<bA;bz++){if(bx[bz]===bx[bB]){bx.splice(bB--,1);break}}}}}return bx},has:function(bv){var e=b(bv);return this.filter(function(){for(var bx=0,bw=e.length;bx<bw;bx++){if(b.contains(this,e[bx])){return true}}})},not:function(e){return this.pushStack(aG(this,e,false),"not",e)},filter:function(e){return this.pushStack(aG(this,e,true),"filter",e)},is:function(e){return !!e&&(typeof e==="string"?H.test(e)?b(e,this.context).index(this[0])>=0:b.filter(e,this).length>0:this.filter(e).length>0)},closest:function(by,bx){var bv=[],bw,e,bz=this[0];if(b.isArray(by)){var bB=1;while(bz&&bz.ownerDocument&&bz!==bx){for(bw=0;bw<by.length;bw++){if(b(bz).is(by[bw])){bv.push({selector:by[bw],elem:bz,level:bB})}}bz=bz.parentNode;bB++}return bv}var bA=H.test(by)||typeof by!=="string"?b(by,bx||this.context):0;for(bw=0,e=this.length;bw<e;bw++){bz=this[bw];while(bz){if(bA?bA.index(bz)>-1:b.find.matchesSelector(bz,by)){bv.push(bz);break}else{bz=bz.parentNode;if(!bz||!bz.ownerDocument||bz===bx||bz.nodeType===11){break}}}}bv=bv.length>1?b.unique(bv):bv;return this.pushStack(bv,"closest",by)},index:function(e){if(!e){return(this[0]&&this[0].parentNode)?this.prevAll().length:-1}if(typeof e==="string"){return b.inArray(this[0],b(e))}return b.inArray(e.jquery?e[0]:e,this)},add:function(e,bv){var bx=typeof e==="string"?b(e,bv):b.makeArray(e&&e.nodeType?[e]:e),bw=b.merge(this.get(),bx);return this.pushStack(C(bx[0])||C(bw[0])?bw:b.unique(bw))},andSelf:function(){return this.add(this.prevObject)}});function C(e){return !e||!e.parentNode||e.parentNode.nodeType===11}b.each({parent:function(bv){var e=bv.parentNode;return e&&e.nodeType!==11?e:null},parents:function(e){return b.dir(e,"parentNode")},parentsUntil:function(bv,e,bw){return b.dir(bv,"parentNode",bw)},next:function(e){return b.nth(e,2,"nextSibling")},prev:function(e){return b.nth(e,2,"previousSibling")},nextAll:function(e){return b.dir(e,"nextSibling")},prevAll:function(e){return b.dir(e,"previousSibling")},nextUntil:function(bv,e,bw){return b.dir(bv,"nextSibling",bw)},prevUntil:function(bv,e,bw){return b.dir(bv,"previousSibling",bw)},siblings:function(e){return b.sibling(e.parentNode.firstChild,e)},children:function(e){return b.sibling(e.firstChild)},contents:function(e){return b.nodeName(e,"iframe")?e.contentDocument||e.contentWindow.document:b.makeArray(e.childNodes)}},function(e,bv){b.fn[e]=function(by,bw){var bx=b.map(this,bv,by);if(!ab.test(e)){bw=by}if(bw&&typeof bw==="string"){bx=b.filter(bw,bx)}bx=this.length>1&&!ay[e]?b.unique(bx):bx;if((this.length>1||a9.test(bw))&&aq.test(e)){bx=bx.reverse()}return this.pushStack(bx,e,P.call(arguments).join(","))}});b.extend({filter:function(bw,e,bv){if(bv){bw=":not("+bw+")"}return e.length===1?b.find.matchesSelector(e[0],bw)?[e[0]]:[]:b.find.matches(bw,e)},dir:function(bw,bv,by){var e=[],bx=bw[bv];while(bx&&bx.nodeType!==9&&(by===L||bx.nodeType!==1||!b(bx).is(by))){if(bx.nodeType===1){e.push(bx)}bx=bx[bv]}return e},nth:function(by,e,bw,bx){e=e||1;var bv=0;for(;by;by=by[bw]){if(by.nodeType===1&&++bv===e){break}}return by},sibling:function(bw,bv){var e=[];for(;bw;bw=bw.nextSibling){if(bw.nodeType===1&&bw!==bv){e.push(bw)}}return e}});function aG(bx,bw,e){bw=bw||0;if(b.isFunction(bw)){return b.grep(bx,function(bz,by){var bA=!!bw.call(bz,by,bz);return bA===e})}else{if(bw.nodeType){return b.grep(bx,function(bz,by){return(bz===bw)===e})}else{if(typeof bw==="string"){var bv=b.grep(bx,function(by){return by.nodeType===1});if(bp.test(bw)){return b.filter(bw,bv,!e)}else{bw=b.filter(bw,bv)}}}}return b.grep(bx,function(bz,by){return(b.inArray(bz,bw)>=0)===e})}function a(e){var bw=aR.split("|"),bv=e.createDocumentFragment();if(bv.createElement){while(bw.length){bv.createElement(bw.pop())}}return bv}var aR="abbr|article|aside|audio|canvas|datalist|details|figcaption|figure|footer|header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",ag=/ jQuery\d+="(?:\d+|null)"/g,ar=/^\s+/,R=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,d=/<([\w:]+)/,w=/<tbody/i,W=/<|&#?\w+;/,ae=/<(?:script|style)/i,O=/<(?:script|object|embed|option|style)/i,ah=new RegExp("<(?:"+aR+")","i"),o=/checked\s*(?:[^=]|=\s*.checked.)/i,bm=/\/(java|ecma)script/i,aN=/^\s*<!(?:\[CDATA\[|\-\-)/,ax={option:[1,"<select multiple='multiple'>","</select>"],legend:[1,"<fieldset>","</fieldset>"],thead:[1,"<table>","</table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],col:[2,"<table><tbody></tbody><colgroup>","</colgroup></table>"],area:[1,"<map>","</map>"],_default:[0,"",""]},ac=a(av);ax.optgroup=ax.option;ax.tbody=ax.tfoot=ax.colgroup=ax.caption=ax.thead;ax.th=ax.td;if(!b.support.htmlSerialize){ax._default=[1,"div<div>","</div>"]}b.fn.extend({text:function(e){if(b.isFunction(e)){return this.each(function(bw){var bv=b(this);bv.text(e.call(this,bw,bv.text()))})}if(typeof e!=="object"&&e!==L){return this.empty().append((this[0]&&this[0].ownerDocument||av).createTextNode(e))}return b.text(this)},wrapAll:function(e){if(b.isFunction(e)){return this.each(function(bw){b(this).wrapAll(e.call(this,bw))})}if(this[0]){var bv=b(e,this[0].ownerDocument).eq(0).clone(true);if(this[0].parentNode){bv.insertBefore(this[0])}bv.map(function(){var bw=this;while(bw.firstChild&&bw.firstChild.nodeType===1){bw=bw.firstChild}return bw}).append(this)}return this},wrapInner:function(e){if(b.isFunction(e)){return this.each(function(bv){b(this).wrapInner(e.call(this,bv))})}return this.each(function(){var bv=b(this),bw=bv.contents();if(bw.length){bw.wrapAll(e)}else{bv.append(e)}})},wrap:function(e){var bv=b.isFunction(e);return this.each(function(bw){b(this).wrapAll(bv?e.call(this,bw):e)})},unwrap:function(){return this.parent().each(function(){if(!b.nodeName(this,"body")){b(this).replaceWith(this.childNodes)}}).end()},append:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.appendChild(e)}})},prepend:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.insertBefore(e,this.firstChild)}})},before:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this)})}else{if(arguments.length){var e=b.clean(arguments);e.push.apply(e,this.toArray());return this.pushStack(e,"before",arguments)}}},after:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this.nextSibling)})}else{if(arguments.length){var e=this.pushStack(this,"after",arguments);e.push.apply(e,b.clean(arguments));return e}}},remove:function(e,bx){for(var bv=0,bw;(bw=this[bv])!=null;bv++){if(!e||b.filter(e,[bw]).length){if(!bx&&bw.nodeType===1){b.cleanData(bw.getElementsByTagName("*"));b.cleanData([bw])}if(bw.parentNode){bw.parentNode.removeChild(bw)}}}return this},empty:function(){for(var e=0,bv;(bv=this[e])!=null;e++){if(bv.nodeType===1){b.cleanData(bv.getElementsByTagName("*"))}while(bv.firstChild){bv.removeChild(bv.firstChild)}}return this},clone:function(bv,e){bv=bv==null?false:bv;e=e==null?bv:e;return this.map(function(){return b.clone(this,bv,e)})},html:function(bx){if(bx===L){return this[0]&&this[0].nodeType===1?this[0].innerHTML.replace(ag,""):null}else{if(typeof bx==="string"&&!ae.test(bx)&&(b.support.leadingWhitespace||!ar.test(bx))&&!ax[(d.exec(bx)||["",""])[1].toLowerCase()]){bx=bx.replace(R,"<$1></$2>");try{for(var bw=0,bv=this.length;bw<bv;bw++){if(this[bw].nodeType===1){b.cleanData(this[bw].getElementsByTagName("*"));this[bw].innerHTML=bx}}}catch(by){this.empty().append(bx)}}else{if(b.isFunction(bx)){this.each(function(bz){var e=b(this);e.html(bx.call(this,bz,e.html()))})}else{this.empty().append(bx)}}}return this},replaceWith:function(e){if(this[0]&&this[0].parentNode){if(b.isFunction(e)){return this.each(function(bx){var bw=b(this),bv=bw.html();bw.replaceWith(e.call(this,bx,bv))})}if(typeof e!=="string"){e=b(e).detach()}return this.each(function(){var bw=this.nextSibling,bv=this.parentNode;b(this).remove();if(bw){b(bw).before(e)}else{b(bv).append(e)}})}else{return this.length?this.pushStack(b(b.isFunction(e)?e():e),"replaceWith",e):this}},detach:function(e){return this.remove(e,true)},domManip:function(bB,bF,bE){var bx,by,bA,bD,bC=bB[0],bv=[];if(!b.support.checkClone&&arguments.length===3&&typeof bC==="string"&&o.test(bC)){return this.each(function(){b(this).domManip(bB,bF,bE,true)})}if(b.isFunction(bC)){return this.each(function(bH){var bG=b(this);bB[0]=bC.call(this,bH,bF?bG.html():L);bG.domManip(bB,bF,bE)})}if(this[0]){bD=bC&&bC.parentNode;if(b.support.parentNode&&bD&&bD.nodeType===11&&bD.childNodes.length===this.length){bx={fragment:bD}}else{bx=b.buildFragment(bB,this,bv)}bA=bx.fragment;if(bA.childNodes.length===1){by=bA=bA.firstChild}else{by=bA.firstChild}if(by){bF=bF&&b.nodeName(by,"tr");for(var bw=0,e=this.length,bz=e-1;bw<e;bw++){bE.call(bF?ba(this[bw],by):this[bw],bx.cacheable||(e>1&&bw<bz)?b.clone(bA,true,true):bA)}}if(bv.length){b.each(bv,bo)}}return this}});function ba(e,bv){return b.nodeName(e,"table")?(e.getElementsByTagName("tbody")[0]||e.appendChild(e.ownerDocument.createElement("tbody"))):e}function t(bB,bv){if(bv.nodeType!==1||!b.hasData(bB)){return}var by,bx,e,bA=b._data(bB),bz=b._data(bv,bA),bw=bA.events;if(bw){delete bz.handle;bz.events={};for(by in bw){for(bx=0,e=bw[by].length;bx<e;bx++){b.event.add(bv,by+(bw[by][bx].namespace?".":"")+bw[by][bx].namespace,bw[by][bx],bw[by][bx].data)}}}if(bz.data){bz.data=b.extend({},bz.data)}}function ai(bv,e){var bw;if(e.nodeType!==1){return}if(e.clearAttributes){e.clearAttributes()}if(e.mergeAttributes){e.mergeAttributes(bv)}bw=e.nodeName.toLowerCase();if(bw==="object"){e.outerHTML=bv.outerHTML}else{if(bw==="input"&&(bv.type==="checkbox"||bv.type==="radio")){if(bv.checked){e.defaultChecked=e.checked=bv.checked}if(e.value!==bv.value){e.value=bv.value}}else{if(bw==="option"){e.selected=bv.defaultSelected}else{if(bw==="input"||bw==="textarea"){e.defaultValue=bv.defaultValue}}}}e.removeAttribute(b.expando)}b.buildFragment=function(bz,bx,bv){var by,e,bw,bA,bB=bz[0];if(bx&&bx[0]){bA=bx[0].ownerDocument||bx[0]}if(!bA.createDocumentFragment){bA=av}if(bz.length===1&&typeof bB==="string"&&bB.length<512&&bA===av&&bB.charAt(0)==="<"&&!O.test(bB)&&(b.support.checkClone||!o.test(bB))&&(b.support.html5Clone||!ah.test(bB))){e=true;bw=b.fragments[bB];if(bw&&bw!==1){by=bw}}if(!by){by=bA.createDocumentFragment();b.clean(bz,bA,by,bv)}if(e){b.fragments[bB]=bw?by:1}return{fragment:by,cacheable:e}};b.fragments={};b.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,bv){b.fn[e]=function(bw){var bz=[],bC=b(bw),bB=this.length===1&&this[0].parentNode;if(bB&&bB.nodeType===11&&bB.childNodes.length===1&&bC.length===1){bC[bv](this[0]);return this}else{for(var bA=0,bx=bC.length;bA<bx;bA++){var by=(bA>0?this.clone(true):this).get();b(bC[bA])[bv](by);bz=bz.concat(by)}return this.pushStack(bz,e,bC.selector)}}});function bg(e){if(typeof e.getElementsByTagName!=="undefined"){return e.getElementsByTagName("*")}else{if(typeof e.querySelectorAll!=="undefined"){return e.querySelectorAll("*")}else{return[]}}}function az(e){if(e.type==="checkbox"||e.type==="radio"){e.defaultChecked=e.checked}}function E(e){var bv=(e.nodeName||"").toLowerCase();if(bv==="input"){az(e)}else{if(bv!=="script"&&typeof e.getElementsByTagName!=="undefined"){b.grep(e.getElementsByTagName("input"),az)}}}function al(e){var bv=av.createElement("div");ac.appendChild(bv);bv.innerHTML=e.outerHTML;return bv.firstChild}b.extend({clone:function(by,bA,bw){var e,bv,bx,bz=b.support.html5Clone||!ah.test("<"+by.nodeName)?by.cloneNode(true):al(by);if((!b.support.noCloneEvent||!b.support.noCloneChecked)&&(by.nodeType===1||by.nodeType===11)&&!b.isXMLDoc(by)){ai(by,bz);e=bg(by);bv=bg(bz);for(bx=0;e[bx];++bx){if(bv[bx]){ai(e[bx],bv[bx])}}}if(bA){t(by,bz);if(bw){e=bg(by);bv=bg(bz);for(bx=0;e[bx];++bx){t(e[bx],bv[bx])}}}e=bv=null;return bz},clean:function(bw,by,bH,bA){var bF;by=by||av;if(typeof by.createElement==="undefined"){by=by.ownerDocument||by[0]&&by[0].ownerDocument||av}var bI=[],bB;for(var bE=0,bz;(bz=bw[bE])!=null;bE++){if(typeof bz==="number"){bz+=""}if(!bz){continue}if(typeof bz==="string"){if(!W.test(bz)){bz=by.createTextNode(bz)}else{bz=bz.replace(R,"<$1></$2>");var bK=(d.exec(bz)||["",""])[1].toLowerCase(),bx=ax[bK]||ax._default,bD=bx[0],bv=by.createElement("div");if(by===av){ac.appendChild(bv)}else{a(by).appendChild(bv)}bv.innerHTML=bx[1]+bz+bx[2];while(bD--){bv=bv.lastChild}if(!b.support.tbody){var e=w.test(bz),bC=bK==="table"&&!e?bv.firstChild&&bv.firstChild.childNodes:bx[1]==="<table>"&&!e?bv.childNodes:[];for(bB=bC.length-1;bB>=0;--bB){if(b.nodeName(bC[bB],"tbody")&&!bC[bB].childNodes.length){bC[bB].parentNode.removeChild(bC[bB])}}}if(!b.support.leadingWhitespace&&ar.test(bz)){bv.insertBefore(by.createTextNode(ar.exec(bz)[0]),bv.firstChild)}bz=bv.childNodes}}var bG;if(!b.support.appendChecked){if(bz[0]&&typeof(bG=bz.length)==="number"){for(bB=0;bB<bG;bB++){E(bz[bB])}}else{E(bz)}}if(bz.nodeType){bI.push(bz)}else{bI=b.merge(bI,bz)}}if(bH){bF=function(bL){return !bL.type||bm.test(bL.type)};for(bE=0;bI[bE];bE++){if(bA&&b.nodeName(bI[bE],"script")&&(!bI[bE].type||bI[bE].type.toLowerCase()==="text/javascript")){bA.push(bI[bE].parentNode?bI[bE].parentNode.removeChild(bI[bE]):bI[bE])}else{if(bI[bE].nodeType===1){var bJ=b.grep(bI[bE].getElementsByTagName("script"),bF);bI.splice.apply(bI,[bE+1,0].concat(bJ))}bH.appendChild(bI[bE])}}}return bI},cleanData:function(bv){var by,bw,e=b.cache,bB=b.event.special,bA=b.support.deleteExpando;for(var bz=0,bx;(bx=bv[bz])!=null;bz++){if(bx.nodeName&&b.noData[bx.nodeName.toLowerCase()]){continue}bw=bx[b.expando];if(bw){by=e[bw];if(by&&by.events){for(var bC in by.events){if(bB[bC]){b.event.remove(bx,bC)}else{b.removeEvent(bx,bC,by.handle)}}if(by.handle){by.handle.elem=null}}if(bA){delete bx[b.expando]}else{if(bx.removeAttribute){bx.removeAttribute(b.expando)}}delete e[bw]}}}});function bo(e,bv){if(bv.src){b.ajax({url:bv.src,async:false,dataType:"script"})}else{b.globalEval((bv.text||bv.textContent||bv.innerHTML||"").replace(aN,"/*$0*/"))}if(bv.parentNode){bv.parentNode.removeChild(bv)}}var ak=/alpha\([^)]*\)/i,au=/opacity=([^)]*)/,z=/([A-Z]|^ms)/g,bc=/^-?\d+(?:px)?$/i,bn=/^-?\d/,I=/^([\-+])=([\-+.\de]+)/,a7={position:"absolute",visibility:"hidden",display:"block"},an=["Left","Right"],a1=["Top","Bottom"],Z,aI,aX;b.fn.css=function(e,bv){if(arguments.length===2&&bv===L){return this}return b.access(this,e,bv,true,function(bx,bw,by){return by!==L?b.style(bx,bw,by):b.css(bx,bw)})};b.extend({cssHooks:{opacity:{get:function(bw,bv){if(bv){var e=Z(bw,"opacity","opacity");return e===""?"1":e}else{return bw.style.opacity}}}},cssNumber:{fillOpacity:true,fontWeight:true,lineHeight:true,opacity:true,orphans:true,widows:true,zIndex:true,zoom:true},cssProps:{"float":b.support.cssFloat?"cssFloat":"styleFloat"},style:function(bx,bw,bD,by){if(!bx||bx.nodeType===3||bx.nodeType===8||!bx.style){return}var bB,bC,bz=b.camelCase(bw),bv=bx.style,bE=b.cssHooks[bz];bw=b.cssProps[bz]||bz;if(bD!==L){bC=typeof bD;if(bC==="string"&&(bB=I.exec(bD))){bD=(+(bB[1]+1)*+bB[2])+parseFloat(b.css(bx,bw));bC="number"}if(bD==null||bC==="number"&&isNaN(bD)){return}if(bC==="number"&&!b.cssNumber[bz]){bD+="px"}if(!bE||!("set" in bE)||(bD=bE.set(bx,bD))!==L){try{bv[bw]=bD}catch(bA){}}}else{if(bE&&"get" in bE&&(bB=bE.get(bx,false,by))!==L){return bB}return bv[bw]}},css:function(by,bx,bv){var bw,e;bx=b.camelCase(bx);e=b.cssHooks[bx];bx=b.cssProps[bx]||bx;if(bx==="cssFloat"){bx="float"}if(e&&"get" in e&&(bw=e.get(by,true,bv))!==L){return bw}else{if(Z){return Z(by,bx)}}},swap:function(bx,bw,by){var e={};for(var bv in bw){e[bv]=bx.style[bv];bx.style[bv]=bw[bv]}by.call(bx);for(bv in bw){bx.style[bv]=e[bv]}}});b.curCSS=b.css;b.each(["height","width"],function(bv,e){b.cssHooks[e]={get:function(by,bx,bw){var bz;if(bx){if(by.offsetWidth!==0){return p(by,e,bw)}else{b.swap(by,a7,function(){bz=p(by,e,bw)})}return bz}},set:function(bw,bx){if(bc.test(bx)){bx=parseFloat(bx);if(bx>=0){return bx+"px"}}else{return bx}}}});if(!b.support.opacity){b.cssHooks.opacity={get:function(bv,e){return au.test((e&&bv.currentStyle?bv.currentStyle.filter:bv.style.filter)||"")?(parseFloat(RegExp.$1)/100)+"":e?"1":""},set:function(by,bz){var bx=by.style,bv=by.currentStyle,e=b.isNumeric(bz)?"alpha(opacity="+bz*100+")":"",bw=bv&&bv.filter||bx.filter||"";bx.zoom=1;if(bz>=1&&b.trim(bw.replace(ak,""))===""){bx.removeAttribute("filter");if(bv&&!bv.filter){return}}bx.filter=ak.test(bw)?bw.replace(ak,e):bw+" "+e}}}b(function(){if(!b.support.reliableMarginRight){b.cssHooks.marginRight={get:function(bw,bv){var e;b.swap(bw,{display:"inline-block"},function(){if(bv){e=Z(bw,"margin-right","marginRight")}else{e=bw.style.marginRight}});return e}}}});if(av.defaultView&&av.defaultView.getComputedStyle){aI=function(by,bw){var bv,bx,e;bw=bw.replace(z,"-$1").toLowerCase();if((bx=by.ownerDocument.defaultView)&&(e=bx.getComputedStyle(by,null))){bv=e.getPropertyValue(bw);if(bv===""&&!b.contains(by.ownerDocument.documentElement,by)){bv=b.style(by,bw)}}return bv}}if(av.documentElement.currentStyle){aX=function(bz,bw){var bA,e,by,bv=bz.currentStyle&&bz.currentStyle[bw],bx=bz.style;if(bv===null&&bx&&(by=bx[bw])){bv=by}if(!bc.test(bv)&&bn.test(bv)){bA=bx.left;e=bz.runtimeStyle&&bz.runtimeStyle.left;if(e){bz.runtimeStyle.left=bz.currentStyle.left}bx.left=bw==="fontSize"?"1em":(bv||0);bv=bx.pixelLeft+"px";bx.left=bA;if(e){bz.runtimeStyle.left=e}}return bv===""?"auto":bv}}Z=aI||aX;function p(by,bw,bv){var bA=bw==="width"?by.offsetWidth:by.offsetHeight,bz=bw==="width"?an:a1,bx=0,e=bz.length;if(bA>0){if(bv!=="border"){for(;bx<e;bx++){if(!bv){bA-=parseFloat(b.css(by,"padding"+bz[bx]))||0}if(bv==="margin"){bA+=parseFloat(b.css(by,bv+bz[bx]))||0}else{bA-=parseFloat(b.css(by,"border"+bz[bx]+"Width"))||0}}}return bA+"px"}bA=Z(by,bw,bw);if(bA<0||bA==null){bA=by.style[bw]||0}bA=parseFloat(bA)||0;if(bv){for(;bx<e;bx++){bA+=parseFloat(b.css(by,"padding"+bz[bx]))||0;if(bv!=="padding"){bA+=parseFloat(b.css(by,"border"+bz[bx]+"Width"))||0}if(bv==="margin"){bA+=parseFloat(b.css(by,bv+bz[bx]))||0}}}return bA+"px"}if(b.expr&&b.expr.filters){b.expr.filters.hidden=function(bw){var bv=bw.offsetWidth,e=bw.offsetHeight;return(bv===0&&e===0)||(!b.support.reliableHiddenOffsets&&((bw.style&&bw.style.display)||b.css(bw,"display"))==="none")};b.expr.filters.visible=function(e){return !b.expr.filters.hidden(e)}}var k=/%20/g,ap=/\[\]$/,bs=/\r?\n/g,bq=/#.*$/,aD=/^(.*?):[ \t]*([^\r\n]*)\r?$/mg,aZ=/^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,aM=/^(?:about|app|app\-storage|.+\-extension|file|res|widget):$/,aQ=/^(?:GET|HEAD)$/,c=/^\/\//,M=/\?/,a6=/<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,q=/^(?:select|textarea)/i,h=/\s+/,br=/([?&])_=[^&]*/,K=/^([\w\+\.\-]+:)(?:\/\/([^\/?#:]*)(?::(\d+))?)?/,A=b.fn.load,aa={},r={},aE,s,aV=["*/"]+["*"];try{aE=bl.href}catch(aw){aE=av.createElement("a");aE.href="";aE=aE.href}s=K.exec(aE.toLowerCase())||[];function f(e){return function(by,bA){if(typeof by!=="string"){bA=by;by="*"}if(b.isFunction(bA)){var bx=by.toLowerCase().split(h),bw=0,bz=bx.length,bv,bB,bC;for(;bw<bz;bw++){bv=bx[bw];bC=/^\+/.test(bv);if(bC){bv=bv.substr(1)||"*"}bB=e[bv]=e[bv]||[];bB[bC?"unshift":"push"](bA)}}}}function aW(bv,bE,bz,bD,bB,bx){bB=bB||bE.dataTypes[0];bx=bx||{};bx[bB]=true;var bA=bv[bB],bw=0,e=bA?bA.length:0,by=(bv===aa),bC;for(;bw<e&&(by||!bC);bw++){bC=bA[bw](bE,bz,bD);if(typeof bC==="string"){if(!by||bx[bC]){bC=L}else{bE.dataTypes.unshift(bC);bC=aW(bv,bE,bz,bD,bC,bx)}}}if((by||!bC)&&!bx["*"]){bC=aW(bv,bE,bz,bD,"*",bx)}return bC}function am(bw,bx){var bv,e,by=b.ajaxSettings.flatOptions||{};for(bv in bx){if(bx[bv]!==L){(by[bv]?bw:(e||(e={})))[bv]=bx[bv]}}if(e){b.extend(true,bw,e)}}b.fn.extend({load:function(bw,bz,bA){if(typeof bw!=="string"&&A){return A.apply(this,arguments)}else{if(!this.length){return this}}var by=bw.indexOf(" ");if(by>=0){var e=bw.slice(by,bw.length);bw=bw.slice(0,by)}var bx="GET";if(bz){if(b.isFunction(bz)){bA=bz;bz=L}else{if(typeof bz==="object"){bz=b.param(bz,b.ajaxSettings.traditional);bx="POST"}}}var bv=this;b.ajax({url:bw,type:bx,dataType:"html",data:bz,complete:function(bC,bB,bD){bD=bC.responseText;if(bC.isResolved()){bC.done(function(bE){bD=bE});bv.html(e?b("<div>").append(bD.replace(a6,"")).find(e):bD)}if(bA){bv.each(bA,[bD,bB,bC])}}});return this},serialize:function(){return b.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?b.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||q.test(this.nodeName)||aZ.test(this.type))}).map(function(e,bv){var bw=b(this).val();return bw==null?null:b.isArray(bw)?b.map(bw,function(by,bx){return{name:bv.name,value:by.replace(bs,"\r\n")}}):{name:bv.name,value:bw.replace(bs,"\r\n")}}).get()}});b.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "),function(e,bv){b.fn[bv]=function(bw){return this.on(bv,bw)}});b.each(["get","post"],function(e,bv){b[bv]=function(bw,by,bz,bx){if(b.isFunction(by)){bx=bx||bz;bz=by;by=L}return b.ajax({type:bv,url:bw,data:by,success:bz,dataType:bx})}});b.extend({getScript:function(e,bv){return b.get(e,L,bv,"script")},getJSON:function(e,bv,bw){return b.get(e,bv,bw,"json")},ajaxSetup:function(bv,e){if(e){am(bv,b.ajaxSettings)}else{e=bv;bv=b.ajaxSettings}am(bv,e);return bv},ajaxSettings:{url:aE,isLocal:aM.test(s[1]),global:true,type:"GET",contentType:"application/x-www-form-urlencoded",processData:true,async:true,accepts:{xml:"application/xml, text/xml",html:"text/html",text:"text/plain",json:"application/json, text/javascript","*":aV},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:"responseXML",text:"responseText"},converters:{"* text":bb.String,"text html":true,"text json":b.parseJSON,"text xml":b.parseXML},flatOptions:{context:true,url:true}},ajaxPrefilter:f(aa),ajaxTransport:f(r),ajax:function(bz,bx){if(typeof bz==="object"){bx=bz;bz=L}bx=bx||{};var bD=b.ajaxSetup({},bx),bS=bD.context||bD,bG=bS!==bD&&(bS.nodeType||bS instanceof b)?b(bS):b.event,bR=b.Deferred(),bN=b.Callbacks("once memory"),bB=bD.statusCode||{},bC,bH={},bO={},bQ,by,bL,bE,bI,bA=0,bw,bK,bJ={readyState:0,setRequestHeader:function(bT,bU){if(!bA){var e=bT.toLowerCase();bT=bO[e]=bO[e]||bT;bH[bT]=bU}return this},getAllResponseHeaders:function(){return bA===2?bQ:null},getResponseHeader:function(bT){var e;if(bA===2){if(!by){by={};while((e=aD.exec(bQ))){by[e[1].toLowerCase()]=e[2]}}e=by[bT.toLowerCase()]}return e===L?null:e},overrideMimeType:function(e){if(!bA){bD.mimeType=e}return this},abort:function(e){e=e||"abort";if(bL){bL.abort(e)}bF(0,e);return this}};function bF(bZ,bU,b0,bW){if(bA===2){return}bA=2;if(bE){clearTimeout(bE)}bL=L;bQ=bW||"";bJ.readyState=bZ>0?4:0;var bT,b4,b3,bX=bU,bY=b0?bj(bD,bJ,b0):L,bV,b2;if(bZ>=200&&bZ<300||bZ===304){if(bD.ifModified){if((bV=bJ.getResponseHeader("Last-Modified"))){b.lastModified[bC]=bV}if((b2=bJ.getResponseHeader("Etag"))){b.etag[bC]=b2}}if(bZ===304){bX="notmodified";bT=true}else{try{b4=G(bD,bY);bX="success";bT=true}catch(b1){bX="parsererror";b3=b1}}}else{b3=bX;if(!bX||bZ){bX="error";if(bZ<0){bZ=0}}}bJ.status=bZ;bJ.statusText=""+(bU||bX);if(bT){bR.resolveWith(bS,[b4,bX,bJ])}else{bR.rejectWith(bS,[bJ,bX,b3])}bJ.statusCode(bB);bB=L;if(bw){bG.trigger("ajax"+(bT?"Success":"Error"),[bJ,bD,bT?b4:b3])}bN.fireWith(bS,[bJ,bX]);if(bw){bG.trigger("ajaxComplete",[bJ,bD]);if(!(--b.active)){b.event.trigger("ajaxStop")}}}bR.promise(bJ);bJ.success=bJ.done;bJ.error=bJ.fail;bJ.complete=bN.add;bJ.statusCode=function(bT){if(bT){var e;if(bA<2){for(e in bT){bB[e]=[bB[e],bT[e]]}}else{e=bT[bJ.status];bJ.then(e,e)}}return this};bD.url=((bz||bD.url)+"").replace(bq,"").replace(c,s[1]+"//");bD.dataTypes=b.trim(bD.dataType||"*").toLowerCase().split(h);if(bD.crossDomain==null){bI=K.exec(bD.url.toLowerCase());bD.crossDomain=!!(bI&&(bI[1]!=s[1]||bI[2]!=s[2]||(bI[3]||(bI[1]==="http:"?80:443))!=(s[3]||(s[1]==="http:"?80:443))))}if(bD.data&&bD.processData&&typeof bD.data!=="string"){bD.data=b.param(bD.data,bD.traditional)}aW(aa,bD,bx,bJ);if(bA===2){return false}bw=bD.global;bD.type=bD.type.toUpperCase();bD.hasContent=!aQ.test(bD.type);if(bw&&b.active++===0){b.event.trigger("ajaxStart")}if(!bD.hasContent){if(bD.data){bD.url+=(M.test(bD.url)?"&":"?")+bD.data;delete bD.data}bC=bD.url;if(bD.cache===false){var bv=b.now(),bP=bD.url.replace(br,"$1_="+bv);bD.url=bP+((bP===bD.url)?(M.test(bD.url)?"&":"?")+"_="+bv:"")}}if(bD.data&&bD.hasContent&&bD.contentType!==false||bx.contentType){bJ.setRequestHeader("Content-Type",bD.contentType)}if(bD.ifModified){bC=bC||bD.url;if(b.lastModified[bC]){bJ.setRequestHeader("If-Modified-Since",b.lastModified[bC])}if(b.etag[bC]){bJ.setRequestHeader("If-None-Match",b.etag[bC])}}bJ.setRequestHeader("Accept",bD.dataTypes[0]&&bD.accepts[bD.dataTypes[0]]?bD.accepts[bD.dataTypes[0]]+(bD.dataTypes[0]!=="*"?", "+aV+"; q=0.01":""):bD.accepts["*"]);for(bK in bD.headers){bJ.setRequestHeader(bK,bD.headers[bK])}if(bD.beforeSend&&(bD.beforeSend.call(bS,bJ,bD)===false||bA===2)){bJ.abort();return false}for(bK in {success:1,error:1,complete:1}){bJ[bK](bD[bK])}bL=aW(r,bD,bx,bJ);if(!bL){bF(-1,"No Transport")}else{bJ.readyState=1;if(bw){bG.trigger("ajaxSend",[bJ,bD])}if(bD.async&&bD.timeout>0){bE=setTimeout(function(){bJ.abort("timeout")},bD.timeout)}try{bA=1;bL.send(bH,bF)}catch(bM){if(bA<2){bF(-1,bM)}else{throw bM}}}return bJ},param:function(e,bw){var bv=[],by=function(bz,bA){bA=b.isFunction(bA)?bA():bA;bv[bv.length]=encodeURIComponent(bz)+"="+encodeURIComponent(bA)};if(bw===L){bw=b.ajaxSettings.traditional}if(b.isArray(e)||(e.jquery&&!b.isPlainObject(e))){b.each(e,function(){by(this.name,this.value)})}else{for(var bx in e){v(bx,e[bx],bw,by)}}return bv.join("&").replace(k,"+")}});function v(bw,by,bv,bx){if(b.isArray(by)){b.each(by,function(bA,bz){if(bv||ap.test(bw)){bx(bw,bz)}else{v(bw+"["+(typeof bz==="object"||b.isArray(bz)?bA:"")+"]",bz,bv,bx)}})}else{if(!bv&&by!=null&&typeof by==="object"){for(var e in by){v(bw+"["+e+"]",by[e],bv,bx)}}else{bx(bw,by)}}}b.extend({active:0,lastModified:{},etag:{}});function bj(bD,bC,bz){var bv=bD.contents,bB=bD.dataTypes,bw=bD.responseFields,by,bA,bx,e;for(bA in bw){if(bA in bz){bC[bw[bA]]=bz[bA]}}while(bB[0]==="*"){bB.shift();if(by===L){by=bD.mimeType||bC.getResponseHeader("content-type")}}if(by){for(bA in bv){if(bv[bA]&&bv[bA].test(by)){bB.unshift(bA);break}}}if(bB[0] in bz){bx=bB[0]}else{for(bA in bz){if(!bB[0]||bD.converters[bA+" "+bB[0]]){bx=bA;break}if(!e){e=bA}}bx=bx||e}if(bx){if(bx!==bB[0]){bB.unshift(bx)}return bz[bx]}}function G(bH,bz){if(bH.dataFilter){bz=bH.dataFilter(bz,bH.dataType)}var bD=bH.dataTypes,bG={},bA,bE,bw=bD.length,bB,bC=bD[0],bx,by,bF,bv,e;for(bA=1;bA<bw;bA++){if(bA===1){for(bE in bH.converters){if(typeof bE==="string"){bG[bE.toLowerCase()]=bH.converters[bE]}}}bx=bC;bC=bD[bA];if(bC==="*"){bC=bx}else{if(bx!=="*"&&bx!==bC){by=bx+" "+bC;bF=bG[by]||bG["* "+bC];if(!bF){e=L;for(bv in bG){bB=bv.split(" ");if(bB[0]===bx||bB[0]==="*"){e=bG[bB[1]+" "+bC];if(e){bv=bG[bv];if(bv===true){bF=e}else{if(e===true){bF=bv}}break}}}}if(!(bF||e)){b.error("No conversion from "+by.replace(" "," to "))}if(bF!==true){bz=bF?bF(bz):e(bv(bz))}}}}return bz}var aC=b.now(),u=/(\=)\?(&|$)|\?\?/i;b.ajaxSetup({jsonp:"callback",jsonpCallback:function(){return b.expando+"_"+(aC++)}});b.ajaxPrefilter("json jsonp",function(bD,bA,bC){var bx=bD.contentType==="application/x-www-form-urlencoded"&&(typeof bD.data==="string");if(bD.dataTypes[0]==="jsonp"||bD.jsonp!==false&&(u.test(bD.url)||bx&&u.test(bD.data))){var bB,bw=bD.jsonpCallback=b.isFunction(bD.jsonpCallback)?bD.jsonpCallback():bD.jsonpCallback,bz=bb[bw],e=bD.url,by=bD.data,bv="$1"+bw+"$2";if(bD.jsonp!==false){e=e.replace(u,bv);if(bD.url===e){if(bx){by=by.replace(u,bv)}if(bD.data===by){e+=(/\?/.test(e)?"&":"?")+bD.jsonp+"="+bw}}}bD.url=e;bD.data=by;bb[bw]=function(bE){bB=[bE]};bC.always(function(){bb[bw]=bz;if(bB&&b.isFunction(bz)){bb[bw](bB[0])}});bD.converters["script json"]=function(){if(!bB){b.error(bw+" was not called")}return bB[0]};bD.dataTypes[0]="json";return"script"}});b.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/javascript|ecmascript/},converters:{"text script":function(e){b.globalEval(e);return e}}});b.ajaxPrefilter("script",function(e){if(e.cache===L){e.cache=false}if(e.crossDomain){e.type="GET";e.global=false}});b.ajaxTransport("script",function(bw){if(bw.crossDomain){var e,bv=av.head||av.getElementsByTagName("head")[0]||av.documentElement;return{send:function(bx,by){e=av.createElement("script");e.async="async";if(bw.scriptCharset){e.charset=bw.scriptCharset}e.src=bw.url;e.onload=e.onreadystatechange=function(bA,bz){if(bz||!e.readyState||/loaded|complete/.test(e.readyState)){e.onload=e.onreadystatechange=null;if(bv&&e.parentNode){bv.removeChild(e)}e=L;if(!bz){by(200,"success")}}};bv.insertBefore(e,bv.firstChild)},abort:function(){if(e){e.onload(0,1)}}}}});var B=bb.ActiveXObject?function(){for(var e in N){N[e](0,1)}}:false,y=0,N;function aL(){try{return new bb.XMLHttpRequest()}catch(bv){}}function aj(){try{return new bb.ActiveXObject("Microsoft.XMLHTTP")}catch(bv){}}b.ajaxSettings.xhr=bb.ActiveXObject?function(){return !this.isLocal&&aL()||aj()}:aL;(function(e){b.extend(b.support,{ajax:!!e,cors:!!e&&("withCredentials" in e)})})(b.ajaxSettings.xhr());if(b.support.ajax){b.ajaxTransport(function(e){if(!e.crossDomain||b.support.cors){var bv;return{send:function(bB,bw){var bA=e.xhr(),bz,by;if(e.username){bA.open(e.type,e.url,e.async,e.username,e.password)}else{bA.open(e.type,e.url,e.async)}if(e.xhrFields){for(by in e.xhrFields){bA[by]=e.xhrFields[by]}}if(e.mimeType&&bA.overrideMimeType){bA.overrideMimeType(e.mimeType)}if(!e.crossDomain&&!bB["X-Requested-With"]){bB["X-Requested-With"]="XMLHttpRequest"}try{for(by in bB){bA.setRequestHeader(by,bB[by])}}catch(bx){}bA.send((e.hasContent&&e.data)||null);bv=function(bK,bE){var bF,bD,bC,bI,bH;try{if(bv&&(bE||bA.readyState===4)){bv=L;if(bz){bA.onreadystatechange=b.noop;if(B){delete N[bz]}}if(bE){if(bA.readyState!==4){bA.abort()}}else{bF=bA.status;bC=bA.getAllResponseHeaders();bI={};bH=bA.responseXML;if(bH&&bH.documentElement){bI.xml=bH}bI.text=bA.responseText;try{bD=bA.statusText}catch(bJ){bD=""}if(!bF&&e.isLocal&&!e.crossDomain){bF=bI.text?200:404}else{if(bF===1223){bF=204}}}}}catch(bG){if(!bE){bw(-1,bG)}}if(bI){bw(bF,bD,bI,bC)}};if(!e.async||bA.readyState===4){bv()}else{bz=++y;if(B){if(!N){N={};b(bb).unload(B)}N[bz]=bv}bA.onreadystatechange=bv}},abort:function(){if(bv){bv(0,1)}}}}})}var Q={},a8,m,aB=/^(?:toggle|show|hide)$/,aT=/^([+\-]=)?([\d+.\-]+)([a-z%]*)$/i,a3,aH=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]],a4;b.fn.extend({show:function(bx,bA,bz){var bw,by;if(bx||bx===0){return this.animate(a0("show",3),bx,bA,bz)}else{for(var bv=0,e=this.length;bv<e;bv++){bw=this[bv];if(bw.style){by=bw.style.display;if(!b._data(bw,"olddisplay")&&by==="none"){by=bw.style.display=""}if(by===""&&b.css(bw,"display")==="none"){b._data(bw,"olddisplay",x(bw.nodeName))}}}for(bv=0;bv<e;bv++){bw=this[bv];if(bw.style){by=bw.style.display;if(by===""||by==="none"){bw.style.display=b._data(bw,"olddisplay")||""}}}return this}},hide:function(bx,bA,bz){if(bx||bx===0){return this.animate(a0("hide",3),bx,bA,bz)}else{var bw,by,bv=0,e=this.length;for(;bv<e;bv++){bw=this[bv];if(bw.style){by=b.css(bw,"display");if(by!=="none"&&!b._data(bw,"olddisplay")){b._data(bw,"olddisplay",by)}}}for(bv=0;bv<e;bv++){if(this[bv].style){this[bv].style.display="none"}}return this}},_toggle:b.fn.toggle,toggle:function(bw,bv,bx){var e=typeof bw==="boolean";if(b.isFunction(bw)&&b.isFunction(bv)){this._toggle.apply(this,arguments)}else{if(bw==null||e){this.each(function(){var by=e?bw:b(this).is(":hidden");b(this)[by?"show":"hide"]()})}else{this.animate(a0("toggle",3),bw,bv,bx)}}return this},fadeTo:function(e,bx,bw,bv){return this.filter(":hidden").css("opacity",0).show().end().animate({opacity:bx},e,bw,bv)},animate:function(bz,bw,by,bx){var e=b.speed(bw,by,bx);if(b.isEmptyObject(bz)){return this.each(e.complete,[false])}bz=b.extend({},bz);function bv(){if(e.queue===false){b._mark(this)}var bE=b.extend({},e),bK=this.nodeType===1,bI=bK&&b(this).is(":hidden"),bB,bF,bD,bJ,bH,bC,bG,bL,bA;bE.animatedProperties={};for(bD in bz){bB=b.camelCase(bD);if(bD!==bB){bz[bB]=bz[bD];delete bz[bD]}bF=bz[bB];if(b.isArray(bF)){bE.animatedProperties[bB]=bF[1];bF=bz[bB]=bF[0]}else{bE.animatedProperties[bB]=bE.specialEasing&&bE.specialEasing[bB]||bE.easing||"swing"}if(bF==="hide"&&bI||bF==="show"&&!bI){return bE.complete.call(this)}if(bK&&(bB==="height"||bB==="width")){bE.overflow=[this.style.overflow,this.style.overflowX,this.style.overflowY];if(b.css(this,"display")==="inline"&&b.css(this,"float")==="none"){if(!b.support.inlineBlockNeedsLayout||x(this.nodeName)==="inline"){this.style.display="inline-block"}else{this.style.zoom=1}}}}if(bE.overflow!=null){this.style.overflow="hidden"}for(bD in bz){bJ=new b.fx(this,bE,bD);bF=bz[bD];if(aB.test(bF)){bA=b._data(this,"toggle"+bD)||(bF==="toggle"?bI?"show":"hide":0);if(bA){b._data(this,"toggle"+bD,bA==="show"?"hide":"show");bJ[bA]()}else{bJ[bF]()}}else{bH=aT.exec(bF);bC=bJ.cur();if(bH){bG=parseFloat(bH[2]);bL=bH[3]||(b.cssNumber[bD]?"":"px");if(bL!=="px"){b.style(this,bD,(bG||1)+bL);bC=((bG||1)/bJ.cur())*bC;b.style(this,bD,bC+bL)}if(bH[1]){bG=((bH[1]==="-="?-1:1)*bG)+bC}bJ.custom(bC,bG,bL)}else{bJ.custom(bC,bF,"")}}}return true}return e.queue===false?this.each(bv):this.queue(e.queue,bv)},stop:function(bw,bv,e){if(typeof bw!=="string"){e=bv;bv=bw;bw=L}if(bv&&bw!==false){this.queue(bw||"fx",[])}return this.each(function(){var bx,by=false,bA=b.timers,bz=b._data(this);if(!e){b._unmark(true,this)}function bB(bE,bF,bD){var bC=bF[bD];b.removeData(bE,bD,true);bC.stop(e)}if(bw==null){for(bx in bz){if(bz[bx]&&bz[bx].stop&&bx.indexOf(".run")===bx.length-4){bB(this,bz,bx)}}}else{if(bz[bx=bw+".run"]&&bz[bx].stop){bB(this,bz,bx)}}for(bx=bA.length;bx--;){if(bA[bx].elem===this&&(bw==null||bA[bx].queue===bw)){if(e){bA[bx](true)}else{bA[bx].saveState()}by=true;bA.splice(bx,1)}}if(!(e&&by)){b.dequeue(this,bw)}})}});function bh(){setTimeout(at,0);return(a4=b.now())}function at(){a4=L}function a0(bv,e){var bw={};b.each(aH.concat.apply([],aH.slice(0,e)),function(){bw[this]=bv});return bw}b.each({slideDown:a0("show",1),slideUp:a0("hide",1),slideToggle:a0("toggle",1),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,bv){b.fn[e]=function(bw,by,bx){return this.animate(bv,bw,by,bx)}});b.extend({speed:function(bw,bx,bv){var e=bw&&typeof bw==="object"?b.extend({},bw):{complete:bv||!bv&&bx||b.isFunction(bw)&&bw,duration:bw,easing:bv&&bx||bx&&!b.isFunction(bx)&&bx};e.duration=b.fx.off?0:typeof e.duration==="number"?e.duration:e.duration in b.fx.speeds?b.fx.speeds[e.duration]:b.fx.speeds._default;if(e.queue==null||e.queue===true){e.queue="fx"}e.old=e.complete;e.complete=function(by){if(b.isFunction(e.old)){e.old.call(this)}if(e.queue){b.dequeue(this,e.queue)}else{if(by!==false){b._unmark(this)}}};return e},easing:{linear:function(bw,bx,e,bv){return e+bv*bw},swing:function(bw,bx,e,bv){return((-Math.cos(bw*Math.PI)/2)+0.5)*bv+e}},timers:[],fx:function(bv,e,bw){this.options=e;this.elem=bv;this.prop=bw;e.orig=e.orig||{}}});b.fx.prototype={update:function(){if(this.options.step){this.options.step.call(this.elem,this.now,this)}(b.fx.step[this.prop]||b.fx.step._default)(this)},cur:function(){if(this.elem[this.prop]!=null&&(!this.elem.style||this.elem.style[this.prop]==null)){return this.elem[this.prop]}var e,bv=b.css(this.elem,this.prop);return isNaN(e=parseFloat(bv))?!bv||bv==="auto"?0:bv:e},custom:function(bz,by,bx){var e=this,bw=b.fx;this.startTime=a4||bh();this.end=by;this.now=this.start=bz;this.pos=this.state=0;this.unit=bx||this.unit||(b.cssNumber[this.prop]?"":"px");function bv(bA){return e.step(bA)}bv.queue=this.options.queue;bv.elem=this.elem;bv.saveState=function(){if(e.options.hide&&b._data(e.elem,"fxshow"+e.prop)===L){b._data(e.elem,"fxshow"+e.prop,e.start)}};if(bv()&&b.timers.push(bv)&&!a3){a3=setInterval(bw.tick,bw.interval)}},show:function(){var e=b._data(this.elem,"fxshow"+this.prop);this.options.orig[this.prop]=e||b.style(this.elem,this.prop);this.options.show=true;if(e!==L){this.custom(this.cur(),e)}else{this.custom(this.prop==="width"||this.prop==="height"?1:0,this.cur())}b(this.elem).show()},hide:function(){this.options.orig[this.prop]=b._data(this.elem,"fxshow"+this.prop)||b.style(this.elem,this.prop);this.options.hide=true;this.custom(this.cur(),0)},step:function(by){var bA,bB,bv,bx=a4||bh(),e=true,bz=this.elem,bw=this.options;if(by||bx>=bw.duration+this.startTime){this.now=this.end;this.pos=this.state=1;this.update();bw.animatedProperties[this.prop]=true;for(bA in bw.animatedProperties){if(bw.animatedProperties[bA]!==true){e=false}}if(e){if(bw.overflow!=null&&!b.support.shrinkWrapBlocks){b.each(["","X","Y"],function(bC,bD){bz.style["overflow"+bD]=bw.overflow[bC]})}if(bw.hide){b(bz).hide()}if(bw.hide||bw.show){for(bA in bw.animatedProperties){b.style(bz,bA,bw.orig[bA]);b.removeData(bz,"fxshow"+bA,true);b.removeData(bz,"toggle"+bA,true)}}bv=bw.complete;if(bv){bw.complete=false;bv.call(bz)}}return false}else{if(bw.duration==Infinity){this.now=bx}else{bB=bx-this.startTime;this.state=bB/bw.duration;this.pos=b.easing[bw.animatedProperties[this.prop]](this.state,bB,0,1,bw.duration);this.now=this.start+((this.end-this.start)*this.pos)}this.update()}return true}};b.extend(b.fx,{tick:function(){var bw,bv=b.timers,e=0;for(;e<bv.length;e++){bw=bv[e];if(!bw()&&bv[e]===bw){bv.splice(e--,1)}}if(!bv.length){b.fx.stop()}},interval:13,stop:function(){clearInterval(a3);a3=null},speeds:{slow:600,fast:200,_default:400},step:{opacity:function(e){b.style(e.elem,"opacity",e.now)},_default:function(e){if(e.elem.style&&e.elem.style[e.prop]!=null){e.elem.style[e.prop]=e.now+e.unit}else{e.elem[e.prop]=e.now}}}});b.each(["width","height"],function(e,bv){b.fx.step[bv]=function(bw){b.style(bw.elem,bv,Math.max(0,bw.now)+bw.unit)}});if(b.expr&&b.expr.filters){b.expr.filters.animated=function(e){return b.grep(b.timers,function(bv){return e===bv.elem}).length}}function x(bx){if(!Q[bx]){var e=av.body,bv=b("<"+bx+">").appendTo(e),bw=bv.css("display");bv.remove();if(bw==="none"||bw===""){if(!a8){a8=av.createElement("iframe");a8.frameBorder=a8.width=a8.height=0}e.appendChild(a8);if(!m||!a8.createElement){m=(a8.contentWindow||a8.contentDocument).document;m.write((av.compatMode==="CSS1Compat"?"<!doctype html>":"")+"<html><body>");m.close()}bv=m.createElement(bx);m.body.appendChild(bv);bw=b.css(bv,"display");e.removeChild(a8)}Q[bx]=bw}return Q[bx]}var V=/^t(?:able|d|h)$/i,ad=/^(?:body|html)$/i;if("getBoundingClientRect" in av.documentElement){b.fn.offset=function(bI){var by=this[0],bB;if(bI){return this.each(function(e){b.offset.setOffset(this,bI,e)})}if(!by||!by.ownerDocument){return null}if(by===by.ownerDocument.body){return b.offset.bodyOffset(by)}try{bB=by.getBoundingClientRect()}catch(bF){}var bH=by.ownerDocument,bw=bH.documentElement;if(!bB||!b.contains(bw,by)){return bB?{top:bB.top,left:bB.left}:{top:0,left:0}}var bC=bH.body,bD=aK(bH),bA=bw.clientTop||bC.clientTop||0,bE=bw.clientLeft||bC.clientLeft||0,bv=bD.pageYOffset||b.support.boxModel&&bw.scrollTop||bC.scrollTop,bz=bD.pageXOffset||b.support.boxModel&&bw.scrollLeft||bC.scrollLeft,bG=bB.top+bv-bA,bx=bB.left+bz-bE;return{top:bG,left:bx}}}else{b.fn.offset=function(bF){var bz=this[0];if(bF){return this.each(function(bG){b.offset.setOffset(this,bF,bG)})}if(!bz||!bz.ownerDocument){return null}if(bz===bz.ownerDocument.body){return b.offset.bodyOffset(bz)}var bC,bw=bz.offsetParent,bv=bz,bE=bz.ownerDocument,bx=bE.documentElement,bA=bE.body,bB=bE.defaultView,e=bB?bB.getComputedStyle(bz,null):bz.currentStyle,bD=bz.offsetTop,by=bz.offsetLeft;while((bz=bz.parentNode)&&bz!==bA&&bz!==bx){if(b.support.fixedPosition&&e.position==="fixed"){break}bC=bB?bB.getComputedStyle(bz,null):bz.currentStyle;bD-=bz.scrollTop;by-=bz.scrollLeft;if(bz===bw){bD+=bz.offsetTop;by+=bz.offsetLeft;if(b.support.doesNotAddBorder&&!(b.support.doesAddBorderForTableAndCells&&V.test(bz.nodeName))){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}bv=bw;bw=bz.offsetParent}if(b.support.subtractsBorderForOverflowNotVisible&&bC.overflow!=="visible"){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}e=bC}if(e.position==="relative"||e.position==="static"){bD+=bA.offsetTop;by+=bA.offsetLeft}if(b.support.fixedPosition&&e.position==="fixed"){bD+=Math.max(bx.scrollTop,bA.scrollTop);by+=Math.max(bx.scrollLeft,bA.scrollLeft)}return{top:bD,left:by}}}b.offset={bodyOffset:function(e){var bw=e.offsetTop,bv=e.offsetLeft;if(b.support.doesNotIncludeMarginInBodyOffset){bw+=parseFloat(b.css(e,"marginTop"))||0;bv+=parseFloat(b.css(e,"marginLeft"))||0}return{top:bw,left:bv}},setOffset:function(bx,bG,bA){var bB=b.css(bx,"position");if(bB==="static"){bx.style.position="relative"}var bz=b(bx),bv=bz.offset(),e=b.css(bx,"top"),bE=b.css(bx,"left"),bF=(bB==="absolute"||bB==="fixed")&&b.inArray("auto",[e,bE])>-1,bD={},bC={},bw,by;if(bF){bC=bz.position();bw=bC.top;by=bC.left}else{bw=parseFloat(e)||0;by=parseFloat(bE)||0}if(b.isFunction(bG)){bG=bG.call(bx,bA,bv)}if(bG.top!=null){bD.top=(bG.top-bv.top)+bw}if(bG.left!=null){bD.left=(bG.left-bv.left)+by}if("using" in bG){bG.using.call(bx,bD)}else{bz.css(bD)}}};b.fn.extend({position:function(){if(!this[0]){return null}var bw=this[0],bv=this.offsetParent(),bx=this.offset(),e=ad.test(bv[0].nodeName)?{top:0,left:0}:bv.offset();bx.top-=parseFloat(b.css(bw,"marginTop"))||0;bx.left-=parseFloat(b.css(bw,"marginLeft"))||0;e.top+=parseFloat(b.css(bv[0],"borderTopWidth"))||0;e.left+=parseFloat(b.css(bv[0],"borderLeftWidth"))||0;return{top:bx.top-e.top,left:bx.left-e.left}},offsetParent:function(){return this.map(function(){var e=this.offsetParent||av.body;while(e&&(!ad.test(e.nodeName)&&b.css(e,"position")==="static")){e=e.offsetParent}return e})}});b.each(["Left","Top"],function(bv,e){var bw="scroll"+e;b.fn[bw]=function(bz){var bx,by;if(bz===L){bx=this[0];if(!bx){return null}by=aK(bx);return by?("pageXOffset" in by)?by[bv?"pageYOffset":"pageXOffset"]:b.support.boxModel&&by.document.documentElement[bw]||by.document.body[bw]:bx[bw]}return this.each(function(){by=aK(this);if(by){by.scrollTo(!bv?bz:b(by).scrollLeft(),bv?bz:b(by).scrollTop())}else{this[bw]=bz}})}});function aK(e){return b.isWindow(e)?e:e.nodeType===9?e.defaultView||e.parentWindow:false}b.each(["Height","Width"],function(bv,e){var bw=e.toLowerCase();b.fn["inner"+e]=function(){var bx=this[0];return bx?bx.style?parseFloat(b.css(bx,bw,"padding")):this[bw]():null};b.fn["outer"+e]=function(by){var bx=this[0];return bx?bx.style?parseFloat(b.css(bx,bw,by?"margin":"border")):this[bw]():null};b.fn[bw]=function(bz){var bA=this[0];if(!bA){return bz==null?null:this}if(b.isFunction(bz)){return this.each(function(bE){var bD=b(this);bD[bw](bz.call(this,bE,bD[bw]()))})}if(b.isWindow(bA)){var bB=bA.document.documentElement["client"+e],bx=bA.document.body;return bA.document.compatMode==="CSS1Compat"&&bB||bx&&bx["client"+e]||bB}else{if(bA.nodeType===9){return Math.max(bA.documentElement["client"+e],bA.body["scroll"+e],bA.documentElement["scroll"+e],bA.body["offset"+e],bA.documentElement["offset"+e])}else{if(bz===L){var bC=b.css(bA,bw),by=parseFloat(bC);return b.isNumeric(by)?by:bC}else{return this.css(bw,typeof bz==="string"?bz:bz+"px")}}}}});bb.jQuery=bb.$=b;if(typeof define==="function"&&define.amd&&define.amd.jQuery){define("jquery",[],function(){return b})}})(window);/*!
- * jQuery UI 1.8.18
- *
- * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- * http://jquery.org/license
- *
- * http://docs.jquery.com/UI
- */
-(function(a,d){a.ui=a.ui||{};if(a.ui.version){return}a.extend(a.ui,{version:"1.8.18",keyCode:{ALT:18,BACKSPACE:8,CAPS_LOCK:20,COMMA:188,COMMAND:91,COMMAND_LEFT:91,COMMAND_RIGHT:93,CONTROL:17,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,INSERT:45,LEFT:37,MENU:93,NUMPAD_ADD:107,NUMPAD_DECIMAL:110,NUMPAD_DIVIDE:111,NUMPAD_ENTER:108,NUMPAD_MULTIPLY:106,NUMPAD_SUBTRACT:109,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SHIFT:16,SPACE:32,TAB:9,UP:38,WINDOWS:91}});a.fn.extend({propAttr:a.fn.prop||a.fn.attr,_focus:a.fn.focus,focus:function(e,f){return typeof e==="number"?this.each(function(){var g=this;setTimeout(function(){a(g).focus();if(f){f.call(g)}},e)}):this._focus.apply(this,arguments)},scrollParent:function(){var e;if((a.browser.msie&&(/(static|relative)/).test(this.css("position")))||(/absolute/).test(this.css("position"))){e=this.parents().filter(function(){return(/(relative|absolute|fixed)/).test(a.curCSS(this,"position",1))&&(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}else{e=this.parents().filter(function(){return(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}return(/fixed/).test(this.css("position"))||!e.length?a(document):e},zIndex:function(h){if(h!==d){return this.css("zIndex",h)}if(this.length){var f=a(this[0]),e,g;while(f.length&&f[0]!==document){e=f.css("position");if(e==="absolute"||e==="relative"||e==="fixed"){g=parseInt(f.css("zIndex"),10);if(!isNaN(g)&&g!==0){return g}}f=f.parent()}}return 0},disableSelection:function(){return this.bind((a.support.selectstart?"selectstart":"mousedown")+".ui-disableSelection",function(e){e.preventDefault()})},enableSelection:function(){return this.unbind(".ui-disableSelection")}});a.each(["Width","Height"],function(g,e){var f=e==="Width"?["Left","Right"]:["Top","Bottom"],h=e.toLowerCase(),k={innerWidth:a.fn.innerWidth,innerHeight:a.fn.innerHeight,outerWidth:a.fn.outerWidth,outerHeight:a.fn.outerHeight};function j(m,l,i,n){a.each(f,function(){l-=parseFloat(a.curCSS(m,"padding"+this,true))||0;if(i){l-=parseFloat(a.curCSS(m,"border"+this+"Width",true))||0}if(n){l-=parseFloat(a.curCSS(m,"margin"+this,true))||0}});return l}a.fn["inner"+e]=function(i){if(i===d){return k["inner"+e].call(this)}return this.each(function(){a(this).css(h,j(this,i)+"px")})};a.fn["outer"+e]=function(i,l){if(typeof i!=="number"){return k["outer"+e].call(this,i)}return this.each(function(){a(this).css(h,j(this,i,true,l)+"px")})}});function c(g,e){var j=g.nodeName.toLowerCase();if("area"===j){var i=g.parentNode,h=i.name,f;if(!g.href||!h||i.nodeName.toLowerCase()!=="map"){return false}f=a("img[usemap=#"+h+"]")[0];return !!f&&b(f)}return(/input|select|textarea|button|object/.test(j)?!g.disabled:"a"==j?g.href||e:e)&&b(g)}function b(e){return !a(e).parents().andSelf().filter(function(){return a.curCSS(this,"visibility")==="hidden"||a.expr.filters.hidden(this)}).length}a.extend(a.expr[":"],{data:function(g,f,e){return !!a.data(g,e[3])},focusable:function(e){return c(e,!isNaN(a.attr(e,"tabindex")))},tabbable:function(g){var e=a.attr(g,"tabindex"),f=isNaN(e);return(f||e>=0)&&c(g,!f)}});a(function(){var e=document.body,f=e.appendChild(f=document.createElement("div"));f.offsetHeight;a.extend(f.style,{minHeight:"100px",height:"auto",padding:0,borderWidth:0});a.support.minHeight=f.offsetHeight===100;a.support.selectstart="onselectstart" in f;e.removeChild(f).style.display="none"});a.extend(a.ui,{plugin:{add:function(f,g,j){var h=a.ui[f].prototype;for(var e in j){h.plugins[e]=h.plugins[e]||[];h.plugins[e].push([g,j[e]])}},call:function(e,g,f){var j=e.plugins[g];if(!j||!e.element[0].parentNode){return}for(var h=0;h<j.length;h++){if(e.options[j[h][0]]){j[h][1].apply(e.element,f)}}}},contains:function(f,e){return document.compareDocumentPosition?f.compareDocumentPosition(e)&16:f!==e&&f.contains(e)},hasScroll:function(h,f){if(a(h).css("overflow")==="hidden"){return false}var e=(f&&f==="left")?"scrollLeft":"scrollTop",g=false;if(h[e]>0){return true}h[e]=1;g=(h[e]>0);h[e]=0;return g},isOverAxis:function(f,e,g){return(f>e)&&(f<(e+g))},isOver:function(j,f,i,h,e,g){return a.ui.isOverAxis(j,i,e)&&a.ui.isOverAxis(f,h,g)}})})(jQuery);/*!
- * jQuery UI Widget 1.8.18
- *
- * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- * http://jquery.org/license
- *
- * http://docs.jquery.com/UI/Widget
- */
-(function(b,d){if(b.cleanData){var c=b.cleanData;b.cleanData=function(f){for(var g=0,h;(h=f[g])!=null;g++){try{b(h).triggerHandler("remove")}catch(j){}}c(f)}}else{var a=b.fn.remove;b.fn.remove=function(e,f){return this.each(function(){if(!f){if(!e||b.filter(e,[this]).length){b("*",this).add([this]).each(function(){try{b(this).triggerHandler("remove")}catch(g){}})}}return a.call(b(this),e,f)})}}b.widget=function(f,h,e){var g=f.split(".")[0],j;f=f.split(".")[1];j=g+"-"+f;if(!e){e=h;h=b.Widget}b.expr[":"][j]=function(k){return !!b.data(k,f)};b[g]=b[g]||{};b[g][f]=function(k,l){if(arguments.length){this._createWidget(k,l)}};var i=new h();i.options=b.extend(true,{},i.options);b[g][f].prototype=b.extend(true,i,{namespace:g,widgetName:f,widgetEventPrefix:b[g][f].prototype.widgetEventPrefix||f,widgetBaseClass:j},e);b.widget.bridge(f,b[g][f])};b.widget.bridge=function(f,e){b.fn[f]=function(i){var g=typeof i==="string",h=Array.prototype.slice.call(arguments,1),j=this;i=!g&&h.length?b.extend.apply(null,[true,i].concat(h)):i;if(g&&i.charAt(0)==="_"){return j}if(g){this.each(function(){var k=b.data(this,f),l=k&&b.isFunction(k[i])?k[i].apply(k,h):k;if(l!==k&&l!==d){j=l;return false}})}else{this.each(function(){var k=b.data(this,f);if(k){k.option(i||{})._init()}else{b.data(this,f,new e(i,this))}})}return j}};b.Widget=function(e,f){if(arguments.length){this._createWidget(e,f)}};b.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",options:{disabled:false},_createWidget:function(f,g){b.data(g,this.widgetName,this);this.element=b(g);this.options=b.extend(true,{},this.options,this._getCreateOptions(),f);var e=this;this.element.bind("remove."+this.widgetName,function(){e.destroy()});this._create();this._trigger("create");this._init()},_getCreateOptions:function(){return b.metadata&&b.metadata.get(this.element[0])[this.widgetName]},_create:function(){},_init:function(){},destroy:function(){this.element.unbind("."+this.widgetName).removeData(this.widgetName);this.widget().unbind("."+this.widgetName).removeAttr("aria-disabled").removeClass(this.widgetBaseClass+"-disabled ui-state-disabled")},widget:function(){return this.element},option:function(f,g){var e=f;if(arguments.length===0){return b.extend({},this.options)}if(typeof f==="string"){if(g===d){return this.options[f]}e={};e[f]=g}this._setOptions(e);return this},_setOptions:function(f){var e=this;b.each(f,function(g,h){e._setOption(g,h)});return this},_setOption:function(e,f){this.options[e]=f;if(e==="disabled"){this.widget()[f?"addClass":"removeClass"](this.widgetBaseClass+"-disabled ui-state-disabled").attr("aria-disabled",f)}return this},enable:function(){return this._setOption("disabled",false)},disable:function(){return this._setOption("disabled",true)},_trigger:function(e,f,g){var j,i,h=this.options[e];g=g||{};f=b.Event(f);f.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase();f.target=this.element[0];i=f.originalEvent;if(i){for(j in i){if(!(j in f)){f[j]=i[j]}}}this.element.trigger(f,g);return !(b.isFunction(h)&&h.call(this.element[0],f,g)===false||f.isDefaultPrevented())}}})(jQuery);/*!
- * jQuery UI Mouse 1.8.18
- *
- * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about)
- * Dual licensed under the MIT or GPL Version 2 licenses.
- * http://jquery.org/license
- *
- * http://docs.jquery.com/UI/Mouse
- *
- * Depends:
- *	jquery.ui.widget.js
- */
-(function(b,c){var a=false;b(document).mouseup(function(d){a=false});b.widget("ui.mouse",{options:{cancel:":input,option",distance:1,delay:0},_mouseInit:function(){var d=this;this.element.bind("mousedown."+this.widgetName,function(e){return d._mouseDown(e)}).bind("click."+this.widgetName,function(e){if(true===b.data(e.target,d.widgetName+".preventClickEvent")){b.removeData(e.target,d.widgetName+".preventClickEvent");e.stopImmediatePropagation();return false}});this.started=false},_mouseDestroy:function(){this.element.unbind("."+this.widgetName)},_mouseDown:function(f){if(a){return}(this._mouseStarted&&this._mouseUp(f));this._mouseDownEvent=f;var e=this,g=(f.which==1),d=(typeof this.options.cancel=="string"&&f.target.nodeName?b(f.target).closest(this.options.cancel).length:false);if(!g||d||!this._mouseCapture(f)){return true}this.mouseDelayMet=!this.options.delay;if(!this.mouseDelayMet){this._mouseDelayTimer=setTimeout(function(){e.mouseDelayMet=true},this.options.delay)}if(this._mouseDistanceMet(f)&&this._mouseDelayMet(f)){this._mouseStarted=(this._mouseStart(f)!==false);if(!this._mouseStarted){f.preventDefault();return true}}if(true===b.data(f.target,this.widgetName+".preventClickEvent")){b.removeData(f.target,this.widgetName+".preventClickEvent")}this._mouseMoveDelegate=function(h){return e._mouseMove(h)};this._mouseUpDelegate=function(h){return e._mouseUp(h)};b(document).bind("mousemove."+this.widgetName,this._mouseMoveDelegate).bind("mouseup."+this.widgetName,this._mouseUpDelegate);f.preventDefault();a=true;return true},_mouseMove:function(d){if(b.browser.msie&&!(document.documentMode>=9)&&!d.button){return this._mouseUp(d)}if(this._mouseStarted){this._mouseDrag(d);return d.preventDefault()}if(this._mouseDistanceMet(d)&&this._mouseDelayMet(d)){this._mouseStarted=(this._mouseStart(this._mouseDownEvent,d)!==false);(this._mouseStarted?this._mouseDrag(d):this._mouseUp(d))}return !this._mouseStarted},_mouseUp:function(d){b(document).unbind("mousemove."+this.widgetName,this._mouseMoveDelegate).unbind("mouseup."+this.widgetName,this._mouseUpDelegate);if(this._mouseStarted){this._mouseStarted=false;if(d.target==this._mouseDownEvent.target){b.data(d.target,this.widgetName+".preventClickEvent",true)}this._mouseStop(d)}return false},_mouseDistanceMet:function(d){return(Math.max(Math.abs(this._mouseDownEvent.pageX-d.pageX),Math.abs(this._mouseDownEvent.pageY-d.pageY))>=this.options.distance)},_mouseDelayMet:function(d){return this.mouseDelayMet},_mouseStart:function(d){},_mouseDrag:function(d){},_mouseStop:function(d){},_mouseCapture:function(d){return true}})})(jQuery);(function(c,d){c.widget("ui.resizable",c.ui.mouse,{widgetEventPrefix:"resize",options:{alsoResize:false,animate:false,animateDuration:"slow",animateEasing:"swing",aspectRatio:false,autoHide:false,containment:false,ghost:false,grid:false,handles:"e,s,se",helper:false,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:1000},_create:function(){var f=this,k=this.options;this.element.addClass("ui-resizable");c.extend(this,{_aspectRatio:!!(k.aspectRatio),aspectRatio:k.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:k.helper||k.ghost||k.animate?k.helper||"ui-resizable-helper":null});if(this.element[0].nodeName.match(/canvas|textarea|input|select|button|img/i)){this.element.wrap(c('<div class="ui-wrapper" style="overflow: hidden;"></div>').css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")}));this.element=this.element.parent().data("resizable",this.element.data("resizable"));this.elementIsWrapper=true;this.element.css({marginLeft:this.originalElement.css("marginLeft"),marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom")});this.originalElement.css({marginLeft:0,marginTop:0,marginRight:0,marginBottom:0});this.originalResizeStyle=this.originalElement.css("resize");this.originalElement.css("resize","none");this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"}));this.originalElement.css({margin:this.originalElement.css("margin")});this._proportionallyResize()}this.handles=k.handles||(!c(".ui-resizable-handle",this.element).length?"e,s,se":{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"});if(this.handles.constructor==String){if(this.handles=="all"){this.handles="n,e,s,w,se,sw,ne,nw"}var l=this.handles.split(",");this.handles={};for(var g=0;g<l.length;g++){var j=c.trim(l[g]),e="ui-resizable-"+j;var h=c('<div class="ui-resizable-handle '+e+'"></div>');if(/sw|se|ne|nw/.test(j)){h.css({zIndex:++k.zIndex})}if("se"==j){h.addClass("ui-icon ui-icon-gripsmall-diagonal-se")}this.handles[j]=".ui-resizable-"+j;this.element.append(h)}}this._renderAxis=function(q){q=q||this.element;for(var n in this.handles){if(this.handles[n].constructor==String){this.handles[n]=c(this.handles[n],this.element).show()}if(this.elementIsWrapper&&this.originalElement[0].nodeName.match(/textarea|input|select|button/i)){var o=c(this.handles[n],this.element),p=0;p=/sw|ne|nw|se|n|s/.test(n)?o.outerHeight():o.outerWidth();var m=["padding",/ne|nw|n/.test(n)?"Top":/se|sw|s/.test(n)?"Bottom":/^e$/.test(n)?"Right":"Left"].join("");q.css(m,p);this._proportionallyResize()}if(!c(this.handles[n]).length){continue}}};this._renderAxis(this.element);this._handles=c(".ui-resizable-handle",this.element).disableSelection();this._handles.mouseover(function(){if(!f.resizing){if(this.className){var i=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)}f.axis=i&&i[1]?i[1]:"se"}});if(k.autoHide){this._handles.hide();c(this.element).addClass("ui-resizable-autohide").hover(function(){if(k.disabled){return}c(this).removeClass("ui-resizable-autohide");f._handles.show()},function(){if(k.disabled){return}if(!f.resizing){c(this).addClass("ui-resizable-autohide");f._handles.hide()}})}this._mouseInit()},destroy:function(){this._mouseDestroy();var e=function(g){c(g).removeClass("ui-resizable ui-resizable-disabled ui-resizable-resizing").removeData("resizable").unbind(".resizable").find(".ui-resizable-handle").remove()};if(this.elementIsWrapper){e(this.element);var f=this.element;f.after(this.originalElement.css({position:f.css("position"),width:f.outerWidth(),height:f.outerHeight(),top:f.css("top"),left:f.css("left")})).remove()}this.originalElement.css("resize",this.originalResizeStyle);e(this.originalElement);return this},_mouseCapture:function(f){var g=false;for(var e in this.handles){if(c(this.handles[e])[0]==f.target){g=true}}return !this.options.disabled&&g},_mouseStart:function(g){var j=this.options,f=this.element.position(),e=this.element;this.resizing=true;this.documentScroll={top:c(document).scrollTop(),left:c(document).scrollLeft()};if(e.is(".ui-draggable")||(/absolute/).test(e.css("position"))){e.css({position:"absolute",top:f.top,left:f.left})}this._renderProxy();var k=b(this.helper.css("left")),h=b(this.helper.css("top"));if(j.containment){k+=c(j.containment).scrollLeft()||0;h+=c(j.containment).scrollTop()||0}this.offset=this.helper.offset();this.position={left:k,top:h};this.size=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalSize=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalPosition={left:k,top:h};this.sizeDiff={width:e.outerWidth()-e.width(),height:e.outerHeight()-e.height()};this.originalMousePosition={left:g.pageX,top:g.pageY};this.aspectRatio=(typeof j.aspectRatio=="number")?j.aspectRatio:((this.originalSize.width/this.originalSize.height)||1);var i=c(".ui-resizable-"+this.axis).css("cursor");c("body").css("cursor",i=="auto"?this.axis+"-resize":i);e.addClass("ui-resizable-resizing");this._propagate("start",g);return true},_mouseDrag:function(e){var h=this.helper,g=this.options,m={},q=this,j=this.originalMousePosition,n=this.axis;var r=(e.pageX-j.left)||0,p=(e.pageY-j.top)||0;var i=this._change[n];if(!i){return false}var l=i.apply(this,[e,r,p]),k=c.browser.msie&&c.browser.version<7,f=this.sizeDiff;this._updateVirtualBoundaries(e.shiftKey);if(this._aspectRatio||e.shiftKey){l=this._updateRatio(l,e)}l=this._respectSize(l,e);this._propagate("resize",e);h.css({top:this.position.top+"px",left:this.position.left+"px",width:this.size.width+"px",height:this.size.height+"px"});if(!this._helper&&this._proportionallyResizeElements.length){this._proportionallyResize()}this._updateCache(l);this._trigger("resize",e,this.ui());return false},_mouseStop:function(h){this.resizing=false;var i=this.options,m=this;if(this._helper){var g=this._proportionallyResizeElements,e=g.length&&(/textarea/i).test(g[0].nodeName),f=e&&c.ui.hasScroll(g[0],"left")?0:m.sizeDiff.height,k=e?0:m.sizeDiff.width;var n={width:(m.helper.width()-k),height:(m.helper.height()-f)},j=(parseInt(m.element.css("left"),10)+(m.position.left-m.originalPosition.left))||null,l=(parseInt(m.element.css("top"),10)+(m.position.top-m.originalPosition.top))||null;if(!i.animate){this.element.css(c.extend(n,{top:l,left:j}))}m.helper.height(m.size.height);m.helper.width(m.size.width);if(this._helper&&!i.animate){this._proportionallyResize()}}c("body").css("cursor","auto");this.element.removeClass("ui-resizable-resizing");this._propagate("stop",h);if(this._helper){this.helper.remove()}return false},_updateVirtualBoundaries:function(g){var j=this.options,i,h,f,k,e;e={minWidth:a(j.minWidth)?j.minWidth:0,maxWidth:a(j.maxWidth)?j.maxWidth:Infinity,minHeight:a(j.minHeight)?j.minHeight:0,maxHeight:a(j.maxHeight)?j.maxHeight:Infinity};if(this._aspectRatio||g){i=e.minHeight*this.aspectRatio;f=e.minWidth/this.aspectRatio;h=e.maxHeight*this.aspectRatio;k=e.maxWidth/this.aspectRatio;if(i>e.minWidth){e.minWidth=i}if(f>e.minHeight){e.minHeight=f}if(h<e.maxWidth){e.maxWidth=h}if(k<e.maxHeight){e.maxHeight=k}}this._vBoundaries=e},_updateCache:function(e){var f=this.options;this.offset=this.helper.offset();if(a(e.left)){this.position.left=e.left}if(a(e.top)){this.position.top=e.top}if(a(e.height)){this.size.height=e.height}if(a(e.width)){this.size.width=e.width}},_updateRatio:function(h,g){var i=this.options,j=this.position,f=this.size,e=this.axis;if(a(h.height)){h.width=(h.height*this.aspectRatio)}else{if(a(h.width)){h.height=(h.width/this.aspectRatio)}}if(e=="sw"){h.left=j.left+(f.width-h.width);h.top=null}if(e=="nw"){h.top=j.top+(f.height-h.height);h.left=j.left+(f.width-h.width)}return h},_respectSize:function(l,g){var j=this.helper,i=this._vBoundaries,r=this._aspectRatio||g.shiftKey,q=this.axis,t=a(l.width)&&i.maxWidth&&(i.maxWidth<l.width),m=a(l.height)&&i.maxHeight&&(i.maxHeight<l.height),h=a(l.width)&&i.minWidth&&(i.minWidth>l.width),s=a(l.height)&&i.minHeight&&(i.minHeight>l.height);if(h){l.width=i.minWidth}if(s){l.height=i.minHeight}if(t){l.width=i.maxWidth}if(m){l.height=i.maxHeight}var f=this.originalPosition.left+this.originalSize.width,p=this.position.top+this.size.height;var k=/sw|nw|w/.test(q),e=/nw|ne|n/.test(q);if(h&&k){l.left=f-i.minWidth}if(t&&k){l.left=f-i.maxWidth}if(s&&e){l.top=p-i.minHeight}if(m&&e){l.top=p-i.maxHeight}var n=!l.width&&!l.height;if(n&&!l.left&&l.top){l.top=null}else{if(n&&!l.top&&l.left){l.left=null}}return l},_proportionallyResize:function(){var k=this.options;if(!this._proportionallyResizeElements.length){return}var g=this.helper||this.element;for(var f=0;f<this._proportionallyResizeElements.length;f++){var h=this._proportionallyResizeElements[f];if(!this.borderDif){var e=[h.css("borderTopWidth"),h.css("borderRightWidth"),h.css("borderBottomWidth"),h.css("borderLeftWidth")],j=[h.css("paddingTop"),h.css("paddingRight"),h.css("paddingBottom"),h.css("paddingLeft")];this.borderDif=c.map(e,function(l,n){var m=parseInt(l,10)||0,o=parseInt(j[n],10)||0;return m+o})}if(c.browser.msie&&!(!(c(g).is(":hidden")||c(g).parents(":hidden").length))){continue}h.css({height:(g.height()-this.borderDif[0]-this.borderDif[2])||0,width:(g.width()-this.borderDif[1]-this.borderDif[3])||0})}},_renderProxy:function(){var f=this.element,i=this.options;this.elementOffset=f.offset();if(this._helper){this.helper=this.helper||c('<div style="overflow:hidden;"></div>');var e=c.browser.msie&&c.browser.version<7,g=(e?1:0),h=(e?2:-1);this.helper.addClass(this._helper).css({width:this.element.outerWidth()+h,height:this.element.outerHeight()+h,position:"absolute",left:this.elementOffset.left-g+"px",top:this.elementOffset.top-g+"px",zIndex:++i.zIndex});this.helper.appendTo("body").disableSelection()}else{this.helper=this.element}},_change:{e:function(g,f,e){return{width:this.originalSize.width+f}},w:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{left:i.left+f,width:g.width-f}},n:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{top:i.top+e,height:g.height-e}},s:function(g,f,e){return{height:this.originalSize.height+e}},se:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},sw:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[g,f,e]))},ne:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},nw:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[g,f,e]))}},_propagate:function(f,e){c.ui.plugin.call(this,f,[e,this.ui()]);(f!="resize"&&this._trigger(f,e,this.ui()))},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}});c.extend(c.ui.resizable,{version:"1.8.18"});c.ui.plugin.add("resizable","alsoResize",{start:function(f,g){var e=c(this).data("resizable"),i=e.options;var h=function(j){c(j).each(function(){var k=c(this);k.data("resizable-alsoresize",{width:parseInt(k.width(),10),height:parseInt(k.height(),10),left:parseInt(k.css("left"),10),top:parseInt(k.css("top"),10)})})};if(typeof(i.alsoResize)=="object"&&!i.alsoResize.parentNode){if(i.alsoResize.length){i.alsoResize=i.alsoResize[0];h(i.alsoResize)}else{c.each(i.alsoResize,function(j){h(j)})}}else{h(i.alsoResize)}},resize:function(g,i){var f=c(this).data("resizable"),j=f.options,h=f.originalSize,l=f.originalPosition;var k={height:(f.size.height-h.height)||0,width:(f.size.width-h.width)||0,top:(f.position.top-l.top)||0,left:(f.position.left-l.left)||0},e=function(m,n){c(m).each(function(){var q=c(this),r=c(this).data("resizable-alsoresize"),p={},o=n&&n.length?n:q.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];c.each(o,function(s,u){var t=(r[u]||0)+(k[u]||0);if(t&&t>=0){p[u]=t||null}});q.css(p)})};if(typeof(j.alsoResize)=="object"&&!j.alsoResize.nodeType){c.each(j.alsoResize,function(m,n){e(m,n)})}else{e(j.alsoResize)}},stop:function(e,f){c(this).removeData("resizable-alsoresize")}});c.ui.plugin.add("resizable","animate",{stop:function(i,n){var p=c(this).data("resizable"),j=p.options;var h=p._proportionallyResizeElements,e=h.length&&(/textarea/i).test(h[0].nodeName),f=e&&c.ui.hasScroll(h[0],"left")?0:p.sizeDiff.height,l=e?0:p.sizeDiff.width;var g={width:(p.size.width-l),height:(p.size.height-f)},k=(parseInt(p.element.css("left"),10)+(p.position.left-p.originalPosition.left))||null,m=(parseInt(p.element.css("top"),10)+(p.position.top-p.originalPosition.top))||null;p.element.animate(c.extend(g,m&&k?{top:m,left:k}:{}),{duration:j.animateDuration,easing:j.animateEasing,step:function(){var o={width:parseInt(p.element.css("width"),10),height:parseInt(p.element.css("height"),10),top:parseInt(p.element.css("top"),10),left:parseInt(p.element.css("left"),10)};if(h&&h.length){c(h[0]).css({width:o.width,height:o.height})}p._updateCache(o);p._propagate("resize",i)}})}});c.ui.plugin.add("resizable","containment",{start:function(f,r){var t=c(this).data("resizable"),j=t.options,l=t.element;var g=j.containment,k=(g instanceof c)?g.get(0):(/parent/.test(g))?l.parent().get(0):g;if(!k){return}t.containerElement=c(k);if(/document/.test(g)||g==document){t.containerOffset={left:0,top:0};t.containerPosition={left:0,top:0};t.parentData={element:c(document),left:0,top:0,width:c(document).width(),height:c(document).height()||document.body.parentNode.scrollHeight}}else{var n=c(k),i=[];c(["Top","Right","Left","Bottom"]).each(function(p,o){i[p]=b(n.css("padding"+o))});t.containerOffset=n.offset();t.containerPosition=n.position();t.containerSize={height:(n.innerHeight()-i[3]),width:(n.innerWidth()-i[1])};var q=t.containerOffset,e=t.containerSize.height,m=t.containerSize.width,h=(c.ui.hasScroll(k,"left")?k.scrollWidth:m),s=(c.ui.hasScroll(k)?k.scrollHeight:e);t.parentData={element:k,left:q.left,top:q.top,width:h,height:s}}},resize:function(g,q){var t=c(this).data("resizable"),i=t.options,f=t.containerSize,p=t.containerOffset,m=t.size,n=t.position,r=t._aspectRatio||g.shiftKey,e={top:0,left:0},h=t.containerElement;if(h[0]!=document&&(/static/).test(h.css("position"))){e=p}if(n.left<(t._helper?p.left:0)){t.size.width=t.size.width+(t._helper?(t.position.left-p.left):(t.position.left-e.left));if(r){t.size.height=t.size.width/i.aspectRatio}t.position.left=i.helper?p.left:0}if(n.top<(t._helper?p.top:0)){t.size.height=t.size.height+(t._helper?(t.position.top-p.top):t.position.top);if(r){t.size.width=t.size.height*i.aspectRatio}t.position.top=t._helper?p.top:0}t.offset.left=t.parentData.left+t.position.left;t.offset.top=t.parentData.top+t.position.top;var l=Math.abs((t._helper?t.offset.left-e.left:(t.offset.left-e.left))+t.sizeDiff.width),s=Math.abs((t._helper?t.offset.top-e.top:(t.offset.top-p.top))+t.sizeDiff.height);var k=t.containerElement.get(0)==t.element.parent().get(0),j=/relative|absolute/.test(t.containerElement.css("position"));if(k&&j){l-=t.parentData.left}if(l+t.size.width>=t.parentData.width){t.size.width=t.parentData.width-l;if(r){t.size.height=t.size.width/t.aspectRatio}}if(s+t.size.height>=t.parentData.height){t.size.height=t.parentData.height-s;if(r){t.size.width=t.size.height*t.aspectRatio}}},stop:function(f,n){var q=c(this).data("resizable"),g=q.options,l=q.position,m=q.containerOffset,e=q.containerPosition,i=q.containerElement;var j=c(q.helper),r=j.offset(),p=j.outerWidth()-q.sizeDiff.width,k=j.outerHeight()-q.sizeDiff.height;if(q._helper&&!g.animate&&(/relative/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}if(q._helper&&!g.animate&&(/static/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}}});c.ui.plugin.add("resizable","ghost",{start:function(g,h){var e=c(this).data("resizable"),i=e.options,f=e.size;e.ghost=e.originalElement.clone();e.ghost.css({opacity:0.25,display:"block",position:"relative",height:f.height,width:f.width,margin:0,left:0,top:0}).addClass("ui-resizable-ghost").addClass(typeof i.ghost=="string"?i.ghost:"");e.ghost.appendTo(e.helper)},resize:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost){e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})}},stop:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost&&e.helper){e.helper.get(0).removeChild(e.ghost.get(0))}}});c.ui.plugin.add("resizable","grid",{resize:function(e,m){var p=c(this).data("resizable"),h=p.options,k=p.size,i=p.originalSize,j=p.originalPosition,n=p.axis,l=h._aspectRatio||e.shiftKey;h.grid=typeof h.grid=="number"?[h.grid,h.grid]:h.grid;var g=Math.round((k.width-i.width)/(h.grid[0]||1))*(h.grid[0]||1),f=Math.round((k.height-i.height)/(h.grid[1]||1))*(h.grid[1]||1);if(/^(se|s|e)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f}else{if(/^(ne)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f}else{if(/^(sw)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.left=j.left-g}else{p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f;p.position.left=j.left-g}}}}});var b=function(e){return parseInt(e,10)||0};var a=function(e){return !isNaN(parseInt(e,10))}})(jQuery);/*!
- * jQuery hashchange event - v1.3 - 7/21/2010
- * http://benalman.com/projects/jquery-hashchange-plugin/
- *
- * Copyright (c) 2010 "Cowboy" Ben Alman
- * Dual licensed under the MIT and GPL licenses.
- * http://benalman.com/about/license/
- */
-(function($,e,b){var c="hashchange",h=document,f,g=$.event.special,i=h.documentMode,d="on"+c in e&&(i===b||i>7);function a(j){j=j||location.href;return"#"+j.replace(/^[^#]*#?(.*)$/,"$1")}$.fn[c]=function(j){return j?this.bind(c,j):this.trigger(c)};$.fn[c].delay=50;g[c]=$.extend(g[c],{setup:function(){if(d){return false}$(f.start)},teardown:function(){if(d){return false}$(f.stop)}});f=(function(){var j={},p,m=a(),k=function(q){return q},l=k,o=k;j.start=function(){p||n()};j.stop=function(){p&&clearTimeout(p);p=b};function n(){var r=a(),q=o(m);if(r!==m){l(m=r,q);$(e).trigger(c)}else{if(q!==m){location.href=location.href.replace(/#.*/,"")+q}}p=setTimeout(n,$.fn[c].delay)}$.browser.msie&&!d&&(function(){var q,r;j.start=function(){if(!q){r=$.fn[c].src;r=r&&r+a();q=$('<iframe tabindex="-1" title="empty"/>').hide().one("load",function(){r||l(a());n()}).attr("src",r||"javascript:0").insertAfter("body")[0].contentWindow;h.onpropertychange=function(){try{if(event.propertyName==="title"){q.document.title=h.title}}catch(s){}}}};j.stop=k;o=function(){return a(q.location.href)};l=function(v,s){var u=q.document,t=$.fn[c].domain;if(v!==s){u.title=h.title;u.open();t&&u.write('<script>document.domain="'+t+'"<\/script>');u.close();q.location.hash=v}}})();return j})()})(jQuery,this);(function(c){var a=c.scrollTo=function(f,e,d){c(window).scrollTo(f,e,d)};a.defaults={axis:"xy",duration:parseFloat(c.fn.jquery)>=1.3?0:1};a.window=function(d){return c(window)._scrollable()};c.fn._scrollable=function(){return this.map(function(){var e=this,d=!e.nodeName||c.inArray(e.nodeName.toLowerCase(),["iframe","#document","html","body"])!=-1;if(!d){return e}var f=(e.contentWindow||e).document||e.ownerDocument||e;return c.browser.safari||f.compatMode=="BackCompat"?f.body:f.documentElement})};c.fn.scrollTo=function(f,e,d){if(typeof e=="object"){d=e;e=0}if(typeof d=="function"){d={onAfter:d}}if(f=="max"){f=9000000000}d=c.extend({},a.defaults,d);e=e||d.speed||d.duration;d.queue=d.queue&&d.axis.length>1;if(d.queue){e/=2}d.offset=b(d.offset);d.over=b(d.over);return this._scrollable().each(function(){var l=this,j=c(l),k=f,i,g={},m=j.is("html,body");switch(typeof k){case"number":case"string":if(/^([+-]=)?\d+(\.\d+)?(px|%)?$/.test(k)){k=b(k);break}k=c(k,this);case"object":if(k.is||k.style){i=(k=c(k)).offset()}}c.each(d.axis.split(""),function(q,r){var s=r=="x"?"Left":"Top",u=s.toLowerCase(),p="scroll"+s,o=l[p],n=a.max(l,r);if(i){g[p]=i[u]+(m?0:o-j.offset()[u]);if(d.margin){g[p]-=parseInt(k.css("margin"+s))||0;g[p]-=parseInt(k.css("border"+s+"Width"))||0}g[p]+=d.offset[u]||0;if(d.over[u]){g[p]+=k[r=="x"?"width":"height"]()*d.over[u]}}else{var t=k[u];g[p]=t.slice&&t.slice(-1)=="%"?parseFloat(t)/100*n:t}if(/^\d+$/.test(g[p])){g[p]=g[p]<=0?0:Math.min(g[p],n)}if(!q&&d.queue){if(o!=g[p]){h(d.onAfterFirst)}delete g[p]}});h(d.onAfter);function h(n){j.animate(g,e,d.easing,n&&function(){n.call(this,f,d)})}}).end()};a.max=function(j,i){var h=i=="x"?"Width":"Height",e="scroll"+h;if(!c(j).is("html,body")){return j[e]-c(j)[h.toLowerCase()]()}var g="client"+h,f=j.ownerDocument.documentElement,d=j.ownerDocument.body;return Math.max(f[e],d[e])-Math.min(f[g],d[g])};function b(d){return typeof d=="object"?d:{top:d,left:d}}})(jQuery);/*!
- PowerTip - v1.2.0 - 2013-04-03
- http://stevenbenner.github.com/jquery-powertip/
- Copyright (c) 2013 Steven Benner (http://stevenbenner.com/).
+ PowerTip v1.3.1 (2018-04-15)
+ https://stevenbenner.github.io/jquery-powertip/
+ Copyright (c) 2018 Steven Benner (http://stevenbenner.com/).
  Released under MIT license.
  https://raw.github.com/stevenbenner/jquery-powertip/master/LICENSE.txt
 */
-(function(a){if(typeof define==="function"&&define.amd){define(["jquery"],a)}else{a(jQuery)}}(function(k){var A=k(document),s=k(window),w=k("body");var n="displayController",e="hasActiveHover",d="forcedOpen",u="hasMouseMove",f="mouseOnToPopup",g="originalTitle",y="powertip",o="powertipjq",l="powertiptarget",E=180/Math.PI;var c={isTipOpen:false,isFixedTipOpen:false,isClosing:false,tipOpenImminent:false,activeHover:null,currentX:0,currentY:0,previousX:0,previousY:0,desyncTimeout:null,mouseTrackingActive:false,delayInProgress:false,windowWidth:0,windowHeight:0,scrollTop:0,scrollLeft:0};var p={none:0,top:1,bottom:2,left:4,right:8};k.fn.powerTip=function(F,N){if(!this.length){return this}if(k.type(F)==="string"&&k.powerTip[F]){return k.powerTip[F].call(this,this,N)}var O=k.extend({},k.fn.powerTip.defaults,F),G=new x(O);h();this.each(function M(){var R=k(this),Q=R.data(y),P=R.data(o),T=R.data(l),S;if(R.data(n)){k.powerTip.destroy(R)}S=R.attr("title");if(!Q&&!T&&!P&&S){R.data(y,S);R.data(g,S);R.removeAttr("title")}R.data(n,new t(R,O,G))});if(!O.manual){this.on({"mouseenter.powertip":function J(P){k.powerTip.show(this,P)},"mouseleave.powertip":function L(){k.powerTip.hide(this)},"focus.powertip":function K(){k.powerTip.show(this)},"blur.powertip":function H(){k.powerTip.hide(this,true)},"keydown.powertip":function I(P){if(P.keyCode===27){k.powerTip.hide(this,true)}}})}return this};k.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false};k.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};k.powerTip={show:function z(F,G){if(G){i(G);c.previousX=G.pageX;c.previousY=G.pageY;k(F).data(n).show()}else{k(F).first().data(n).show(true,true)}return F},reposition:function r(F){k(F).first().data(n).resetPosition();return F},hide:function D(G,F){if(G){k(G).first().data(n).hide(F)}else{if(c.activeHover){c.activeHover.data(n).hide(true)}}return G},destroy:function C(G){k(G).off(".powertip").each(function F(){var I=k(this),H=[g,n,e,d];if(I.data(g)){I.attr("title",I.data(g));H.push(y)}I.removeData(H)});return G}};k.powerTip.showTip=k.powerTip.show;k.powerTip.closeTip=k.powerTip.hide;function b(){var F=this;F.top="auto";F.left="auto";F.right="auto";F.bottom="auto";F.set=function(H,G){if(k.isNumeric(G)){F[H]=Math.round(G)}}}function t(K,N,F){var J=null;function L(P,Q){M();if(!K.data(e)){if(!P){c.tipOpenImminent=true;J=setTimeout(function O(){J=null;I()},N.intentPollInterval)}else{if(Q){K.data(d,true)}F.showTip(K)}}}function G(P){M();c.tipOpenImminent=false;if(K.data(e)){K.data(d,false);if(!P){c.delayInProgress=true;J=setTimeout(function O(){J=null;F.hideTip(K);c.delayInProgress=false},N.closeDelay)}else{F.hideTip(K)}}}function I(){var Q=Math.abs(c.previousX-c.currentX),O=Math.abs(c.previousY-c.currentY),P=Q+O;if(P<N.intentSensitivity){F.showTip(K)}else{c.previousX=c.currentX;c.previousY=c.currentY;L()}}function M(){J=clearTimeout(J);c.delayInProgress=false}function H(){F.resetPosition(K)}this.show=L;this.hide=G;this.cancel=M;this.resetPosition=H}function j(){function G(M,L,J,O,P){var K=L.split("-")[0],N=new b(),I;if(q(M)){I=H(M,K)}else{I=F(M,K)}switch(L){case"n":N.set("left",I.left-(J/2));N.set("bottom",c.windowHeight-I.top+P);break;case"e":N.set("left",I.left+P);N.set("top",I.top-(O/2));break;case"s":N.set("left",I.left-(J/2));N.set("top",I.top+P);break;case"w":N.set("top",I.top-(O/2));N.set("right",c.windowWidth-I.left+P);break;case"nw":N.set("bottom",c.windowHeight-I.top+P);N.set("right",c.windowWidth-I.left-20);break;case"nw-alt":N.set("left",I.left);N.set("bottom",c.windowHeight-I.top+P);break;case"ne":N.set("left",I.left-20);N.set("bottom",c.windowHeight-I.top+P);break;case"ne-alt":N.set("bottom",c.windowHeight-I.top+P);N.set("right",c.windowWidth-I.left);break;case"sw":N.set("top",I.top+P);N.set("right",c.windowWidth-I.left-20);break;case"sw-alt":N.set("left",I.left);N.set("top",I.top+P);break;case"se":N.set("left",I.left-20);N.set("top",I.top+P);break;case"se-alt":N.set("top",I.top+P);N.set("right",c.windowWidth-I.left);break}return N}function F(K,J){var O=K.offset(),N=K.outerWidth(),I=K.outerHeight(),M,L;switch(J){case"n":M=O.left+N/2;L=O.top;break;case"e":M=O.left+N;L=O.top+I/2;break;case"s":M=O.left+N/2;L=O.top+I;break;case"w":M=O.left;L=O.top+I/2;break;case"nw":M=O.left;L=O.top;break;case"ne":M=O.left+N;L=O.top;break;case"sw":M=O.left;L=O.top+I;break;case"se":M=O.left+N;L=O.top+I;break}return{top:L,left:M}}function H(O,K){var S=O.closest("svg")[0],N=O[0],W=S.createSVGPoint(),L=N.getBBox(),V=N.getScreenCTM(),M=L.width/2,Q=L.height/2,P=[],I=["nw","n","ne","e","se","s","sw","w"],U,X,R,T;function J(){P.push(W.matrixTransform(V))}W.x=L.x;W.y=L.y;J();W.x+=M;J();W.x+=M;J();W.y+=Q;J();W.y+=Q;J();W.x-=M;J();W.x-=M;J();W.y-=Q;J();if(P[0].y!==P[1].y||P[0].x!==P[7].x){X=Math.atan2(V.b,V.a)*E;R=Math.ceil(((X%360)-22.5)/45);if(R<1){R+=8}while(R--){I.push(I.shift())}}for(T=0;T<P.length;T++){if(I[T]===K){U=P[T];break}}return{top:U.y+c.scrollTop,left:U.x+c.scrollLeft}}this.compute=G}function x(Q){var P=new j(),O=k("#"+Q.popupId);if(O.length===0){O=k("<div/>",{id:Q.popupId});if(w.length===0){w=k("body")}w.append(O)}if(Q.followMouse){if(!O.data(u)){A.on("mousemove",M);s.on("scroll",M);O.data(u,true)}}if(Q.mouseOnToPopup){O.on({mouseenter:function L(){if(O.data(f)){if(c.activeHover){c.activeHover.data(n).cancel()}}},mouseleave:function N(){if(c.activeHover){c.activeHover.data(n).hide()}}})}function I(S){S.data(e,true);O.queue(function R(T){H(S);T()})}function H(S){var U;if(!S.data(e)){return}if(c.isTipOpen){if(!c.isClosing){K(c.activeHover)}O.delay(100).queue(function R(V){H(S);V()});return}S.trigger("powerTipPreRender");U=B(S);if(U){O.empty().append(U)}else{return}S.trigger("powerTipRender");c.activeHover=S;c.isTipOpen=true;O.data(f,Q.mouseOnToPopup);if(!Q.followMouse){G(S);c.isFixedTipOpen=true}else{M()}O.fadeIn(Q.fadeInTime,function T(){if(!c.desyncTimeout){c.desyncTimeout=setInterval(J,500)}S.trigger("powerTipOpen")})}function K(R){c.isClosing=true;c.activeHover=null;c.isTipOpen=false;c.desyncTimeout=clearInterval(c.desyncTimeout);R.data(e,false);R.data(d,false);O.fadeOut(Q.fadeOutTime,function S(){var T=new b();c.isClosing=false;c.isFixedTipOpen=false;O.removeClass();T.set("top",c.currentY+Q.offset);T.set("left",c.currentX+Q.offset);O.css(T);R.trigger("powerTipClose")})}function M(){if(!c.isFixedTipOpen&&(c.isTipOpen||(c.tipOpenImminent&&O.data(u)))){var R=O.outerWidth(),V=O.outerHeight(),U=new b(),S,T;U.set("top",c.currentY+Q.offset);U.set("left",c.currentX+Q.offset);S=m(U,R,V);if(S!==p.none){T=a(S);if(T===1){if(S===p.right){U.set("left",c.windowWidth-R)}else{if(S===p.bottom){U.set("top",c.scrollTop+c.windowHeight-V)}}}else{U.set("left",c.currentX-R-Q.offset);U.set("top",c.currentY-V-Q.offset)}}O.css(U)}}function G(S){var R,T;if(Q.smartPlacement){R=k.fn.powerTip.smartPlacementLists[Q.placement];k.each(R,function(U,W){var V=m(F(S,W),O.outerWidth(),O.outerHeight());T=W;if(V===p.none){return false}})}else{F(S,Q.placement);T=Q.placement}O.addClass(T)}function F(U,T){var R=0,S,W,V=new b();V.set("top",0);V.set("left",0);O.css(V);do{S=O.outerWidth();W=O.outerHeight();V=P.compute(U,T,S,W,Q.offset);O.css(V)}while(++R<=5&&(S!==O.outerWidth()||W!==O.outerHeight()));return V}function J(){var R=false;if(c.isTipOpen&&!c.isClosing&&!c.delayInProgress){if(c.activeHover.data(e)===false||c.activeHover.is(":disabled")){R=true}else{if(!v(c.activeHover)&&!c.activeHover.is(":focus")&&!c.activeHover.data(d)){if(O.data(f)){if(!v(O)){R=true}}else{R=true}}}if(R){K(c.activeHover)}}}this.showTip=I;this.hideTip=K;this.resetPosition=G}function q(F){return window.SVGElement&&F[0] instanceof SVGElement}function h(){if(!c.mouseTrackingActive){c.mouseTrackingActive=true;k(function H(){c.scrollLeft=s.scrollLeft();c.scrollTop=s.scrollTop();c.windowWidth=s.width();c.windowHeight=s.height()});A.on("mousemove",i);s.on({resize:function G(){c.windowWidth=s.width();c.windowHeight=s.height()},scroll:function F(){var I=s.scrollLeft(),J=s.scrollTop();if(I!==c.scrollLeft){c.currentX+=I-c.scrollLeft;c.scrollLeft=I}if(J!==c.scrollTop){c.currentY+=J-c.scrollTop;c.scrollTop=J}}})}}function i(F){c.currentX=F.pageX;c.currentY=F.pageY}function v(F){var H=F.offset(),J=F[0].getBoundingClientRect(),I=J.right-J.left,G=J.bottom-J.top;return c.currentX>=H.left&&c.currentX<=H.left+I&&c.currentY>=H.top&&c.currentY<=H.top+G}function B(I){var G=I.data(y),F=I.data(o),K=I.data(l),H,J;if(G){if(k.isFunction(G)){G=G.call(I[0])}J=G}else{if(F){if(k.isFunction(F)){F=F.call(I[0])}if(F.length>0){J=F.clone(true,true)}}else{if(K){H=k("#"+K);if(H.length>0){J=H.html()}}}}return J}function m(M,L,K){var G=c.scrollTop,J=c.scrollLeft,I=G+c.windowHeight,F=J+c.windowWidth,H=p.none;if(M.top<G||Math.abs(M.bottom-c.windowHeight)-K<G){H|=p.top}if(M.top+K>I||Math.abs(M.bottom-c.windowHeight)>I){H|=p.bottom}if(M.left<J||M.right+L>F){H|=p.left}if(M.left+L>F||M.right<J){H|=p.right}return H}function a(G){var F=0;while(G){G&=G-1;F++}return F}}));/*!
+(function(root,factory){if(typeof define==="function"&&define.amd){define(["jquery"],factory)}else if(typeof module==="object"&&module.exports){module.exports=factory(require("jquery"))}else{factory(root.jQuery)}})(this,function($){var $document=$(document),$window=$(window),$body=$("body");var DATA_DISPLAYCONTROLLER="displayController",DATA_HASACTIVEHOVER="hasActiveHover",DATA_FORCEDOPEN="forcedOpen",DATA_HASMOUSEMOVE="hasMouseMove",DATA_MOUSEONTOTIP="mouseOnToPopup",DATA_ORIGINALTITLE="originalTitle",DATA_POWERTIP="powertip",DATA_POWERTIPJQ="powertipjq",DATA_POWERTIPTARGET="powertiptarget",EVENT_NAMESPACE=".powertip",RAD2DEG=180/Math.PI,MOUSE_EVENTS=["click","dblclick","mousedown","mouseup","mousemove","mouseover","mouseout","mouseenter","mouseleave","contextmenu"];var session={tooltips:null,isTipOpen:false,isFixedTipOpen:false,isClosing:false,tipOpenImminent:false,activeHover:null,currentX:0,currentY:0,previousX:0,previousY:0,desyncTimeout:null,closeDelayTimeout:null,mouseTrackingActive:false,delayInProgress:false,windowWidth:0,windowHeight:0,scrollTop:0,scrollLeft:0};var Collision={none:0,top:1,bottom:2,left:4,right:8};$.fn.powerTip=function(opts,arg){var targetElements=this,options,tipController;if(!targetElements.length){return targetElements}if($.type(opts)==="string"&&$.powerTip[opts]){return $.powerTip[opts].call(targetElements,targetElements,arg)}options=$.extend({},$.fn.powerTip.defaults,opts);tipController=new TooltipController(options);initTracking();targetElements.each(function elementSetup(){var $this=$(this),dataPowertip=$this.data(DATA_POWERTIP),dataElem=$this.data(DATA_POWERTIPJQ),dataTarget=$this.data(DATA_POWERTIPTARGET),title=$this.attr("title");if(!dataPowertip&&!dataTarget&&!dataElem&&title){$this.data(DATA_POWERTIP,title);$this.data(DATA_ORIGINALTITLE,title);$this.removeAttr("title")}$this.data(DATA_DISPLAYCONTROLLER,new DisplayController($this,options,tipController))});if(!options.manual){$.each(options.openEvents,function(idx,evt){if($.inArray(evt,options.closeEvents)>-1){targetElements.on(evt+EVENT_NAMESPACE,function elementToggle(event){$.powerTip.toggle(this,event)})}else{targetElements.on(evt+EVENT_NAMESPACE,function elementOpen(event){$.powerTip.show(this,event)})}});$.each(options.closeEvents,function(idx,evt){if($.inArray(evt,options.openEvents)<0){targetElements.on(evt+EVENT_NAMESPACE,function elementClose(event){$.powerTip.hide(this,!isMouseEvent(event))})}});targetElements.on("keydown"+EVENT_NAMESPACE,function elementKeyDown(event){if(event.keyCode===27){$.powerTip.hide(this,true)}})}return targetElements};$.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",popupClass:null,intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false,openEvents:["mouseenter","focus"],closeEvents:["mouseleave","blur"]};$.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};$.powerTip={show:function apiShowTip(element,event){if(isMouseEvent(event)){trackMouse(event);session.previousX=event.pageX;session.previousY=event.pageY;$(element).data(DATA_DISPLAYCONTROLLER).show()}else{$(element).first().data(DATA_DISPLAYCONTROLLER).show(true,true)}return element},reposition:function apiResetPosition(element){$(element).first().data(DATA_DISPLAYCONTROLLER).resetPosition();return element},hide:function apiCloseTip(element,immediate){var displayController;immediate=element?immediate:true;if(element){displayController=$(element).first().data(DATA_DISPLAYCONTROLLER)}else if(session.activeHover){displayController=session.activeHover.data(DATA_DISPLAYCONTROLLER)}if(displayController){displayController.hide(immediate)}return element},toggle:function apiToggle(element,event){if(session.activeHover&&session.activeHover.is(element)){$.powerTip.hide(element,!isMouseEvent(event))}else{$.powerTip.show(element,event)}return element}};$.powerTip.showTip=$.powerTip.show;$.powerTip.closeTip=$.powerTip.hide;function CSSCoordinates(){var me=this;me.top="auto";me.left="auto";me.right="auto";me.bottom="auto";me.set=function(property,value){if($.isNumeric(value)){me[property]=Math.round(value)}}}function DisplayController(element,options,tipController){var hoverTimer=null,myCloseDelay=null;function openTooltip(immediate,forceOpen){cancelTimer();if(!element.data(DATA_HASACTIVEHOVER)){if(!immediate){session.tipOpenImminent=true;hoverTimer=setTimeout(function intentDelay(){hoverTimer=null;checkForIntent()},options.intentPollInterval)}else{if(forceOpen){element.data(DATA_FORCEDOPEN,true)}closeAnyDelayed();tipController.showTip(element)}}else{cancelClose()}}function closeTooltip(disableDelay){if(myCloseDelay){myCloseDelay=session.closeDelayTimeout=clearTimeout(myCloseDelay);session.delayInProgress=false}cancelTimer();session.tipOpenImminent=false;if(element.data(DATA_HASACTIVEHOVER)){element.data(DATA_FORCEDOPEN,false);if(!disableDelay){session.delayInProgress=true;session.closeDelayTimeout=setTimeout(function closeDelay(){session.closeDelayTimeout=null;tipController.hideTip(element);session.delayInProgress=false;myCloseDelay=null},options.closeDelay);myCloseDelay=session.closeDelayTimeout}else{tipController.hideTip(element)}}}function checkForIntent(){var xDifference=Math.abs(session.previousX-session.currentX),yDifference=Math.abs(session.previousY-session.currentY),totalDifference=xDifference+yDifference;if(totalDifference<options.intentSensitivity){cancelClose();closeAnyDelayed();tipController.showTip(element)}else{session.previousX=session.currentX;session.previousY=session.currentY;openTooltip()}}function cancelTimer(stopClose){hoverTimer=clearTimeout(hoverTimer);if(session.closeDelayTimeout&&myCloseDelay===session.closeDelayTimeout||stopClose){cancelClose()}}function cancelClose(){session.closeDelayTimeout=clearTimeout(session.closeDelayTimeout);session.delayInProgress=false}function closeAnyDelayed(){if(session.delayInProgress&&session.activeHover&&!session.activeHover.is(element)){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide(true)}}function repositionTooltip(){tipController.resetPosition(element)}this.show=openTooltip;this.hide=closeTooltip;this.cancel=cancelTimer;this.resetPosition=repositionTooltip}function PlacementCalculator(){function computePlacementCoords(element,placement,tipWidth,tipHeight,offset){var placementBase=placement.split("-")[0],coords=new CSSCoordinates,position;if(isSvgElement(element)){position=getSvgPlacement(element,placementBase)}else{position=getHtmlPlacement(element,placementBase)}switch(placement){case"n":coords.set("left",position.left-tipWidth/2);coords.set("bottom",session.windowHeight-position.top+offset);break;case"e":coords.set("left",position.left+offset);coords.set("top",position.top-tipHeight/2);break;case"s":coords.set("left",position.left-tipWidth/2);coords.set("top",position.top+offset);break;case"w":coords.set("top",position.top-tipHeight/2);coords.set("right",session.windowWidth-position.left+offset);break;case"nw":coords.set("bottom",session.windowHeight-position.top+offset);coords.set("right",session.windowWidth-position.left-20);break;case"nw-alt":coords.set("left",position.left);coords.set("bottom",session.windowHeight-position.top+offset);break;case"ne":coords.set("left",position.left-20);coords.set("bottom",session.windowHeight-position.top+offset);break;case"ne-alt":coords.set("bottom",session.windowHeight-position.top+offset);coords.set("right",session.windowWidth-position.left);break;case"sw":coords.set("top",position.top+offset);coords.set("right",session.windowWidth-position.left-20);break;case"sw-alt":coords.set("left",position.left);coords.set("top",position.top+offset);break;case"se":coords.set("left",position.left-20);coords.set("top",position.top+offset);break;case"se-alt":coords.set("top",position.top+offset);coords.set("right",session.windowWidth-position.left);break}return coords}function getHtmlPlacement(element,placement){var objectOffset=element.offset(),objectWidth=element.outerWidth(),objectHeight=element.outerHeight(),left,top;switch(placement){case"n":left=objectOffset.left+objectWidth/2;top=objectOffset.top;break;case"e":left=objectOffset.left+objectWidth;top=objectOffset.top+objectHeight/2;break;case"s":left=objectOffset.left+objectWidth/2;top=objectOffset.top+objectHeight;break;case"w":left=objectOffset.left;top=objectOffset.top+objectHeight/2;break;case"nw":left=objectOffset.left;top=objectOffset.top;break;case"ne":left=objectOffset.left+objectWidth;top=objectOffset.top;break;case"sw":left=objectOffset.left;top=objectOffset.top+objectHeight;break;case"se":left=objectOffset.left+objectWidth;top=objectOffset.top+objectHeight;break}return{top:top,left:left}}function getSvgPlacement(element,placement){var svgElement=element.closest("svg")[0],domElement=element[0],point=svgElement.createSVGPoint(),boundingBox=domElement.getBBox(),matrix=domElement.getScreenCTM(),halfWidth=boundingBox.width/2,halfHeight=boundingBox.height/2,placements=[],placementKeys=["nw","n","ne","e","se","s","sw","w"],coords,rotation,steps,x;function pushPlacement(){placements.push(point.matrixTransform(matrix))}point.x=boundingBox.x;point.y=boundingBox.y;pushPlacement();point.x+=halfWidth;pushPlacement();point.x+=halfWidth;pushPlacement();point.y+=halfHeight;pushPlacement();point.y+=halfHeight;pushPlacement();point.x-=halfWidth;pushPlacement();point.x-=halfWidth;pushPlacement();point.y-=halfHeight;pushPlacement();if(placements[0].y!==placements[1].y||placements[0].x!==placements[7].x){rotation=Math.atan2(matrix.b,matrix.a)*RAD2DEG;steps=Math.ceil((rotation%360-22.5)/45);if(steps<1){steps+=8}while(steps--){placementKeys.push(placementKeys.shift())}}for(x=0;x<placements.length;x++){if(placementKeys[x]===placement){coords=placements[x];break}}return{top:coords.y+session.scrollTop,left:coords.x+session.scrollLeft}}this.compute=computePlacementCoords}function TooltipController(options){var placementCalculator=new PlacementCalculator,tipElement=$("#"+options.popupId);if(tipElement.length===0){tipElement=$("<div/>",{id:options.popupId});if($body.length===0){$body=$("body")}$body.append(tipElement);session.tooltips=session.tooltips?session.tooltips.add(tipElement):tipElement}if(options.followMouse){if(!tipElement.data(DATA_HASMOUSEMOVE)){$document.on("mousemove"+EVENT_NAMESPACE,positionTipOnCursor);$window.on("scroll"+EVENT_NAMESPACE,positionTipOnCursor);tipElement.data(DATA_HASMOUSEMOVE,true)}}function beginShowTip(element){element.data(DATA_HASACTIVEHOVER,true);tipElement.queue(function queueTipInit(next){showTip(element);next()})}function showTip(element){var tipContent;if(!element.data(DATA_HASACTIVEHOVER)){return}if(session.isTipOpen){if(!session.isClosing){hideTip(session.activeHover)}tipElement.delay(100).queue(function queueTipAgain(next){showTip(element);next()});return}element.trigger("powerTipPreRender");tipContent=getTooltipContent(element);if(tipContent){tipElement.empty().append(tipContent)}else{return}element.trigger("powerTipRender");session.activeHover=element;session.isTipOpen=true;tipElement.data(DATA_MOUSEONTOTIP,options.mouseOnToPopup);tipElement.addClass(options.popupClass);if(!options.followMouse||element.data(DATA_FORCEDOPEN)){positionTipOnElement(element);session.isFixedTipOpen=true}else{positionTipOnCursor()}if(!element.data(DATA_FORCEDOPEN)&&!options.followMouse){$document.on("click"+EVENT_NAMESPACE,function documentClick(event){var target=event.target;if(target!==element[0]){if(options.mouseOnToPopup){if(target!==tipElement[0]&&!$.contains(tipElement[0],target)){$.powerTip.hide()}}else{$.powerTip.hide()}}})}if(options.mouseOnToPopup&&!options.manual){tipElement.on("mouseenter"+EVENT_NAMESPACE,function tipMouseEnter(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).cancel()}});tipElement.on("mouseleave"+EVENT_NAMESPACE,function tipMouseLeave(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide()}})}tipElement.fadeIn(options.fadeInTime,function fadeInCallback(){if(!session.desyncTimeout){session.desyncTimeout=setInterval(closeDesyncedTip,500)}element.trigger("powerTipOpen")})}function hideTip(element){session.isClosing=true;session.isTipOpen=false;session.desyncTimeout=clearInterval(session.desyncTimeout);element.data(DATA_HASACTIVEHOVER,false);element.data(DATA_FORCEDOPEN,false);$document.off("click"+EVENT_NAMESPACE);tipElement.off(EVENT_NAMESPACE);tipElement.fadeOut(options.fadeOutTime,function fadeOutCallback(){var coords=new CSSCoordinates;session.activeHover=null;session.isClosing=false;session.isFixedTipOpen=false;tipElement.removeClass();coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);tipElement.css(coords);element.trigger("powerTipClose")})}function positionTipOnCursor(){var tipWidth,tipHeight,coords,collisions,collisionCount;if(!session.isFixedTipOpen&&(session.isTipOpen||session.tipOpenImminent&&tipElement.data(DATA_HASMOUSEMOVE))){tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=new CSSCoordinates;coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);collisions=getViewportCollisions(coords,tipWidth,tipHeight);if(collisions!==Collision.none){collisionCount=countFlags(collisions);if(collisionCount===1){if(collisions===Collision.right){coords.set("left",session.scrollLeft+session.windowWidth-tipWidth)}else if(collisions===Collision.bottom){coords.set("top",session.scrollTop+session.windowHeight-tipHeight)}}else{coords.set("left",session.currentX-tipWidth-options.offset);coords.set("top",session.currentY-tipHeight-options.offset)}}tipElement.css(coords)}}function positionTipOnElement(element){var priorityList,finalPlacement;if(options.smartPlacement||options.followMouse&&element.data(DATA_FORCEDOPEN)){priorityList=$.fn.powerTip.smartPlacementLists[options.placement];$.each(priorityList,function(idx,pos){var collisions=getViewportCollisions(placeTooltip(element,pos),tipElement.outerWidth(),tipElement.outerHeight());finalPlacement=pos;return collisions!==Collision.none})}else{placeTooltip(element,options.placement);finalPlacement=options.placement}tipElement.removeClass("w nw sw e ne se n s w se-alt sw-alt ne-alt nw-alt");tipElement.addClass(finalPlacement)}function placeTooltip(element,placement){var iterationCount=0,tipWidth,tipHeight,coords=new CSSCoordinates;coords.set("top",0);coords.set("left",0);tipElement.css(coords);do{tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=placementCalculator.compute(element,placement,tipWidth,tipHeight,options.offset);tipElement.css(coords)}while(++iterationCount<=5&&(tipWidth!==tipElement.outerWidth()||tipHeight!==tipElement.outerHeight()));return coords}function closeDesyncedTip(){var isDesynced=false,hasDesyncableCloseEvent=$.grep(["mouseleave","mouseout","blur","focusout"],function(eventType){return $.inArray(eventType,options.closeEvents)!==-1}).length>0;if(session.isTipOpen&&!session.isClosing&&!session.delayInProgress&&hasDesyncableCloseEvent){if(session.activeHover.data(DATA_HASACTIVEHOVER)===false||session.activeHover.is(":disabled")){isDesynced=true}else if(!isMouseOver(session.activeHover)&&!session.activeHover.is(":focus")&&!session.activeHover.data(DATA_FORCEDOPEN)){if(tipElement.data(DATA_MOUSEONTOTIP)){if(!isMouseOver(tipElement)){isDesynced=true}}else{isDesynced=true}}if(isDesynced){hideTip(session.activeHover)}}}this.showTip=beginShowTip;this.hideTip=hideTip;this.resetPosition=positionTipOnElement}function isSvgElement(element){return Boolean(window.SVGElement&&element[0]instanceof SVGElement)}function isMouseEvent(event){return Boolean(event&&$.inArray(event.type,MOUSE_EVENTS)>-1&&typeof event.pageX==="number")}function initTracking(){if(!session.mouseTrackingActive){session.mouseTrackingActive=true;getViewportDimensions();$(getViewportDimensions);$document.on("mousemove"+EVENT_NAMESPACE,trackMouse);$window.on("resize"+EVENT_NAMESPACE,trackResize);$window.on("scroll"+EVENT_NAMESPACE,trackScroll)}}function getViewportDimensions(){session.scrollLeft=$window.scrollLeft();session.scrollTop=$window.scrollTop();session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackResize(){session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackScroll(){var x=$window.scrollLeft(),y=$window.scrollTop();if(x!==session.scrollLeft){session.currentX+=x-session.scrollLeft;session.scrollLeft=x}if(y!==session.scrollTop){session.currentY+=y-session.scrollTop;session.scrollTop=y}}function trackMouse(event){session.currentX=event.pageX;session.currentY=event.pageY}function isMouseOver(element){var elementPosition=element.offset(),elementBox=element[0].getBoundingClientRect(),elementWidth=elementBox.right-elementBox.left,elementHeight=elementBox.bottom-elementBox.top;return session.currentX>=elementPosition.left&&session.currentX<=elementPosition.left+elementWidth&&session.currentY>=elementPosition.top&&session.currentY<=elementPosition.top+elementHeight}function getTooltipContent(element){var tipText=element.data(DATA_POWERTIP),tipObject=element.data(DATA_POWERTIPJQ),tipTarget=element.data(DATA_POWERTIPTARGET),targetElement,content;if(tipText){if($.isFunction(tipText)){tipText=tipText.call(element[0])}content=tipText}else if(tipObject){if($.isFunction(tipObject)){tipObject=tipObject.call(element[0])}if(tipObject.length>0){content=tipObject.clone(true,true)}}else if(tipTarget){targetElement=$("#"+tipTarget);if(targetElement.length>0){content=targetElement.html()}}return content}function getViewportCollisions(coords,elementWidth,elementHeight){var viewportTop=session.scrollTop,viewportLeft=session.scrollLeft,viewportBottom=viewportTop+session.windowHeight,viewportRight=viewportLeft+session.windowWidth,collisions=Collision.none;if(coords.top<viewportTop||Math.abs(coords.bottom-session.windowHeight)-elementHeight<viewportTop){collisions|=Collision.top}if(coords.top+elementHeight>viewportBottom||Math.abs(coords.bottom-session.windowHeight)>viewportBottom){collisions|=Collision.bottom}if(coords.left<viewportLeft||coords.right+elementWidth>viewportRight){collisions|=Collision.left}if(coords.left+elementWidth>viewportRight||coords.right<viewportLeft){collisions|=Collision.right}return collisions}function countFlags(value){var count=0;while(value){value&=value-1;count++}return count}return $.powerTip});/*!
  * jQuery UI Touch Punch 0.2.3
  *
  * Copyright 2011–2014, Dave Furfero
@@ -103,13 +30,6 @@
  *  jquery.ui.widget.js
  *  jquery.ui.mouse.js
  */
-(function(b){b.support.touch="ontouchend" in document;if(!b.support.touch){return}var d=b.ui.mouse.prototype,f=d._mouseInit,c=d._mouseDestroy,a;function e(h,i){if(h.originalEvent.touches.length>1){return}h.preventDefault();var j=h.originalEvent.changedTouches[0],g=document.createEvent("MouseEvents");g.initMouseEvent(i,true,true,window,1,j.screenX,j.screenY,j.clientX,j.clientY,false,false,false,false,0,null);h.target.dispatchEvent(g)}d._touchStart=function(h){var g=this;if(a||!g._mouseCapture(h.originalEvent.changedTouches[0])){return}a=true;g._touchMoved=false;e(h,"mouseover");e(h,"mousemove");e(h,"mousedown")};d._touchMove=function(g){if(!a){return}this._touchMoved=true;e(g,"mousemove")};d._touchEnd=function(g){if(!a){return}e(g,"mouseup");e(g,"mouseout");if(!this._touchMoved){e(g,"click")}a=false};d._mouseInit=function(){var g=this;g.element.bind({touchstart:b.proxy(g,"_touchStart"),touchmove:b.proxy(g,"_touchMove"),touchend:b.proxy(g,"_touchEnd")});f.call(g)};d._mouseDestroy=function(){var g=this;g.element.unbind({touchstart:b.proxy(g,"_touchStart"),touchmove:b.proxy(g,"_touchMove"),touchend:b.proxy(g,"_touchEnd")});c.call(g)}})(jQuery);/*!
- * SmartMenus jQuery Plugin - v1.0.0 - January 27, 2016
+!function(a){function f(a,b){if(!(a.originalEvent.touches.length>1)){a.preventDefault();var c=a.originalEvent.changedTouches[0],d=document.createEvent("MouseEvents");d.initMouseEvent(b,!0,!0,window,1,c.screenX,c.screenY,c.clientX,c.clientY,!1,!1,!1,!1,0,null),a.target.dispatchEvent(d)}}if(a.support.touch="ontouchend"in document,a.support.touch){var e,b=a.ui.mouse.prototype,c=b._mouseInit,d=b._mouseDestroy;b._touchStart=function(a){var b=this;!e&&b._mouseCapture(a.originalEvent.changedTouches[0])&&(e=!0,b._touchMoved=!1,f(a,"mouseover"),f(a,"mousemove"),f(a,"mousedown"))},b._touchMove=function(a){e&&(this._touchMoved=!0,f(a,"mousemove"))},b._touchEnd=function(a){e&&(f(a,"mouseup"),f(a,"mouseout"),this._touchMoved||f(a,"click"),e=!1)},b._mouseInit=function(){var b=this;b.element.bind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),c.call(b)},b._mouseDestroy=function(){var b=this;b.element.unbind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),d.call(b)}}}(jQuery);/*! SmartMenus jQuery Plugin - v1.1.0 - September 17, 2017
  * http://www.smartmenus.org/
- *
- * Copyright Vasil Dinkov, Vadikom Web Ltd.
- * http://vadikom.com
- *
- * Licensed MIT
- */
-(function(a){if(typeof define==="function"&&define.amd){define(["jquery"],a)}else{if(typeof module==="object"&&typeof module.exports==="object"){module.exports=a(require("jquery"))}else{a(jQuery)}}}(function(a){var b=[],e=!!window.createPopup,f=false,d="ontouchstart" in window,h=false,g=window.requestAnimationFrame||function(l){return setTimeout(l,1000/60)},c=window.cancelAnimationFrame||function(l){clearTimeout(l)};function k(m){var n=".smartmenus_mouse";if(!h&&!m){var o=true,l=null;a(document).bind(i([["mousemove",function(s){var t={x:s.pageX,y:s.pageY,timeStamp:new Date().getTime()};if(l){var q=Math.abs(l.x-t.x),p=Math.abs(l.y-t.y);if((q>0||p>0)&&q<=2&&p<=2&&t.timeStamp-l.timeStamp<=300){f=true;if(o){var r=a(s.target).closest("a");if(r.is("a")){a.each(b,function(){if(a.contains(this.$root[0],r[0])){this.itemEnter({currentTarget:r[0]});return false}})}o=false}}}l=t}],[d?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut",function(p){if(j(p.originalEvent)){f=false}}]],n));h=true}else{if(h&&m){a(document).unbind(n);h=false}}}function j(l){return !/^(4|mouse)$/.test(l.pointerType)}function i(l,n){if(!n){n=""}var m={};a.each(l,function(o,p){m[p[0].split(" ").join(n+" ")+n]=p[1]});return m}a.SmartMenus=function(m,l){this.$root=a(m);this.opts=l;this.rootId="";this.accessIdPrefix="";this.$subArrow=null;this.activatedItems=[];this.visibleSubMenus=[];this.showTimeout=0;this.hideTimeout=0;this.scrollTimeout=0;this.clickActivated=false;this.focusActivated=false;this.zIndexInc=0;this.idInc=0;this.$firstLink=null;this.$firstSub=null;this.disabled=false;this.$disableOverlay=null;this.$touchScrollingSub=null;this.cssTransforms3d="perspective" in m.style||"webkitPerspective" in m.style;this.wasCollapsible=false;this.init()};a.extend(a.SmartMenus,{hideAll:function(){a.each(b,function(){this.menuHideAll()})},destroy:function(){while(b.length){b[0].destroy()}k(true)},prototype:{init:function(n){var l=this;if(!n){b.push(this);this.rootId=(new Date().getTime()+Math.random()+"").replace(/\D/g,"");this.accessIdPrefix="sm-"+this.rootId+"-";if(this.$root.hasClass("sm-rtl")){this.opts.rightToLeftSubMenus=true}var r=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).bind(i([["mouseover focusin",a.proxy(this.rootOver,this)],["mouseout focusout",a.proxy(this.rootOut,this)],["keydown",a.proxy(this.rootKeyDown,this)]],r)).delegate("a",i([["mouseenter",a.proxy(this.itemEnter,this)],["mouseleave",a.proxy(this.itemLeave,this)],["mousedown",a.proxy(this.itemDown,this)],["focus",a.proxy(this.itemFocus,this)],["blur",a.proxy(this.itemBlur,this)],["click",a.proxy(this.itemClick,this)]],r));r+=this.rootId;if(this.opts.hideOnClick){a(document).bind(i([["touchstart",a.proxy(this.docTouchStart,this)],["touchmove",a.proxy(this.docTouchMove,this)],["touchend",a.proxy(this.docTouchEnd,this)],["click",a.proxy(this.docClick,this)]],r))}a(window).bind(i([["resize orientationchange",a.proxy(this.winResize,this)]],r));if(this.opts.subIndicators){this.$subArrow=a("<span/>").addClass("sub-arrow");if(this.opts.subIndicatorsText){this.$subArrow.html(this.opts.subIndicatorsText)}}k()}this.$firstSub=this.$root.find("ul").each(function(){l.menuInit(a(this))}).eq(0);this.$firstLink=this.$root.find("a").eq(0);if(this.opts.markCurrentItem){var p=/(index|default)\.[^#\?\/]*/i,m=/#.*/,q=window.location.href.replace(p,""),o=q.replace(m,"");this.$root.find("a").each(function(){var s=this.href.replace(p,""),t=a(this);if(s==q||s==o){t.addClass("current");if(l.opts.markCurrentTree){t.parentsUntil("[data-smartmenus-id]","ul").each(function(){a(this).dataSM("parent-a").addClass("current")})}}})}this.wasCollapsible=this.isCollapsible()},destroy:function(m){if(!m){var n=".smartmenus";this.$root.removeData("smartmenus").removeAttr("data-smartmenus-id").removeDataSM("level").unbind(n).undelegate(n);n+=this.rootId;a(document).unbind(n);a(window).unbind(n);if(this.opts.subIndicators){this.$subArrow=null}}this.menuHideAll();var l=this;this.$root.find("ul").each(function(){var o=a(this);if(o.dataSM("scroll-arrows")){o.dataSM("scroll-arrows").remove()}if(o.dataSM("shown-before")){if(l.opts.subMenusMinWidth||l.opts.subMenusMaxWidth){o.css({width:"",minWidth:"",maxWidth:""}).removeClass("sm-nowrap")}if(o.dataSM("scroll-arrows")){o.dataSM("scroll-arrows").remove()}o.css({zIndex:"",top:"",left:"",marginLeft:"",marginTop:"",display:""})}if((o.attr("id")||"").indexOf(l.accessIdPrefix)==0){o.removeAttr("id")}}).removeDataSM("in-mega").removeDataSM("shown-before").removeDataSM("ie-shim").removeDataSM("scroll-arrows").removeDataSM("parent-a").removeDataSM("level").removeDataSM("beforefirstshowfired").removeAttr("role").removeAttr("aria-hidden").removeAttr("aria-labelledby").removeAttr("aria-expanded");this.$root.find("a.has-submenu").each(function(){var o=a(this);if(o.attr("id").indexOf(l.accessIdPrefix)==0){o.removeAttr("id")}}).removeClass("has-submenu").removeDataSM("sub").removeAttr("aria-haspopup").removeAttr("aria-controls").removeAttr("aria-expanded").closest("li").removeDataSM("sub");if(this.opts.subIndicators){this.$root.find("span.sub-arrow").remove()}if(this.opts.markCurrentItem){this.$root.find("a.current").removeClass("current")}if(!m){this.$root=null;this.$firstLink=null;this.$firstSub=null;if(this.$disableOverlay){this.$disableOverlay.remove();this.$disableOverlay=null}b.splice(a.inArray(this,b),1)}},disable:function(l){if(!this.disabled){this.menuHideAll();if(!l&&!this.opts.isPopup&&this.$root.is(":visible")){var m=this.$root.offset();this.$disableOverlay=a('<div class="sm-jquery-disable-overlay"/>').css({position:"absolute",top:m.top,left:m.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(true),opacity:0}).appendTo(document.body)}this.disabled=true}},docClick:function(l){if(this.$touchScrollingSub){this.$touchScrollingSub=null;return}if(this.visibleSubMenus.length&&!a.contains(this.$root[0],l.target)||a(l.target).is("a")){this.menuHideAll()}},docTouchEnd:function(m){if(!this.lastTouch){return}if(this.visibleSubMenus.length&&(this.lastTouch.x2===undefined||this.lastTouch.x1==this.lastTouch.x2)&&(this.lastTouch.y2===undefined||this.lastTouch.y1==this.lastTouch.y2)&&(!this.lastTouch.target||!a.contains(this.$root[0],this.lastTouch.target))){if(this.hideTimeout){clearTimeout(this.hideTimeout);this.hideTimeout=0}var l=this;this.hideTimeout=setTimeout(function(){l.menuHideAll()},350)}this.lastTouch=null},docTouchMove:function(m){if(!this.lastTouch){return}var l=m.originalEvent.touches[0];this.lastTouch.x2=l.pageX;this.lastTouch.y2=l.pageY},docTouchStart:function(m){var l=m.originalEvent.touches[0];this.lastTouch={x1:l.pageX,y1:l.pageY,target:l.target}},enable:function(){if(this.disabled){if(this.$disableOverlay){this.$disableOverlay.remove();this.$disableOverlay=null}this.disabled=false}},getClosestMenu:function(m){var l=a(m).closest("ul");while(l.dataSM("in-mega")){l=l.parent().closest("ul")}return l[0]||null},getHeight:function(l){return this.getOffset(l,true)},getOffset:function(n,l){var m;if(n.css("display")=="none"){m={position:n[0].style.position,visibility:n[0].style.visibility};n.css({position:"absolute",visibility:"hidden"}).show()}var o=n[0].getBoundingClientRect&&n[0].getBoundingClientRect(),p=o&&(l?o.height||o.bottom-o.top:o.width||o.right-o.left);if(!p&&p!==0){p=l?n[0].offsetHeight:n[0].offsetWidth}if(m){n.hide().css(m)}return p},getStartZIndex:function(l){var m=parseInt(this[l?"$root":"$firstSub"].css("z-index"));if(!l&&isNaN(m)){m=parseInt(this.$root.css("z-index"))}return !isNaN(m)?m:1},getTouchPoint:function(l){return l.touches&&l.touches[0]||l.changedTouches&&l.changedTouches[0]||l},getViewport:function(l){var m=l?"Height":"Width",o=document.documentElement["client"+m],n=window["inner"+m];if(n){o=Math.min(o,n)}return o},getViewportHeight:function(){return this.getViewport(true)},getViewportWidth:function(){return this.getViewport()},getWidth:function(l){return this.getOffset(l)},handleEvents:function(){return !this.disabled&&this.isCSSOn()},handleItemEvents:function(l){return this.handleEvents()&&!this.isLinkInMegaMenu(l)},isCollapsible:function(){return this.$firstSub.css("position")=="static"},isCSSOn:function(){return this.$firstLink.css("display")=="block"},isFixed:function(){var l=this.$root.css("position")=="fixed";if(!l){this.$root.parentsUntil("body").each(function(){if(a(this).css("position")=="fixed"){l=true;return false}})}return l},isLinkInMegaMenu:function(l){return a(this.getClosestMenu(l[0])).hasClass("mega-menu")},isTouchMode:function(){return !f||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(p,l){var n=p.closest("ul"),q=n.dataSM("level");if(q>1&&(!this.activatedItems[q-2]||this.activatedItems[q-2][0]!=n.dataSM("parent-a")[0])){var m=this;a(n.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(n).each(function(){m.itemActivate(a(this).dataSM("parent-a"))})}if(!this.isCollapsible()||l){this.menuHideSubMenus(!this.activatedItems[q-1]||this.activatedItems[q-1][0]!=p[0]?q-1:q)}this.activatedItems[q-1]=p;if(this.$root.triggerHandler("activate.smapi",p[0])===false){return}var o=p.dataSM("sub");if(o&&(this.isTouchMode()||(!this.opts.showOnClick||this.clickActivated))){this.menuShow(o)}},itemBlur:function(m){var l=a(m.currentTarget);if(!this.handleItemEvents(l)){return}this.$root.triggerHandler("blur.smapi",l[0])},itemClick:function(o){var n=a(o.currentTarget);if(!this.handleItemEvents(n)){return}if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==n.closest("ul")[0]){this.$touchScrollingSub=null;o.stopPropagation();return false}if(this.$root.triggerHandler("click.smapi",n[0])===false){return false}var p=a(o.target).is("span.sub-arrow"),m=n.dataSM("sub"),l=m?m.dataSM("level")==2:false;if(m&&!m.is(":visible")){if(this.opts.showOnClick&&l){this.clickActivated=true}this.itemActivate(n);if(m.is(":visible")){this.focusActivated=true;return false}}else{if(this.isCollapsible()&&p){this.itemActivate(n);this.menuHide(m);return false}}if(this.opts.showOnClick&&l||n.hasClass("disabled")||this.$root.triggerHandler("select.smapi",n[0])===false){return false}},itemDown:function(m){var l=a(m.currentTarget);if(!this.handleItemEvents(l)){return}l.dataSM("mousedown",true)},itemEnter:function(n){var m=a(n.currentTarget);if(!this.handleItemEvents(m)){return}if(!this.isTouchMode()){if(this.showTimeout){clearTimeout(this.showTimeout);this.showTimeout=0}var l=this;this.showTimeout=setTimeout(function(){l.itemActivate(m)},this.opts.showOnClick&&m.closest("ul").dataSM("level")==1?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",m[0])},itemFocus:function(m){var l=a(m.currentTarget);if(!this.handleItemEvents(l)){return}if(this.focusActivated&&(!this.isTouchMode()||!l.dataSM("mousedown"))&&(!this.activatedItems.length||this.activatedItems[this.activatedItems.length-1][0]!=l[0])){this.itemActivate(l,true)}this.$root.triggerHandler("focus.smapi",l[0])},itemLeave:function(m){var l=a(m.currentTarget);if(!this.handleItemEvents(l)){return}if(!this.isTouchMode()){l[0].blur();if(this.showTimeout){clearTimeout(this.showTimeout);this.showTimeout=0}}l.removeDataSM("mousedown");this.$root.triggerHandler("mouseleave.smapi",l[0])},menuHide:function(m){if(this.$root.triggerHandler("beforehide.smapi",m[0])===false){return}m.stop(true,true);if(m.css("display")!="none"){var l=function(){m.css("z-index","")};if(this.isCollapsible()){if(this.opts.collapsibleHideFunction){this.opts.collapsibleHideFunction.call(this,m,l)}else{m.hide(this.opts.collapsibleHideDuration,l)}}else{if(this.opts.hideFunction){this.opts.hideFunction.call(this,m,l)}else{m.hide(this.opts.hideDuration,l)}}if(m.dataSM("ie-shim")){m.dataSM("ie-shim").remove().css({"-webkit-transform":"",transform:""})}if(m.dataSM("scroll")){this.menuScrollStop(m);m.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).unbind(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()}m.dataSM("parent-a").removeClass("highlighted").attr("aria-expanded","false");m.attr({"aria-expanded":"false","aria-hidden":"true"});var n=m.dataSM("level");this.activatedItems.splice(n-1,1);this.visibleSubMenus.splice(a.inArray(m,this.visibleSubMenus),1);this.$root.triggerHandler("hide.smapi",m[0])}},menuHideAll:function(){if(this.showTimeout){clearTimeout(this.showTimeout);this.showTimeout=0}var m=this.opts.isPopup?1:0;for(var l=this.visibleSubMenus.length-1;l>=m;l--){this.menuHide(this.visibleSubMenus[l])}if(this.opts.isPopup){this.$root.stop(true,true);if(this.$root.is(":visible")){if(this.opts.hideFunction){this.opts.hideFunction.call(this,this.$root)}else{this.$root.hide(this.opts.hideDuration)}if(this.$root.dataSM("ie-shim")){this.$root.dataSM("ie-shim").remove()}}}this.activatedItems=[];this.visibleSubMenus=[];this.clickActivated=false;this.focusActivated=false;this.zIndexInc=0;this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(n){for(var l=this.activatedItems.length-1;l>=n;l--){var m=this.activatedItems[l].dataSM("sub");if(m){this.menuHide(m)}}},menuIframeShim:function(l){if(e&&this.opts.overlapControlsInIE&&!l.dataSM("ie-shim")){l.dataSM("ie-shim",a("<iframe/>").attr({src:"javascript:0",tabindex:-9}).css({position:"absolute",top:"auto",left:"0",opacity:0,border:"0"}))}},menuInit:function(l){if(!l.dataSM("in-mega")){if(l.hasClass("mega-menu")){l.find("ul").dataSM("in-mega",true)}var q=2,m=l[0];while((m=m.parentNode.parentNode)!=this.$root[0]){q++}var n=l.prevAll("a").eq(-1);if(!n.length){n=l.prevAll().find("a").eq(-1)}n.addClass("has-submenu").dataSM("sub",l);l.dataSM("parent-a",n).dataSM("level",q).parent().dataSM("sub",l);var o=n.attr("id")||this.accessIdPrefix+(++this.idInc),p=l.attr("id")||this.accessIdPrefix+(++this.idInc);n.attr({id:o,"aria-haspopup":"true","aria-controls":p,"aria-expanded":"false"});l.attr({id:p,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"});if(this.opts.subIndicators){n[this.opts.subIndicatorsPos](this.$subArrow.clone())}}},menuPosition:function(K){var r=K.dataSM("parent-a"),D=r.closest("li"),E=D.parent(),l=K.dataSM("level"),t=this.getWidth(K),J=this.getHeight(K),u=r.offset(),o=u.left,m=u.top,q=this.getWidth(r),F=this.getHeight(r),H=a(window),v=H.scrollLeft(),s=H.scrollTop(),z=this.getViewportWidth(),L=this.getViewportHeight(),w=E.parent().is("[data-sm-horizontal-sub]")||l==2&&!E.hasClass("sm-vertical"),B=this.opts.rightToLeftSubMenus&&!D.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&D.is("[data-sm-reverse]"),p=l==2?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,n=l==2?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY,C,A;if(w){C=B?q-t-p:p;A=this.opts.bottomToTopSubMenus?-J-n:F+n}else{C=B?p-t:q-p;A=this.opts.bottomToTopSubMenus?F-n-J:n}if(this.opts.keepInViewport){var N=o+C,M=m+A;if(B&&N<v){C=w?v-N+C:q-p}else{if(!B&&N+t>v+z){C=w?v+z-t-N+C:p-t}}if(!w){if(J<L&&M+J>s+L){A+=s+L-J-M}else{if(J>=L||M<s){A+=s-M}}}if(w&&(M+J>s+L+0.49||M<s)||!w&&J>L+0.49){var G=this;if(!K.dataSM("scroll-arrows")){K.dataSM("scroll-arrows",a([a('<span class="scroll-up"><span class="scroll-up-arrow"></span></span>')[0],a('<span class="scroll-down"><span class="scroll-down-arrow"></span></span>')[0]]).bind({mouseenter:function(){K.dataSM("scroll").up=a(this).hasClass("scroll-up");G.menuScroll(K)},mouseleave:function(x){G.menuScrollStop(K);G.menuScrollOut(K,x)},"mousewheel DOMMouseScroll":function(x){x.preventDefault()}}).insertAfter(K))}var I=".smartmenus_scroll";K.dataSM("scroll",{y:this.cssTransforms3d?0:A-F,step:1,itemH:F,subH:J,arrowDownH:this.getHeight(K.dataSM("scroll-arrows").eq(1))}).bind(i([["mouseover",function(x){G.menuScrollOver(K,x)}],["mouseout",function(x){G.menuScrollOut(K,x)}],["mousewheel DOMMouseScroll",function(x){G.menuScrollMousewheel(K,x)}]],I)).dataSM("scroll-arrows").css({top:"auto",left:"0",marginLeft:C+(parseInt(K.css("border-left-width"))||0),width:t-(parseInt(K.css("border-left-width"))||0)-(parseInt(K.css("border-right-width"))||0),zIndex:K.css("z-index")}).eq(w&&this.opts.bottomToTopSubMenus?0:1).show();if(this.isFixed()){K.css({"touch-action":"none","-ms-touch-action":"none"}).bind(i([[d?"touchstart touchmove touchend":"pointerdown pointermove pointerup MSPointerDown MSPointerMove MSPointerUp",function(x){G.menuScrollTouch(K,x)}]],I))}}}K.css({top:"auto",left:"0",marginLeft:C,marginTop:A-F});this.menuIframeShim(K);if(K.dataSM("ie-shim")){K.dataSM("ie-shim").css({zIndex:K.css("z-index"),width:t,height:J,marginLeft:C,marginTop:A-F})}},menuScroll:function(r,m,n){var p=r.dataSM("scroll"),q=r.dataSM("scroll-arrows"),o=p.up?p.upEnd:p.downEnd,s;if(!m&&p.momentum){p.momentum*=0.92;s=p.momentum;if(s<0.5){this.menuScrollStop(r);return}}else{s=n||(m||!this.opts.scrollAccelerate?this.opts.scrollStep:Math.floor(p.step))}var l=r.dataSM("level");if(this.activatedItems[l-1]&&this.activatedItems[l-1].dataSM("sub")&&this.activatedItems[l-1].dataSM("sub").is(":visible")){this.menuHideSubMenus(l-1)}p.y=p.up&&o<=p.y||!p.up&&o>=p.y?p.y:(Math.abs(o-p.y)>s?p.y+(p.up?s:-s):o);r.add(r.dataSM("ie-shim")).css(this.cssTransforms3d?{"-webkit-transform":"translate3d(0, "+p.y+"px, 0)",transform:"translate3d(0, "+p.y+"px, 0)"}:{marginTop:p.y});if(f&&(p.up&&p.y>p.downEnd||!p.up&&p.y<p.upEnd)){q.eq(p.up?1:0).show()}if(p.y==o){if(f){q.eq(p.up?0:1).hide()}this.menuScrollStop(r)}else{if(!m){if(this.opts.scrollAccelerate&&p.step<this.opts.scrollStep){p.step+=0.2}var t=this;this.scrollTimeout=g(function(){t.menuScroll(r)})}}},menuScrollMousewheel:function(m,n){if(this.getClosestMenu(n.target)==m[0]){n=n.originalEvent;var l=(n.wheelDelta||-n.detail)>0;if(m.dataSM("scroll-arrows").eq(l?0:1).is(":visible")){m.dataSM("scroll").up=l;this.menuScroll(m,true)}}n.preventDefault()},menuScrollOut:function(l,m){if(f){if(!/^scroll-(up|down)/.test((m.relatedTarget||"").className)&&(l[0]!=m.relatedTarget&&!a.contains(l[0],m.relatedTarget)||this.getClosestMenu(m.relatedTarget)!=l[0])){l.dataSM("scroll-arrows").css("visibility","hidden")}}},menuScrollOver:function(n,o){if(f){if(!/^scroll-(up|down)/.test(o.target.className)&&this.getClosestMenu(o.target)==n[0]){this.menuScrollRefreshData(n);var m=n.dataSM("scroll"),l=a(window).scrollTop()-n.dataSM("parent-a").offset().top-m.itemH;n.dataSM("scroll-arrows").eq(0).css("margin-top",l).end().eq(1).css("margin-top",l+this.getViewportHeight()-m.arrowDownH).end().css("visibility","visible")}}},menuScrollRefreshData:function(n){var m=n.dataSM("scroll"),l=a(window).scrollTop()-n.dataSM("parent-a").offset().top-m.itemH;if(this.cssTransforms3d){l=-(parseFloat(n.css("margin-top"))-l)}a.extend(m,{upEnd:l,downEnd:l+this.getViewportHeight()-m.subH})},menuScrollStop:function(l){if(this.scrollTimeout){c(this.scrollTimeout);this.scrollTimeout=0;l.dataSM("scroll").step=1;return true}},menuScrollTouch:function(p,q){q=q.originalEvent;if(j(q)){var m=this.getTouchPoint(q);if(this.getClosestMenu(m.target)==p[0]){var o=p.dataSM("scroll");if(/(start|down)$/i.test(q.type)){if(this.menuScrollStop(p)){q.preventDefault();this.$touchScrollingSub=p}else{this.$touchScrollingSub=null}this.menuScrollRefreshData(p);a.extend(o,{touchStartY:m.pageY,touchStartTime:q.timeStamp})}else{if(/move$/i.test(q.type)){var n=o.touchY!==undefined?o.touchY:o.touchStartY;if(n!==undefined&&n!=m.pageY){this.$touchScrollingSub=p;var l=n<m.pageY;if(o.up!==undefined&&o.up!=l){a.extend(o,{touchStartY:m.pageY,touchStartTime:q.timeStamp})}a.extend(o,{up:l,touchY:m.pageY});this.menuScroll(p,true,Math.abs(m.pageY-n))}q.preventDefault()}else{if(o.touchY!==undefined){if(o.momentum=Math.pow(Math.abs(m.pageY-o.touchStartY)/(q.timeStamp-o.touchStartTime),2)*15){this.menuScrollStop(p);this.menuScroll(p);q.preventDefault()}delete o.touchY}}}}}},menuShow:function(n){if(!n.dataSM("beforefirstshowfired")){n.dataSM("beforefirstshowfired",true);if(this.$root.triggerHandler("beforefirstshow.smapi",n[0])===false){return}}if(this.$root.triggerHandler("beforeshow.smapi",n[0])===false){return}n.dataSM("shown-before",true).stop(true,true);if(!n.is(":visible")){var m=n.dataSM("parent-a");if(this.opts.keepHighlighted||this.isCollapsible()){m.addClass("highlighted")}if(this.isCollapsible()){n.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""})}else{n.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1);if(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth){n.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap");if(this.opts.subMenusMinWidth){n.css("min-width",this.opts.subMenusMinWidth)}if(this.opts.subMenusMaxWidth){var o=this.getWidth(n);n.css("max-width",this.opts.subMenusMaxWidth);if(o>this.getWidth(n)){n.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}}}this.menuPosition(n);if(n.dataSM("ie-shim")){n.dataSM("ie-shim").insertBefore(n)}}var l=function(){n.css("overflow","")};if(this.isCollapsible()){if(this.opts.collapsibleShowFunction){this.opts.collapsibleShowFunction.call(this,n,l)}else{n.show(this.opts.collapsibleShowDuration,l)}}else{if(this.opts.showFunction){this.opts.showFunction.call(this,n,l)}else{n.show(this.opts.showDuration,l)}}m.attr("aria-expanded","true");n.attr({"aria-expanded":"true","aria-hidden":"false"});this.visibleSubMenus.push(n);this.$root.triggerHandler("show.smapi",n[0])}},popupHide:function(l){if(this.hideTimeout){clearTimeout(this.hideTimeout);this.hideTimeout=0}var m=this;this.hideTimeout=setTimeout(function(){m.menuHideAll()},l?1:this.opts.hideTimeout)},popupShow:function(o,n){if(!this.opts.isPopup){alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.');return}if(this.hideTimeout){clearTimeout(this.hideTimeout);this.hideTimeout=0}this.$root.dataSM("shown-before",true).stop(true,true);if(!this.$root.is(":visible")){this.$root.css({left:o,top:n});this.menuIframeShim(this.$root);if(this.$root.dataSM("ie-shim")){this.$root.dataSM("ie-shim").css({zIndex:this.$root.css("z-index"),width:this.getWidth(this.$root),height:this.getHeight(this.$root),left:o,top:n}).insertBefore(this.$root)}var m=this,l=function(){m.$root.css("overflow","")};if(this.opts.showFunction){this.opts.showFunction.call(this,this.$root,l)}else{this.$root.show(this.opts.showDuration,l)}this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(true);this.init(true)},rootKeyDown:function(o){if(!this.handleEvents()){return}switch(o.keyCode){case 27:var m=this.activatedItems[0];if(m){this.menuHideAll();m[0].focus();var n=m.dataSM("sub");if(n){this.menuHide(n)}}break;case 32:var l=a(o.target);if(l.is("a")&&this.handleItemEvents(l)){var n=l.dataSM("sub");if(n&&!n.is(":visible")){this.itemClick({currentTarget:o.target});o.preventDefault()}}break}},rootOut:function(m){if(!this.handleEvents()||this.isTouchMode()||m.target==this.$root[0]){return}if(this.hideTimeout){clearTimeout(this.hideTimeout);this.hideTimeout=0}if(!this.opts.showOnClick||!this.opts.hideOnClick){var l=this;this.hideTimeout=setTimeout(function(){l.menuHideAll()},this.opts.hideTimeout)}},rootOver:function(l){if(!this.handleEvents()||this.isTouchMode()||l.target==this.$root[0]){return}if(this.hideTimeout){clearTimeout(this.hideTimeout);this.hideTimeout=0}},winResize:function(m){if(!this.handleEvents()){if(this.$disableOverlay){var n=this.$root.offset();this.$disableOverlay.css({top:n.top,left:n.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}return}if(!("onorientationchange" in window)||m.type=="orientationchange"){var l=this.isCollapsible();if(!(this.wasCollapsible&&l)){if(this.activatedItems.length){this.activatedItems[this.activatedItems.length-1][0].blur()}this.menuHideAll()}this.wasCollapsible=l}}}});a.fn.dataSM=function(l,m){if(m){return this.data(l+"_smartmenus",m)}return this.data(l+"_smartmenus")};a.fn.removeDataSM=function(l){return this.removeData(l+"_smartmenus")};a.fn.smartmenus=function(m){if(typeof m=="string"){var l=arguments,o=m;Array.prototype.shift.call(l);return this.each(function(){var p=a(this).data("smartmenus");if(p&&p[o]){p[o].apply(p,l)}})}var n=a.extend({},a.fn.smartmenus.defaults,m);return this.each(function(){new a.SmartMenus(this,n)})};a.fn.smartmenus.defaults={isPopup:false,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:true,subIndicatorsPos:"prepend",subIndicatorsText:"+",scrollStep:30,scrollAccelerate:true,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(m,l){m.fadeOut(200,l)},collapsibleShowDuration:0,collapsibleShowFunction:function(m,l){m.slideDown(200,l)},collapsibleHideDuration:0,collapsibleHideFunction:function(m,l){m.slideUp(200,l)},showOnClick:false,hideOnClick:true,noMouseOver:false,keepInViewport:true,keepHighlighted:true,markCurrentItem:false,markCurrentTree:true,rightToLeftSubMenus:false,bottomToTopSubMenus:false,overlapControlsInIE:true};return a}));
+ * Copyright Vasil Dinkov, Vadikom Web Ltd. http://vadikom.com; Licensed MIT */(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):"object"==typeof module&&"object"==typeof module.exports?module.exports=t(require("jquery")):t(jQuery)})(function($){function initMouseDetection(t){var e=".smartmenus_mouse";if(mouseDetectionEnabled||t)mouseDetectionEnabled&&t&&($(document).off(e),mouseDetectionEnabled=!1);else{var i=!0,s=null,o={mousemove:function(t){var e={x:t.pageX,y:t.pageY,timeStamp:(new Date).getTime()};if(s){var o=Math.abs(s.x-e.x),a=Math.abs(s.y-e.y);if((o>0||a>0)&&2>=o&&2>=a&&300>=e.timeStamp-s.timeStamp&&(mouse=!0,i)){var n=$(t.target).closest("a");n.is("a")&&$.each(menuTrees,function(){return $.contains(this.$root[0],n[0])?(this.itemEnter({currentTarget:n[0]}),!1):void 0}),i=!1}}s=e}};o[touchEvents?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut"]=function(t){isTouchEvent(t.originalEvent)&&(mouse=!1)},$(document).on(getEventsNS(o,e)),mouseDetectionEnabled=!0}}function isTouchEvent(t){return!/^(4|mouse)$/.test(t.pointerType)}function getEventsNS(t,e){e||(e="");var i={};for(var s in t)i[s.split(" ").join(e+" ")+e]=t[s];return i}var menuTrees=[],mouse=!1,touchEvents="ontouchstart"in window,mouseDetectionEnabled=!1,requestAnimationFrame=window.requestAnimationFrame||function(t){return setTimeout(t,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||function(t){clearTimeout(t)},canAnimate=!!$.fn.animate;return $.SmartMenus=function(t,e){this.$root=$(t),this.opts=e,this.rootId="",this.accessIdPrefix="",this.$subArrow=null,this.activatedItems=[],this.visibleSubMenus=[],this.showTimeout=0,this.hideTimeout=0,this.scrollTimeout=0,this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.idInc=0,this.$firstLink=null,this.$firstSub=null,this.disabled=!1,this.$disableOverlay=null,this.$touchScrollingSub=null,this.cssTransforms3d="perspective"in t.style||"webkitPerspective"in t.style,this.wasCollapsible=!1,this.init()},$.extend($.SmartMenus,{hideAll:function(){$.each(menuTrees,function(){this.menuHideAll()})},destroy:function(){for(;menuTrees.length;)menuTrees[0].destroy();initMouseDetection(!0)},prototype:{init:function(t){var e=this;if(!t){menuTrees.push(this),this.rootId=((new Date).getTime()+Math.random()+"").replace(/\D/g,""),this.accessIdPrefix="sm-"+this.rootId+"-",this.$root.hasClass("sm-rtl")&&(this.opts.rightToLeftSubMenus=!0);var i=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).on(getEventsNS({"mouseover focusin":$.proxy(this.rootOver,this),"mouseout focusout":$.proxy(this.rootOut,this),keydown:$.proxy(this.rootKeyDown,this)},i)).on(getEventsNS({mouseenter:$.proxy(this.itemEnter,this),mouseleave:$.proxy(this.itemLeave,this),mousedown:$.proxy(this.itemDown,this),focus:$.proxy(this.itemFocus,this),blur:$.proxy(this.itemBlur,this),click:$.proxy(this.itemClick,this)},i),"a"),i+=this.rootId,this.opts.hideOnClick&&$(document).on(getEventsNS({touchstart:$.proxy(this.docTouchStart,this),touchmove:$.proxy(this.docTouchMove,this),touchend:$.proxy(this.docTouchEnd,this),click:$.proxy(this.docClick,this)},i)),$(window).on(getEventsNS({"resize orientationchange":$.proxy(this.winResize,this)},i)),this.opts.subIndicators&&(this.$subArrow=$("<span/>").addClass("sub-arrow"),this.opts.subIndicatorsText&&this.$subArrow.html(this.opts.subIndicatorsText)),initMouseDetection()}if(this.$firstSub=this.$root.find("ul").each(function(){e.menuInit($(this))}).eq(0),this.$firstLink=this.$root.find("a").eq(0),this.opts.markCurrentItem){var s=/(index|default)\.[^#\?\/]*/i,o=/#.*/,a=window.location.href.replace(s,""),n=a.replace(o,"");this.$root.find("a").each(function(){var t=this.href.replace(s,""),i=$(this);(t==a||t==n)&&(i.addClass("current"),e.opts.markCurrentTree&&i.parentsUntil("[data-smartmenus-id]","ul").each(function(){$(this).dataSM("parent-a").addClass("current")}))})}this.wasCollapsible=this.isCollapsible()},destroy:function(t){if(!t){var e=".smartmenus";this.$root.removeData("smartmenus").removeAttr("data-smartmenus-id").removeDataSM("level").off(e),e+=this.rootId,$(document).off(e),$(window).off(e),this.opts.subIndicators&&(this.$subArrow=null)}this.menuHideAll();var i=this;this.$root.find("ul").each(function(){var t=$(this);t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.dataSM("shown-before")&&((i.opts.subMenusMinWidth||i.opts.subMenusMaxWidth)&&t.css({width:"",minWidth:"",maxWidth:""}).removeClass("sm-nowrap"),t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.css({zIndex:"",top:"",left:"",marginLeft:"",marginTop:"",display:""})),0==(t.attr("id")||"").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeDataSM("in-mega").removeDataSM("shown-before").removeDataSM("scroll-arrows").removeDataSM("parent-a").removeDataSM("level").removeDataSM("beforefirstshowfired").removeAttr("role").removeAttr("aria-hidden").removeAttr("aria-labelledby").removeAttr("aria-expanded"),this.$root.find("a.has-submenu").each(function(){var t=$(this);0==t.attr("id").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeClass("has-submenu").removeDataSM("sub").removeAttr("aria-haspopup").removeAttr("aria-controls").removeAttr("aria-expanded").closest("li").removeDataSM("sub"),this.opts.subIndicators&&this.$root.find("span.sub-arrow").remove(),this.opts.markCurrentItem&&this.$root.find("a.current").removeClass("current"),t||(this.$root=null,this.$firstLink=null,this.$firstSub=null,this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),menuTrees.splice($.inArray(this,menuTrees),1))},disable:function(t){if(!this.disabled){if(this.menuHideAll(),!t&&!this.opts.isPopup&&this.$root.is(":visible")){var e=this.$root.offset();this.$disableOverlay=$('<div class="sm-jquery-disable-overlay"/>').css({position:"absolute",top:e.top,left:e.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(!0),opacity:0}).appendTo(document.body)}this.disabled=!0}},docClick:function(t){return this.$touchScrollingSub?(this.$touchScrollingSub=null,void 0):((this.visibleSubMenus.length&&!$.contains(this.$root[0],t.target)||$(t.target).closest("a").length)&&this.menuHideAll(),void 0)},docTouchEnd:function(){if(this.lastTouch){if(!(!this.visibleSubMenus.length||void 0!==this.lastTouch.x2&&this.lastTouch.x1!=this.lastTouch.x2||void 0!==this.lastTouch.y2&&this.lastTouch.y1!=this.lastTouch.y2||this.lastTouch.target&&$.contains(this.$root[0],this.lastTouch.target))){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var t=this;this.hideTimeout=setTimeout(function(){t.menuHideAll()},350)}this.lastTouch=null}},docTouchMove:function(t){if(this.lastTouch){var e=t.originalEvent.touches[0];this.lastTouch.x2=e.pageX,this.lastTouch.y2=e.pageY}},docTouchStart:function(t){var e=t.originalEvent.touches[0];this.lastTouch={x1:e.pageX,y1:e.pageY,target:e.target}},enable:function(){this.disabled&&(this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),this.disabled=!1)},getClosestMenu:function(t){for(var e=$(t).closest("ul");e.dataSM("in-mega");)e=e.parent().closest("ul");return e[0]||null},getHeight:function(t){return this.getOffset(t,!0)},getOffset:function(t,e){var i;"none"==t.css("display")&&(i={position:t[0].style.position,visibility:t[0].style.visibility},t.css({position:"absolute",visibility:"hidden"}).show());var s=t[0].getBoundingClientRect&&t[0].getBoundingClientRect(),o=s&&(e?s.height||s.bottom-s.top:s.width||s.right-s.left);return o||0===o||(o=e?t[0].offsetHeight:t[0].offsetWidth),i&&t.hide().css(i),o},getStartZIndex:function(t){var e=parseInt(this[t?"$root":"$firstSub"].css("z-index"));return!t&&isNaN(e)&&(e=parseInt(this.$root.css("z-index"))),isNaN(e)?1:e},getTouchPoint:function(t){return t.touches&&t.touches[0]||t.changedTouches&&t.changedTouches[0]||t},getViewport:function(t){var e=t?"Height":"Width",i=document.documentElement["client"+e],s=window["inner"+e];return s&&(i=Math.min(i,s)),i},getViewportHeight:function(){return this.getViewport(!0)},getViewportWidth:function(){return this.getViewport()},getWidth:function(t){return this.getOffset(t)},handleEvents:function(){return!this.disabled&&this.isCSSOn()},handleItemEvents:function(t){return this.handleEvents()&&!this.isLinkInMegaMenu(t)},isCollapsible:function(){return"static"==this.$firstSub.css("position")},isCSSOn:function(){return"inline"!=this.$firstLink.css("display")},isFixed:function(){var t="fixed"==this.$root.css("position");return t||this.$root.parentsUntil("body").each(function(){return"fixed"==$(this).css("position")?(t=!0,!1):void 0}),t},isLinkInMegaMenu:function(t){return $(this.getClosestMenu(t[0])).hasClass("mega-menu")},isTouchMode:function(){return!mouse||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(t,e){var i=t.closest("ul"),s=i.dataSM("level");if(s>1&&(!this.activatedItems[s-2]||this.activatedItems[s-2][0]!=i.dataSM("parent-a")[0])){var o=this;$(i.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(i).each(function(){o.itemActivate($(this).dataSM("parent-a"))})}if((!this.isCollapsible()||e)&&this.menuHideSubMenus(this.activatedItems[s-1]&&this.activatedItems[s-1][0]==t[0]?s:s-1),this.activatedItems[s-1]=t,this.$root.triggerHandler("activate.smapi",t[0])!==!1){var a=t.dataSM("sub");a&&(this.isTouchMode()||!this.opts.showOnClick||this.clickActivated)&&this.menuShow(a)}},itemBlur:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&this.$root.triggerHandler("blur.smapi",e[0])},itemClick:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==e.closest("ul")[0])return this.$touchScrollingSub=null,t.stopPropagation(),!1;if(this.$root.triggerHandler("click.smapi",e[0])===!1)return!1;var i=$(t.target).is(".sub-arrow"),s=e.dataSM("sub"),o=s?2==s.dataSM("level"):!1,a=this.isCollapsible(),n=/toggle$/.test(this.opts.collapsibleBehavior),r=/link$/.test(this.opts.collapsibleBehavior),h=/^accordion/.test(this.opts.collapsibleBehavior);if(s&&!s.is(":visible")){if((!r||!a||i)&&(this.opts.showOnClick&&o&&(this.clickActivated=!0),this.itemActivate(e,h),s.is(":visible")))return this.focusActivated=!0,!1}else if(a&&(n||i))return this.itemActivate(e,h),this.menuHide(s),n&&(this.focusActivated=!1),!1;return this.opts.showOnClick&&o||e.hasClass("disabled")||this.$root.triggerHandler("select.smapi",e[0])===!1?!1:void 0}},itemDown:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&e.dataSM("mousedown",!0)},itemEnter:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(!this.isTouchMode()){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);var i=this;this.showTimeout=setTimeout(function(){i.itemActivate(e)},this.opts.showOnClick&&1==e.closest("ul").dataSM("level")?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",e[0])}},itemFocus:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(!this.focusActivated||this.isTouchMode()&&e.dataSM("mousedown")||this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0]==e[0]||this.itemActivate(e,!0),this.$root.triggerHandler("focus.smapi",e[0]))},itemLeave:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(this.isTouchMode()||(e[0].blur(),this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0)),e.removeDataSM("mousedown"),this.$root.triggerHandler("mouseleave.smapi",e[0]))},menuHide:function(t){if(this.$root.triggerHandler("beforehide.smapi",t[0])!==!1&&(canAnimate&&t.stop(!0,!0),"none"!=t.css("display"))){var e=function(){t.css("z-index","")};this.isCollapsible()?canAnimate&&this.opts.collapsibleHideFunction?this.opts.collapsibleHideFunction.call(this,t,e):t.hide(this.opts.collapsibleHideDuration,e):canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,t,e):t.hide(this.opts.hideDuration,e),t.dataSM("scroll")&&(this.menuScrollStop(t),t.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).off(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()),t.dataSM("parent-a").removeClass("highlighted").attr("aria-expanded","false"),t.attr({"aria-expanded":"false","aria-hidden":"true"});var i=t.dataSM("level");this.activatedItems.splice(i-1,1),this.visibleSubMenus.splice($.inArray(t,this.visibleSubMenus),1),this.$root.triggerHandler("hide.smapi",t[0])}},menuHideAll:function(){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);for(var t=this.opts.isPopup?1:0,e=this.visibleSubMenus.length-1;e>=t;e--)this.menuHide(this.visibleSubMenus[e]);this.opts.isPopup&&(canAnimate&&this.$root.stop(!0,!0),this.$root.is(":visible")&&(canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,this.$root):this.$root.hide(this.opts.hideDuration))),this.activatedItems=[],this.visibleSubMenus=[],this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(t){for(var e=this.activatedItems.length-1;e>=t;e--){var i=this.activatedItems[e].dataSM("sub");i&&this.menuHide(i)}},menuInit:function(t){if(!t.dataSM("in-mega")){t.hasClass("mega-menu")&&t.find("ul").dataSM("in-mega",!0);for(var e=2,i=t[0];(i=i.parentNode.parentNode)!=this.$root[0];)e++;var s=t.prevAll("a").eq(-1);s.length||(s=t.prevAll().find("a").eq(-1)),s.addClass("has-submenu").dataSM("sub",t),t.dataSM("parent-a",s).dataSM("level",e).parent().dataSM("sub",t);var o=s.attr("id")||this.accessIdPrefix+ ++this.idInc,a=t.attr("id")||this.accessIdPrefix+ ++this.idInc;s.attr({id:o,"aria-haspopup":"true","aria-controls":a,"aria-expanded":"false"}),t.attr({id:a,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"}),this.opts.subIndicators&&s[this.opts.subIndicatorsPos](this.$subArrow.clone())}},menuPosition:function(t){var e,i,s=t.dataSM("parent-a"),o=s.closest("li"),a=o.parent(),n=t.dataSM("level"),r=this.getWidth(t),h=this.getHeight(t),u=s.offset(),l=u.left,c=u.top,d=this.getWidth(s),m=this.getHeight(s),p=$(window),f=p.scrollLeft(),v=p.scrollTop(),b=this.getViewportWidth(),S=this.getViewportHeight(),g=a.parent().is("[data-sm-horizontal-sub]")||2==n&&!a.hasClass("sm-vertical"),M=this.opts.rightToLeftSubMenus&&!o.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&o.is("[data-sm-reverse]"),w=2==n?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,T=2==n?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY;if(g?(e=M?d-r-w:w,i=this.opts.bottomToTopSubMenus?-h-T:m+T):(e=M?w-r:d-w,i=this.opts.bottomToTopSubMenus?m-T-h:T),this.opts.keepInViewport){var y=l+e,I=c+i;if(M&&f>y?e=g?f-y+e:d-w:!M&&y+r>f+b&&(e=g?f+b-r-y+e:w-r),g||(S>h&&I+h>v+S?i+=v+S-h-I:(h>=S||v>I)&&(i+=v-I)),g&&(I+h>v+S+.49||v>I)||!g&&h>S+.49){var x=this;t.dataSM("scroll-arrows")||t.dataSM("scroll-arrows",$([$('<span class="scroll-up"><span class="scroll-up-arrow"></span></span>')[0],$('<span class="scroll-down"><span class="scroll-down-arrow"></span></span>')[0]]).on({mouseenter:function(){t.dataSM("scroll").up=$(this).hasClass("scroll-up"),x.menuScroll(t)},mouseleave:function(e){x.menuScrollStop(t),x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(t){t.preventDefault()}}).insertAfter(t));var A=".smartmenus_scroll";if(t.dataSM("scroll",{y:this.cssTransforms3d?0:i-m,step:1,itemH:m,subH:h,arrowDownH:this.getHeight(t.dataSM("scroll-arrows").eq(1))}).on(getEventsNS({mouseover:function(e){x.menuScrollOver(t,e)},mouseout:function(e){x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(e){x.menuScrollMousewheel(t,e)}},A)).dataSM("scroll-arrows").css({top:"auto",left:"0",marginLeft:e+(parseInt(t.css("border-left-width"))||0),width:r-(parseInt(t.css("border-left-width"))||0)-(parseInt(t.css("border-right-width"))||0),zIndex:t.css("z-index")}).eq(g&&this.opts.bottomToTopSubMenus?0:1).show(),this.isFixed()){var C={};C[touchEvents?"touchstart touchmove touchend":"pointerdown pointermove pointerup MSPointerDown MSPointerMove MSPointerUp"]=function(e){x.menuScrollTouch(t,e)},t.css({"touch-action":"none","-ms-touch-action":"none"}).on(getEventsNS(C,A))}}}t.css({top:"auto",left:"0",marginLeft:e,marginTop:i-m})},menuScroll:function(t,e,i){var s,o=t.dataSM("scroll"),a=t.dataSM("scroll-arrows"),n=o.up?o.upEnd:o.downEnd;if(!e&&o.momentum){if(o.momentum*=.92,s=o.momentum,.5>s)return this.menuScrollStop(t),void 0}else s=i||(e||!this.opts.scrollAccelerate?this.opts.scrollStep:Math.floor(o.step));var r=t.dataSM("level");if(this.activatedItems[r-1]&&this.activatedItems[r-1].dataSM("sub")&&this.activatedItems[r-1].dataSM("sub").is(":visible")&&this.menuHideSubMenus(r-1),o.y=o.up&&o.y>=n||!o.up&&n>=o.y?o.y:Math.abs(n-o.y)>s?o.y+(o.up?s:-s):n,t.css(this.cssTransforms3d?{"-webkit-transform":"translate3d(0, "+o.y+"px, 0)",transform:"translate3d(0, "+o.y+"px, 0)"}:{marginTop:o.y}),mouse&&(o.up&&o.y>o.downEnd||!o.up&&o.y<o.upEnd)&&a.eq(o.up?1:0).show(),o.y==n)mouse&&a.eq(o.up?0:1).hide(),this.menuScrollStop(t);else if(!e){this.opts.scrollAccelerate&&o.step<this.opts.scrollStep&&(o.step+=.2);var h=this;this.scrollTimeout=requestAnimationFrame(function(){h.menuScroll(t)})}},menuScrollMousewheel:function(t,e){if(this.getClosestMenu(e.target)==t[0]){e=e.originalEvent;var i=(e.wheelDelta||-e.detail)>0;t.dataSM("scroll-arrows").eq(i?0:1).is(":visible")&&(t.dataSM("scroll").up=i,this.menuScroll(t,!0))}e.preventDefault()},menuScrollOut:function(t,e){mouse&&(/^scroll-(up|down)/.test((e.relatedTarget||"").className)||(t[0]==e.relatedTarget||$.contains(t[0],e.relatedTarget))&&this.getClosestMenu(e.relatedTarget)==t[0]||t.dataSM("scroll-arrows").css("visibility","hidden"))},menuScrollOver:function(t,e){if(mouse&&!/^scroll-(up|down)/.test(e.target.className)&&this.getClosestMenu(e.target)==t[0]){this.menuScrollRefreshData(t);var i=t.dataSM("scroll"),s=$(window).scrollTop()-t.dataSM("parent-a").offset().top-i.itemH;t.dataSM("scroll-arrows").eq(0).css("margin-top",s).end().eq(1).css("margin-top",s+this.getViewportHeight()-i.arrowDownH).end().css("visibility","visible")}},menuScrollRefreshData:function(t){var e=t.dataSM("scroll"),i=$(window).scrollTop()-t.dataSM("parent-a").offset().top-e.itemH;this.cssTransforms3d&&(i=-(parseFloat(t.css("margin-top"))-i)),$.extend(e,{upEnd:i,downEnd:i+this.getViewportHeight()-e.subH})},menuScrollStop:function(t){return this.scrollTimeout?(cancelAnimationFrame(this.scrollTimeout),this.scrollTimeout=0,t.dataSM("scroll").step=1,!0):void 0},menuScrollTouch:function(t,e){if(e=e.originalEvent,isTouchEvent(e)){var i=this.getTouchPoint(e);if(this.getClosestMenu(i.target)==t[0]){var s=t.dataSM("scroll");if(/(start|down)$/i.test(e.type))this.menuScrollStop(t)?(e.preventDefault(),this.$touchScrollingSub=t):this.$touchScrollingSub=null,this.menuScrollRefreshData(t),$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp});else if(/move$/i.test(e.type)){var o=void 0!==s.touchY?s.touchY:s.touchStartY;if(void 0!==o&&o!=i.pageY){this.$touchScrollingSub=t;var a=i.pageY>o;void 0!==s.up&&s.up!=a&&$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp}),$.extend(s,{up:a,touchY:i.pageY}),this.menuScroll(t,!0,Math.abs(i.pageY-o))}e.preventDefault()}else void 0!==s.touchY&&((s.momentum=15*Math.pow(Math.abs(i.pageY-s.touchStartY)/(e.timeStamp-s.touchStartTime),2))&&(this.menuScrollStop(t),this.menuScroll(t),e.preventDefault()),delete s.touchY)}}},menuShow:function(t){if((t.dataSM("beforefirstshowfired")||(t.dataSM("beforefirstshowfired",!0),this.$root.triggerHandler("beforefirstshow.smapi",t[0])!==!1))&&this.$root.triggerHandler("beforeshow.smapi",t[0])!==!1&&(t.dataSM("shown-before",!0),canAnimate&&t.stop(!0,!0),!t.is(":visible"))){var e=t.dataSM("parent-a"),i=this.isCollapsible();if((this.opts.keepHighlighted||i)&&e.addClass("highlighted"),i)t.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""});else{if(t.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1),(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth)&&(t.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap"),this.opts.subMenusMinWidth&&t.css("min-width",this.opts.subMenusMinWidth),this.opts.subMenusMaxWidth)){var s=this.getWidth(t);t.css("max-width",this.opts.subMenusMaxWidth),s>this.getWidth(t)&&t.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}this.menuPosition(t)}var o=function(){t.css("overflow","")};i?canAnimate&&this.opts.collapsibleShowFunction?this.opts.collapsibleShowFunction.call(this,t,o):t.show(this.opts.collapsibleShowDuration,o):canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,t,o):t.show(this.opts.showDuration,o),e.attr("aria-expanded","true"),t.attr({"aria-expanded":"true","aria-hidden":"false"}),this.visibleSubMenus.push(t),this.$root.triggerHandler("show.smapi",t[0])}},popupHide:function(t){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},t?1:this.opts.hideTimeout)},popupShow:function(t,e){if(!this.opts.isPopup)return alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.'),void 0;if(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),this.$root.dataSM("shown-before",!0),canAnimate&&this.$root.stop(!0,!0),!this.$root.is(":visible")){this.$root.css({left:t,top:e});var i=this,s=function(){i.$root.css("overflow","")};canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,this.$root,s):this.$root.show(this.opts.showDuration,s),this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(!0),this.init(!0)},rootKeyDown:function(t){if(this.handleEvents())switch(t.keyCode){case 27:var e=this.activatedItems[0];if(e){this.menuHideAll(),e[0].focus();var i=e.dataSM("sub");i&&this.menuHide(i)}break;case 32:var s=$(t.target);if(s.is("a")&&this.handleItemEvents(s)){var i=s.dataSM("sub");i&&!i.is(":visible")&&(this.itemClick({currentTarget:t.target}),t.preventDefault())}}},rootOut:function(t){if(this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),!this.opts.showOnClick||!this.opts.hideOnClick)){var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},this.opts.hideTimeout)}},rootOver:function(t){this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0)},winResize:function(t){if(this.handleEvents()){if(!("onorientationchange"in window)||"orientationchange"==t.type){var e=this.isCollapsible();this.wasCollapsible&&e||(this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0].blur(),this.menuHideAll()),this.wasCollapsible=e}}else if(this.$disableOverlay){var i=this.$root.offset();this.$disableOverlay.css({top:i.top,left:i.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}}}}),$.fn.dataSM=function(t,e){return e?this.data(t+"_smartmenus",e):this.data(t+"_smartmenus")},$.fn.removeDataSM=function(t){return this.removeData(t+"_smartmenus")},$.fn.smartmenus=function(options){if("string"==typeof options){var args=arguments,method=options;return Array.prototype.shift.call(args),this.each(function(){var t=$(this).data("smartmenus");t&&t[method]&&t[method].apply(t,args)})}return this.each(function(){var dataOpts=$(this).data("sm-options")||null;if(dataOpts)try{dataOpts=eval("("+dataOpts+")")}catch(e){dataOpts=null,alert('ERROR\n\nSmartMenus jQuery init:\nInvalid "data-sm-options" attribute value syntax.')}new $.SmartMenus(this,$.extend({},$.fn.smartmenus.defaults,options,dataOpts))})},$.fn.smartmenus.defaults={isPopup:!1,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:!0,subIndicatorsPos:"append",subIndicatorsText:"",scrollStep:30,scrollAccelerate:!0,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(t,e){t.fadeOut(200,e)},collapsibleShowDuration:0,collapsibleShowFunction:function(t,e){t.slideDown(200,e)},collapsibleHideDuration:0,collapsibleHideFunction:function(t,e){t.slideUp(200,e)},showOnClick:!1,hideOnClick:!0,noMouseOver:!1,keepInViewport:!0,keepHighlighted:!0,markCurrentItem:!1,markCurrentTree:!0,rightToLeftSubMenus:!1,bottomToTopSubMenus:!1,collapsibleBehavior:"default"},$});
\ No newline at end of file
diff --git a/doc/html/menu.js b/doc/html/menu.js
index 89aaf57..433c15b 100644
--- a/doc/html/menu.js
+++ b/doc/html/menu.js
@@ -40,7 +40,7 @@ function initMenu(relPath,searchEnabled,serverSide,searchPage,search) {
   $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu');
   if (searchEnabled) {
     if (serverSide) {
-      $('#main-menu').append('<li style="float:right"><div id="MSearchBox" class="MSearchBoxInactive"><div class="left"><form id="FSearchBox" action="'+searchPage+'" method="get"><img id="MSearchSelect" src="'+relPath+'search/mag.png" alt=""/><input type="text" id="MSearchField" name="query" value="'+search+'" size="20" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)"></form></div><div class="right"></div></div></li>');
+      $('#main-menu').append('<li style="float:right"><div id="MSearchBox" class="MSearchBoxInactive"><div class="left"><form id="FSearchBox" action="'+relPath+searchPage+'" method="get"><img id="MSearchSelect" src="'+relPath+'search/mag.png" alt=""/><input type="text" id="MSearchField" name="query" value="'+search+'" size="20" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)"></form></div><div class="right"></div></div></li>');
     } else {
       $('#main-menu').append('<li style="float:right"><div id="MSearchBox" class="MSearchBoxInactive"><span class="left"><img id="MSearchSelect" src="'+relPath+'search/mag_sel.png" onmouseover="return searchBox.OnSearchSelectShow()" onmouseout="return searchBox.OnSearchSelectHide()" alt=""/><input type="text" id="MSearchField" value="'+search+'" accesskey="S" onfocus="searchBox.OnSearchFieldFocus(true)" onblur="searchBox.OnSearchFieldFocus(false)" onkeyup="searchBox.OnSearchFieldChange(event)"/></span><span class="right"><a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="'+relPath+'search/close.png" alt=""/></a></span></div></li>');
     }
diff --git a/doc/html/menudata.js b/doc/html/menudata.js
index 97b8f77..6e93387 100644
--- a/doc/html/menudata.js
+++ b/doc/html/menudata.js
@@ -1,18 +1,17 @@
 /*
-@ @licstart  The following is the entire license notice for the
+@licstart  The following is the entire license notice for the
 JavaScript code in this file.
 
-Copyright (C) 1997-2017 by Dimitri van Heesch
+Copyright (C) 1997-2019 by Dimitri van Heesch
 
 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 2 of the License, or
-(at your option) any later version.
+it under the terms of version 2 of the GNU General Public License as published by
+the Free Software Foundation
 
 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.
+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, write to the Free Software Foundation, Inc.,
diff --git a/doc/html/namespacemembers.html b/doc/html/namespacemembers.html
index f8d8705..f0c16ad 100644
--- a/doc/html/namespacemembers.html
+++ b/doc/html/namespacemembers.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Module Members</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -268,7 +268,7 @@ <h3><a id="index_t"></a>- t -</h3><ul>
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacemembers_func.html b/doc/html/namespacemembers_func.html
index 62241f1..8da0578 100644
--- a/doc/html/namespacemembers_func.html
+++ b/doc/html/namespacemembers_func.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Module Members</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -240,7 +240,7 @@ <h3><a id="index_t"></a>- t -</h3><ul>
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacemembers_vars.html b/doc/html/namespacemembers_vars.html
index 529c4be..8572816 100644
--- a/doc/html/namespacemembers_vars.html
+++ b/doc/html/namespacemembers_vars.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Module Members</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -120,7 +120,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__c__api.html b/doc/html/namespacenonlin__c__api.html
new file mode 100644
index 0000000..cbcb680
--- /dev/null
+++ b/doc/html/namespacenonlin__c__api.html
@@ -0,0 +1,111 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api Module Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('namespacenonlin__c__api.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api Module Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Defines a C-friendly API to the NONLIN library.  
+<a href="namespacenonlin__c__api.html#details">More...</a></p>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Defines a C-friendly API to the NONLIN library. </p>
+</div></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/namespacenonlin__constants.html b/doc/html/namespacenonlin__constants.html
index a3c57c6..bd1f1d3 100644
--- a/doc/html/namespacenonlin__constants.html
+++ b/doc/html/namespacenonlin__constants.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_constants Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -94,8 +94,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants ">nonlin_constants</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants">nonlin_constants</a></b>  
+<a href="namespacenonlin__constants.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
 Variables</h2></td></tr>
@@ -133,7 +133,7 @@
 <tr class="separator:a226aad58e61f8da6e0bf56163a761cd0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants ">nonlin_constants</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants">nonlin_constants</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide various constants used by the NONLIN library. </dd></dl>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
@@ -143,7 +143,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__constants.html">nonlin_constants</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__core.html b/doc/html/namespacenonlin__core.html
index a532b61..1e50677 100644
--- a/doc/html/namespacenonlin__core.html
+++ b/doc/html/namespacenonlin__core.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -95,8 +95,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core ">nonlin_core</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b>  
+<a href="namespacenonlin__core.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
@@ -152,24 +152,24 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions/Subroutines</h2></td></tr>
 <tr class="memitem:ac9637db13c24f15661e80eb42b225ea7"><td class="memItemLeft" align="right" valign="top">subroutine, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7">print_status</a> (iter, nfeval, njaceval, xnorm, fnorm)</td></tr>
-<tr class="memdesc:ac9637db13c24f15661e80eb42b225ea7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the iteration status.  <a href="#ac9637db13c24f15661e80eb42b225ea7">More...</a><br /></td></tr>
+<tr class="memdesc:ac9637db13c24f15661e80eb42b225ea7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the iteration status.  <a href="namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7">More...</a><br /></td></tr>
 <tr class="separator:ac9637db13c24f15661e80eb42b225ea7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core ">nonlin_core</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide various routines to solve equations of one or many variables. Actual solvers are located in the following modules.<ul>
-<li>Module: <a class="el" href="namespacenonlin__solve.html" title="nonlin_solve ">nonlin_solve</a><ul>
+<li>Module: <a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a><ul>
 <li>quasi_newton_solver</li>
 <li>newton_solver</li>
 <li>brent_solver</li>
 <li>newton_1var_solver</li>
 </ul>
 </li>
-<li>Module: <a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares ">nonlin_least_squares</a><ul>
+<li>Module: <a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a><ul>
 <li>least_squares_solver</li>
 </ul>
 </li>
-<li>Module: <a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize ">nonlin_optimize</a><ul>
+<li>Module: <a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a><ul>
 <li>nelder_mead</li>
 <li>bfgs </li>
 </ul>
@@ -245,7 +245,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac9637db13c24f15661e80eb4
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__least__squares.html b/doc/html/namespacenonlin__least__squares.html
index fc67609..0f96db6 100644
--- a/doc/html/namespacenonlin__least__squares.html
+++ b/doc/html/namespacenonlin__least__squares.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_least_squares Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -95,8 +95,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares ">nonlin_least_squares</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b>  
+<a href="namespacenonlin__least__squares.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
@@ -107,26 +107,26 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions/Subroutines</h2></td></tr>
 <tr class="memitem:a1e0b514919f21f9226c5ed69eee4018b"><td class="memItemLeft" align="right" valign="top">pure real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b">lss_get_factor</a> (this)</td></tr>
-<tr class="memdesc:a1e0b514919f21f9226c5ed69eee4018b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a factor used to scale the bounds on the initial step.  <a href="#a1e0b514919f21f9226c5ed69eee4018b">More...</a><br /></td></tr>
+<tr class="memdesc:a1e0b514919f21f9226c5ed69eee4018b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a factor used to scale the bounds on the initial step.  <a href="namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b">More...</a><br /></td></tr>
 <tr class="separator:a1e0b514919f21f9226c5ed69eee4018b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af93ae0c6697ce082b10c9577c17d35f2"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2">lss_set_factor</a> (this, x)</td></tr>
-<tr class="memdesc:af93ae0c6697ce082b10c9577c17d35f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a factor used to scale the bounds on the initial step.  <a href="#af93ae0c6697ce082b10c9577c17d35f2">More...</a><br /></td></tr>
+<tr class="memdesc:af93ae0c6697ce082b10c9577c17d35f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a factor used to scale the bounds on the initial step.  <a href="namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2">More...</a><br /></td></tr>
 <tr class="separator:af93ae0c6697ce082b10c9577c17d35f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a974515039f6a26d25f774604eeaef992"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992">lss_solve</a> (this, fcn, x, fvec, ib, err)</td></tr>
-<tr class="memdesc:a974515039f6a26d25f774604eeaef992"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies the Levenberg-Marquardt method to solve the nonlinear least-squares problem.  <a href="#a974515039f6a26d25f774604eeaef992">More...</a><br /></td></tr>
+<tr class="memdesc:a974515039f6a26d25f774604eeaef992"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies the Levenberg-Marquardt method to solve the nonlinear least-squares problem.  <a href="namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992">More...</a><br /></td></tr>
 <tr class="separator:a974515039f6a26d25f774604eeaef992"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aff0b0333d5da3f2c6f9418faf9bed743"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743">lmpar</a> (r, ipvt, diag, qtb, delta, par, x, sdiag, wa1, wa2)</td></tr>
-<tr class="memdesc:aff0b0333d5da3f2c6f9418faf9bed743"><td class="mdescLeft">&#160;</td><td class="mdescRight">Completes the solution of the Levenberg-Marquardt problem when provided with a QR factored form of the system Jacobian matrix. The form of the problem at this stage is J*X = B (J = Jacobian), and D*X = 0, where D is a diagonal matrix.  <a href="#aff0b0333d5da3f2c6f9418faf9bed743">More...</a><br /></td></tr>
+<tr class="memdesc:aff0b0333d5da3f2c6f9418faf9bed743"><td class="mdescLeft">&#160;</td><td class="mdescRight">Completes the solution of the Levenberg-Marquardt problem when provided with a QR factored form of the system Jacobian matrix. The form of the problem at this stage is J*X = B (J = Jacobian), and D*X = 0, where D is a diagonal matrix.  <a href="namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743">More...</a><br /></td></tr>
 <tr class="separator:aff0b0333d5da3f2c6f9418faf9bed743"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad4e4f6036867660fa6ad45ee6000fd47"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47">lmfactor</a> (a, pivot, ipvt, rdiag, acnorm, wa)</td></tr>
-<tr class="memdesc:ad4e4f6036867660fa6ad45ee6000fd47"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the QR factorization of an M-by-N matrix.  <a href="#ad4e4f6036867660fa6ad45ee6000fd47">More...</a><br /></td></tr>
+<tr class="memdesc:ad4e4f6036867660fa6ad45ee6000fd47"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the QR factorization of an M-by-N matrix.  <a href="namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47">More...</a><br /></td></tr>
 <tr class="separator:ad4e4f6036867660fa6ad45ee6000fd47"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa04692a475a2845cd5f05e8798696483"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483">lmsolve</a> (r, ipvt, diag, qtb, x, sdiag, wa)</td></tr>
-<tr class="memdesc:aa04692a475a2845cd5f05e8798696483"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the QR factored system A*X = B, coupled with the diagonal system D*X = 0 in the least-squares sense.  <a href="#aa04692a475a2845cd5f05e8798696483">More...</a><br /></td></tr>
+<tr class="memdesc:aa04692a475a2845cd5f05e8798696483"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the QR factored system A*X = B, coupled with the diagonal system D*X = 0 in the least-squares sense.  <a href="namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483">More...</a><br /></td></tr>
 <tr class="separator:aa04692a475a2845cd5f05e8798696483"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares ">nonlin_least_squares</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide routines capable of solving the nonlinear least squares problem. </dd></dl>
 </div><h2 class="groupheader">Function/Subroutine Documentation</h2>
 <a id="ad4e4f6036867660fa6ad45ee6000fd47"></a>
@@ -419,7 +419,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1e0b514919f21f9226c5ed69
 <p>Gets a factor used to scale the bounds on the initial step. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems. ">least_squares_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems.">least_squares_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -467,7 +467,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#af93ae0c6697ce082b10c9577
 <p>Sets a factor used to scale the bounds on the initial step. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems. ">least_squares_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems.">least_squares_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The factor. Notice, the factor is limited to the interval [0.1, 100].</td></tr>
   </table>
   </dd>
@@ -539,7 +539,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a974515039f6a26d25f774604
 <p>Applies the Levenberg-Marquardt method to solve the nonlinear least-squares problem. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems. ">least_squares_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems.">least_squares_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The vecfcn_helper object containing the equations to solve. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an M-element array containing an initial estimate to the solution. On output, the updated solution estimate. M is the number of variables. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">fvec</td><td>An N-element array that, on output, will contain the values of each equation as evaluated at the variable values given in <code>x</code>. N is the number of equations. </td></tr>
@@ -557,8 +557,110 @@ <h2 class="memtitle"><span class="permalink"><a href="#a974515039f6a26d25f774604
   </dd>
 </dl>
 <dl class="section user"><dt>Remarks</dt><dd>This routines is based upon the MINPACK routine LMDIF.</dd></dl>
-<dl class="section user"><dt>Example 1</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using the Levenberg-Marquardt method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div><div class="line"></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(least_squares_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div><div class="line">    x = 1.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Define the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual:</span></div><div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! System of Equations:</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! Solution:</span></div><div class="line">    <span class="comment">! x = +/-5</span></div><div class="line">    <span class="comment">! y = +/-3</span></div><div class="line"><span class="keyword">    subroutine </span>fcn1(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div><div class="line">The residual: (.000E+00, .000E+00)</div></div><!-- fragment --></dd></dl>
-<dl class="section user"><dt>Example 2</dt><dd><div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>, <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(least_squares_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(4), f(21) <span class="comment">! There are 4 coefficients and 21 data points</span></div><div class="line"></div><div class="line">    <span class="comment">! Locate the routine containing the equations to solve</span></div><div class="line">    fcn =&gt; fcns</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 21, 4)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0, 1.0d0, 1.0d0]</span></div><div class="line"></div><div class="line">    <span class="comment">! Solve</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c1: &quot;</span>, x(1)</div><div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c2: &quot;</span>, x(2)</div><div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c3: &quot;</span>, x(3)</div><div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c4: &quot;</span>, x(4)</div><div class="line">    print <span class="stringliteral">&quot;(AF9.5)&quot;</span>, <span class="stringliteral">&quot;Max Residual: &quot;</span>, maxval(abs(f))</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function containing the data to fit</span></div><div class="line"><span class="keyword">    subroutine </span>fcns(x, f)</div><div class="line">        <span class="comment">! Arguments</span></div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x  <span class="comment">! Contains the coefficients</span></div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line"></div><div class="line">        <span class="comment">! Local Variables</span></div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(21)</span> :: xp, yp</div><div class="line"></div><div class="line">        <span class="comment">! Data to fit (21 data points)</span></div><div class="line">        xp = [0.0d0, 0.1d0, 0.2d0, 0.3d0, 0.4d0, 0.5d0, 0.6d0, 0.7d0, 0.8d0, &amp;</div><div class="line">            0.9d0, 1.0d0, 1.1d0, 1.2d0, 1.3d0, 1.4d0, 1.5d0, 1.6d0, 1.7d0, &amp;</div><div class="line">            1.8d0, 1.9d0, 2.0d0]</div><div class="line">        yp = [1.216737514d0, 1.250032542d0, 1.305579195d0, 1.040182335d0, &amp;</div><div class="line">            1.751867738d0, 1.109716707d0, 2.018141531d0, 1.992418729d0, &amp;</div><div class="line">            1.807916923d0, 2.078806005d0, 2.698801324d0, 2.644662712d0, &amp;</div><div class="line">            3.412756702d0, 4.406137221d0, 4.567156645d0, 4.999550779d0, &amp;</div><div class="line">            5.652854194d0, 6.784320119d0, 8.307936836d0, 8.395126494d0, &amp;</div><div class="line">            10.30252404d0]</div><div class="line"></div><div class="line">        <span class="comment">! We&#39;ll apply a cubic polynomial model to this data:</span></div><div class="line">        <span class="comment">! y = c1 * x**3 + c2 * x**2 + c3 * x + c4</span></div><div class="line">        f = x(1) * xp**3 + x(2) * xp**2 + x(3) * xp + x(4) - yp</div><div class="line"></div><div class="line">        <span class="comment">! For reference, the data was generated by adding random errors to</span></div><div class="line">        <span class="comment">! the following polynomial: y = x**3 - 0.3 * x**2 + 1.2 * x + 0.3</span></div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">c1:   1.06476276</div><div class="line">c2:  -0.12232029</div><div class="line">c3:   0.44661345</div><div class="line">c4:   1.18661422</div><div class="line">Max Residual:   0.50636</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example 1</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using the Levenberg-Marquardt method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(least_squares_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div>
+<div class="line">    x = 1.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual:</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! System of Equations:</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! Solution:</span></div>
+<div class="line">    <span class="comment">! x = +/-5</span></div>
+<div class="line">    <span class="comment">! y = +/-3</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcn1(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div>
+<div class="line">The residual: (.000E+00, .000E+00)</div>
+</div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example 2</dt><dd><div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>, <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(least_squares_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(4), f(21) <span class="comment">! There are 4 coefficients and 21 data points</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Locate the routine containing the equations to solve</span></div>
+<div class="line">    fcn =&gt; fcns</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 21, 4)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0, 1.0d0, 1.0d0]</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c1: &quot;</span>, x(1)</div>
+<div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c2: &quot;</span>, x(2)</div>
+<div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c3: &quot;</span>, x(3)</div>
+<div class="line">    print <span class="stringliteral">&quot;(AF12.8)&quot;</span>, <span class="stringliteral">&quot;c4: &quot;</span>, x(4)</div>
+<div class="line">    print <span class="stringliteral">&quot;(AF9.5)&quot;</span>, <span class="stringliteral">&quot;Max Residual: &quot;</span>, maxval(abs(f))</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function containing the data to fit</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcns(x, f)</div>
+<div class="line">        <span class="comment">! Arguments</span></div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x  <span class="comment">! Contains the coefficients</span></div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line"> </div>
+<div class="line">        <span class="comment">! Local Variables</span></div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">dimension(21)</span> :: xp, yp</div>
+<div class="line"> </div>
+<div class="line">        <span class="comment">! Data to fit (21 data points)</span></div>
+<div class="line">        xp = [0.0d0, 0.1d0, 0.2d0, 0.3d0, 0.4d0, 0.5d0, 0.6d0, 0.7d0, 0.8d0, &amp;</div>
+<div class="line">            0.9d0, 1.0d0, 1.1d0, 1.2d0, 1.3d0, 1.4d0, 1.5d0, 1.6d0, 1.7d0, &amp;</div>
+<div class="line">            1.8d0, 1.9d0, 2.0d0]</div>
+<div class="line">        yp = [1.216737514d0, 1.250032542d0, 1.305579195d0, 1.040182335d0, &amp;</div>
+<div class="line">            1.751867738d0, 1.109716707d0, 2.018141531d0, 1.992418729d0, &amp;</div>
+<div class="line">            1.807916923d0, 2.078806005d0, 2.698801324d0, 2.644662712d0, &amp;</div>
+<div class="line">            3.412756702d0, 4.406137221d0, 4.567156645d0, 4.999550779d0, &amp;</div>
+<div class="line">            5.652854194d0, 6.784320119d0, 8.307936836d0, 8.395126494d0, &amp;</div>
+<div class="line">            10.30252404d0]</div>
+<div class="line"> </div>
+<div class="line">        <span class="comment">! We&#39;ll apply a cubic polynomial model to this data:</span></div>
+<div class="line">        <span class="comment">! y = c1 * x**3 + c2 * x**2 + c3 * x + c4</span></div>
+<div class="line">        f = x(1) * xp**3 + x(2) * xp**2 + x(3) * xp + x(4) - yp</div>
+<div class="line"> </div>
+<div class="line">        <span class="comment">! For reference, the data was generated by adding random errors to</span></div>
+<div class="line">        <span class="comment">! the following polynomial: y = x**3 - 0.3 * x**2 + 1.2 * x + 0.3</span></div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">c1:   1.06476276</div>
+<div class="line">c2:  -0.12232029</div>
+<div class="line">c3:   0.44661345</div>
+<div class="line">c4:   1.18661422</div>
+<div class="line">Max Residual:   0.50636</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li><a href="https://en.wikipedia.org/wiki/Levenberg%E2%80%93Marquardt_algorithm">Wikipedia</a></li>
 <li><a href="https://en.wikipedia.org/wiki/MINPACK">MINPACK (Wikipedia)</a> </li>
@@ -571,13 +673,18 @@ <h2 class="memtitle"><span class="permalink"><a href="#a974515039f6a26d25f774604
 </div>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="ainterfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="astructnonlin__least__squares_1_1least__squares__solver_html"><div class="ttname"><a href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></div><div class="ttdoc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00021">nonlin_least_squares.f90:21</a></div></div>
+<div class="ttc" id="anamespacenonlin__least__squares_html"><div class="ttname"><a href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="ttdoc">nonlin_least_squares</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00007">nonlin_least_squares.f90:7</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__linesearch.html b/doc/html/namespacenonlin__linesearch.html
index 5c1ee21..e594f60 100644
--- a/doc/html/namespacenonlin__linesearch.html
+++ b/doc/html/namespacenonlin__linesearch.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_linesearch Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -95,8 +95,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch ">nonlin_linesearch</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b>  
+<a href="namespacenonlin__linesearch.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
@@ -107,38 +107,38 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions/Subroutines</h2></td></tr>
 <tr class="memitem:aff56057432ad08c5ce39638da945dcfa"><td class="memItemLeft" align="right" valign="top">pure integer(int32) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa">ls_get_max_eval</a> (this)</td></tr>
-<tr class="memdesc:aff56057432ad08c5ce39638da945dcfa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single line search.  <a href="#aff56057432ad08c5ce39638da945dcfa">More...</a><br /></td></tr>
+<tr class="memdesc:aff56057432ad08c5ce39638da945dcfa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single line search.  <a href="namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa">More...</a><br /></td></tr>
 <tr class="separator:aff56057432ad08c5ce39638da945dcfa"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aeb9ded3f31ec2baad455218fa6b5e4fd"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd">ls_set_max_eval</a> (this, x)</td></tr>
-<tr class="memdesc:aeb9ded3f31ec2baad455218fa6b5e4fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single line search.  <a href="#aeb9ded3f31ec2baad455218fa6b5e4fd">More...</a><br /></td></tr>
+<tr class="memdesc:aeb9ded3f31ec2baad455218fa6b5e4fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single line search.  <a href="namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd">More...</a><br /></td></tr>
 <tr class="separator:aeb9ded3f31ec2baad455218fa6b5e4fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a767b8926182d3ee4553e2731b32b16a2"><td class="memItemLeft" align="right" valign="top">pure real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2">ls_get_scale</a> (this)</td></tr>
-<tr class="memdesc:a767b8926182d3ee4553e2731b32b16a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the scaling of the product of the gradient and direction vectors (ALPHA) such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor.  <a href="#a767b8926182d3ee4553e2731b32b16a2">More...</a><br /></td></tr>
+<tr class="memdesc:a767b8926182d3ee4553e2731b32b16a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the scaling of the product of the gradient and direction vectors (ALPHA) such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor.  <a href="namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2">More...</a><br /></td></tr>
 <tr class="separator:a767b8926182d3ee4553e2731b32b16a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afbc0daef332c32c1c93e08d5c8357a3b"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b">ls_set_scale</a> (this, x)</td></tr>
-<tr class="memdesc:afbc0daef332c32c1c93e08d5c8357a3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">sets the scaling of the product of the gradient and direction vectors (ALPHA) such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor.  <a href="#afbc0daef332c32c1c93e08d5c8357a3b">More...</a><br /></td></tr>
+<tr class="memdesc:afbc0daef332c32c1c93e08d5c8357a3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">sets the scaling of the product of the gradient and direction vectors (ALPHA) such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor.  <a href="namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b">More...</a><br /></td></tr>
 <tr class="separator:afbc0daef332c32c1c93e08d5c8357a3b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7e3e4ce001803923645008325088301d"><td class="memItemLeft" align="right" valign="top">pure real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d">ls_get_dist</a> (this)</td></tr>
-<tr class="memdesc:a7e3e4ce001803923645008325088301d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a distance factor defining the minimum distance along the search direction vector is practical.  <a href="#a7e3e4ce001803923645008325088301d">More...</a><br /></td></tr>
+<tr class="memdesc:a7e3e4ce001803923645008325088301d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a distance factor defining the minimum distance along the search direction vector is practical.  <a href="namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d">More...</a><br /></td></tr>
 <tr class="separator:a7e3e4ce001803923645008325088301d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afb6753743afaf8e5a38a765f06476c24"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24">ls_set_dist</a> (this, x)</td></tr>
-<tr class="memdesc:afb6753743afaf8e5a38a765f06476c24"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a distance factor defining the minimum distance along the search direction vector is practical.  <a href="#afb6753743afaf8e5a38a765f06476c24">More...</a><br /></td></tr>
+<tr class="memdesc:afb6753743afaf8e5a38a765f06476c24"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a distance factor defining the minimum distance along the search direction vector is practical.  <a href="namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24">More...</a><br /></td></tr>
 <tr class="separator:afb6753743afaf8e5a38a765f06476c24"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3328346c6c79d704ce268575df190dc6"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6">ls_search_mimo</a> (this, fcn, xold, grad, dir, x, fvec, fold, fx, ib, err)</td></tr>
-<tr class="memdesc:a3328346c6c79d704ce268575df190dc6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems.  <a href="#a3328346c6c79d704ce268575df190dc6">More...</a><br /></td></tr>
+<tr class="memdesc:a3328346c6c79d704ce268575df190dc6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems.  <a href="namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6">More...</a><br /></td></tr>
 <tr class="separator:a3328346c6c79d704ce268575df190dc6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afcde68c8af7940be93c7f2d13d2dabd4"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4">ls_search_miso</a> (this, fcn, xold, grad, dir, x, fold, fx, ib, err)</td></tr>
-<tr class="memdesc:afcde68c8af7940be93c7f2d13d2dabd4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems.  <a href="#afcde68c8af7940be93c7f2d13d2dabd4">More...</a><br /></td></tr>
+<tr class="memdesc:afcde68c8af7940be93c7f2d13d2dabd4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems.  <a href="namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4">More...</a><br /></td></tr>
 <tr class="separator:afcde68c8af7940be93c7f2d13d2dabd4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aed7cac361c60774ac2c49a51a99741d0"><td class="memItemLeft" align="right" valign="top">pure real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0">min_backtrack_search</a> (mode, f0, f, f1, alam, alam1, slope)</td></tr>
-<tr class="memdesc:aed7cac361c60774ac2c49a51a99741d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Minimizes either the quadratic or cubic representation for a backtracking-type line search.  <a href="#aed7cac361c60774ac2c49a51a99741d0">More...</a><br /></td></tr>
+<tr class="memdesc:aed7cac361c60774ac2c49a51a99741d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Minimizes either the quadratic or cubic representation for a backtracking-type line search.  <a href="namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0">More...</a><br /></td></tr>
 <tr class="separator:aed7cac361c60774ac2c49a51a99741d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2562dd3acca3f7f7bc2d22b7490d7b1a"><td class="memItemLeft" align="right" valign="top">subroutine, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a">limit_search_vector</a> (x, lim)</td></tr>
-<tr class="memdesc:a2562dd3acca3f7f7bc2d22b7490d7b1a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Provides a means of scaling the length of the search direction vector.  <a href="#a2562dd3acca3f7f7bc2d22b7490d7b1a">More...</a><br /></td></tr>
+<tr class="memdesc:a2562dd3acca3f7f7bc2d22b7490d7b1a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Provides a means of scaling the length of the search direction vector.  <a href="namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a">More...</a><br /></td></tr>
 <tr class="separator:a2562dd3acca3f7f7bc2d22b7490d7b1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch ">nonlin_linesearch</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide line search routines capable of minimizing nondesireable influences of the nonlinear equation solver model on the convergence of the iteration process. </dd></dl>
 </div><h2 class="groupheader">Function/Subroutine Documentation</h2>
 <a id="a2562dd3acca3f7f7bc2d22b7490d7b1a"></a>
@@ -748,7 +748,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aed7cac361c60774ac2c49a51
     <li class="navelem"><a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__optimize.html b/doc/html/namespacenonlin__optimize.html
index 3c59f7a..a88d1e1 100644
--- a/doc/html/namespacenonlin__optimize.html
+++ b/doc/html/namespacenonlin__optimize.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_optimize Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -94,8 +94,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize ">nonlin_optimize</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b>  
+<a href="namespacenonlin__optimize.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
@@ -110,7 +110,7 @@
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize ">nonlin_optimize</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide various optimization routines. </dd></dl>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
@@ -120,7 +120,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__polynomials.html b/doc/html/namespacenonlin__polynomials.html
index 9563dca..6e05442 100644
--- a/doc/html/namespacenonlin__polynomials.html
+++ b/doc/html/namespacenonlin__polynomials.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -96,12 +96,12 @@
 <div class="contents">
 
 <p><b>polynomials</b>  
-<a href="#details">More...</a></p>
+<a href="namespacenonlin__polynomials.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">assignment(=)</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines polynomial assignment.  <a href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html#details">More...</a><br /></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">assignment(=)</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines polynomial assignment.  <a href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html#details">More...</a><br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a></td></tr>
 <tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines polynomial multiplication.  <a href="interfacenonlin__polynomials_1_1operator_07_5_08.html#details">More...</a><br /></td></tr>
@@ -119,64 +119,64 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions/Subroutines</h2></td></tr>
 <tr class="memitem:a051f7aaa5a37feaf707cf0e7145c83ee"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee">init_poly</a> (this, order, err)</td></tr>
-<tr class="memdesc:a051f7aaa5a37feaf707cf0e7145c83ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the polynomial instance, and sets all coefficients to zero.  <a href="#a051f7aaa5a37feaf707cf0e7145c83ee">More...</a><br /></td></tr>
+<tr class="memdesc:a051f7aaa5a37feaf707cf0e7145c83ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the polynomial instance, and sets all coefficients to zero.  <a href="namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee">More...</a><br /></td></tr>
 <tr class="separator:a051f7aaa5a37feaf707cf0e7145c83ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3f23c7cc868232d6ebbe6b56df2762bf"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf">init_poly_coeffs</a> (this, c, err)</td></tr>
-<tr class="memdesc:a3f23c7cc868232d6ebbe6b56df2762bf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the polynomial instance.  <a href="#a3f23c7cc868232d6ebbe6b56df2762bf">More...</a><br /></td></tr>
+<tr class="memdesc:a3f23c7cc868232d6ebbe6b56df2762bf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the polynomial instance.  <a href="namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf">More...</a><br /></td></tr>
 <tr class="separator:a3f23c7cc868232d6ebbe6b56df2762bf"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a295cc8c0c018a44acbdec56b8b3360c6"><td class="memItemLeft" align="right" valign="top">pure integer(int32) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6">get_poly_order</a> (this)</td></tr>
-<tr class="memdesc:a295cc8c0c018a44acbdec56b8b3360c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the order of the polynomial object.  <a href="#a295cc8c0c018a44acbdec56b8b3360c6">More...</a><br /></td></tr>
+<tr class="memdesc:a295cc8c0c018a44acbdec56b8b3360c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the order of the polynomial object.  <a href="namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6">More...</a><br /></td></tr>
 <tr class="separator:a295cc8c0c018a44acbdec56b8b3360c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a458465372d14caa9e238d82f5ac35735"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735">poly_fit</a> (this, x, y, order, err)</td></tr>
-<tr class="memdesc:a458465372d14caa9e238d82f5ac35735"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fits a polynomial of the specified order to a data set.  <a href="#a458465372d14caa9e238d82f5ac35735">More...</a><br /></td></tr>
+<tr class="memdesc:a458465372d14caa9e238d82f5ac35735"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fits a polynomial of the specified order to a data set.  <a href="namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735">More...</a><br /></td></tr>
 <tr class="separator:a458465372d14caa9e238d82f5ac35735"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6ff33f225fe0f9c25524b0e6c7ced766"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766">poly_fit_thru_zero</a> (this, x, y, order, err)</td></tr>
-<tr class="memdesc:a6ff33f225fe0f9c25524b0e6c7ced766"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fits a polynomial of the specified order that passes through zero to a data set.  <a href="#a6ff33f225fe0f9c25524b0e6c7ced766">More...</a><br /></td></tr>
+<tr class="memdesc:a6ff33f225fe0f9c25524b0e6c7ced766"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fits a polynomial of the specified order that passes through zero to a data set.  <a href="namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766">More...</a><br /></td></tr>
 <tr class="separator:a6ff33f225fe0f9c25524b0e6c7ced766"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aff1ff0ef739be563fd2545d2382ea383"><td class="memItemLeft" align="right" valign="top">elemental real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383">poly_eval_double</a> (this, x)</td></tr>
-<tr class="memdesc:aff1ff0ef739be563fd2545d2382ea383"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates a polynomial at the specified points.  <a href="#aff1ff0ef739be563fd2545d2382ea383">More...</a><br /></td></tr>
+<tr class="memdesc:aff1ff0ef739be563fd2545d2382ea383"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates a polynomial at the specified points.  <a href="namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383">More...</a><br /></td></tr>
 <tr class="separator:aff1ff0ef739be563fd2545d2382ea383"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a761c510e90d7c7b0251ae59345286b51"><td class="memItemLeft" align="right" valign="top">elemental complex(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51">poly_eval_complex</a> (this, x)</td></tr>
-<tr class="memdesc:a761c510e90d7c7b0251ae59345286b51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates a polynomial at the specified points.  <a href="#a761c510e90d7c7b0251ae59345286b51">More...</a><br /></td></tr>
+<tr class="memdesc:a761c510e90d7c7b0251ae59345286b51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates a polynomial at the specified points.  <a href="namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51">More...</a><br /></td></tr>
 <tr class="separator:a761c510e90d7c7b0251ae59345286b51"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a73e15b4ed645b9f672085fdf0c35256a"><td class="memItemLeft" align="right" valign="top">pure real(real64) function, dimension(this%order(), this%order())&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a">poly_companion_mtx</a> (this)</td></tr>
-<tr class="memdesc:a73e15b4ed645b9f672085fdf0c35256a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the companion matrix for the polynomial.  <a href="#a73e15b4ed645b9f672085fdf0c35256a">More...</a><br /></td></tr>
+<tr class="memdesc:a73e15b4ed645b9f672085fdf0c35256a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the companion matrix for the polynomial.  <a href="namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a">More...</a><br /></td></tr>
 <tr class="separator:a73e15b4ed645b9f672085fdf0c35256a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:add5d2b923b389d1b9b829255031a3343"><td class="memItemLeft" align="right" valign="top">complex(real64) function, dimension(this%order())&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343">poly_roots</a> (this, err)</td></tr>
-<tr class="memdesc:add5d2b923b389d1b9b829255031a3343"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes all the roots of a polynomial by computing the eigenvalues of the polynomial companion matrix.  <a href="#add5d2b923b389d1b9b829255031a3343">More...</a><br /></td></tr>
+<tr class="memdesc:add5d2b923b389d1b9b829255031a3343"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes all the roots of a polynomial by computing the eigenvalues of the polynomial companion matrix.  <a href="namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343">More...</a><br /></td></tr>
 <tr class="separator:add5d2b923b389d1b9b829255031a3343"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af61d25330d66ba51fb7948fd6711ba1d"><td class="memItemLeft" align="right" valign="top">real(real64) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d">get_poly_coefficient</a> (this, ind, err)</td></tr>
-<tr class="memdesc:af61d25330d66ba51fb7948fd6711ba1d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the requested polynomial coefficient by index. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="#af61d25330d66ba51fb7948fd6711ba1d">More...</a><br /></td></tr>
+<tr class="memdesc:af61d25330d66ba51fb7948fd6711ba1d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the requested polynomial coefficient by index. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d">More...</a><br /></td></tr>
 <tr class="separator:af61d25330d66ba51fb7948fd6711ba1d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a9b5c03459cc352c480ba3edfb3d05af3"><td class="memItemLeft" align="right" valign="top">pure real(real64) function, dimension(this%order()+1)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3">get_poly_coefficients</a> (this)</td></tr>
-<tr class="memdesc:a9b5c03459cc352c480ba3edfb3d05af3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets an array containing all the coefficients of the polynomial. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="#a9b5c03459cc352c480ba3edfb3d05af3">More...</a><br /></td></tr>
+<tr class="memdesc:a9b5c03459cc352c480ba3edfb3d05af3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets an array containing all the coefficients of the polynomial. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3">More...</a><br /></td></tr>
 <tr class="separator:a9b5c03459cc352c480ba3edfb3d05af3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acda7d27069a05f6a62823265f557f8e0"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0">set_poly_coefficient</a> (this, ind, c, err)</td></tr>
-<tr class="memdesc:acda7d27069a05f6a62823265f557f8e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the requested polynomial coefficient by index. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="#acda7d27069a05f6a62823265f557f8e0">More...</a><br /></td></tr>
+<tr class="memdesc:acda7d27069a05f6a62823265f557f8e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the requested polynomial coefficient by index. The coefficient index is established as follows: c(1) + c(2) * x + c(3) * x**2 + ... c(n) * x**n-1.  <a href="namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0">More...</a><br /></td></tr>
 <tr class="separator:acda7d27069a05f6a62823265f557f8e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a13912dc946f15c21fb662e2a6c228e82"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82">poly_equals</a> (x, y)</td></tr>
-<tr class="memdesc:a13912dc946f15c21fb662e2a6c228e82"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of one polynomial to another.  <a href="#a13912dc946f15c21fb662e2a6c228e82">More...</a><br /></td></tr>
+<tr class="memdesc:a13912dc946f15c21fb662e2a6c228e82"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of one polynomial to another.  <a href="namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82">More...</a><br /></td></tr>
 <tr class="separator:a13912dc946f15c21fb662e2a6c228e82"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a966529b4b45ad23dae7fe3b7e842ca08"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08">poly_dbl_equals</a> (x, y)</td></tr>
-<tr class="memdesc:a966529b4b45ad23dae7fe3b7e842ca08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns a number to each coefficient of the polynomial.  <a href="#a966529b4b45ad23dae7fe3b7e842ca08">More...</a><br /></td></tr>
+<tr class="memdesc:a966529b4b45ad23dae7fe3b7e842ca08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns a number to each coefficient of the polynomial.  <a href="namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08">More...</a><br /></td></tr>
 <tr class="separator:a966529b4b45ad23dae7fe3b7e842ca08"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad08d067c81615b63371e7aa5af22c949"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949">poly_equals_array</a> (x, y)</td></tr>
-<tr class="memdesc:ad08d067c81615b63371e7aa5af22c949"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of an array as polynomial coefficients.  <a href="#ad08d067c81615b63371e7aa5af22c949">More...</a><br /></td></tr>
+<tr class="memdesc:ad08d067c81615b63371e7aa5af22c949"><td class="mdescLeft">&#160;</td><td class="mdescRight">Assigns the contents of an array as polynomial coefficients.  <a href="namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949">More...</a><br /></td></tr>
 <tr class="separator:ad08d067c81615b63371e7aa5af22c949"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae59f978dca8ab539ab458210e4a3fda2"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2">poly_poly_add</a> (x, y)</td></tr>
-<tr class="memdesc:ae59f978dca8ab539ab458210e4a3fda2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two polynomials.  <a href="#ae59f978dca8ab539ab458210e4a3fda2">More...</a><br /></td></tr>
+<tr class="memdesc:ae59f978dca8ab539ab458210e4a3fda2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two polynomials.  <a href="namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2">More...</a><br /></td></tr>
 <tr class="separator:ae59f978dca8ab539ab458210e4a3fda2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa7025bd3c2e6572fa6d5e1226c3b23cf"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf">poly_poly_subtract</a> (x, y)</td></tr>
-<tr class="memdesc:aa7025bd3c2e6572fa6d5e1226c3b23cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Subtracts two polynomials.  <a href="#aa7025bd3c2e6572fa6d5e1226c3b23cf">More...</a><br /></td></tr>
+<tr class="memdesc:aa7025bd3c2e6572fa6d5e1226c3b23cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Subtracts two polynomials.  <a href="namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf">More...</a><br /></td></tr>
 <tr class="separator:aa7025bd3c2e6572fa6d5e1226c3b23cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4d5545f5e93658bc08e011ac13f4ad60"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60">poly_poly_mult</a> (x, y)</td></tr>
-<tr class="memdesc:a4d5545f5e93658bc08e011ac13f4ad60"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies two polynomials.  <a href="#a4d5545f5e93658bc08e011ac13f4ad60">More...</a><br /></td></tr>
+<tr class="memdesc:a4d5545f5e93658bc08e011ac13f4ad60"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies two polynomials.  <a href="namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60">More...</a><br /></td></tr>
 <tr class="separator:a4d5545f5e93658bc08e011ac13f4ad60"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a96288e9730f24e65c61d3ac0970000b2"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2">poly_dbl_mult</a> (x, y)</td></tr>
-<tr class="memdesc:a96288e9730f24e65c61d3ac0970000b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="#a96288e9730f24e65c61d3ac0970000b2">More...</a><br /></td></tr>
+<tr class="memdesc:a96288e9730f24e65c61d3ac0970000b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2">More...</a><br /></td></tr>
 <tr class="separator:a96288e9730f24e65c61d3ac0970000b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae8c0ac75d5ebeb66d6c0cf339a22be2c"><td class="memItemLeft" align="right" valign="top">type(<a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">dbl_poly_mult</a> (x, y)</td></tr>
-<tr class="memdesc:ae8c0ac75d5ebeb66d6c0cf339a22be2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="#ae8c0ac75d5ebeb66d6c0cf339a22be2c">More...</a><br /></td></tr>
+<tr class="memdesc:ae8c0ac75d5ebeb66d6c0cf339a22be2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Multiplies a polynomial by a scalar value.  <a href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">More...</a><br /></td></tr>
 <tr class="separator:ae8c0ac75d5ebeb66d6c0cf339a22be2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -874,7 +874,51 @@ <h2 class="memtitle"><span class="permalink"><a href="#a458465372d14caa9e238d82f
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Usage</dt><dd>The following code provides an example of how to fit a polynomial to a set of data. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : dp, i32</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(21)</span> :: xp, yp, yf, yc, err</div><div class="line">    <span class="keywordtype">real(real64)</span> :: res</div><div class="line">    <span class="keywordtype">type</span>(polynomial) :: p</div><div class="line"></div><div class="line">    <span class="comment">! Data to fit</span></div><div class="line">    xp = [0.0d0, 0.1d0, 0.2d0, 0.3d0, 0.4d0, 0.5d0, 0.6d0, 0.7d0, 0.8d0, &amp;</div><div class="line">        0.9d0, 1.0d0, 1.1d0, 1.2d0, 1.3d0, 1.4d0, 1.5d0, 1.6d0, 1.7d0, &amp;</div><div class="line">        1.8d0, 1.9d0, 2.0d0]</div><div class="line">    yp = [1.216737514d0, 1.250032542d0, 1.305579195d0, 1.040182335d0, &amp;</div><div class="line">        1.751867738d0, 1.109716707d0, 2.018141531d0, 1.992418729d0, &amp;</div><div class="line">        1.807916923d0, 2.078806005d0, 2.698801324d0, 2.644662712d0, &amp;</div><div class="line">        3.412756702d0, 4.406137221d0, 4.567156645d0, 4.999550779d0, &amp;</div><div class="line">        5.652854194d0, 6.784320119d0, 8.307936836d0, 8.395126494d0, &amp;</div><div class="line">        10.30252404d0]</div><div class="line"></div><div class="line">    <span class="comment">! Create a copy of yp as it will be overwritten in the fit command</span></div><div class="line">    yc = yp</div><div class="line"></div><div class="line">    <span class="comment">! Fit the polynomial</span></div><div class="line">    <span class="keyword">call </span>p%fit(xp, yp, 3)</div><div class="line"></div><div class="line">    <span class="comment">! Evaluate the polynomial at xp, and then determine the residual</span></div><div class="line">    yf = p%evaluate(xp)</div><div class="line">    err = abs(yf - yc)</div><div class="line">    res = maxval(err)</div><div class="line"></div><div class="line">    <span class="comment">! Print out the coefficients</span></div><div class="line">     print <span class="stringliteral">&#39;(A)&#39;</span>, <span class="stringliteral">&quot;Polynomial Coefficients (c0 + c1*x + c2*x**2 + c3*x**3):&quot;</span></div><div class="line">     <span class="keywordflow">do</span> i = 1, 4</div><div class="line">         print <span class="stringliteral">&#39;(AI0AF12.9)&#39;</span>, <span class="stringliteral">&quot;c&quot;</span>, i - 1, <span class="stringliteral">&quot; = &quot;</span>, p%get(i)</div><div class="line"><span class="keywordflow">     end do</span></div><div class="line">     print <span class="stringliteral">&#39;(AE9.4)&#39;</span>, <span class="stringliteral">&quot;Residual: &quot;</span>, res</div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">Polynomial Coefficients (c0 + c1*x + c2*x**2 + c3*x**3):</div><div class="line">c0 =  1.186614186</div><div class="line">c1 =  0.446613631</div><div class="line">c2 = -0.122320499</div><div class="line">c3 =  1.064762822</div><div class="line">Residual: .5064E+00</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Usage</dt><dd>The following code provides an example of how to fit a polynomial to a set of data. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : dp, i32</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line"><span class="keywordtype">    real</span>(real64), <span class="keywordtype">dimension(21)</span> :: xp, yp, yf, yc, err</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: res</div>
+<div class="line">    <span class="keywordtype">type</span>(polynomial) :: p</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Data to fit</span></div>
+<div class="line">    xp = [0.0d0, 0.1d0, 0.2d0, 0.3d0, 0.4d0, 0.5d0, 0.6d0, 0.7d0, 0.8d0, &amp;</div>
+<div class="line">        0.9d0, 1.0d0, 1.1d0, 1.2d0, 1.3d0, 1.4d0, 1.5d0, 1.6d0, 1.7d0, &amp;</div>
+<div class="line">        1.8d0, 1.9d0, 2.0d0]</div>
+<div class="line">    yp = [1.216737514d0, 1.250032542d0, 1.305579195d0, 1.040182335d0, &amp;</div>
+<div class="line">        1.751867738d0, 1.109716707d0, 2.018141531d0, 1.992418729d0, &amp;</div>
+<div class="line">        1.807916923d0, 2.078806005d0, 2.698801324d0, 2.644662712d0, &amp;</div>
+<div class="line">        3.412756702d0, 4.406137221d0, 4.567156645d0, 4.999550779d0, &amp;</div>
+<div class="line">        5.652854194d0, 6.784320119d0, 8.307936836d0, 8.395126494d0, &amp;</div>
+<div class="line">        10.30252404d0]</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Create a copy of yp as it will be overwritten in the fit command</span></div>
+<div class="line">    yc = yp</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Fit the polynomial</span></div>
+<div class="line">    <span class="keyword">call </span>p%fit(xp, yp, 3)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Evaluate the polynomial at xp, and then determine the residual</span></div>
+<div class="line">    yf = p%evaluate(xp)</div>
+<div class="line">    err = abs(yf - yc)</div>
+<div class="line">    res = maxval(err)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print out the coefficients</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(A)&#39;</span>, <span class="stringliteral">&quot;Polynomial Coefficients (c0 + c1*x + c2*x**2 + c3*x**3):&quot;</span></div>
+<div class="line">     <span class="keywordflow">do</span> i = 1, 4</div>
+<div class="line">         print <span class="stringliteral">&#39;(AI0AF12.9)&#39;</span>, <span class="stringliteral">&quot;c&quot;</span>, i - 1, <span class="stringliteral">&quot; = &quot;</span>, p%get(i)</div>
+<div class="line"><span class="keywordflow">     end do</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(AE9.4)&#39;</span>, <span class="stringliteral">&quot;Residual: &quot;</span>, res</div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">Polynomial Coefficients (c0 + c1*x + c2*x**2 + c3*x**3):</div>
+<div class="line">c0 =  1.186614186</div>
+<div class="line">c1 =  0.446613631</div>
+<div class="line">c2 = -0.122320499</div>
+<div class="line">c3 =  1.064762822</div>
+<div class="line">Residual: .5064E+00</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__polynomials_8f90_source.html#l00285">285</a> of file <a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a>.</p>
 
@@ -1143,7 +1187,47 @@ <h2 class="memtitle"><span class="permalink"><a href="#add5d2b923b389d1b9b829255
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Usage</dt><dd>The following code provides an example of how to compute the roots of a polynomial. This examples uses a tenth order polynomial; however, this process is applicable to any order. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : dp, i32</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="line"></div><div class="line">    <span class="comment">! Parameters</span></div><div class="line">    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: order = 10</div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">integer(int32)</span> :: i</div><div class="line">    <span class="keywordtype">type</span>(polynomial) :: p</div><div class="line">    <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(order+1)</span> :: coeff</div><div class="line">    <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: rts, sol</div><div class="line"></div><div class="line">    <span class="comment">! Define the polynomial</span></div><div class="line">    <span class="keyword">call </span>random_number(coeff)</div><div class="line">    <span class="keyword">call </span>p%initialize(order)</div><div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(coeff)</div><div class="line">        <span class="keyword">call </span>p%set(i, coeff(i))</div><div class="line"><span class="keywordflow">    end do</span></div><div class="line"></div><div class="line">    <span class="comment">! Compute the roots via the polynomial routine</span></div><div class="line">    rts = p%roots()</div><div class="line"></div><div class="line">    <span class="comment">! Compute the value of the polynomial at each root and ensure it</span></div><div class="line">    <span class="comment">! is sufficiently close to zero.</span></div><div class="line">    sol = p%evaluate(rts)</div><div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(sol)</div><div class="line">        print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;(&quot;</span>, <span class="keywordtype">real(sol(i))</span>, <span class="stringliteral">&quot;, &quot;</span>, aimag(sol(i)), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keywordflow">    end do</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">(-.466E-14, -.161E-14)</div><div class="line">(-.466E-14, 0.161E-14)</div><div class="line">(-.999E-15, 0.211E-14)</div><div class="line">(-.999E-15, -.211E-14)</div><div class="line">(0.444E-15, 0.108E-14)</div><div class="line">(0.444E-15, -.108E-14)</div><div class="line">(-.144E-14, -.433E-14)</div><div class="line">(-.144E-14, 0.433E-14)</div><div class="line">(0.644E-14, -.100E-13)</div><div class="line">(0.644E-14, 0.100E-13)</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Usage</dt><dd>The following code provides an example of how to compute the roots of a polynomial. This examples uses a tenth order polynomial; however, this process is applicable to any order. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : dp, i32</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Parameters</span></div>
+<div class="line">    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: order = 10</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">integer(int32)</span> :: i</div>
+<div class="line">    <span class="keywordtype">type</span>(polynomial) :: p</div>
+<div class="line"><span class="keywordtype">    real</span>(real64), <span class="keywordtype">dimension(order+1)</span> :: coeff</div>
+<div class="line">    <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: rts, sol</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the polynomial</span></div>
+<div class="line">    <span class="keyword">call </span>random_number(coeff)</div>
+<div class="line">    <span class="keyword">call </span>p%initialize(order)</div>
+<div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(coeff)</div>
+<div class="line">        <span class="keyword">call </span>p%set(i, coeff(i))</div>
+<div class="line"><span class="keywordflow">    end do</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Compute the roots via the polynomial routine</span></div>
+<div class="line">    rts = p%roots()</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Compute the value of the polynomial at each root and ensure it</span></div>
+<div class="line">    <span class="comment">! is sufficiently close to zero.</span></div>
+<div class="line">    sol = p%evaluate(rts)</div>
+<div class="line">    <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(sol)</div>
+<div class="line">        print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;(&quot;</span>, real(sol(i)), <span class="stringliteral">&quot;, &quot;</span>, aimag(sol(i)), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keywordflow">    end do</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">(-.466E-14, -.161E-14)</div>
+<div class="line">(-.466E-14, 0.161E-14)</div>
+<div class="line">(-.999E-15, 0.211E-14)</div>
+<div class="line">(-.999E-15, -.211E-14)</div>
+<div class="line">(0.444E-15, 0.108E-14)</div>
+<div class="line">(0.444E-15, -.108E-14)</div>
+<div class="line">(-.144E-14, -.433E-14)</div>
+<div class="line">(-.144E-14, 0.433E-14)</div>
+<div class="line">(0.644E-14, -.100E-13)</div>
+<div class="line">(0.644E-14, 0.100E-13)</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__polynomials_8f90_source.html#l00615">615</a> of file <a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a>.</p>
 
@@ -1215,13 +1299,14 @@ <h2 class="memtitle"><span class="permalink"><a href="#acda7d27069a05f6a62823265
 </div>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__polynomials_html"><div class="ttname"><a href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="ttdoc">polynomials</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00013">nonlin_polynomials.f90:13</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespacenonlin__polynomials.js b/doc/html/namespacenonlin__polynomials.js
index 3cbdfc6..33f9356 100644
--- a/doc/html/namespacenonlin__polynomials.js
+++ b/doc/html/namespacenonlin__polynomials.js
@@ -1,6 +1,6 @@
 var namespacenonlin__polynomials =
 [
-    [ "assignment(=)", "interfacenonlin__polynomials_1_1assignment_07_0A_08.html", "interfacenonlin__polynomials_1_1assignment_07_0A_08" ],
+    [ "assignment(=)", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html", "interfacenonlin__polynomials_1_1assignment_07_0a_08" ],
     [ "operator(*)", "interfacenonlin__polynomials_1_1operator_07_5_08.html", "interfacenonlin__polynomials_1_1operator_07_5_08" ],
     [ "operator(+)", "interfacenonlin__polynomials_1_1operator_07_09_08.html", "interfacenonlin__polynomials_1_1operator_07_09_08" ],
     [ "operator(-)", "interfacenonlin__polynomials_1_1operator_07-_08.html", "interfacenonlin__polynomials_1_1operator_07-_08" ],
diff --git a/doc/html/namespacenonlin__solve.html b/doc/html/namespacenonlin__solve.html
index 2b6b839..f406b9a 100644
--- a/doc/html/namespacenonlin__solve.html
+++ b/doc/html/namespacenonlin__solve.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve Module Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -95,8 +95,8 @@
 </div><!--header-->
 <div class="contents">
 
-<p><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve ">nonlin_solve</a></b>  
-<a href="#details">More...</a></p>
+<p><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b>  
+<a href="namespacenonlin__solve.html#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Data Types</h2></td></tr>
@@ -119,11 +119,11 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions/Subroutines</h2></td></tr>
 <tr class="memitem:a7f189a8566c3ad7dcdecebe7d3f17456"><td class="memItemLeft" align="right" valign="top">subroutine, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456">test_convergence</a> (x, xo, f, g, lg, xtol, ftol, gtol, c, cx, cf, cg, xnorm, fnorm)</td></tr>
-<tr class="memdesc:a7f189a8566c3ad7dcdecebe7d3f17456"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests for convergence.  <a href="#a7f189a8566c3ad7dcdecebe7d3f17456">More...</a><br /></td></tr>
+<tr class="memdesc:a7f189a8566c3ad7dcdecebe7d3f17456"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests for convergence.  <a href="namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456">More...</a><br /></td></tr>
 <tr class="separator:a7f189a8566c3ad7dcdecebe7d3f17456"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve ">nonlin_solve</a></b> </p>
+<div class="textblock"><p><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b> </p>
 <dl class="section user"><dt>Purpose</dt><dd>To provide various routines capapble of solving systems of nonlinear equations. </dd></dl>
 </div><h2 class="groupheader">Function/Subroutine Documentation</h2>
 <a id="a7f189a8566c3ad7dcdecebe7d3f17456"></a>
@@ -257,7 +257,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7f189a8566c3ad7dcdecebe7
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespaces.html b/doc/html/namespaces.html
index 7f5e0e1..3021d94 100644
--- a/doc/html/namespaces.html
+++ b/doc/html/namespaces.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Modules List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -93,13 +93,14 @@
 <div class="contents">
 <div class="textblock">Here is a list of all documented modules with brief descriptions:</div><div class="directory">
 <table class="directory">
-<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__constants.html" target="_self">nonlin_constants</a></td><td class="desc"><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants ">nonlin_constants</a></b> </td></tr>
-<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core ">nonlin_core</a></b> </td></tr>
-<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares ">nonlin_least_squares</a></b> </td></tr>
-<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch ">nonlin_linesearch</a></b> </td></tr>
-<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize ">nonlin_optimize</a></b> </td></tr>
-<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__polynomials.html" target="_self">nonlin_polynomials</a></td><td class="desc"><b>polynomials</b> </td></tr>
-<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve ">nonlin_solve</a></b> </td></tr>
+<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__c__api.html" target="_self">nonlin_c_api</a></td><td class="desc">Defines a C-friendly API to the NONLIN library </td></tr>
+<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__constants.html" target="_self">nonlin_constants</a></td><td class="desc"><b><a class="el" href="namespacenonlin__constants.html" title="nonlin_constants">nonlin_constants</a></b> </td></tr>
+<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b> </td></tr>
+<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b> </td></tr>
+<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b> </td></tr>
+<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b> </td></tr>
+<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__polynomials.html" target="_self">nonlin_polynomials</a></td><td class="desc"><b>polynomials</b> </td></tr>
+<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b> </td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
@@ -109,7 +110,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/namespaces_dup.js b/doc/html/namespaces_dup.js
index 76be054..ce9af21 100644
--- a/doc/html/namespaces_dup.js
+++ b/doc/html/namespaces_dup.js
@@ -1,5 +1,6 @@
 var namespaces_dup =
 [
+    [ "nonlin_c_api", "namespacenonlin__c__api.html", null ],
     [ "nonlin_constants", "namespacenonlin__constants.html", null ],
     [ "nonlin_core", "namespacenonlin__core.html", null ],
     [ "nonlin_least_squares", "namespacenonlin__least__squares.html", null ],
diff --git a/doc/html/navtree.css b/doc/html/navtree.css
index 0cc7e77..33341a6 100644
--- a/doc/html/navtree.css
+++ b/doc/html/navtree.css
@@ -96,7 +96,7 @@
 .ui-resizable-e {
   background-image:url("splitbar.png");
   background-size:100%;
-  background-repeat:no-repeat;
+  background-repeat:repeat-y;
   background-attachment: scroll;
   cursor:ew-resize;
   height:100%;
diff --git a/doc/html/navtree.js b/doc/html/navtree.js
index e310bc9..edc31ef 100644
--- a/doc/html/navtree.js
+++ b/doc/html/navtree.js
@@ -2,12 +2,11 @@
  @licstart  The following is the entire license notice for the
  JavaScript code in this file.
 
- Copyright (C) 1997-2017 by Dimitri van Heesch
+ Copyright (C) 1997-2019 by Dimitri van Heesch
 
  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 2 of the License, or
- (at your option) any later version.
+ it under the terms of version 2 of the GNU General Public License as 
+ published by the Free Software Foundation.
 
  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -23,7 +22,7 @@
  */
 var navTreeSubIndices = new Array();
 var arrowDown = '&#9660;';
-var arrowRight = '&#9654;';
+var arrowRight = '&#9658;';
 
 function getData(varName)
 {
@@ -70,7 +69,6 @@ function localStorageSupported()
   }
 }
 
-
 function storeLink(link)
 {
   if (!$("#nav-sync").hasClass('sync') && localStorageSupported()) {
@@ -102,14 +100,6 @@ function getScript(scriptName,func,show)
   script.type = 'text/javascript';
   script.onload = func;
   script.src = scriptName+'.js';
-  if ($.browser.msie && $.browser.version<=8) {
-    // script.onload does not work with older versions of IE
-    script.onreadystatechange = function() {
-      if (script.readyState=='complete' || script.readyState=='loaded') {
-        func(); if (show) showRoot();
-      }
-    }
-  }
   head.appendChild(script);
 }
 
@@ -153,6 +143,7 @@ function gotoAnchor(anchor,aname,updateLocation)
   var pos, docContent = $('#doc-content');
   var ancParent = $(anchor.parent());
   if (ancParent.hasClass('memItemLeft') ||
+      ancParent.hasClass('memtitle') ||
       ancParent.hasClass('fieldname') ||
       ancParent.hasClass('fieldtype') ||
       ancParent.is(':header'))
@@ -265,7 +256,7 @@ function showRoot()
   (function (){ // retry until we can scroll to the selected item
     try {
       var navtree=$('#nav-tree');
-      navtree.scrollTo('#selected',0,{offset:-windowHeight/2});
+      navtree.scrollTo('#selected',100,{offset:-windowHeight/2});
     } catch (err) {
       setTimeout(arguments.callee, 0);
     }
@@ -284,12 +275,8 @@ function expandNode(o, node, imm, showRoot)
     } else {
       if (!node.childrenVisited) {
         getNode(o, node);
-      } if (imm || ($.browser.msie && $.browser.version>8)) {
-        // somehow slideDown jumps to the start of tree for IE9 :-(
-        $(node.getChildrenUL()).show();
-      } else {
-        $(node.getChildrenUL()).slideDown("fast");
       }
+      $(node.getChildrenUL()).slideDown("fast");
       node.plus_img.innerHTML = arrowDown;
       node.expanded = true;
     }
@@ -319,7 +306,6 @@ function highlightAnchor()
   } else {
     glowEffect(anchor.next(),1000); // normal member
   }
-  gotoAnchor(anchor,aname,false);
 }
 
 function selectAndHighlight(hash,n)
@@ -481,6 +467,18 @@ function toggleSyncButton(relpath)
   }
 }
 
+var loadTriggered = false;
+var readyTriggered = false;
+var loadObject,loadToRoot,loadUrl,loadRelPath;
+
+$(window).on('load',function(){
+  if (readyTriggered) { // ready first
+    navTo(loadObject,loadToRoot,loadUrl,loadRelPath);
+    showRoot();
+  }
+  loadTriggered=true;
+});
+
 function initNavTree(toroot,relpath)
 {
   var o = new Object();
@@ -511,10 +509,16 @@ function initNavTree(toroot,relpath)
     navSync.click(function(){ toggleSyncButton(relpath); });
   }
 
-  $(window).load(function(){
+  if (loadTriggered) { // load before ready
     navTo(o,toroot,hashUrl(),relpath);
     showRoot();
-  });
+  } else { // ready before load
+    loadObject  = o;
+    loadToRoot  = toroot;
+    loadUrl     = hashUrl();
+    loadRelPath = relpath;
+    readyTriggered=true;
+  }
 
   $(window).bind('hashchange', function(){
      if (window.location.hash && window.location.hash.length>1){
diff --git a/doc/html/navtreedata.js b/doc/html/navtreedata.js
index 913e449..a0888e0 100644
--- a/doc/html/navtreedata.js
+++ b/doc/html/navtreedata.js
@@ -1,18 +1,17 @@
 /*
-@ @licstart  The following is the entire license notice for the
+@licstart  The following is the entire license notice for the
 JavaScript code in this file.
 
-Copyright (C) 1997-2017 by Dimitri van Heesch
+Copyright (C) 1997-2019 by Dimitri van Heesch
 
 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 2 of the License, or
-(at your option) any later version.
+it under the terms of version 2 of the GNU General Public License as published by
+the Free Software Foundation
 
 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.
+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, write to the Free Software Foundation, Inc.,
diff --git a/doc/html/navtreeindex0.js b/doc/html/navtreeindex0.js
index 6286367..c475422 100644
--- a/doc/html/navtreeindex0.js
+++ b/doc/html/navtreeindex0.js
@@ -26,10 +26,10 @@ var NAVTREEINDEX0 =
 "interfacenonlin__core_1_1nonlin__solver__1var.html#a0dd1911d755446057df7966f2d91e3b6":[2,0,0,12,0],
 "interfacenonlin__core_1_1vecfcn.html":[2,0,0,14],
 "interfacenonlin__core_1_1vecfcn.html#a1623a83da00b1738453145568962f9ee":[2,0,0,14,0],
-"interfacenonlin__polynomials_1_1assignment_07_0A_08.html":[2,0,4,0],
-"interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7":[2,0,4,0,1],
-"interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0":[2,0,4,0,2],
-"interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7":[2,0,4,0,0],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html":[2,0,4,0],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7":[2,0,4,0,1],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0":[2,0,4,0,2],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7":[2,0,4,0,0],
 "interfacenonlin__polynomials_1_1operator_07-_08.html":[2,0,4,3],
 "interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3":[2,0,4,3,0],
 "interfacenonlin__polynomials_1_1operator_07_09_08.html":[2,0,4,2],
@@ -41,41 +41,43 @@ var NAVTREEINDEX0 =
 "namespacemembers.html":[1,1,0],
 "namespacemembers_func.html":[1,1,1],
 "namespacemembers_vars.html":[1,1,2],
-"namespacenonlin__constants.html":[1,0,0],
+"namespacenonlin__c__api.html":[1,0,0],
+"namespacenonlin__constants.html":[1,0,1],
 "namespacenonlin__core.html":[2,0,0],
-"namespacenonlin__core.html":[1,0,1],
-"namespacenonlin__least__squares.html":[1,0,2],
+"namespacenonlin__core.html":[1,0,2],
+"namespacenonlin__least__squares.html":[1,0,3],
 "namespacenonlin__least__squares.html":[2,0,1],
-"namespacenonlin__linesearch.html":[1,0,3],
 "namespacenonlin__linesearch.html":[2,0,2],
+"namespacenonlin__linesearch.html":[1,0,4],
 "namespacenonlin__optimize.html":[2,0,3],
-"namespacenonlin__optimize.html":[1,0,4],
+"namespacenonlin__optimize.html":[1,0,5],
 "namespacenonlin__polynomials.html":[2,0,4],
-"namespacenonlin__polynomials.html":[1,0,5],
-"namespacenonlin__solve.html":[1,0,6],
+"namespacenonlin__polynomials.html":[1,0,6],
 "namespacenonlin__solve.html":[2,0,5],
+"namespacenonlin__solve.html":[1,0,7],
 "namespaces.html":[1,0],
-"nonlin__constants_8f90_source.html":[3,0,0,0],
-"nonlin__core_8f90_source.html":[3,0,0,1],
-"nonlin__equation__optimizer_8f90_source.html":[3,0,0,2],
-"nonlin__equation__solver_8f90_source.html":[3,0,0,3],
-"nonlin__equation__solver__1var_8f90_source.html":[3,0,0,4],
-"nonlin__fcn1var__helper_8f90_source.html":[3,0,0,5],
-"nonlin__fcnnvar__helper_8f90_source.html":[3,0,0,6],
-"nonlin__least__squares_8f90_source.html":[3,0,0,7],
-"nonlin__linesearch_8f90_source.html":[3,0,0,8],
-"nonlin__optimize_8f90_source.html":[3,0,0,9],
-"nonlin__optimize__bfgs_8f90_source.html":[3,0,0,10],
-"nonlin__optimize__line__search_8f90_source.html":[3,0,0,11],
-"nonlin__optimize__nelder__mead_8f90_source.html":[3,0,0,12],
-"nonlin__polynomials_8f90_source.html":[3,0,0,13],
-"nonlin__solve_8f90_source.html":[3,0,0,14],
-"nonlin__solve__brent_8f90_source.html":[3,0,0,15],
-"nonlin__solve__line__search_8f90_source.html":[3,0,0,16],
-"nonlin__solve__newton1var_8f90_source.html":[3,0,0,18],
-"nonlin__solve__newton_8f90_source.html":[3,0,0,17],
-"nonlin__solve__quasi__newton_8f90_source.html":[3,0,0,19],
-"nonlin__vecfcn__helper_8f90_source.html":[3,0,0,20],
+"nonlin__c__api_8f90_source.html":[3,0,0,0],
+"nonlin__constants_8f90_source.html":[3,0,0,1],
+"nonlin__core_8f90_source.html":[3,0,0,2],
+"nonlin__equation__optimizer_8f90_source.html":[3,0,0,3],
+"nonlin__equation__solver_8f90_source.html":[3,0,0,4],
+"nonlin__equation__solver__1var_8f90_source.html":[3,0,0,5],
+"nonlin__fcn1var__helper_8f90_source.html":[3,0,0,6],
+"nonlin__fcnnvar__helper_8f90_source.html":[3,0,0,7],
+"nonlin__least__squares_8f90_source.html":[3,0,0,8],
+"nonlin__linesearch_8f90_source.html":[3,0,0,9],
+"nonlin__optimize_8f90_source.html":[3,0,0,10],
+"nonlin__optimize__bfgs_8f90_source.html":[3,0,0,11],
+"nonlin__optimize__line__search_8f90_source.html":[3,0,0,12],
+"nonlin__optimize__nelder__mead_8f90_source.html":[3,0,0,13],
+"nonlin__polynomials_8f90_source.html":[3,0,0,14],
+"nonlin__solve_8f90_source.html":[3,0,0,15],
+"nonlin__solve__brent_8f90_source.html":[3,0,0,16],
+"nonlin__solve__line__search_8f90_source.html":[3,0,0,17],
+"nonlin__solve__newton1var_8f90_source.html":[3,0,0,19],
+"nonlin__solve__newton_8f90_source.html":[3,0,0,18],
+"nonlin__solve__quasi__newton_8f90_source.html":[3,0,0,20],
+"nonlin__vecfcn__helper_8f90_source.html":[3,0,0,21],
 "pages.html":[],
 "structnonlin__core_1_1equation__optimizer.html":[2,0,0,0],
 "structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917":[2,0,0,0,6],
diff --git a/doc/html/nonlin__c__api_8f90_source.html b/doc/html/nonlin__c__api_8f90_source.html
new file mode 100644
index 0000000..66f0dcd
--- /dev/null
+++ b/doc/html/nonlin__c__api_8f90_source.html
@@ -0,0 +1,122 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_c_api.f90 Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('nonlin__c__api_8f90_source.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api.f90</div>  </div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_c_api.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00004"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html">    4</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__c__api.html">nonlin_c_api</a></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;    <span class="keywordtype">use </span>iso_c_binding</div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keyword">end module</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__c__api_html"><div class="ttname"><a href="namespacenonlin__c__api.html">nonlin_c_api</a></div><div class="ttdoc">Defines a C-friendly API to the NONLIN library.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00004">nonlin_c_api.f90:4</a></div></div>
+<div class="ttc" id="anamespacenonlin__least__squares_html"><div class="ttname"><a href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="ttdoc">nonlin_least_squares</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00007">nonlin_least_squares.f90:7</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_c_api.f90</b></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/nonlin__constants_8f90_source.html b/doc/html/nonlin__constants_8f90_source.html
index 0164993..05ea21d 100644
--- a/doc/html/nonlin__constants_8f90_source.html
+++ b/doc/html/nonlin__constants_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_constants.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_constants.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,36 @@
 <div class="title">nonlin_constants.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_constants.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html">    7</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span>linalg_constants</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ERROR FLAGS</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00016"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d">   16</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_input_error = 201</div><div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a">   18</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_array_size_error = 202</div><div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">   20</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_out_of_memory_error = la_out_of_memory_error</div><div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">   22</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_operation_error = &amp;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        la_invalid_operation_error</div><div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5">   25</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_convergence_error = la_convergence_error</div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0">   27</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_divergent_behavior_error = 206</div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4">   29</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_spurious_convergence_error = 207</div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0">   32</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_tolerance_too_small_error = 208</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_constants.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html">    7</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span>linalg_constants</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160; </div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ERROR FLAGS</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d">   16</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_input_error = 201</div>
+<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a">   18</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_array_size_error = 202</div>
+<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">   20</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_out_of_memory_error = la_out_of_memory_error</div>
+<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">   22</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_operation_error = &amp;</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        la_invalid_operation_error</div>
+<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5">   25</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_convergence_error = la_convergence_error</div>
+<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0">   27</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_divergent_behavior_error = 206</div>
+<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4">   29</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_spurious_convergence_error = 207</div>
+<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0">   32</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_tolerance_too_small_error = 208</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_constants.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__core_8f90_source.html b/doc/html/nonlin__core_8f90_source.html
index 2600454..16f2c82 100644
--- a/doc/html/nonlin__core_8f90_source.html
+++ b/doc/html/nonlin__core_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_core.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_core.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,33 +91,581 @@
 <div class="title">nonlin_core.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_core.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="namespacenonlin__core.html">  167</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64, int32</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordtype">private</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a></div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a></div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a></div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a></div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a></div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;    <span class="keywordtype">public</span> :: print_status</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment">! INTERFACES</span></div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;</div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1fcn1var.html">  198</a></span>&#160;<span class="keyword">        function </span><a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>(x) <span class="keyword">result</span>(f)</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;            <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;</div><div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1vecfcn.html">  209</a></span>&#160;<span class="keyword">        subroutine </span><a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>(x, f)</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1jacobianfcn.html">  220</a></span>&#160;<span class="keyword">        subroutine </span><a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a>(x, jac)</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;</div><div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1fcnnvar.html">  230</a></span>&#160;<span class="keyword">        function </span><a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>(x) <span class="keyword">result</span>(f)</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;            <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;</div><div class="line"><a name="l00242"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1gradientfcn.html">  242</a></span>&#160;<span class="keyword">        subroutine </span><a class="code" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a>(x, g)</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="comment">! TYPES</span></div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html">  254</a></span>&#160;    <span class="keyword">type</span> :: <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div><div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52">  256</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: iter_count</div><div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4">  258</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: fcn_count</div><div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2">  260</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: jacobian_count</div><div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105">  262</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: gradient_count</div><div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8">  265</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_fcn</div><div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec">  268</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_chng</div><div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1">  272</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_zero_diff</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html">  277</a></span>&#160;    <span class="keyword">type</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div><div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87">  279</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: x1</div><div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73">  281</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: x2</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="comment">! NONLIN_VECFCN_HELPER.F90</span></div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html">  339</a></span>&#160;    <span class="keyword">type</span> <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00342"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109">  342</a></span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div><div class="line"><a name="l00344"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d">  344</a></span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a>), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_jac =&gt; null()</div><div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c">  346</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nfcn = 0</div><div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818">  348</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nvar = 0</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00410"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed">  410</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; vfh_set_fcn</div><div class="line"><a name="l00486"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78">  486</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_jacobian =&gt; vfh_set_jac</div><div class="line"><a name="l00497"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae">  497</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; vfh_is_fcn_defined</div><div class="line"><a name="l00508"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b">  508</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_jacobian_defined =&gt; vfh_is_jac_defined</div><div class="line"><a name="l00522"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8">  522</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; vfh_fcn</div><div class="line"><a name="l00557"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a">  557</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: jacobian =&gt; vfh_jac_fcn</div><div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982">  567</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_equation_count =&gt; vfh_get_nfcn</div><div class="line"><a name="l00577"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc">  577</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_variable_count =&gt; vfh_get_nvar</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;</div><div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;        <span class="keyword">module</span> subroutine vfh_set_fcn(this, fcn, nfcn, nvar)</div><div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;            <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nfcn, nvar</div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;</div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;        <span class="keyword">module</span> subroutine vfh_set_jac(this, jac)</div><div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;            <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: jac</div><div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;</div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_fcn_defined(this) result(x)</div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;</div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_jac_defined(this) result(x)</div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;</div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        <span class="keyword">module</span> subroutine vfh_fcn(this, x, f)</div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;</div><div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="keyword">module</span> subroutine vfh_jac_fcn(this, x, jac, fv, work, olwork, err)</div><div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: fv</div><div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: work</div><div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: olwork, err</div><div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;</div><div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nfcn(this) result(n)</div><div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;</div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nvar(this) result(n)</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;</div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;<span class="comment">! NONLIN_FCN1VAR_HELPER.F90</span></div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00682"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html">  682</a></span>&#160;    <span class="keyword">type</span> fcn1var_helper</div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00685"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7">  685</a></span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div><div class="line"><a name="l00687"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d">  687</a></span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_diff =&gt; null()</div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00700"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93">  700</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; f1h_fcn</div><div class="line"><a name="l00711"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce">  711</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; f1h_is_fcn_defined</div><div class="line"><a name="l00771"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271">  771</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; f1h_set_fcn</div><div class="line"><a name="l00782"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c">  782</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_derivative_defined =&gt; f1h_is_diff_defined</div><div class="line"><a name="l00796"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952">  796</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: diff =&gt; f1h_diff_fcn</div><div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;        <span class="comment">!!</span></div><div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;        <span class="comment">!! @par Syntax</span></div><div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;        <span class="comment">!! @code{.f90}</span></div><div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;        <span class="comment">!! subroutine set_diff(class(fcn1var_helper) this, procedure(fcn1var) pointer diff)</span></div><div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;        <span class="comment">!! @endcode</span></div><div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;        <span class="comment">!!</span></div><div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;        <span class="comment">!! @param[in,out] this The fcn1var_helper object.</span></div><div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;        <span class="comment">!! @param[in] diff A pointer to the function for computing the first</span></div><div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;        <span class="comment">!!  derivative.</span></div><div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_diff =&gt; f1h_set_diff</div><div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;</div><div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;        <span class="keyword">module</span> function f1h_fcn(this, x) result(f)</div><div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;            <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;</div><div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_fcn_defined(this) result(x)</div><div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;</div><div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;        <span class="keyword">module</span> subroutine f1h_set_fcn(this, fcn)</div><div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;            <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;</div><div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_diff_defined(this) result(x)</div><div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;</div><div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;        <span class="keyword">module</span> function f1h_diff_fcn(this, x, f) result(df)</div><div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;            <span class="keywordtype">real(real64)</span> :: df</div><div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;</div><div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keyword">module</span> subroutine f1h_set_diff(this, diff)</div><div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;            <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: diff</div><div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;</div><div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="comment">! NONLIN_FCNNVAR_HELPER.F90</span></div><div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00896"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html">  896</a></span>&#160;    <span class="keyword">type</span> fcnnvar_helper</div><div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00899"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031">  899</a></span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div><div class="line"><a name="l00901"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1">  901</a></span>&#160;        <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_grad =&gt; null()</div><div class="line"><a name="l00903"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e">  903</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nvar = 0</div><div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404">  916</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; fnh_fcn</div><div class="line"><a name="l00926"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe">  926</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; fnh_is_fcn_defined</div><div class="line"><a name="l00983"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924">  983</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; fnh_set_fcn</div><div class="line"><a name="l00993"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090">  993</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_variable_count =&gt; fnh_get_nvar</div><div class="line"><a name="l01070"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022"> 1070</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_gradient_fcn =&gt; fnh_set_grad</div><div class="line"><a name="l01081"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f"> 1081</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_gradient_defined =&gt; fnh_is_grad_defined</div><div class="line"><a name="l01104"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2"> 1104</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: gradient =&gt; fnh_grad_fcn</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;        <span class="keyword">module</span> function fnh_fcn(this, x) result(f)</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;            <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_fcn_defined(this) result(x)</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;        <span class="keyword">module</span> subroutine fnh_set_fcn(this, fcn, nvar)</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;            <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nvar</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_get_nvar(this) result(n)</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;        <span class="keyword">module</span> subroutine fnh_set_grad(this, fcn)</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;            <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_grad_defined(this) result(x)</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        <span class="keyword">module</span> subroutine fnh_grad_fcn(this, x, g, fv, err)</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fv</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: err</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;<span class="comment">! NONLIN_EQUATION_SOLVER.F90</span></div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01260"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html"> 1260</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_solver</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l01263"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04"> 1263</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div><div class="line"><a name="l01265"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae"> 1265</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_fcntol = 1.0d-8</div><div class="line"><a name="l01267"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2"> 1267</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_xtol = 1.0d-12</div><div class="line"><a name="l01269"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c"> 1269</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_gtol = 1.0d-12</div><div class="line"><a name="l01271"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6"> 1271</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l01283"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9"> 1283</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; es_get_max_eval</div><div class="line"><a name="l01298"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599"> 1298</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; es_set_max_eval</div><div class="line"><a name="l01308"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33"> 1308</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_fcn_tolerance =&gt; es_get_fcn_tol</div><div class="line"><a name="l01322"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50"> 1322</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn_tolerance =&gt; es_set_fcn_tol</div><div class="line"><a name="l01332"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05"> 1332</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; es_get_var_tol</div><div class="line"><a name="l01346"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d"> 1346</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; es_set_var_tol</div><div class="line"><a name="l01357"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6"> 1357</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_gradient_tolerance =&gt; es_get_grad_tol</div><div class="line"><a name="l01372"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797"> 1372</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_gradient_tolerance =&gt; es_set_grad_tol</div><div class="line"><a name="l01383"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47"> 1383</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; es_get_print_status</div><div class="line"><a name="l01398"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5"> 1398</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; es_set_print_status</div><div class="line"><a name="l01404"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391"> 1404</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_solver), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160;</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_max_eval(this) result(n)</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160;</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;        <span class="keyword">module</span> subroutine es_set_max_eval(this, n)</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160;</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_fcn_tol(this) result(x)</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160;</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;        <span class="keyword">module</span> subroutine es_set_fcn_tol(this, x)</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160;</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_var_tol(this) result(x)</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160;</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;        <span class="keyword">module</span> subroutine es_set_var_tol(this, x)</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160;</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_grad_tol(this) result(x)</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160;</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160;        <span class="keyword">module</span> subroutine es_set_grad_tol(this, x)</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160;</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_print_status(this) result(x)</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160;</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>&#160;        <span class="keyword">module</span> subroutine es_set_print_status(this, x)</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160;</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160;<span class="comment">! NONLIN_EQUATION_SOLVER_1VAR.F90</span></div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01512"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html"> 1512</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_solver_1var</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l01515"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb"> 1515</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div><div class="line"><a name="l01517"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b"> 1517</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_fcntol = 1.0d-8</div><div class="line"><a name="l01519"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a"> 1519</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_xtol = 1.0d-12</div><div class="line"><a name="l01521"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4"> 1521</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_difftol = 1.0d-12</div><div class="line"><a name="l01523"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f"> 1523</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l01535"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e"> 1535</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; es1_get_max_eval</div><div class="line"><a name="l01546"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240"> 1546</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; es1_set_max_eval</div><div class="line"><a name="l01556"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b"> 1556</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_fcn_tolerance =&gt; es1_get_fcn_tol</div><div class="line"><a name="l01566"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2"> 1566</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn_tolerance =&gt; es1_set_fcn_tol</div><div class="line"><a name="l01576"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89"> 1576</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; es1_get_var_tol</div><div class="line"><a name="l01586"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95"> 1586</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; es1_set_var_tol</div><div class="line"><a name="l01597"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda"> 1597</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; es1_get_print_status</div><div class="line"><a name="l01608"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0"> 1608</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; es1_set_print_status</div><div class="line"><a name="l01614"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9"> 1614</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_solver_1var), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div><div class="line"><a name="l01625"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54"> 1625</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_diff_tolerance =&gt; es1_get_diff_tol</div><div class="line"><a name="l01640"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20"> 1640</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_diff_tolerance =&gt; es1_set_diff_tol</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>&#160;</div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_max_eval(this) result(n)</div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>&#160;</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>&#160;        <span class="keyword">module</span> subroutine es1_set_max_eval(this, n)</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>&#160;</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_fcn_tol(this) result(x)</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>&#160;</div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>&#160;        <span class="keyword">module</span> subroutine es1_set_fcn_tol(this, x)</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>&#160;</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_var_tol(this) result(x)</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>&#160;</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>&#160;        <span class="keyword">module</span> subroutine es1_set_var_tol(this, x)</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>&#160;</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_print_status(this) result(x)</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>&#160;</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>&#160;        <span class="keyword">module</span> subroutine es1_set_print_status(this, x)</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>&#160;</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_diff_tol(this) result(x)</div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>&#160;</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>&#160;    <span class="comment">! --------------------</span></div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>&#160;        <span class="keyword">module</span> subroutine es1_set_diff_tol(this, x)</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>&#160;</div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>&#160;<span class="comment">! NONLIN_EQUATION_OPTIMIZER.F90</span></div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01767"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html"> 1767</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_optimizer</div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l01770"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b"> 1770</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 500</div><div class="line"><a name="l01772"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952"> 1772</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_tol = 1.0d-12</div><div class="line"><a name="l01774"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50"> 1774</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l01785"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b"> 1785</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; oe_get_max_eval</div><div class="line"><a name="l01795"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c"> 1795</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; oe_set_max_eval</div><div class="line"><a name="l01805"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1"> 1805</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_tolerance =&gt; oe_get_tol</div><div class="line"><a name="l01815"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868"> 1815</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_tolerance =&gt; oe_set_tol</div><div class="line"><a name="l01826"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485"> 1826</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; oe_get_print_status</div><div class="line"><a name="l01837"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5"> 1837</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; oe_set_print_status</div><div class="line"><a name="l01843"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917"> 1843</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_optimize_fcn), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>&#160;</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_max_eval(this) result(n)</div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>&#160;</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>&#160;        <span class="keyword">module</span> subroutine oe_set_max_eval(this, n)</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>&#160;</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_tol(this) result(x)</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>&#160;</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>&#160;        <span class="keyword">module</span> subroutine oe_set_tol(this, x)</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>&#160;</div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_print_status(this) result(x)</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>&#160;</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>&#160;        <span class="keyword">module</span> subroutine oe_set_print_status(this, x)</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>&#160;</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>&#160;<span class="comment">! ABSTRACT ROUTINE INTERFACES</span></div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>&#160;</div><div class="line"><a name="l01902"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__solver.html"> 1902</a></span>&#160;<span class="keyword">        subroutine </span>nonlin_solver(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>&#160;            <span class="keywordtype">import </span>equation_solver</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>&#160;            <span class="keywordtype">import </span>vecfcn_helper</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>&#160;</div><div class="line"><a name="l01935"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__solver__1var.html"> 1935</a></span>&#160;<span class="keyword">        subroutine </span>nonlin_solver_1var(this, fcn, x, lim, f, ib, err)</div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160;            <span class="keywordtype">import </span>equation_solver_1var</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160;            <span class="keywordtype">import </span>fcn1var_helper</div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;            <span class="keywordtype">import </span>value_pair</div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>&#160;            <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>&#160;</div><div class="line"><a name="l01969"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html"> 1969</a></span>&#160;<span class="keyword">        subroutine </span>nonlin_optimize_fcn(this, fcn, x, fout, ib, err)</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>&#160;            <span class="keywordtype">import </span>equation_optimizer</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>&#160;            <span class="keywordtype">import </span>fcnnvar_helper</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>&#160;</div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>&#160;<span class="comment">! MISC. ROUTINES</span></div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>&#160;<span class="keyword">    subroutine </span>print_status(iter, nfeval, njaceval, xnorm, fnorm)</div><div class="line"><a name="l01996"></a><span class="lineno"><a class="line" href="namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7"> 1996</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: iter, nfeval, njaceval</div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: xnorm, fnorm</div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>&#160;</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>&#160;        print *, <span class="stringliteral">&quot;&quot;</span></div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>&#160;        print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>&#160;        print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, nfeval</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>&#160;        <span class="keywordflow">if</span> (njaceval &gt; 0) print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Jacobian Evaluations: &quot;</span>, njaceval</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>&#160;        print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>&#160;        print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="structnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__optimizer_html"><div class="ttname"><a href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></div><div class="ttdoc">A base class for optimization of an equation of multiple variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01767">nonlin_core.f90:1767</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1nonlin__optimize__fcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_core::nonlin_optimize_fcn</a></div><div class="ttdoc">Describes the interface of a routine for optimizing an equation of N variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01969">nonlin_core.f90:1969</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1nonlin__solver_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_core::nonlin_solver</a></div><div class="ttdoc">Describes the interface of a nonlinear equation solver. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01902">nonlin_core.f90:1902</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1fcn1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcn1var.html">nonlin_core::fcn1var</a></div><div class="ttdoc">Describes a function of one variable. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00198">nonlin_core.f90:198</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1nonlin__solver__1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_core::nonlin_solver_1var</a></div><div class="ttdoc">Describes the interface of a solver for an equation of one variable. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01935">nonlin_core.f90:1935</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1fcnnvar_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcnnvar.html">nonlin_core::fcnnvar</a></div><div class="ttdoc">Describes a function of N variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00230">nonlin_core.f90:230</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__solver__1var_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></div><div class="ttdoc">A base class for various solvers of equations of one variable. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01512">nonlin_core.f90:1512</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1gradientfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1gradientfcn.html">nonlin_core::gradientfcn</a></div><div class="ttdoc">Describes a routine capable of computing the gradient vector of an equation of N variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00242">nonlin_core.f90:242</a></div></div>
-<div class="ttc" id="interfacenonlin__core_1_1jacobianfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1jacobianfcn.html">nonlin_core::jacobianfcn</a></div><div class="ttdoc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00220">nonlin_core.f90:220</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
-<div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_core.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160; </div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160; </div>
+<div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="namespacenonlin__core.html">  167</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64, int32</div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a></div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a></div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a></div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a></div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a></div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a></div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a></div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a></div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;    <span class="keywordtype">public</span> :: print_status</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160; </div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment">! INTERFACES</span></div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160; </div>
+<div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1fcn1var.html">  198</a></span>&#160;        <span class="keyword">function </span><a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;<span class="keywordtype">            real</span>(real64) :: f</div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160; </div>
+<div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1vecfcn.html">  209</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>(x, f)</div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160; </div>
+<div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1jacobianfcn.html">  220</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a>(x, jac)</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160; </div>
+<div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1fcnnvar.html">  230</a></span>&#160;        <span class="keyword">function </span><a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;<span class="keywordtype">            real</span>(real64) :: f</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160; </div>
+<div class="line"><a name="l00242"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1gradientfcn.html">  242</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a>(x, g)</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160; </div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="comment">! TYPES</span></div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html">  254</a></span>&#160;    <span class="keyword">type</span> :: <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div>
+<div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52">  256</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: iter_count</div>
+<div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4">  258</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: fcn_count</div>
+<div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2">  260</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: jacobian_count</div>
+<div class="line"><a name="l00262"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105">  262</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: gradient_count</div>
+<div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8">  265</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_fcn</div>
+<div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec">  268</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_chng</div>
+<div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1">  272</a></span>&#160;        <span class="keywordtype">logical</span> :: converge_on_zero_diff</div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160; </div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html">  277</a></span>&#160;    <span class="keyword">type</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87">  279</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: x1</div>
+<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73">  281</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: x2</div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160; </div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="comment">! NONLIN_VECFCN_HELPER.F90</span></div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html">  339</a></span>&#160;    <span class="keyword">type</span> <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div>
+<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00342"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109">  342</a></span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div>
+<div class="line"><a name="l00344"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d">  344</a></span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a>), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_jac =&gt; null()</div>
+<div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c">  346</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nfcn = 0</div>
+<div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818">  348</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nvar = 0</div>
+<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00410"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed">  410</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; vfh_set_fcn</div>
+<div class="line"><a name="l00486"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78">  486</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_jacobian =&gt; vfh_set_jac</div>
+<div class="line"><a name="l00497"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae">  497</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; vfh_is_fcn_defined</div>
+<div class="line"><a name="l00508"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b">  508</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_jacobian_defined =&gt; vfh_is_jac_defined</div>
+<div class="line"><a name="l00522"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8">  522</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; vfh_fcn</div>
+<div class="line"><a name="l00557"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a">  557</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: jacobian =&gt; vfh_jac_fcn</div>
+<div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982">  567</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_equation_count =&gt; vfh_get_nfcn</div>
+<div class="line"><a name="l00577"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc">  577</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_variable_count =&gt; vfh_get_nvar</div>
+<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160; </div>
+<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;        <span class="keyword">module</span> subroutine vfh_set_fcn(this, fcn, nfcn, nvar)</div>
+<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;            <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nfcn, nvar</div>
+<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160; </div>
+<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;        <span class="keyword">module</span> subroutine vfh_set_jac(this, jac)</div>
+<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;            <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: jac</div>
+<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160; </div>
+<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160; </div>
+<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_jac_defined(this) result(x)</div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160; </div>
+<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        <span class="keyword">module</span> subroutine vfh_fcn(this, x, f)</div>
+<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160; </div>
+<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="keyword">module</span> subroutine vfh_jac_fcn(this, x, jac, fv, work, olwork, err)</div>
+<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: fv</div>
+<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: work</div>
+<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: olwork, err</div>
+<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160; </div>
+<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nfcn(this) result(n)</div>
+<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160; </div>
+<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nvar(this) result(n)</div>
+<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160; </div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;<span class="comment">! NONLIN_FCN1VAR_HELPER.F90</span></div>
+<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00682"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html">  682</a></span>&#160;    <span class="keyword">type</span> fcn1var_helper</div>
+<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00685"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7">  685</a></span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div>
+<div class="line"><a name="l00687"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d">  687</a></span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_diff =&gt; null()</div>
+<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00700"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93">  700</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; f1h_fcn</div>
+<div class="line"><a name="l00711"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce">  711</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; f1h_is_fcn_defined</div>
+<div class="line"><a name="l00771"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271">  771</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; f1h_set_fcn</div>
+<div class="line"><a name="l00782"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c">  782</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_derivative_defined =&gt; f1h_is_diff_defined</div>
+<div class="line"><a name="l00796"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952">  796</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: diff =&gt; f1h_diff_fcn</div>
+<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;        <span class="comment">!!</span></div>
+<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;        <span class="comment">!! @par Syntax</span></div>
+<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;        <span class="comment">!! @code{.f90}</span></div>
+<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;        <span class="comment">!! subroutine set_diff(class(fcn1var_helper) this, procedure(fcn1var) pointer diff)</span></div>
+<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;        <span class="comment">!! @endcode</span></div>
+<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;        <span class="comment">!!</span></div>
+<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;        <span class="comment">!! @param[in,out] this The fcn1var_helper object.</span></div>
+<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;        <span class="comment">!! @param[in] diff A pointer to the function for computing the first</span></div>
+<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;        <span class="comment">!!  derivative.</span></div>
+<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_diff =&gt; f1h_set_diff</div>
+<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160; </div>
+<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;        <span class="keyword">module</span> function f1h_fcn(this, x) result(f)</div>
+<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="keywordtype">            real</span>(real64) :: f</div>
+<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160; </div>
+<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160; </div>
+<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;        <span class="keyword">module</span> subroutine f1h_set_fcn(this, fcn)</div>
+<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;            <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160; </div>
+<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_diff_defined(this) result(x)</div>
+<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160; </div>
+<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;        <span class="keyword">module</span> function f1h_diff_fcn(this, x, f) result(df)</div>
+<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;<span class="keywordtype">            real</span>(real64) :: df</div>
+<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160; </div>
+<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keyword">module</span> subroutine f1h_set_diff(this, diff)</div>
+<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;            <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: diff</div>
+<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160; </div>
+<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="comment">! NONLIN_FCNNVAR_HELPER.F90</span></div>
+<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00896"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html">  896</a></span>&#160;    <span class="keyword">type</span> fcnnvar_helper</div>
+<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00899"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031">  899</a></span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_fcn =&gt; null()</div>
+<div class="line"><a name="l00901"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1">  901</a></span>&#160;        <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">nopass</span> :: m_grad =&gt; null()</div>
+<div class="line"><a name="l00903"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e">  903</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_nvar = 0</div>
+<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404">  916</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fcn =&gt; fnh_fcn</div>
+<div class="line"><a name="l00926"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe">  926</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_fcn_defined =&gt; fnh_is_fcn_defined</div>
+<div class="line"><a name="l00983"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924">  983</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn =&gt; fnh_set_fcn</div>
+<div class="line"><a name="l00993"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090">  993</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_variable_count =&gt; fnh_get_nvar</div>
+<div class="line"><a name="l01070"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022"> 1070</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_gradient_fcn =&gt; fnh_set_grad</div>
+<div class="line"><a name="l01081"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f"> 1081</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_gradient_defined =&gt; fnh_is_grad_defined</div>
+<div class="line"><a name="l01104"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2"> 1104</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: gradient =&gt; fnh_grad_fcn</div>
+<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160; </div>
+<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;        <span class="keyword">module</span> function fnh_fcn(this, x) result(f)</div>
+<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;<span class="keywordtype">            real</span>(real64) :: f</div>
+<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160; </div>
+<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160; </div>
+<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;        <span class="keyword">module</span> subroutine fnh_set_fcn(this, fcn, nvar)</div>
+<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;            <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nvar</div>
+<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160; </div>
+<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_get_nvar(this) result(n)</div>
+<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160; </div>
+<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;        <span class="keyword">module</span> subroutine fnh_set_grad(this, fcn)</div>
+<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;            <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160; </div>
+<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_grad_defined(this) result(x)</div>
+<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160; </div>
+<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;        <span class="keyword">module</span> subroutine fnh_grad_fcn(this, x, g, fv, err)</div>
+<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div>
+<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fv</div>
+<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: err</div>
+<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160; </div>
+<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;<span class="comment">! NONLIN_EQUATION_SOLVER.F90</span></div>
+<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01260"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html"> 1260</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_solver</div>
+<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l01263"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04"> 1263</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div>
+<div class="line"><a name="l01265"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae"> 1265</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_fcntol = 1.0d-8</div>
+<div class="line"><a name="l01267"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2"> 1267</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_xtol = 1.0d-12</div>
+<div class="line"><a name="l01269"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c"> 1269</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_gtol = 1.0d-12</div>
+<div class="line"><a name="l01271"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6"> 1271</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div>
+<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l01283"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9"> 1283</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; es_get_max_eval</div>
+<div class="line"><a name="l01298"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599"> 1298</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; es_set_max_eval</div>
+<div class="line"><a name="l01308"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33"> 1308</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_fcn_tolerance =&gt; es_get_fcn_tol</div>
+<div class="line"><a name="l01322"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50"> 1322</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn_tolerance =&gt; es_set_fcn_tol</div>
+<div class="line"><a name="l01332"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05"> 1332</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; es_get_var_tol</div>
+<div class="line"><a name="l01346"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d"> 1346</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; es_set_var_tol</div>
+<div class="line"><a name="l01357"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6"> 1357</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_gradient_tolerance =&gt; es_get_grad_tol</div>
+<div class="line"><a name="l01372"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797"> 1372</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_gradient_tolerance =&gt; es_set_grad_tol</div>
+<div class="line"><a name="l01383"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47"> 1383</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; es_get_print_status</div>
+<div class="line"><a name="l01398"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5"> 1398</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; es_set_print_status</div>
+<div class="line"><a name="l01404"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391"> 1404</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_solver), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div>
+<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160; </div>
+<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160; </div>
+<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;        <span class="keyword">module</span> subroutine es_set_max_eval(this, n)</div>
+<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160; </div>
+<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_fcn_tol(this) result(x)</div>
+<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160; </div>
+<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;        <span class="keyword">module</span> subroutine es_set_fcn_tol(this, x)</div>
+<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160; </div>
+<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160; </div>
+<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;        <span class="keyword">module</span> subroutine es_set_var_tol(this, x)</div>
+<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160; </div>
+<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_grad_tol(this) result(x)</div>
+<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160; </div>
+<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160;        <span class="keyword">module</span> subroutine es_set_grad_tol(this, x)</div>
+<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160; </div>
+<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_print_status(this) result(x)</div>
+<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160; </div>
+<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>&#160;        <span class="keyword">module</span> subroutine es_set_print_status(this, x)</div>
+<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160; </div>
+<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160;<span class="comment">! NONLIN_EQUATION_SOLVER_1VAR.F90</span></div>
+<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01512"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html"> 1512</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_solver_1var</div>
+<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l01515"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb"> 1515</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div>
+<div class="line"><a name="l01517"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b"> 1517</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_fcntol = 1.0d-8</div>
+<div class="line"><a name="l01519"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a"> 1519</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_xtol = 1.0d-12</div>
+<div class="line"><a name="l01521"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4"> 1521</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_difftol = 1.0d-12</div>
+<div class="line"><a name="l01523"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f"> 1523</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div>
+<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l01535"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e"> 1535</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; es1_get_max_eval</div>
+<div class="line"><a name="l01546"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240"> 1546</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; es1_set_max_eval</div>
+<div class="line"><a name="l01556"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b"> 1556</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_fcn_tolerance =&gt; es1_get_fcn_tol</div>
+<div class="line"><a name="l01566"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2"> 1566</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_fcn_tolerance =&gt; es1_set_fcn_tol</div>
+<div class="line"><a name="l01576"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89"> 1576</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; es1_get_var_tol</div>
+<div class="line"><a name="l01586"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95"> 1586</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; es1_set_var_tol</div>
+<div class="line"><a name="l01597"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda"> 1597</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; es1_get_print_status</div>
+<div class="line"><a name="l01608"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0"> 1608</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; es1_set_print_status</div>
+<div class="line"><a name="l01614"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9"> 1614</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_solver_1var), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div>
+<div class="line"><a name="l01625"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54"> 1625</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_diff_tolerance =&gt; es1_get_diff_tol</div>
+<div class="line"><a name="l01640"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20"> 1640</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_diff_tolerance =&gt; es1_set_diff_tol</div>
+<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>&#160; </div>
+<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>&#160; </div>
+<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>&#160;        <span class="keyword">module</span> subroutine es1_set_max_eval(this, n)</div>
+<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>&#160; </div>
+<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_fcn_tol(this) result(x)</div>
+<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>&#160; </div>
+<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>&#160;        <span class="keyword">module</span> subroutine es1_set_fcn_tol(this, x)</div>
+<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>&#160; </div>
+<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>&#160; </div>
+<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>&#160;        <span class="keyword">module</span> subroutine es1_set_var_tol(this, x)</div>
+<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>&#160; </div>
+<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_print_status(this) result(x)</div>
+<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>&#160; </div>
+<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>&#160;        <span class="keyword">module</span> subroutine es1_set_print_status(this, x)</div>
+<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>&#160; </div>
+<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_diff_tol(this) result(x)</div>
+<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>&#160; </div>
+<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>&#160;    <span class="comment">! --------------------</span></div>
+<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>&#160;        <span class="keyword">module</span> subroutine es1_set_diff_tol(this, x)</div>
+<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>&#160; </div>
+<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>&#160;<span class="comment">! NONLIN_EQUATION_OPTIMIZER.F90</span></div>
+<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01767"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html"> 1767</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span> :: equation_optimizer</div>
+<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l01770"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b"> 1770</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 500</div>
+<div class="line"><a name="l01772"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952"> 1772</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_tol = 1.0d-12</div>
+<div class="line"><a name="l01774"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50"> 1774</a></span>&#160;        <span class="keywordtype">logical</span> :: m_printstatus = .false.</div>
+<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l01785"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b"> 1785</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; oe_get_max_eval</div>
+<div class="line"><a name="l01795"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c"> 1795</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; oe_set_max_eval</div>
+<div class="line"><a name="l01805"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1"> 1805</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_tolerance =&gt; oe_get_tol</div>
+<div class="line"><a name="l01815"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868"> 1815</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_tolerance =&gt; oe_set_tol</div>
+<div class="line"><a name="l01826"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485"> 1826</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_print_status =&gt; oe_get_print_status</div>
+<div class="line"><a name="l01837"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5"> 1837</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_print_status =&gt; oe_set_print_status</div>
+<div class="line"><a name="l01843"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917"> 1843</a></span>&#160;        <span class="keywordtype">procedure</span>(nonlin_optimize_fcn), <span class="keywordtype">deferred</span>, <span class="keywordtype">public</span>, pass :: solve</div>
+<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>&#160; </div>
+<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>&#160; </div>
+<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>&#160;        <span class="keyword">module</span> subroutine oe_set_max_eval(this, n)</div>
+<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>&#160; </div>
+<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_tol(this) result(x)</div>
+<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>&#160; </div>
+<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>&#160;        <span class="keyword">module</span> subroutine oe_set_tol(this, x)</div>
+<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>&#160; </div>
+<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_print_status(this) result(x)</div>
+<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>&#160; </div>
+<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>&#160;        <span class="keyword">module</span> subroutine oe_set_print_status(this, x)</div>
+<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>&#160; </div>
+<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>&#160;<span class="comment">! ABSTRACT ROUTINE INTERFACES</span></div>
+<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>&#160; </div>
+<div class="line"><a name="l01902"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__solver.html"> 1902</a></span>&#160;        <span class="keyword">subroutine </span>nonlin_solver(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>&#160;            <span class="keywordtype">import </span>equation_solver</div>
+<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>&#160;            <span class="keywordtype">import </span>vecfcn_helper</div>
+<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div>
+<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>&#160;            <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>&#160;            <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>&#160; </div>
+<div class="line"><a name="l01935"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__solver__1var.html"> 1935</a></span>&#160;        <span class="keyword">subroutine </span>nonlin_solver_1var(this, fcn, x, lim, f, ib, err)</div>
+<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160;            <span class="keywordtype">import </span>equation_solver_1var</div>
+<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160;            <span class="keywordtype">import </span>fcn1var_helper</div>
+<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;            <span class="keywordtype">import </span>value_pair</div>
+<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div>
+<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>&#160;            <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>&#160; </div>
+<div class="line"><a name="l01969"></a><span class="lineno"><a class="line" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html"> 1969</a></span>&#160;        <span class="keyword">subroutine </span>nonlin_optimize_fcn(this, fcn, x, fout, ib, err)</div>
+<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : real64</div>
+<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>&#160;            <span class="keywordtype">import </span>equation_optimizer</div>
+<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>&#160;            <span class="keywordtype">import </span>fcnnvar_helper</div>
+<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div>
+<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>&#160;            <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>&#160;            <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div>
+<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>&#160;            <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>&#160; </div>
+<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>&#160;<span class="comment">! MISC. ROUTINES</span></div>
+<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>&#160;    <span class="keyword">subroutine </span>print_status(iter, nfeval, njaceval, xnorm, fnorm)</div>
+<div class="line"><a name="l01996"></a><span class="lineno"><a class="line" href="namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7"> 1996</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: iter, nfeval, njaceval</div>
+<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: xnorm, fnorm</div>
+<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>&#160; </div>
+<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>&#160;        print *, <span class="stringliteral">&quot;&quot;</span></div>
+<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>&#160;        print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div>
+<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>&#160;        print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, nfeval</div>
+<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>&#160;        <span class="keywordflow">if</span> (njaceval &gt; 0) print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Jacobian Evaluations: &quot;</span>, njaceval</div>
+<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>&#160;        print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm</div>
+<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>&#160;        print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1nonlin__solver_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_core::nonlin_solver</a></div><div class="ttdoc">Describes the interface of a nonlinear equation solver.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01902">nonlin_core.f90:1902</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1nonlin__optimize__fcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_core::nonlin_optimize_fcn</a></div><div class="ttdoc">Describes the interface of a routine for optimizing an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01969">nonlin_core.f90:1969</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1fcn1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcn1var.html">nonlin_core::fcn1var</a></div><div class="ttdoc">Describes a function of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00198">nonlin_core.f90:198</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1jacobianfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1jacobianfcn.html">nonlin_core::jacobianfcn</a></div><div class="ttdoc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00220">nonlin_core.f90:220</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1nonlin__solver__1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_core::nonlin_solver_1var</a></div><div class="ttdoc">Describes the interface of a solver for an equation of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01935">nonlin_core.f90:1935</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1fcnnvar_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcnnvar.html">nonlin_core::fcnnvar</a></div><div class="ttdoc">Describes a function of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00230">nonlin_core.f90:230</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__solver__1var_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></div><div class="ttdoc">A base class for various solvers of equations of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01512">nonlin_core.f90:1512</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__optimizer_html"><div class="ttname"><a href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></div><div class="ttdoc">A base class for optimization of an equation of multiple variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01767">nonlin_core.f90:1767</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1gradientfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1gradientfcn.html">nonlin_core::gradientfcn</a></div><div class="ttdoc">Describes a routine capable of computing the gradient vector of an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00242">nonlin_core.f90:242</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_core.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__equation__optimizer_8f90_source.html b/doc/html/nonlin__equation__optimizer_8f90_source.html
index f800b4b..362e00a 100644
--- a/doc/html/nonlin__equation__optimizer_8f90_source.html
+++ b/doc/html/nonlin__equation__optimizer_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_equation_optimizer.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_equation_optimizer.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,62 @@
 <div class="title">nonlin_equation_optimizer.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_optimizer.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_optimizer</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_max_eval(this) result(n)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine oe_set_max_eval(this, n)</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_tol(this) result(x)</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_tol</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine oe_set_tol(this, x)</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_tol = x</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_print_status(this) result(x)</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_printStatus</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine oe_set_print_status(this, x)</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_printStatus = x</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_optimizer.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_optimizer</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160; </div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine oe_set_max_eval(this, n)</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160; </div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_tol(this) result(x)</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_tol</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160; </div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine oe_set_tol(this, x)</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_tol = x</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160; </div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function oe_get_print_status(this) result(x)</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_printStatus</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160; </div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine oe_set_print_status(this, x)</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_printStatus = x</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_equation_optimizer.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__equation__solver_8f90_source.html b/doc/html/nonlin__equation__solver_8f90_source.html
index eed9e1b..e89c3c4 100644
--- a/doc/html/nonlin__equation__solver_8f90_source.html
+++ b/doc/html/nonlin__equation__solver_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_equation_solver.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_equation_solver.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,90 @@
 <div class="title">nonlin_equation_solver.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_solver.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_solver</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_max_eval(this) result(n)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine es_set_max_eval(this, n)</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_fcn_tol(this) result(x)</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_fcnTol</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine es_set_fcn_tol(this, x)</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_fcnTol = x</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_var_tol(this) result(x)</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_xtol</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine es_set_var_tol(this, x)</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_xtol = x</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_grad_tol(this) result(x)</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        x = this%m_gtol</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keyword">module</span> subroutine es_set_grad_tol(this, x)</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        this%m_gtol = x</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_print_status(this) result(x)</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        x = this%m_printStatus</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keyword">module</span> subroutine es_set_print_status(this, x)</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        this%m_printStatus = x</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_solver.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_solver</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160; </div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine es_set_max_eval(this, n)</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160; </div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_fcn_tol(this) result(x)</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_fcnTol</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160; </div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine es_set_fcn_tol(this, x)</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_fcnTol = x</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160; </div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_xtol</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160; </div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine es_set_var_tol(this, x)</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_xtol = x</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160; </div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_grad_tol(this) result(x)</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        x = this%m_gtol</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160; </div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keyword">module</span> subroutine es_set_grad_tol(this, x)</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        this%m_gtol = x</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160; </div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es_get_print_status(this) result(x)</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        x = this%m_printStatus</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160; </div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keyword">module</span> subroutine es_set_print_status(this, x)</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordtype">class</span>(equation_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        this%m_printStatus = x</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_equation_solver.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__equation__solver__1var_8f90_source.html b/doc/html/nonlin__equation__solver__1var_8f90_source.html
index 1159233..9c870ef 100644
--- a/doc/html/nonlin__equation__solver__1var_8f90_source.html
+++ b/doc/html/nonlin__equation__solver__1var_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_equation_solver_1var.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_equation_solver_1var.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,90 @@
 <div class="title">nonlin_equation_solver_1var.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_solver_1var.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_solver_1var</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_max_eval(this) result(n)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine es1_set_max_eval(this, n)</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_fcn_tol(this) result(x)</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_fcnTol</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine es1_set_fcn_tol(this, x)</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_fcnTol = x</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_var_tol(this) result(x)</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_xtol</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine es1_set_var_tol(this, x)</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_xtol = x</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_print_status(this) result(x)</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        x = this%m_printStatus</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keyword">module</span> subroutine es1_set_print_status(this, x)</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        this%m_printStatus = x</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_diff_tol(this) result(x)</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        x = this%m_difftol</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keyword">module</span> subroutine es1_set_diff_tol(this, x)</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        this%m_difftol = x</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_equation_solver_1var.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_equation_solver_1var</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_max_eval(this) result(n)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        n = this%m_maxEval</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160; </div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">module</span> subroutine es1_set_max_eval(this, n)</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this%m_maxEval = n</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160; </div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_fcn_tol(this) result(x)</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        x = this%m_fcnTol</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160; </div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">module</span> subroutine es1_set_fcn_tol(this, x)</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        this%m_fcnTol = x</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160; </div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        x = this%m_xtol</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160; </div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">module</span> subroutine es1_set_var_tol(this, x)</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        this%m_xtol = x</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160; </div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_print_status(this) result(x)</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        x = this%m_printStatus</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160; </div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keyword">module</span> subroutine es1_set_print_status(this, x)</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        this%m_printStatus = x</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160; </div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function es1_get_diff_tol(this) result(x)</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        x = this%m_difftol</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160; </div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="keyword">module</span> subroutine es1_set_diff_tol(this, x)</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        this%m_difftol = x</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_equation_solver_1var.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__fcn1var__helper_8f90_source.html b/doc/html/nonlin__fcn1var__helper_8f90_source.html
index c354676..92b94ef 100644
--- a/doc/html/nonlin__fcn1var__helper_8f90_source.html
+++ b/doc/html/nonlin__fcn1var__helper_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_fcn1var_helper.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_fcn1var_helper.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,97 @@
 <div class="title">nonlin_fcn1var_helper.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_fcn1var_helper.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_fcn1var_helper</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> function f1h_fcn(this, x) result(f)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_fcn)) <span class="keywordflow">then</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;            f = this%m_fcn(x)</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_fcn_defined(this) result(x)</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keyword">module</span> subroutine f1h_set_fcn(this, fcn)</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        this%m_fcn =&gt; fcn</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_diff_defined(this) result(x)</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        x = <span class="keyword">associated</span>(this%m_diff)</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    <span class="keyword">module</span> function f1h_diff_fcn(this, x, f) result(df)</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordtype">real(real64)</span> :: df</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="keywordtype">real(real64)</span> :: eps, epsmch, h, temp, f1, f0</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        epsmch = epsilon(epsmch)</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        eps = sqrt(epsmch)</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordflow">if</span> (this%is_derivative_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            <span class="comment">! Use the user-defined routine to compute the derivative</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            df = this%m_diff(x)</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;            <span class="comment">! Compute the derivative via a forward difference</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            h = eps * abs(x)</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            <span class="keywordflow">if</span> (h &lt; epsmch) h = eps</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            temp = x + h</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            f1 = this%fcn(temp)</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) <span class="keywordflow">then</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                f0 = f</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                f0 = this%fcn(x)</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            df = (f1 - f0) / h</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="keyword">module</span> subroutine f1h_set_diff(this, diff)</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: diff</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        this%m_diff =&gt; diff</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_fcn1var_helper.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_fcn1var_helper</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> function f1h_fcn(this, x) result(f)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_fcn)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;            f = this%m_fcn(x)</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160; </div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keyword">module</span> subroutine f1h_set_fcn(this, fcn)</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        this%m_fcn =&gt; fcn</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160; </div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function f1h_is_diff_defined(this) result(x)</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        x = <span class="keyword">associated</span>(this%m_diff)</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160; </div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    <span class="keyword">module</span> function f1h_diff_fcn(this, x, f) result(df)</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keywordtype">        real</span>(real64) :: df</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160; </div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160; </div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keywordtype">        real</span>(real64) :: eps, epsmch, h, temp, f1, f0</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160; </div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        epsmch = epsilon(epsmch)</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        eps = sqrt(epsmch)</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160; </div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordflow">if</span> (this%is_derivative_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            <span class="comment">! Use the user-defined routine to compute the derivative</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            df = this%m_diff(x)</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;            <span class="comment">! Compute the derivative via a forward difference</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            h = eps * abs(x)</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            <span class="keywordflow">if</span> (h &lt; epsmch) h = eps</div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            temp = x + h</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            f1 = this%fcn(temp)</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                f0 = f</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                f0 = this%fcn(x)</div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            df = (f1 - f0) / h</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160; </div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="keyword">module</span> subroutine f1h_set_diff(this, diff)</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: diff</div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        this%m_diff =&gt; diff</div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160; </div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_fcn1var_helper.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__fcnnvar__helper_8f90_source.html b/doc/html/nonlin__fcnnvar__helper_8f90_source.html
index c13b75f..ff36319 100644
--- a/doc/html/nonlin__fcnnvar__helper_8f90_source.html
+++ b/doc/html/nonlin__fcnnvar__helper_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_fcnnvar_helper.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_fcnnvar_helper.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,133 @@
 <div class="title">nonlin_fcnnvar_helper.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_fcnnvar_helper.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_fcnnvar_helper</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> function fnh_fcn(this, x) result(f)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">real(real64)</span> :: f</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_fcn)) <span class="keywordflow">then</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;            f = this%m_fcn(x)</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_fcn_defined(this) result(x)</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keyword">module</span> subroutine fnh_set_fcn(this, fcn, nvar)</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nvar</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        this%m_fcn =&gt; fcn</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        this%m_nvar = nvar</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_get_nvar(this) result(n)</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        n = this%m_nvar</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    <span class="keyword">module</span> subroutine fnh_set_grad(this, fcn)</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        this%m_grad =&gt; fcn</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_grad_defined(this) result(x)</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        x = <span class="keyword">associated</span>(this%m_grad)</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keyword">module</span> subroutine fnh_grad_fcn(this, x, g, fv, err)</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fv</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: err</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, n, flag</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="keywordtype">real(real64)</span> :: eps, epsmch, h, temp, f, f1</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 0</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="comment">! n = this%m_nvar</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        n = this%get_variable_count()</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="comment">! Input Checking</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        flag = 0</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            flag = 2</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(g) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;            flag = 3</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="comment">! ERROR: Incorrectly sized input arrays</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = flag</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (.not.this%is_fcn_defined()) <span class="keywordflow">return</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">if</span> (this%is_gradient_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="comment">! Call the user-defined gradient routine</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            <span class="keyword">call </span>this%m_grad(x, g)</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="comment">! Compute the gradient via finite differences</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                f = fv</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                f = this%fcn(x)</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="comment">! Establish step size factors</span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            epsmch = epsilon(epsmch)</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;            eps = sqrt(epsmch)</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            <span class="comment">! Compute the derivatives</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                temp = x(j)</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;                h = eps * abs(temp)</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                <span class="keywordflow">if</span> (h == zero) h = eps</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                x(j) = temp + h</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                f1 = this%fcn(x)</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                x(j) = temp</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                g(j) = (f1 - f) / h</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_fcnnvar_helper.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_fcnnvar_helper</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> function fnh_fcn(this, x) result(f)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_fcn)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;            f = this%m_fcn(x)</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160; </div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keyword">module</span> subroutine fnh_set_fcn(this, fcn, nvar)</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nvar</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        this%m_fcn =&gt; fcn</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        this%m_nvar = nvar</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160; </div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_get_nvar(this) result(n)</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        n = this%m_nvar</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160; </div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    <span class="keyword">module</span> subroutine fnh_set_grad(this, fcn)</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span>, <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        this%m_grad =&gt; fcn</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160; </div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function fnh_is_grad_defined(this) result(x)</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        x = <span class="keyword">associated</span>(this%m_grad)</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160; </div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keyword">module</span> subroutine fnh_grad_fcn(this, x, g, fv, err)</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fv</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: err</div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160; </div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160; </div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, n, flag</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keywordtype">        real</span>(real64) :: eps, epsmch, h, temp, f, f1</div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160; </div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 0</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="comment">! n = this%m_nvar</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        n = this%get_variable_count()</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160; </div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="comment">! Input Checking</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            flag = 2</div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(g) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="comment">! ERROR: Incorrectly sized input arrays</span></div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = flag</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160; </div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (.not.this%is_fcn_defined()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">if</span> (this%is_gradient_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="comment">! Call the user-defined gradient routine</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            <span class="keyword">call </span>this%m_grad(x, g)</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="comment">! Compute the gradient via finite differences</span></div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                f = fv</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                f = this%fcn(x)</div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160; </div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="comment">! Establish step size factors</span></div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            epsmch = epsilon(epsmch)</div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;            eps = sqrt(epsmch)</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160; </div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            <span class="comment">! Compute the derivatives</span></div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                temp = x(j)</div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;                h = eps * abs(temp)</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                <span class="keywordflow">if</span> (h == zero) h = eps</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                x(j) = temp + h</div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                f1 = this%fcn(x)</div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                x(j) = temp</div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                g(j) = (f1 - f) / h</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160; </div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160; </div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_fcnnvar_helper.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__least__squares_8f90_source.html b/doc/html/nonlin__least__squares_8f90_source.html
index b7a4d8b..4a5d496 100644
--- a/doc/html/nonlin__least__squares_8f90_source.html
+++ b/doc/html/nonlin__least__squares_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_least_squares.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_least_squares.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,20 +91,705 @@
 <div class="title">nonlin_least_squares.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_least_squares.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html">    7</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keywordtype">private</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">! TYPES</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html">   21</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a>) :: <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d">   24</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_factor = 100.0d0</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e">   27</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_step_scaling_factor =&gt; lss_get_factor</div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac">   29</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_step_scaling_factor =&gt; lss_set_factor</div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5">   31</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; lss_solve</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! LEAST_SQUARES_SOLVER MEMBERS</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="keyword">pure function </span>lss_get_factor(this) <span class="keyword">result</span>(x)</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b">   50</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        x = this%m_factor</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keyword">    subroutine </span>lss_set_factor(this, x)</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2">   69</a></span>&#160;        <span class="keywordtype">class</span>(least_squares_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (x &lt; 0.1d0) <span class="keywordflow">then</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            this%m_factor = 0.1d0</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &gt; 1.0d2) <span class="keywordflow">then</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            this%m_factor = 1.0d2</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            this%m_factor = x</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="keyword">    subroutine </span>lss_solve(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992">  237</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keywordtype">class</span>(least_squares_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p0001 = 1.0d-4</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p1 = 0.1d0</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: qtr = 0.25d0</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p75 = 0.75d0</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: hndrd = 1.0d2</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg, gcnvrg</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, flag, neval, iter, j, l, maxeval, &amp;</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            njac, lwork</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: jpvt</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        <span class="keywordtype">real(real64)</span> :: ftol, xtol, gtol, fac, eps, fnorm, par, xnorm, delta, &amp;</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            sm, temp, gnorm, pnorm, fnorm1, actred, temp1, temp2, prered, &amp;</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;            dirder, ratio</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtf, wa1, wa2, wa3, wa4, w</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        gcnvrg = .false.</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        neqn = fcn%get_equation_count()</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        nvar = fcn%get_variable_count()</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        neval = 0</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        iter = 0</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        njac = 0</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        fac = this%m_factor</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        ftol = this%get_fcn_tolerance()</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        gtol = this%get_gradient_tolerance()</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;        eps = epsilon(eps)</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, &amp;</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">if</span> (nvar &gt; neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <span class="comment">! ERROR: System is underdetermined</span></div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, <span class="stringliteral">&quot;The solver cannot &quot;</span> // &amp;</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;                <span class="stringliteral">&quot;solve the underdetermined problem.  The number of &quot;</span> // &amp;</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                <span class="stringliteral">&quot;unknowns must not exceed the number of equations.&quot;</span>, &amp;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;        flag = 0</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;            flag = 3</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;            flag = 4</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;</div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;        <span class="keyword">allocate</span>(jpvt(nvar), stat = flag)</div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(jac(neqn, nvar), stat = flag)</div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(diag(nvar), stat = flag)</div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(qtf(nvar), stat = flag)</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa1(nvar), stat = flag)</div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa2(nvar), stat = flag)</div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa3(nvar), stat = flag)</div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa4(neqn), stat = flag)</div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fv = fvec, olwork = lwork)</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;            <span class="keyword">allocate</span>(w(lwork), stat = flag)</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="comment">! Evaluate the function at the starting point, and calculate its norm</span></div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;        neval = 1</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        fnorm = norm2(fvec)</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;</div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;        par = zero</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;        iter = 1</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;        flag = 0</div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;            <span class="comment">! Evaluate the Jacobian</span></div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fvec, w)</div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;            njac = njac + 1</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;            <span class="comment">! Compute the QR factorization of the Jacobian</span></div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;            <span class="keyword">call </span>lmfactor(jac, .true., jpvt, wa1, wa2, wa3)</div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;</div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;            <span class="comment">! On the first iteration, scale the problem according to the norms</span></div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            <span class="comment">! of each of the columns of the initial Jacobian</span></div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;                    diag(j) = wa2(j)</div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;                    <span class="keywordflow">if</span> (wa2(j) == zero) diag(j) = one</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                wa3 = diag * x</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                xnorm = norm2(wa3)</div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;                delta = fac * xnorm</div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;                <span class="keywordflow">if</span> (delta == zero) delta = fac</div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;</div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;            <span class="comment">! Form Q**T * FVEC, and store the first N components in QTF</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;            wa4 = fvec</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;                <span class="keywordflow">if</span> (jac(j,j) /= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;                    sm = zero</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;                    <span class="keywordflow">do</span> i = j, neqn</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;                        sm = sm + jac(i,j) * wa4(i)</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="keywordflow">                    end do</span></div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                    temp = -sm / jac(j,j)</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;                    wa4(j:neqn) = wa4(j:neqn) + jac(j:neqn,j) * temp</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 120</span></div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;                jac(j,j) = wa1(j)</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;                qtf(j) = wa4(j)</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;            <span class="comment">! Compute the norm of the scaled gradient</span></div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;            gnorm = zero</div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;            <span class="keywordflow">if</span> (fnorm /= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;                    l = jpvt(j)</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;                    <span class="keywordflow">if</span> (wa2(l) == zero) cycle</div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;                    sm = zero</div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;                    <span class="keywordflow">do</span> i = 1, j</div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;                        sm = sm + jac(i,j) * (qtf(i) / fnorm)</div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;<span class="keywordflow">                    end do</span></div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;                    gnorm = max(gnorm, abs(sm / wa2(l)))</div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 170</span></div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;</div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;            <span class="comment">! Test for convergence of the gradient norm</span></div><div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;            <span class="keywordflow">if</span> (gnorm &lt;= gtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                gcnvrg = .true.</div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;</div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;            <span class="comment">! Rescale if necessary</span></div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;            <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;                diag(j) = max(diag(j), wa2(j))</div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;</div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="comment">! Inner Loop</span></div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;            <span class="keywordflow">do</span></div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;                <span class="comment">! Determine the Levenberg-Marquardt parameter</span></div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;                <span class="keyword">call </span>lmpar(jac, jpvt, diag, qtf, delta, par, wa1, wa2, wa3, wa4)</div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;                <span class="comment">! Store the direction P, and X + P.  Calculate the norm of P</span></div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;                    wa1(j) = -wa1(j)</div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;                    wa2(j) = x(j) + wa1(j)</div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;                    wa3(j) = diag(j) * wa1(j)</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;                pnorm = norm2(wa3)</div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;                <span class="comment">! On the first iteration, adjust the initial step bounds</span></div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;                <span class="keywordflow">if</span> (iter == 1) delta = min(delta, pnorm)</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;</div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;                <span class="comment">! Evaluate the function at X + P, and calculate its norm</span></div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;                <span class="keyword">call </span>fcn%fcn(wa2, wa4)</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;                neval = neval + 1</div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;                fnorm1 = norm2(wa4)</div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;</div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;                <span class="comment">! Compute the scaled actual reduction</span></div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;                actred = -one</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;                <span class="keywordflow">if</span> (p1 * fnorm1 &lt; fnorm) actred = one - (fnorm1 / fnorm)**2</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;                <span class="comment">! Compute the scaled predicted reduction and the scaled</span></div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;                <span class="comment">! directional derivative</span></div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;                    wa3(j) = zero</div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;                    l = jpvt(j)</div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;                    temp = wa1(l)</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;                    wa3(1:j) = wa3(1:j) + jac(1:j,j) * temp</div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;                temp1 = norm2(wa3) / fnorm</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;                temp2 = (sqrt(par) * pnorm) / fnorm</div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;                prered = temp1**2 + temp2**2 / half</div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;                dirder = -(temp1**2 + temp2**2)</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;</div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;                <span class="comment">! Compute the ratio of the actual to the predicted reduction</span></div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;                ratio = zero</div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;                <span class="keywordflow">if</span> (prered /= zero) ratio = actred / prered</div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;                <span class="comment">! Update the step bounds</span></div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;                <span class="keywordflow">if</span> (ratio &lt;= qtr) <span class="keywordflow">then</span></div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;                    <span class="keywordflow">if</span> (actred &gt;= zero) temp = half</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;                    <span class="keywordflow">if</span> (actred &lt; zero) temp = half * dirder / &amp;</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;                        (dirder + half * actred)</div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;                    <span class="keywordflow">if</span> (p1 * fnorm1 &gt;= fnorm .or. temp &lt; p1) temp = p1</div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;                    delta = temp * min(delta, pnorm / p1)</div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;                    par = par / temp</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;                    <span class="keywordflow">if</span> (par /= zero .and. ratio &lt; p75) <span class="keywordflow">then</span></div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;                        <span class="comment">! NO ACTION REQUIRED</span></div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;                    <span class="keywordflow">else</span></div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;                        delta = pnorm / half</div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;                        par = half * par</div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="keywordflow">                    end if</span></div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 240</span></div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;</div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;                <span class="comment">! Test for successful iteration</span></div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;                <span class="keywordflow">if</span> (ratio &gt;= p0001) <span class="keywordflow">then</span></div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;                    <span class="keywordflow">do</span> j = 1, nvar</div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;                        x(j) = wa2(j)</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;                        wa2(j) = diag(j) * x(j)</div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;<span class="keywordflow">                    end do</span></div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                    fvec = wa4</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                    xnorm = norm2(wa2)</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;                    fnorm = fnorm1</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;                    iter = iter + 1</div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 290</span></div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;</div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;                <span class="comment">! Tests for convergence</span></div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                <span class="keywordflow">if</span> (abs(actred) &lt;= ftol .and. prered &lt;= ftol .and. &amp;</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;                    half * ratio &lt;= one) fcnvrg = .true.</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;                <span class="keywordflow">if</span> (delta &lt;= xtol * xnorm) xcnvrg = .true.</div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;                <span class="keywordflow">if</span> (fcnvrg .or. xcnvrg) <span class="keywordflow">exit</span></div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;</div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;                <span class="comment">! Tests for termination and stringent tolerances</span></div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) flag = nl_convergence_error</div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;                <span class="keywordflow">if</span> (abs(actred) &lt;= eps .and. prered &lt;= eps .and. &amp;</div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;                    half * ratio &lt;= one) flag = nl_tolerance_too_small_error</div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;                <span class="keywordflow">if</span> (delta &lt;= eps * xnorm) flag = nl_tolerance_too_small_error</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;                <span class="keywordflow">if</span> (gnorm &lt;= eps) flag = nl_tolerance_too_small_error</div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;                <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">exit</span></div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;                <span class="keywordflow">if</span> (ratio &gt;= p0001) <span class="keywordflow">exit</span></div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! End of the inner loop</span></div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;            <span class="comment">! Check for termination criteria</span></div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;            <span class="keywordflow">if</span> (fcnvrg .or. xcnvrg .or. gcnvrg .or. flag /= 0) <span class="keywordflow">exit</span></div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;</div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;            <span class="comment">! Print the iteration status</span></div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;</div><div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;</div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;                flag)</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;</div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;<span class="keyword">    subroutine </span>lmpar(r, ipvt, diag, qtb, delta, par, x, sdiag, wa1, wa2)</div><div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743">  567</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: r</div><div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div><div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtb</div><div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: delta</div><div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: par</div><div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, sdiag, wa1, wa2</div><div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;</div><div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p001 = 1.0d-3</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p1 = 0.1d0</div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;</div><div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;        <span class="keywordtype">integer</span> :: iter, j, jm1, jp1, k, l, nsing, n</div><div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;        <span class="keywordtype">real(real64)</span> :: dxnorm, dwarf, fp, gnorm, parc, parl, paru, sm, temp</div><div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;</div><div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;        n = <span class="keyword">size</span>(r, 2)  <span class="comment">! NOTE: R is M-by-N</span></div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        dwarf = tiny(dwarf)</div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;        nsing = n</div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;</div><div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;        <span class="comment">! Compute and store in X, the Gauss-Newton direction.  If the Jacobian</span></div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;        <span class="comment">! is rank deficient, obtain a least-squares solution.</span></div><div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;            wa1(j) = qtb(j)</div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;            <span class="keywordflow">if</span> (r(j,j) == zero .and. nsing == n) nsing = j - 1</div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            <span class="keywordflow">if</span> (nsing &lt; n) wa1(j) = zero</div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 10</span></div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;</div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;        <span class="keywordflow">if</span> (nsing &gt;= 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;            <span class="keywordflow">do</span> k = 1, nsing</div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;                j = nsing - k + 1</div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;                wa1(j) = wa1(j) / r(j,j)</div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                temp = wa1(j)</div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;                jm1 = j - 1</div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;                <span class="keywordflow">if</span> (jm1 &gt;= 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;                    wa1(1:jm1) = wa1(1:jm1) - r(1:jm1,j) * temp</div><div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 40</span></div><div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;</div><div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="comment">! LINE 50</span></div><div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;            l = ipvt(j)</div><div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;            x(l) = wa1(j)</div><div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;</div><div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;        <span class="comment">! Initialize the iteration counter, evaluate the function at the origin,</span></div><div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="comment">! and test for acceptance of the Gauss-Newton direction.</span></div><div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        iter = 0</div><div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        wa2(1:n) = diag * x</div><div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;        dxnorm = norm2(wa2(1:n))</div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        fp = dxnorm - delta</div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">if</span> (fp &lt;= p1 * delta) <span class="keywordflow">then</span></div><div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;            <span class="comment">! LINE 220</span></div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;            <span class="keywordflow">if</span> (iter == 0) par = zero</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;</div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! If the Jacobian is not rank deficient, the Newton step provides a</span></div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="comment">! lower bound, PARL, for the zero of the function; else, set this bound</span></div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;        <span class="comment">! to zero</span></div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        parl = zero</div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="keywordflow">if</span> (nsing == n) <span class="keywordflow">then</span></div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;                l = ipvt(j)</div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;                wa1(j) = diag(l) * (wa2(l) / dxnorm)</div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 80</span></div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;</div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;                sm = zero</div><div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;                jm1 = j - 1</div><div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;                <span class="keywordflow">if</span> (jm1 &gt;= 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;                    sm = dot_product(r(1:jm1,j), wa1(1:jm1))</div><div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;                wa1(j) = (wa1(j) - sm) / r(j,j)</div><div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 110</span></div><div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;            temp = norm2(wa1)</div><div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;            parl = ((fp / delta) / temp) / temp</div><div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;</div><div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        <span class="comment">! Calculate an upper bound, PARU, for the zero of the function</span></div><div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;            sm = dot_product(r(1:j,j), qtb(1:j))</div><div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;            l = ipvt(j)</div><div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;            wa1(j) = sm / diag(l)</div><div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 140</span></div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        gnorm = norm2(wa1)</div><div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        paru = gnorm / delta</div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        <span class="keywordflow">if</span> (paru == zero) paru = dwarf / min(delta, p1)</div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;</div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="comment">! If the input PAR lies outside of the interval (PARL,PARU), set</span></div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;        <span class="comment">! PAR to the closer end point.</span></div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;        par = max(par, parl)</div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        par = min(par, paru)</div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        <span class="keywordflow">if</span> (par == zero) par = gnorm / dxnorm</div><div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;</div><div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        <span class="comment">! Iteration</span></div><div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;            iter = iter + 1</div><div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;</div><div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            <span class="comment">! Evaluate the function at the current value of PAR</span></div><div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;            <span class="keywordflow">if</span> (par == zero) par = max(dwarf, p001 * paru)</div><div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            temp = sqrt(par)</div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;            wa1 = temp * diag</div><div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;            <span class="keyword">call </span>lmsolve(r(1:n,1:n), ipvt, wa1, qtb, x, sdiag, wa2)</div><div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;            wa2 = diag * x</div><div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;            dxnorm = norm2(wa2)</div><div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            temp = fp</div><div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;            fp = dxnorm - delta</div><div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;</div><div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;            <span class="comment">! If the function is small enough, accept the current value of PAR.</span></div><div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;            <span class="comment">! Also test for the exceptional cases where PARL is zero, or the</span></div><div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;            <span class="comment">! number of iterations has reached 10</span></div><div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;            <span class="keywordflow">if</span> (abs(fp) &lt;= p1 * delta &amp;</div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;                .or. parl == zero .and. fp &lt;= temp &amp;</div><div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                .and. temp &lt; zero .or. iter == 10) <span class="keywordflow">exit</span></div><div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;</div><div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;            <span class="comment">! Compute the Newton correction</span></div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                l = ipvt(j)</div><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;                wa1(j) = diag(l) * (wa2(l) / dxnorm)</div><div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 180</span></div><div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;                wa1(j) = wa1(j) / sdiag(j)</div><div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;                temp = wa1(j)</div><div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;                jp1 = j + 1</div><div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;                <span class="keywordflow">if</span> (n &lt; jp1) cycle</div><div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;                wa1 = wa1 - r(1:n,j) * temp</div><div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 210</span></div><div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;            temp = norm2(wa1)</div><div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;            parc = ((fp / delta) / temp) / temp</div><div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;</div><div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;            <span class="comment">! Depending on the sign of the function update PARL or PARU</span></div><div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;            <span class="keywordflow">if</span> (fp &gt; zero) parl = max(parl, par)</div><div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;            <span class="keywordflow">if</span> (fp &lt; zero) paru = min(paru, par)</div><div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;</div><div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;            <span class="comment">! Compute an improved estimate for PAR</span></div><div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;            par = max(parl, par + parc)</div><div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 220 (End of iteration)</span></div><div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;        <span class="keywordflow">if</span> (iter == zero) par = zero</div><div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        <span class="keywordflow">return</span></div><div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;</div><div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;<span class="keyword">    subroutine </span>lmfactor(a, pivot, ipvt, rdiag, acnorm, wa)</div><div class="line"><a name="l00734"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47">  734</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div><div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: pivot</div><div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div><div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: rdiag, acnorm, wa</div><div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;</div><div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p05 = 5.0d-2</div><div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;</div><div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n, i, j, jp1, k, kmax, minmn</div><div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;        <span class="keywordtype">real(real64)</span> :: ajnorm, epsmch, sm, temp</div><div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;</div><div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;        m = <span class="keyword">size</span>(a, 1)</div><div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;        n = <span class="keyword">size</span>(a, 2)</div><div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;        minmn = min(m, n)</div><div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;        epsmch = epsilon(epsmch)</div><div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;</div><div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        <span class="comment">! Compute the initial column norms, and initialize several arrays</span></div><div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;            acnorm(j) = norm2(a(:,j))</div><div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;            rdiag(j) = acnorm(j)</div><div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;            wa(j) = rdiag(j)</div><div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;            <span class="keywordflow">if</span> (pivot) ipvt(j) = j</div><div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 10</span></div><div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;</div><div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;        <span class="comment">! Reduce A to R with Householder transformations</span></div><div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;        <span class="keywordflow">do</span> j = 1, minmn</div><div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;            <span class="keywordflow">if</span> (pivot) <span class="keywordflow">then</span></div><div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;                <span class="comment">! Bring the column of largest norm into the pivot position</span></div><div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;                kmax = j</div><div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;                <span class="keywordflow">do</span> k = j, n</div><div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;                    <span class="keywordflow">if</span> (rdiag(k) &gt; rdiag(kmax)) kmax = k</div><div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;<span class="keywordflow">                end do</span> <span class="comment">! LINE 20</span></div><div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;                <span class="keywordflow">if</span> (kmax /= j) <span class="keywordflow">then</span></div><div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;                    <span class="keywordflow">do</span> i = 1, m</div><div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;                        temp = a(i,j)</div><div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;                        a(i,j) = a(i,kmax)</div><div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;                        a(i,kmax) = temp</div><div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 30</span></div><div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;                    rdiag(kmax) = rdiag(j)</div><div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;                    wa(kmax) = wa(j)</div><div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;                    k = ipvt(j)</div><div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;                    ipvt(j) = ipvt(kmax)</div><div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;                    ipvt(kmax) = k</div><div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 40</span></div><div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;</div><div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;            <span class="comment">! Compute the Householder transformation to reduce the J-th column</span></div><div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;            <span class="comment">! of A to a multiple of the J-th unit vector</span></div><div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;            ajnorm = norm2(a(j:m,j))</div><div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;            <span class="keywordflow">if</span> (ajnorm /= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;                <span class="keywordflow">if</span> (a(j,j) &lt; zero) ajnorm = -ajnorm</div><div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;                a(j:m,j) = a(j:m,j) / ajnorm</div><div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;                a(j,j) = a(j,j) + one</div><div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;</div><div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;                <span class="comment">! Apply the transformation to the remaining columns and update</span></div><div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;                <span class="comment">! the norms</span></div><div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;                jp1 = j + 1</div><div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;                <span class="keywordflow">if</span> (n &gt;= jp1) <span class="keywordflow">then</span></div><div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;                    <span class="keywordflow">do</span> k = jp1, n</div><div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;                        sm = dot_product(a(j:m,j), a(j:m,k))</div><div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;                        temp = sm / a(j,j)</div><div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;                        a(j:m,k) = a(j:m,k) - temp * a(j:m,j)</div><div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;                        <span class="keywordflow">if</span> (.not.pivot .or. rdiag(k) == zero) cycle</div><div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;                        temp = a(j,k) / rdiag(k)</div><div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;                        rdiag(k) = rdiag(k) * sqrt(max(zero, one - temp**2))</div><div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;                        <span class="keywordflow">if</span> (p05 * (rdiag(k) / wa(k))**2 &gt; epsmch) cycle</div><div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;                        rdiag(k) = norm2(a(jp1:m,k))</div><div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;                        wa(k) = rdiag(k)</div><div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 90</span></div><div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 100</span></div><div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;            rdiag(j) = -ajnorm</div><div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 110</span></div><div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;</div><div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;<span class="keyword">    subroutine </span>lmsolve(r, ipvt, diag, qtb, x, sdiag, wa)</div><div class="line"><a name="l00837"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483">  837</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: r</div><div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div><div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtb</div><div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, sdiag, wa</div><div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;</div><div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: qtr = 0.25d0</div><div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;</div><div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n, i, j, jp1, k, kp1, l, nsing</div><div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;        <span class="keywordtype">real(real64)</span> :: cs, ctan, qtbpj, sn, sm, tn, temp</div><div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;</div><div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;        n = <span class="keyword">size</span>(r, 1)</div><div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;</div><div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;        <span class="comment">! Copy R and Q**T*B to preserve inputs and initialize S</span></div><div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;            r(j:n,j) = r(j,j:n)</div><div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;            x(j) = r(j,j)</div><div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;            wa(j) = qtb(j)</div><div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 20</span></div><div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;</div><div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        <span class="comment">! Eliminate the diagonal matrix D using a Givens rotation</span></div><div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;            <span class="comment">! Prepare the row of D to be eliminated, locating the diagonal</span></div><div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;            <span class="comment">! element using P from the QR factorization</span></div><div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;            l = ipvt(j)</div><div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;            <span class="keywordflow">if</span> (diag(l) /= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;                sdiag(j:n) = zero</div><div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;                sdiag(j) = diag(l)</div><div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;</div><div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;                <span class="comment">! The transformations to eliminate the row of D modify only a</span></div><div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;                <span class="comment">! single element of Q**T * B beyond the first N, which is</span></div><div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;                <span class="comment">! initially zero.</span></div><div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;                qtbpj = zero</div><div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;                <span class="keywordflow">do</span> k = j, n</div><div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;                    <span class="comment">! Determine a Givens rotation which eliminates the</span></div><div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;                    <span class="comment">! appropriate element in the current row of D</span></div><div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;                    <span class="keywordflow">if</span> (sdiag(k) == zero) cycle</div><div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;                    <span class="keywordflow">if</span> (abs(r(k,k)) &lt; abs(sdiag(k))) <span class="keywordflow">then</span></div><div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;                        ctan = r(k,k) / sdiag(k)</div><div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;                        sn = half / sqrt(qtr + qtr * ctan**2)</div><div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;                        cs = sn * ctan</div><div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;                    <span class="keywordflow">else</span></div><div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;                        tn = sdiag(k) / r(k,k)</div><div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;                        cs = half / sqrt(qtr + qtr * tn**2)</div><div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;                        sn = cs * tn</div><div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;<span class="keywordflow">                    end if</span></div><div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;</div><div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;                    <span class="comment">! Compute the modified diagonal element of R and the</span></div><div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;                    <span class="comment">! modified element of Q**T * B</span></div><div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;                    r(k,k) = cs * r(k,k) + sn * sdiag(k)</div><div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;                    temp = cs * wa(k) + sn * qtbpj</div><div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;                    qtbpj = -sn * wa(k) + cs * qtbpj</div><div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;                    wa(k) = temp</div><div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;</div><div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;                    <span class="comment">! Accumulate the transformation in the row of S</span></div><div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;                    kp1 = k + 1</div><div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;                    <span class="keywordflow">if</span> (n &lt; kp1) cycle</div><div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;                    <span class="keywordflow">do</span> i = kp1, n</div><div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                        temp = cs * r(i,k) + sn * sdiag(i)</div><div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;                        sdiag(i) = -sn * r(i,k) + cs * sdiag(i)</div><div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;                        r(i,k) = temp</div><div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 60</span></div><div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;<span class="keywordflow">                end do</span> <span class="comment">! LINE 80</span></div><div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;</div><div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;            <span class="comment">! Store the diagonal element of S and restore the corresponding</span></div><div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;            <span class="comment">! diagonal element of R</span></div><div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;            sdiag(j) = r(j,j)</div><div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;            r(j,j) = x(j)</div><div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 100</span></div><div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;</div><div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        <span class="comment">! Solve the triangular system.  If the system is singular, then obtain a</span></div><div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;        <span class="comment">! least-squares solution</span></div><div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;        nsing = n</div><div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            <span class="keywordflow">if</span> (sdiag(j) == zero .and. nsing == n) nsing = j - 1</div><div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;            <span class="keywordflow">if</span> (nsing &lt; n) wa(j) = zero</div><div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 110</span></div><div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        <span class="keywordflow">if</span> (nsing &gt;= 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="keywordflow">do</span> k = 1, nsing</div><div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                j = nsing - k + 1</div><div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;                sm = zero</div><div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;                jp1 = j + 1</div><div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;                <span class="keywordflow">if</span> (nsing &gt;= jp1) <span class="keywordflow">then</span></div><div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;                    sm = dot_product(r(jp1:nsing,j), wa(jp1:nsing))</div><div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                wa(j) = (wa(j) - sm) / sdiag(j)</div><div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 140</span></div><div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;</div><div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;        <span class="comment">! Permute the components of Z back to components of X</span></div><div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;            l = ipvt(j)</div><div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;            x(l) = wa(j)</div><div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 160</span></div><div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;</div><div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="structnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
-<div class="ttc" id="namespacenonlin__least__squares_html"><div class="ttname"><a href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="ttdoc">nonlin_least_squares </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00007">nonlin_least_squares.f90:7</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="structnonlin__least__squares_1_1least__squares__solver_html"><div class="ttname"><a href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></div><div class="ttdoc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00021">nonlin_least_squares.f90:21</a></div></div>
-<div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_least_squares.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html">    7</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160; </div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">! TYPES</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00021"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html">   21</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a>) :: <a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d">   24</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_factor = 100.0d0</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e">   27</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_step_scaling_factor =&gt; lss_get_factor</div>
+<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac">   29</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_step_scaling_factor =&gt; lss_set_factor</div>
+<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5">   31</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; lss_solve</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160; </div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! LEAST_SQUARES_SOLVER MEMBERS</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>lss_get_factor(this) <span class="keyword">result</span>(x)</div>
+<div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b">   50</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        x = this%m_factor</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160; </div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    <span class="keyword">subroutine </span>lss_set_factor(this, x)</div>
+<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2">   69</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (x &lt; 0.1d0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            this%m_factor = 0.1d0</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &gt; 1.0d2) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            this%m_factor = 1.0d2</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            this%m_factor = x</div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160; </div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    <span class="keyword">subroutine </span>lss_solve(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992">  237</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160; </div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p0001 = 1.0d-4</div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p1 = 0.1d0</div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: qtr = 0.25d0</div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p75 = 0.75d0</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: hndrd = 1.0d2</div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160; </div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg, gcnvrg</div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, flag, neval, iter, j, l, maxeval, &amp;</div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            njac, lwork</div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: jpvt</div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;<span class="keywordtype">        real</span>(real64) :: ftol, xtol, gtol, fac, eps, fnorm, par, xnorm, delta, &amp;</div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            sm, temp, gnorm, pnorm, fnorm1, actred, temp1, temp2, prered, &amp;</div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;            dirder, ratio</div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtf, wa1, wa2, wa3, wa4, w</div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160; </div>
+<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        gcnvrg = .false.</div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        neqn = fcn%get_equation_count()</div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        nvar = fcn%get_variable_count()</div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        njac = 0</div>
+<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        fac = this%m_factor</div>
+<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        ftol = this%get_fcn_tolerance()</div>
+<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        gtol = this%get_gradient_tolerance()</div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;        eps = epsilon(eps)</div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160; </div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">if</span> (nvar &gt; neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <span class="comment">! ERROR: System is underdetermined</span></div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, <span class="stringliteral">&quot;The solver cannot &quot;</span> // &amp;</div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;                <span class="stringliteral">&quot;solve the underdetermined problem.  The number of &quot;</span> // &amp;</div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                <span class="stringliteral">&quot;unknowns must not exceed the number of equations.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;            flag = 4</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160; </div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;        <span class="keyword">allocate</span>(jpvt(nvar), stat = flag)</div>
+<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(jac(neqn, nvar), stat = flag)</div>
+<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(diag(nvar), stat = flag)</div>
+<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(qtf(nvar), stat = flag)</div>
+<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa1(nvar), stat = flag)</div>
+<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa2(nvar), stat = flag)</div>
+<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa3(nvar), stat = flag)</div>
+<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(wa4(neqn), stat = flag)</div>
+<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fv = fvec, olwork = lwork)</div>
+<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;            <span class="keyword">allocate</span>(w(lwork), stat = flag)</div>
+<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160; </div>
+<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="comment">! Evaluate the function at the starting point, and calculate its norm</span></div>
+<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;        neval = 1</div>
+<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        fnorm = norm2(fvec)</div>
+<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160; </div>
+<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;        par = zero</div>
+<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;        iter = 1</div>
+<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;            <span class="comment">! Evaluate the Jacobian</span></div>
+<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fvec, w)</div>
+<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;            njac = njac + 1</div>
+<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160; </div>
+<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;            <span class="comment">! Compute the QR factorization of the Jacobian</span></div>
+<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;            <span class="keyword">call </span>lmfactor(jac, .true., jpvt, wa1, wa2, wa3)</div>
+<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160; </div>
+<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;            <span class="comment">! On the first iteration, scale the problem according to the norms</span></div>
+<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            <span class="comment">! of each of the columns of the initial Jacobian</span></div>
+<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;                    diag(j) = wa2(j)</div>
+<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;                    <span class="keywordflow">if</span> (wa2(j) == zero) diag(j) = one</div>
+<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                wa3 = diag * x</div>
+<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                xnorm = norm2(wa3)</div>
+<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;                delta = fac * xnorm</div>
+<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;                <span class="keywordflow">if</span> (delta == zero) delta = fac</div>
+<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160; </div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;            <span class="comment">! Form Q**T * FVEC, and store the first N components in QTF</span></div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;            wa4 = fvec</div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;                <span class="keywordflow">if</span> (jac(j,j) /= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;                    sm = zero</div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;                    <span class="keywordflow">do</span> i = j, neqn</div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;                        sm = sm + jac(i,j) * wa4(i)</div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="keywordflow">                    end do</span></div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;                    temp = -sm / jac(j,j)</div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;                    wa4(j:neqn) = wa4(j:neqn) + jac(j:neqn,j) * temp</div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 120</span></div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;                jac(j,j) = wa1(j)</div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;                qtf(j) = wa4(j)</div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160; </div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;            <span class="comment">! Compute the norm of the scaled gradient</span></div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;            gnorm = zero</div>
+<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;            <span class="keywordflow">if</span> (fnorm /= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;                    l = jpvt(j)</div>
+<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;                    <span class="keywordflow">if</span> (wa2(l) == zero) cycle</div>
+<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;                    sm = zero</div>
+<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;                    <span class="keywordflow">do</span> i = 1, j</div>
+<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;                        sm = sm + jac(i,j) * (qtf(i) / fnorm)</div>
+<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;<span class="keywordflow">                    end do</span></div>
+<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;                    gnorm = max(gnorm, abs(sm / wa2(l)))</div>
+<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 170</span></div>
+<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160; </div>
+<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;            <span class="comment">! Test for convergence of the gradient norm</span></div>
+<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;            <span class="keywordflow">if</span> (gnorm &lt;= gtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                gcnvrg = .true.</div>
+<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160; </div>
+<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;            <span class="comment">! Rescale if necessary</span></div>
+<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;            <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;                diag(j) = max(diag(j), wa2(j))</div>
+<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160; </div>
+<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="comment">! Inner Loop</span></div>
+<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;            <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;                <span class="comment">! Determine the Levenberg-Marquardt parameter</span></div>
+<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;                <span class="keyword">call </span>lmpar(jac, jpvt, diag, qtf, delta, par, wa1, wa2, wa3, wa4)</div>
+<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160; </div>
+<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;                <span class="comment">! Store the direction P, and X + P.  Calculate the norm of P</span></div>
+<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;                    wa1(j) = -wa1(j)</div>
+<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;                    wa2(j) = x(j) + wa1(j)</div>
+<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;                    wa3(j) = diag(j) * wa1(j)</div>
+<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;                pnorm = norm2(wa3)</div>
+<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160; </div>
+<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;                <span class="comment">! On the first iteration, adjust the initial step bounds</span></div>
+<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;                <span class="keywordflow">if</span> (iter == 1) delta = min(delta, pnorm)</div>
+<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160; </div>
+<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;                <span class="comment">! Evaluate the function at X + P, and calculate its norm</span></div>
+<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;                <span class="keyword">call </span>fcn%fcn(wa2, wa4)</div>
+<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;                neval = neval + 1</div>
+<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;                fnorm1 = norm2(wa4)</div>
+<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160; </div>
+<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;                <span class="comment">! Compute the scaled actual reduction</span></div>
+<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;                actred = -one</div>
+<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;                <span class="keywordflow">if</span> (p1 * fnorm1 &lt; fnorm) actred = one - (fnorm1 / fnorm)**2</div>
+<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160; </div>
+<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;                <span class="comment">! Compute the scaled predicted reduction and the scaled</span></div>
+<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;                <span class="comment">! directional derivative</span></div>
+<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;                <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;                    wa3(j) = zero</div>
+<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;                    l = jpvt(j)</div>
+<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;                    temp = wa1(l)</div>
+<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;                    wa3(1:j) = wa3(1:j) + jac(1:j,j) * temp</div>
+<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;                temp1 = norm2(wa3) / fnorm</div>
+<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;                temp2 = (sqrt(par) * pnorm) / fnorm</div>
+<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;                prered = temp1**2 + temp2**2 / half</div>
+<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;                dirder = -(temp1**2 + temp2**2)</div>
+<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160; </div>
+<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;                <span class="comment">! Compute the ratio of the actual to the predicted reduction</span></div>
+<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;                ratio = zero</div>
+<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;                <span class="keywordflow">if</span> (prered /= zero) ratio = actred / prered</div>
+<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160; </div>
+<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;                <span class="comment">! Update the step bounds</span></div>
+<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;                <span class="keywordflow">if</span> (ratio &lt;= qtr) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;                    <span class="keywordflow">if</span> (actred &gt;= zero) temp = half</div>
+<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;                    <span class="keywordflow">if</span> (actred &lt; zero) temp = half * dirder / &amp;</div>
+<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;                        (dirder + half * actred)</div>
+<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;                    <span class="keywordflow">if</span> (p1 * fnorm1 &gt;= fnorm .or. temp &lt; p1) temp = p1</div>
+<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;                    delta = temp * min(delta, pnorm / p1)</div>
+<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;                    par = par / temp</div>
+<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;                    <span class="keywordflow">if</span> (par /= zero .and. ratio &lt; p75) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;                        <span class="comment">! NO ACTION REQUIRED</span></div>
+<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;                    <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;                        delta = pnorm / half</div>
+<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;                        par = half * par</div>
+<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="keywordflow">                    end if</span></div>
+<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 240</span></div>
+<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160; </div>
+<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;                <span class="comment">! Test for successful iteration</span></div>
+<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;                <span class="keywordflow">if</span> (ratio &gt;= p0001) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;                    <span class="keywordflow">do</span> j = 1, nvar</div>
+<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;                        x(j) = wa2(j)</div>
+<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;                        wa2(j) = diag(j) * x(j)</div>
+<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;<span class="keywordflow">                    end do</span></div>
+<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                    fvec = wa4</div>
+<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                    xnorm = norm2(wa2)</div>
+<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;                    fnorm = fnorm1</div>
+<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;                    iter = iter + 1</div>
+<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! LINE 290</span></div>
+<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160; </div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;                <span class="comment">! Tests for convergence</span></div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                <span class="keywordflow">if</span> (abs(actred) &lt;= ftol .and. prered &lt;= ftol .and. &amp;</div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;                    half * ratio &lt;= one) fcnvrg = .true.</div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;                <span class="keywordflow">if</span> (delta &lt;= xtol * xnorm) xcnvrg = .true.</div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;                <span class="keywordflow">if</span> (fcnvrg .or. xcnvrg) <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160; </div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;                <span class="comment">! Tests for termination and stringent tolerances</span></div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) flag = nl_convergence_error</div>
+<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;                <span class="keywordflow">if</span> (abs(actred) &lt;= eps .and. prered &lt;= eps .and. &amp;</div>
+<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;                    half * ratio &lt;= one) flag = nl_tolerance_too_small_error</div>
+<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;                <span class="keywordflow">if</span> (delta &lt;= eps * xnorm) flag = nl_tolerance_too_small_error</div>
+<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;                <span class="keywordflow">if</span> (gnorm &lt;= eps) flag = nl_tolerance_too_small_error</div>
+<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;                <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160; </div>
+<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;                <span class="keywordflow">if</span> (ratio &gt;= p0001) <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! End of the inner loop</span></div>
+<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160; </div>
+<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;            <span class="comment">! Check for termination criteria</span></div>
+<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;            <span class="keywordflow">if</span> (fcnvrg .or. xcnvrg .or. gcnvrg .or. flag /= 0) <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160; </div>
+<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;            <span class="comment">! Print the iteration status</span></div>
+<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div>
+<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160; </div>
+<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160; </div>
+<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div>
+<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;lss_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;                flag)</div>
+<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160; </div>
+<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;    <span class="keyword">subroutine </span>lmpar(r, ipvt, diag, qtb, delta, par, x, sdiag, wa1, wa2)</div>
+<div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743">  567</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: r</div>
+<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div>
+<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtb</div>
+<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: delta</div>
+<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span> :: par</div>
+<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, sdiag, wa1, wa2</div>
+<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160; </div>
+<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p001 = 1.0d-3</div>
+<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p1 = 0.1d0</div>
+<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160; </div>
+<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;        <span class="keywordtype">integer</span> :: iter, j, jm1, jp1, k, l, nsing, n</div>
+<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;<span class="keywordtype">        real</span>(real64) :: dxnorm, dwarf, fp, gnorm, parc, parl, paru, sm, temp</div>
+<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160; </div>
+<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;        n = <span class="keyword">size</span>(r, 2)  <span class="comment">! NOTE: R is M-by-N</span></div>
+<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;        dwarf = tiny(dwarf)</div>
+<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;        nsing = n</div>
+<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160; </div>
+<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;        <span class="comment">! Compute and store in X, the Gauss-Newton direction.  If the Jacobian</span></div>
+<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;        <span class="comment">! is rank deficient, obtain a least-squares solution.</span></div>
+<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;            wa1(j) = qtb(j)</div>
+<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;            <span class="keywordflow">if</span> (r(j,j) == zero .and. nsing == n) nsing = j - 1</div>
+<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            <span class="keywordflow">if</span> (nsing &lt; n) wa1(j) = zero</div>
+<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 10</span></div>
+<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160; </div>
+<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;        <span class="keywordflow">if</span> (nsing &gt;= 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;            <span class="keywordflow">do</span> k = 1, nsing</div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;                j = nsing - k + 1</div>
+<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;                wa1(j) = wa1(j) / r(j,j)</div>
+<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                temp = wa1(j)</div>
+<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;                jm1 = j - 1</div>
+<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;                <span class="keywordflow">if</span> (jm1 &gt;= 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;                    wa1(1:jm1) = wa1(1:jm1) - r(1:jm1,j) * temp</div>
+<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 40</span></div>
+<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160; </div>
+<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="comment">! LINE 50</span></div>
+<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;            l = ipvt(j)</div>
+<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;            x(l) = wa1(j)</div>
+<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160; </div>
+<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;        <span class="comment">! Initialize the iteration counter, evaluate the function at the origin,</span></div>
+<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="comment">! and test for acceptance of the Gauss-Newton direction.</span></div>
+<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        wa2(1:n) = diag * x</div>
+<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;        dxnorm = norm2(wa2(1:n))</div>
+<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        fp = dxnorm - delta</div>
+<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">if</span> (fp &lt;= p1 * delta) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;            <span class="comment">! LINE 220</span></div>
+<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;            <span class="keywordflow">if</span> (iter == 0) par = zero</div>
+<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160; </div>
+<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! If the Jacobian is not rank deficient, the Newton step provides a</span></div>
+<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="comment">! lower bound, PARL, for the zero of the function; else, set this bound</span></div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;        <span class="comment">! to zero</span></div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        parl = zero</div>
+<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="keywordflow">if</span> (nsing == n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;                l = ipvt(j)</div>
+<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;                wa1(j) = diag(l) * (wa2(l) / dxnorm)</div>
+<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 80</span></div>
+<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160; </div>
+<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;                sm = zero</div>
+<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;                jm1 = j - 1</div>
+<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;                <span class="keywordflow">if</span> (jm1 &gt;= 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;                    sm = dot_product(r(1:jm1,j), wa1(1:jm1))</div>
+<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;                wa1(j) = (wa1(j) - sm) / r(j,j)</div>
+<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 110</span></div>
+<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;            temp = norm2(wa1)</div>
+<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;            parl = ((fp / delta) / temp) / temp</div>
+<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160; </div>
+<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        <span class="comment">! Calculate an upper bound, PARU, for the zero of the function</span></div>
+<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;            sm = dot_product(r(1:j,j), qtb(1:j))</div>
+<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;            l = ipvt(j)</div>
+<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;            wa1(j) = sm / diag(l)</div>
+<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 140</span></div>
+<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        gnorm = norm2(wa1)</div>
+<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        paru = gnorm / delta</div>
+<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        <span class="keywordflow">if</span> (paru == zero) paru = dwarf / min(delta, p1)</div>
+<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160; </div>
+<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="comment">! If the input PAR lies outside of the interval (PARL,PARU), set</span></div>
+<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;        <span class="comment">! PAR to the closer end point.</span></div>
+<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;        par = max(par, parl)</div>
+<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        par = min(par, paru)</div>
+<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        <span class="keywordflow">if</span> (par == zero) par = gnorm / dxnorm</div>
+<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160; </div>
+<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        <span class="comment">! Iteration</span></div>
+<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;            iter = iter + 1</div>
+<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160; </div>
+<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            <span class="comment">! Evaluate the function at the current value of PAR</span></div>
+<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;            <span class="keywordflow">if</span> (par == zero) par = max(dwarf, p001 * paru)</div>
+<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            temp = sqrt(par)</div>
+<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;            wa1 = temp * diag</div>
+<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;            <span class="keyword">call </span>lmsolve(r(1:n,1:n), ipvt, wa1, qtb, x, sdiag, wa2)</div>
+<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;            wa2 = diag * x</div>
+<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;            dxnorm = norm2(wa2)</div>
+<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            temp = fp</div>
+<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;            fp = dxnorm - delta</div>
+<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160; </div>
+<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;            <span class="comment">! If the function is small enough, accept the current value of PAR.</span></div>
+<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;            <span class="comment">! Also test for the exceptional cases where PARL is zero, or the</span></div>
+<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;            <span class="comment">! number of iterations has reached 10</span></div>
+<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;            <span class="keywordflow">if</span> (abs(fp) &lt;= p1 * delta &amp;</div>
+<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;                .or. parl == zero .and. fp &lt;= temp &amp;</div>
+<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                .and. temp &lt; zero .or. iter == 10) <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160; </div>
+<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;            <span class="comment">! Compute the Newton correction</span></div>
+<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                l = ipvt(j)</div>
+<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;                wa1(j) = diag(l) * (wa2(l) / dxnorm)</div>
+<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 180</span></div>
+<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;                wa1(j) = wa1(j) / sdiag(j)</div>
+<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;                temp = wa1(j)</div>
+<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;                jp1 = j + 1</div>
+<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;                <span class="keywordflow">if</span> (n &lt; jp1) cycle</div>
+<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;                wa1 = wa1 - r(1:n,j) * temp</div>
+<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 210</span></div>
+<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;            temp = norm2(wa1)</div>
+<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;            parc = ((fp / delta) / temp) / temp</div>
+<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160; </div>
+<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;            <span class="comment">! Depending on the sign of the function update PARL or PARU</span></div>
+<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;            <span class="keywordflow">if</span> (fp &gt; zero) parl = max(parl, par)</div>
+<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;            <span class="keywordflow">if</span> (fp &lt; zero) paru = min(paru, par)</div>
+<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160; </div>
+<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;            <span class="comment">! Compute an improved estimate for PAR</span></div>
+<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;            par = max(parl, par + parc)</div>
+<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 220 (End of iteration)</span></div>
+<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;        <span class="keywordflow">if</span> (iter == zero) par = zero</div>
+<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160; </div>
+<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;    <span class="keyword">subroutine </span>lmfactor(a, pivot, ipvt, rdiag, acnorm, wa)</div>
+<div class="line"><a name="l00734"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47">  734</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div>
+<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: pivot</div>
+<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div>
+<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: rdiag, acnorm, wa</div>
+<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160; </div>
+<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p05 = 5.0d-2</div>
+<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160; </div>
+<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n, i, j, jp1, k, kmax, minmn</div>
+<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;<span class="keywordtype">        real</span>(real64) :: ajnorm, epsmch, sm, temp</div>
+<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160; </div>
+<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;        m = <span class="keyword">size</span>(a, 1)</div>
+<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;        n = <span class="keyword">size</span>(a, 2)</div>
+<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;        minmn = min(m, n)</div>
+<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;        epsmch = epsilon(epsmch)</div>
+<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160; </div>
+<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        <span class="comment">! Compute the initial column norms, and initialize several arrays</span></div>
+<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;            acnorm(j) = norm2(a(:,j))</div>
+<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;            rdiag(j) = acnorm(j)</div>
+<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;            wa(j) = rdiag(j)</div>
+<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;            <span class="keywordflow">if</span> (pivot) ipvt(j) = j</div>
+<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 10</span></div>
+<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160; </div>
+<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;        <span class="comment">! Reduce A to R with Householder transformations</span></div>
+<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;        <span class="keywordflow">do</span> j = 1, minmn</div>
+<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;            <span class="keywordflow">if</span> (pivot) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;                <span class="comment">! Bring the column of largest norm into the pivot position</span></div>
+<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;                kmax = j</div>
+<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;                <span class="keywordflow">do</span> k = j, n</div>
+<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;                    <span class="keywordflow">if</span> (rdiag(k) &gt; rdiag(kmax)) kmax = k</div>
+<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;<span class="keywordflow">                end do</span> <span class="comment">! LINE 20</span></div>
+<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;                <span class="keywordflow">if</span> (kmax /= j) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;                    <span class="keywordflow">do</span> i = 1, m</div>
+<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;                        temp = a(i,j)</div>
+<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;                        a(i,j) = a(i,kmax)</div>
+<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;                        a(i,kmax) = temp</div>
+<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 30</span></div>
+<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;                    rdiag(kmax) = rdiag(j)</div>
+<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;                    wa(kmax) = wa(j)</div>
+<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;                    k = ipvt(j)</div>
+<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;                    ipvt(j) = ipvt(kmax)</div>
+<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;                    ipvt(kmax) = k</div>
+<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 40</span></div>
+<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160; </div>
+<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;            <span class="comment">! Compute the Householder transformation to reduce the J-th column</span></div>
+<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;            <span class="comment">! of A to a multiple of the J-th unit vector</span></div>
+<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;            ajnorm = norm2(a(j:m,j))</div>
+<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;            <span class="keywordflow">if</span> (ajnorm /= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;                <span class="keywordflow">if</span> (a(j,j) &lt; zero) ajnorm = -ajnorm</div>
+<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;                a(j:m,j) = a(j:m,j) / ajnorm</div>
+<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;                a(j,j) = a(j,j) + one</div>
+<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160; </div>
+<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;                <span class="comment">! Apply the transformation to the remaining columns and update</span></div>
+<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;                <span class="comment">! the norms</span></div>
+<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;                jp1 = j + 1</div>
+<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;                <span class="keywordflow">if</span> (n &gt;= jp1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;                    <span class="keywordflow">do</span> k = jp1, n</div>
+<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;                        sm = dot_product(a(j:m,j), a(j:m,k))</div>
+<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;                        temp = sm / a(j,j)</div>
+<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;                        a(j:m,k) = a(j:m,k) - temp * a(j:m,j)</div>
+<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;                        <span class="keywordflow">if</span> (.not.pivot .or. rdiag(k) == zero) cycle</div>
+<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;                        temp = a(j,k) / rdiag(k)</div>
+<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;                        rdiag(k) = rdiag(k) * sqrt(max(zero, one - temp**2))</div>
+<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;                        <span class="keywordflow">if</span> (p05 * (rdiag(k) / wa(k))**2 &gt; epsmch) cycle</div>
+<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;                        rdiag(k) = norm2(a(jp1:m,k))</div>
+<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;                        wa(k) = rdiag(k)</div>
+<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 90</span></div>
+<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="keywordflow">            end if</span> <span class="comment">! LINE 100</span></div>
+<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;            rdiag(j) = -ajnorm</div>
+<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 110</span></div>
+<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160; </div>
+<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;    <span class="keyword">subroutine </span>lmsolve(r, ipvt, diag, qtb, x, sdiag, wa)</div>
+<div class="line"><a name="l00837"></a><span class="lineno"><a class="line" href="namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483">  837</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:,:)</span> :: r</div>
+<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div>
+<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: diag, qtb</div>
+<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, sdiag, wa</div>
+<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160; </div>
+<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: qtr = 0.25d0</div>
+<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160; </div>
+<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n, i, j, jp1, k, kp1, l, nsing</div>
+<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;<span class="keywordtype">        real</span>(real64) :: cs, ctan, qtbpj, sn, sm, tn, temp</div>
+<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160; </div>
+<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;        n = <span class="keyword">size</span>(r, 1)</div>
+<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160; </div>
+<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;        <span class="comment">! Copy R and Q**T*B to preserve inputs and initialize S</span></div>
+<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;            r(j:n,j) = r(j,j:n)</div>
+<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;            x(j) = r(j,j)</div>
+<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;            wa(j) = qtb(j)</div>
+<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 20</span></div>
+<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160; </div>
+<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        <span class="comment">! Eliminate the diagonal matrix D using a Givens rotation</span></div>
+<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;            <span class="comment">! Prepare the row of D to be eliminated, locating the diagonal</span></div>
+<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;            <span class="comment">! element using P from the QR factorization</span></div>
+<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;            l = ipvt(j)</div>
+<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;            <span class="keywordflow">if</span> (diag(l) /= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;                sdiag(j:n) = zero</div>
+<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;                sdiag(j) = diag(l)</div>
+<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160; </div>
+<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;                <span class="comment">! The transformations to eliminate the row of D modify only a</span></div>
+<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;                <span class="comment">! single element of Q**T * B beyond the first N, which is</span></div>
+<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;                <span class="comment">! initially zero.</span></div>
+<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;                qtbpj = zero</div>
+<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;                <span class="keywordflow">do</span> k = j, n</div>
+<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;                    <span class="comment">! Determine a Givens rotation which eliminates the</span></div>
+<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;                    <span class="comment">! appropriate element in the current row of D</span></div>
+<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;                    <span class="keywordflow">if</span> (sdiag(k) == zero) cycle</div>
+<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;                    <span class="keywordflow">if</span> (abs(r(k,k)) &lt; abs(sdiag(k))) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;                        ctan = r(k,k) / sdiag(k)</div>
+<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;                        sn = half / sqrt(qtr + qtr * ctan**2)</div>
+<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;                        cs = sn * ctan</div>
+<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;                    <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;                        tn = sdiag(k) / r(k,k)</div>
+<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;                        cs = half / sqrt(qtr + qtr * tn**2)</div>
+<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;                        sn = cs * tn</div>
+<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;<span class="keywordflow">                    end if</span></div>
+<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160; </div>
+<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;                    <span class="comment">! Compute the modified diagonal element of R and the</span></div>
+<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;                    <span class="comment">! modified element of Q**T * B</span></div>
+<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;                    r(k,k) = cs * r(k,k) + sn * sdiag(k)</div>
+<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;                    temp = cs * wa(k) + sn * qtbpj</div>
+<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;                    qtbpj = -sn * wa(k) + cs * qtbpj</div>
+<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;                    wa(k) = temp</div>
+<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160; </div>
+<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;                    <span class="comment">! Accumulate the transformation in the row of S</span></div>
+<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;                    kp1 = k + 1</div>
+<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;                    <span class="keywordflow">if</span> (n &lt; kp1) cycle</div>
+<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;                    <span class="keywordflow">do</span> i = kp1, n</div>
+<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                        temp = cs * r(i,k) + sn * sdiag(i)</div>
+<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;                        sdiag(i) = -sn * r(i,k) + cs * sdiag(i)</div>
+<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;                        r(i,k) = temp</div>
+<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="keywordflow">                    end do</span> <span class="comment">! LINE 60</span></div>
+<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;<span class="keywordflow">                end do</span> <span class="comment">! LINE 80</span></div>
+<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160; </div>
+<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;            <span class="comment">! Store the diagonal element of S and restore the corresponding</span></div>
+<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;            <span class="comment">! diagonal element of R</span></div>
+<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;            sdiag(j) = r(j,j)</div>
+<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;            r(j,j) = x(j)</div>
+<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 100</span></div>
+<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160; </div>
+<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        <span class="comment">! Solve the triangular system.  If the system is singular, then obtain a</span></div>
+<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;        <span class="comment">! least-squares solution</span></div>
+<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;        nsing = n</div>
+<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            <span class="keywordflow">if</span> (sdiag(j) == zero .and. nsing == n) nsing = j - 1</div>
+<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;            <span class="keywordflow">if</span> (nsing &lt; n) wa(j) = zero</div>
+<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 110</span></div>
+<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        <span class="keywordflow">if</span> (nsing &gt;= 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="keywordflow">do</span> k = 1, nsing</div>
+<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                j = nsing - k + 1</div>
+<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;                sm = zero</div>
+<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;                jp1 = j + 1</div>
+<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;                <span class="keywordflow">if</span> (nsing &gt;= jp1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;                    sm = dot_product(r(jp1:nsing,j), wa(jp1:nsing))</div>
+<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                wa(j) = (wa(j) - sm) / sdiag(j)</div>
+<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;<span class="keywordflow">            end do</span> <span class="comment">! LINE 140</span></div>
+<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160; </div>
+<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;        <span class="comment">! Permute the components of Z back to components of X</span></div>
+<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;            l = ipvt(j)</div>
+<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;            x(l) = wa(j)</div>
+<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;<span class="keywordflow">        end do</span> <span class="comment">! LINE 160</span></div>
+<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160; </div>
+<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="astructnonlin__least__squares_1_1least__squares__solver_html"><div class="ttname"><a href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></div><div class="ttdoc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00021">nonlin_least_squares.f90:21</a></div></div>
+<div class="ttc" id="anamespacenonlin__least__squares_html"><div class="ttname"><a href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="ttdoc">nonlin_least_squares</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00007">nonlin_least_squares.f90:7</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_least_squares.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__linesearch_8f90_source.html b/doc/html/nonlin__linesearch_8f90_source.html
index 68b219a..45f2d52 100644
--- a/doc/html/nonlin__linesearch_8f90_source.html
+++ b/doc/html/nonlin__linesearch_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_linesearch.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_linesearch.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,19 +91,536 @@
 <div class="title">nonlin_linesearch.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_linesearch.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">! REFERENCES</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! - https://scicomp.stackexchange.com/questions/26330/backtracking-armijo-line-search-algorithm</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! - https://ctk.math.ncsu.edu/</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">private</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    <span class="keywordtype">public</span> :: limit_search_vector</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment">! TYPES</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html">   40</a></span>&#160;    <span class="keyword">type</span> <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d">   44</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487">   51</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_alpha = 1.0d-4</div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957">   59</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_factor = 0.1d0</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf">   63</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; ls_get_max_eval</div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8">   66</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; ls_set_max_eval</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b">   69</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_scaling_factor =&gt; ls_get_scale</div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8">   72</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_scaling_factor =&gt; ls_set_scale</div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf">   75</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_distance_factor =&gt; ls_get_dist</div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972">   78</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_distance_factor =&gt; ls_set_dist</div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79">   83</a></span>&#160;        generic, <span class="keywordtype">public</span> :: search =&gt; ls_search_mimo, ls_search_miso</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordtype">procedure</span> :: ls_search_mimo</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordtype">procedure</span> :: ls_search_miso</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment">! LINE SEARCH MEMBERS</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    <span class="keyword">pure function </span>ls_get_max_eval(this) <span class="keyword">result</span>(n)</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa">   99</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        n = this%m_maxEval</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="keyword">    subroutine </span>ls_set_max_eval(this, x)</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd">  111</a></span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        this%m_maxEval = x</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    <span class="keyword">pure function </span>ls_get_scale(this) <span class="keyword">result</span>(x)</div><div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2">  125</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        x = this%m_alpha</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="keyword">    subroutine </span>ls_set_scale(this, x)</div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b">  139</a></span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        this%m_alpha = x</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    <span class="keyword">pure function </span>ls_get_dist(this) <span class="keyword">result</span>(x)</div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d">  152</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        x = this%m_factor</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;<span class="keyword">    subroutine </span>ls_set_dist(this, x)</div><div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24">  166</a></span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        <span class="keywordflow">if</span> (x &lt;= 0.0d0) <span class="keywordflow">then</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            this%m_factor = 0.1d0</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &gt;= 1.0d0) <span class="keywordflow">then</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            this%m_factor = 0.99d0</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;            this%m_factor = x</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keyword">    subroutine </span>ls_search_mimo(this, fcn, xold, grad, dir, x, fvec, fold, fx, &amp;</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            ib, err)</div><div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6">  215</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xold, dir, grad</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, fvec</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fold</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fx</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: three = 3.0d0</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, m, n, neval, niter, flag, maxeval</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;        <span class="keywordtype">real(real64)</span> :: alam, alam1, alamin, f1, slope, temp, test, tmplam, &amp;</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            alpha, tolx, lambdamin, f, fo</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keywordtype">character(len = 128)</span> :: errmsg</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        neval = 0</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        niter = 0</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        m = fcn%get_equation_count()</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        n = fcn%get_variable_count()</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        tolx = two * epsilon(tolx)</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        alpha = this%m_alpha</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        lambdamin = this%m_factor</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        maxeval = this%m_maxEval</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = zero</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            ib%iter_count = niter</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="comment">! Input Checking</span></div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        flag = 0</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(xold) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;            flag = 3</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(grad) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;            flag = 4</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(dir) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;            flag = 5</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;            flag = 6</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= m) <span class="keywordflow">then</span></div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;            flag = 7</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="comment">! Compute 1/2 F * F (* = dot product) if not provided</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fold)) <span class="keywordflow">then</span></div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;            fo = fold</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;            <span class="comment">! Evaluate the function, and compute the dot product</span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="keyword">call </span>fcn%fcn(xold, fvec)</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            fo = p5 * dot_product(fvec, fvec)</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="comment">! Compute the slope parameter</span></div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        slope = dot_product(grad, dir)</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;        <span class="keywordflow">if</span> (slope &gt;= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            <span class="comment">! ERROR: The slope should not be pointing uphill - invalid direction</span></div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                <span class="stringliteral">&quot;The search direction vector appears to be pointing in &quot;</span> // &amp;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                <span class="stringliteral">&quot;an uphill direction -  away from a minimum.&quot;</span>, &amp;</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;                nl_divergent_behavior_error)</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        <span class="comment">! Compute the minimum lambda value (length along the search direction)</span></div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        test = zero</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;            temp = abs(dir(i)) / max(abs(xold(i)), one)</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;            <span class="keywordflow">if</span> (temp &gt; test) test = temp</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        alamin = tolx / test</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;        alam = one</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="comment">! Iteration Loop</span></div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            <span class="comment">! Step along the specified direction by the amount ALAM</span></div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            x = xold + alam * dir</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;            f = p5 * dot_product(fvec, fvec)</div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;            niter = niter + 1</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;</div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;            <span class="comment">! Check the step</span></div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            <span class="keywordflow">if</span> (alam &lt; alamin) <span class="keywordflow">then</span></div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;                <span class="comment">! Either the solution has converged due to negligible change in</span></div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;                <span class="comment">! the root values, or the line search may have fully</span></div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;                <span class="comment">! backtracked.  In the event the solution fully backtracked,</span></div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;                <span class="comment">! we&#39;ll issue a warning to inform the user of the potential</span></div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;                <span class="comment">! issue.</span></div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;                <span class="keywordflow">if</span> (norm2(x - xold) == zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;                    <span class="comment">! The line search fully backtracked</span></div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;                        <span class="stringliteral">&quot;The line search appears to have fully &quot;</span> // &amp;</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;                        <span class="stringliteral">&quot;backtracked.  As such, check results carefully, &quot;</span> // &amp;</div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;                        <span class="stringliteral">&quot;and/or consider attempting the solve without &quot;</span> // &amp;</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;                        <span class="stringliteral">&quot;the line search.&quot;</span>, &amp;</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;                        nl_convergence_error)</div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;                x = xold</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;                xcnvrg = .true.</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f &lt;= fo + alpha * alam * slope) <span class="keywordflow">then</span></div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;                <span class="comment">! The function has converged</span></div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;                fcnvrg = .true.</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;                <span class="comment">! Convergence has not yet occurred, continue backtracking</span></div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;                tmplam = min_backtrack_search(niter, fo, f, f1, alam, &amp;</div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;                    alam1, slope)</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;</div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;            <span class="comment">! Set up parameters for the cubic model as we&#39;ve already been</span></div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;            <span class="comment">! through once with the quadratic model without success.</span></div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;            alam1 = alam</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            f1 = f</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            alam = max(tmplam, lambdamin * alam)</div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;</div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;            <span class="comment">! Ensure we haven&#39;t performed too many function evaluations</span></div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;                <span class="comment">! ERROR: Too many function evaluations</span></div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                flag = 1</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = f</div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;</div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            ib%iter_count = niter</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;The line search failed to &quot;</span> // &amp;</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, <span class="stringliteral">&quot;.&quot;</span></div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;<span class="keyword">    subroutine </span>ls_search_miso(this, fcn, xold, grad, dir, x, fold, fx, &amp;</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;            ib, err)</div><div class="line"><a name="l00430"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4">  430</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xold, dir, grad</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fold</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fx</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;</div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: three = 3.0d0</div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg</div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n, neval, niter, flag, maxeval</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;        <span class="keywordtype">real(real64)</span> :: alam, alam1, alamin, f1, slope, temp, test, tmplam, &amp;</div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;            alpha, tolx, lambdamin, f, fo</div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordtype">character(len = 128)</span> :: errmsg</div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        neval = 0</div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;        niter = 0</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        n = fcn%get_variable_count()</div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;        tolx = two * epsilon(tolx)</div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        alpha = this%m_alpha</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        lambdamin = this%m_factor</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        maxeval = this%m_maxEval</div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = zero</div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;            ib%iter_count = niter</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;</div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        <span class="comment">! Input Checking</span></div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;        flag = 0</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(xold) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            flag = 3</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(grad) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;            flag = 4</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(dir) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;            flag = 5</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            flag = 6</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        <span class="comment">! Establish the &quot;old&quot; function value</span></div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fold)) <span class="keywordflow">then</span></div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;            fo = fold</div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;            <span class="comment">! Evaluate the function</span></div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;            fo = fcn%fcn(xold)</div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;</div><div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <span class="comment">! Compute the slope parameter</span></div><div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        slope = dot_product(grad, dir)</div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        <span class="keywordflow">if</span> (slope &gt;= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;            <span class="comment">! ERROR: The slope should not be pointing uphill - invalid direction</span></div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div><div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;                <span class="stringliteral">&quot;The search direction vector appears to be pointing in &quot;</span> // &amp;</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;                <span class="stringliteral">&quot;an uphill direction -  away from a minimum.&quot;</span>, &amp;</div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;                nl_divergent_behavior_error)</div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;</div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <span class="comment">! Compute the minimum lambda value (length along the search direction)</span></div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;        test = zero</div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;            temp = abs(dir(i)) / max(abs(xold(i)), one)</div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;            <span class="keywordflow">if</span> (temp &gt; test) test = temp</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        alamin = tolx / test</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        alam = one</div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;</div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        <span class="comment">! Iteration Loop</span></div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div><div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;            <span class="comment">! Step along the specified direction by the amount ALAM</span></div><div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;            x = xold + alam * dir</div><div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;            f = fcn%fcn(x)</div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;            niter = niter + 1</div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;</div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;            <span class="comment">! Check the step</span></div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;            <span class="keywordflow">if</span> (alam &lt; alamin) <span class="keywordflow">then</span></div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;                <span class="comment">! Either the solution has converged due to negligible change in</span></div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;                <span class="comment">! the root values, or the line search may have fully</span></div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;                <span class="comment">! backtracked.  In the event the solution fully backtracked,</span></div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;                <span class="comment">! we&#39;ll issue a warning to inform the user of the potential</span></div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;                <span class="comment">! issue.</span></div><div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;                <span class="keywordflow">if</span> (norm2(x - xold) == zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;                    <span class="comment">! The line search fully backtracked</span></div><div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div><div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;                        <span class="stringliteral">&quot;The line search appears to have fully &quot;</span> // &amp;</div><div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;                        <span class="stringliteral">&quot;backtracked.  As such, check results carefully, &quot;</span> // &amp;</div><div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;                        <span class="stringliteral">&quot;and/or consider attempting the solve without &quot;</span> // &amp;</div><div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;                        <span class="stringliteral">&quot;the line search.&quot;</span>, &amp;</div><div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;                        nl_convergence_error)</div><div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;                x = xold</div><div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;                xcnvrg = .true.</div><div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f &lt;= fo + alpha * alam * slope) <span class="keywordflow">then</span></div><div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;                <span class="comment">! The function has converged</span></div><div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;                fcnvrg = .true.</div><div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;                <span class="comment">! Convergence has not yet occurred, continue backtracking</span></div><div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;                tmplam = min_backtrack_search(niter, fo, f, f1, alam, &amp;</div><div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;                    alam1, slope)</div><div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;</div><div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;            <span class="comment">! Set up parameters for the cubic model as we&#39;ve already been</span></div><div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;            <span class="comment">! through once with the quadratic model without success.</span></div><div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;            alam1 = alam</div><div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;            f1 = f</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;            alam = max(tmplam, lambdamin * alam)</div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;</div><div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;            <span class="comment">! Ensure we haven&#39;t performed too many function evaluations</span></div><div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;                <span class="comment">! ERROR: Too many function evaluations</span></div><div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;                flag = 1</div><div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = f</div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;</div><div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;            ib%iter_count = niter</div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;</div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;The line search failed to &quot;</span> // &amp;</div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, <span class="stringliteral">&quot;.&quot;</span></div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;</div><div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;    <span class="keyword">pure function </span>min_backtrack_search(mode, f0, f, f1, alam, alam1, &amp;</div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;            slope) <span class="keyword">result</span>(lam)</div><div class="line"><a name="l00622"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0">  622</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: mode</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: f0, f, f1, alam, alam1, slope</div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;        <span class="keywordtype">real(real64)</span> :: lam</div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;</div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: three = 3.0d0</div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;</div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="keywordtype">real(real64)</span> :: rhs1, rhs2, a, b, disc</div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;</div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;        <span class="keywordflow">if</span> (mode == 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;            <span class="comment">! Use a quadratic function approximation</span></div><div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;            lam = -slope / (two * (f - f0 - slope))</div><div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;            <span class="comment">! Use a cubic function</span></div><div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;            rhs1 = f - f0 - alam * slope</div><div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;            rhs2 = f1 - f0 - alam1 * slope</div><div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;            a = (rhs1 / alam**2 - rhs2 / alam1**2) / (alam - alam1)</div><div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;            b = (-alam1 * rhs1 / alam**2 + alam * rhs2 / alam1**2) / &amp;</div><div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;                (alam - alam1)</div><div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;            <span class="keywordflow">if</span> (a == zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;                lam = -slope / (two * b)</div><div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                disc = b**2 - three * a * slope</div><div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;                <span class="keywordflow">if</span> (disc &lt; zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;                    lam = p5 * alam</div><div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt;= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;                    lam = (-b + sqrt(disc)) / (three * a)</div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;                    lam = -slope / (b + sqrt(disc))</div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;            <span class="keywordflow">if</span> (lam &gt; p5 * alam) lam = p5 * alam</div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;</div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="keyword">    subroutine </span>limit_search_vector(x, lim)</div><div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a">  673</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;</div><div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;        <span class="keywordtype">real(real64)</span> :: mag</div><div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;</div><div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;        mag = norm2(x)</div><div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;        <span class="keywordflow">if</span> (mag == 0.0d0) <span class="keywordflow">return</span></div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;        <span class="keywordflow">if</span> (mag &gt; lim) x = (lim / mag) * x</div><div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;</div><div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="structnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
-<div class="ttc" id="namespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_linesearch.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">! REFERENCES</span></div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! - https://scicomp.stackexchange.com/questions/26330/backtracking-armijo-line-search-algorithm</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! - https://ctk.math.ncsu.edu/</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160; </div>
+<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a></div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    <span class="keywordtype">public</span> :: limit_search_vector</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160; </div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment">! TYPES</span></div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html">   40</a></span>&#160;    <span class="keyword">type</span> <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d">   44</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_maxeval = 100</div>
+<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487">   51</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_alpha = 1.0d-4</div>
+<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957">   59</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_factor = 0.1d0</div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf">   63</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_max_fcn_evals =&gt; ls_get_max_eval</div>
+<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8">   66</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_max_fcn_evals =&gt; ls_set_max_eval</div>
+<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b">   69</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_scaling_factor =&gt; ls_get_scale</div>
+<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8">   72</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_scaling_factor =&gt; ls_set_scale</div>
+<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf">   75</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_distance_factor =&gt; ls_get_dist</div>
+<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972">   78</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_distance_factor =&gt; ls_set_dist</div>
+<div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79">   83</a></span>&#160;        generic, <span class="keywordtype">public</span> :: search =&gt; ls_search_mimo, ls_search_miso</div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160; </div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordtype">procedure</span> :: ls_search_mimo</div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordtype">procedure</span> :: ls_search_miso</div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160; </div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment">! LINE SEARCH MEMBERS</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>ls_get_max_eval(this) <span class="keyword">result</span>(n)</div>
+<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa">   99</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        n = this%m_maxEval</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160; </div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    <span class="keyword">subroutine </span>ls_set_max_eval(this, x)</div>
+<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd">  111</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        this%m_maxEval = x</div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160; </div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>ls_get_scale(this) <span class="keyword">result</span>(x)</div>
+<div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2">  125</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        x = this%m_alpha</div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160; </div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    <span class="keyword">subroutine </span>ls_set_scale(this, x)</div>
+<div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b">  139</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        this%m_alpha = x</div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160; </div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>ls_get_dist(this) <span class="keyword">result</span>(x)</div>
+<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d">  152</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        x = this%m_factor</div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160; </div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    <span class="keyword">subroutine </span>ls_set_dist(this, x)</div>
+<div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24">  166</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        <span class="keywordflow">if</span> (x &lt;= 0.0d0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            this%m_factor = 0.1d0</div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &gt;= 1.0d0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            this%m_factor = 0.99d0</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;            this%m_factor = x</div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160; </div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;    <span class="keyword">subroutine </span>ls_search_mimo(this, fcn, xold, grad, dir, x, fvec, fold, fx, &amp;</div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            ib, err)</div>
+<div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6">  215</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xold, dir, grad</div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x, fvec</div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fold</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fx</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160; </div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: three = 3.0d0</div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160; </div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, m, n, neval, niter, flag, maxeval</div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;<span class="keywordtype">        real</span>(real64) :: alam, alam1, alamin, f1, slope, temp, test, tmplam, &amp;</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            alpha, tolx, lambdamin, f, fo</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keywordtype">character(len = 128)</span> :: errmsg</div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160; </div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        niter = 0</div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        m = fcn%get_equation_count()</div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        n = fcn%get_variable_count()</div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        tolx = two * epsilon(tolx)</div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        alpha = this%m_alpha</div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        lambdamin = this%m_factor</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        maxeval = this%m_maxEval</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = zero</div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            ib%iter_count = niter</div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160; </div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        <span class="comment">! Input Checking</span></div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div>
+<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(xold) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(grad) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;            flag = 4</div>
+<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(dir) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;            flag = 5</div>
+<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;            flag = 6</div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= m) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;            flag = 7</div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160; </div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="comment">! Compute 1/2 F * F (* = dot product) if not provided</span></div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fold)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;            fo = fold</div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;            <span class="comment">! Evaluate the function, and compute the dot product</span></div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="keyword">call </span>fcn%fcn(xold, fvec)</div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            fo = p5 * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160; </div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="comment">! Compute the slope parameter</span></div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        slope = dot_product(grad, dir)</div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;        <span class="keywordflow">if</span> (slope &gt;= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            <span class="comment">! ERROR: The slope should not be pointing uphill - invalid direction</span></div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                <span class="stringliteral">&quot;The search direction vector appears to be pointing in &quot;</span> // &amp;</div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;                <span class="stringliteral">&quot;an uphill direction -  away from a minimum.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;                nl_divergent_behavior_error)</div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160; </div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        <span class="comment">! Compute the minimum lambda value (length along the search direction)</span></div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        test = zero</div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;            temp = abs(dir(i)) / max(abs(xold(i)), one)</div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;            <span class="keywordflow">if</span> (temp &gt; test) test = temp</div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        alamin = tolx / test</div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;        alam = one</div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160; </div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="comment">! Iteration Loop</span></div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            <span class="comment">! Step along the specified direction by the amount ALAM</span></div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            x = xold + alam * dir</div>
+<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;            f = p5 * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;            niter = niter + 1</div>
+<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160; </div>
+<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;            <span class="comment">! Check the step</span></div>
+<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            <span class="keywordflow">if</span> (alam &lt; alamin) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;                <span class="comment">! Either the solution has converged due to negligible change in</span></div>
+<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;                <span class="comment">! the root values, or the line search may have fully</span></div>
+<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;                <span class="comment">! backtracked.  In the event the solution fully backtracked,</span></div>
+<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;                <span class="comment">! we&#39;ll issue a warning to inform the user of the potential</span></div>
+<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;                <span class="comment">! issue.</span></div>
+<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;                <span class="keywordflow">if</span> (norm2(x - xold) == zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;                    <span class="comment">! The line search fully backtracked</span></div>
+<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, &amp;</div>
+<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;                        <span class="stringliteral">&quot;The line search appears to have fully &quot;</span> // &amp;</div>
+<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;                        <span class="stringliteral">&quot;backtracked.  As such, check results carefully, &quot;</span> // &amp;</div>
+<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;                        <span class="stringliteral">&quot;and/or consider attempting the solve without &quot;</span> // &amp;</div>
+<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;                        <span class="stringliteral">&quot;the line search.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;                        nl_convergence_error)</div>
+<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;                x = xold</div>
+<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;                xcnvrg = .true.</div>
+<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f &lt;= fo + alpha * alam * slope) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;                <span class="comment">! The function has converged</span></div>
+<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;                fcnvrg = .true.</div>
+<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;                <span class="comment">! Convergence has not yet occurred, continue backtracking</span></div>
+<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;                tmplam = min_backtrack_search(niter, fo, f, f1, alam, &amp;</div>
+<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;                    alam1, slope)</div>
+<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160; </div>
+<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;            <span class="comment">! Set up parameters for the cubic model as we&#39;ve already been</span></div>
+<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;            <span class="comment">! through once with the quadratic model without success.</span></div>
+<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;            alam1 = alam</div>
+<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            f1 = f</div>
+<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            alam = max(tmplam, lambdamin * alam)</div>
+<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160; </div>
+<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;            <span class="comment">! Ensure we haven&#39;t performed too many function evaluations</span></div>
+<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;                <span class="comment">! ERROR: Too many function evaluations</span></div>
+<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;                flag = 1</div>
+<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = f</div>
+<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160; </div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;            ib%iter_count = niter</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160; </div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;The line search failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, <span class="stringliteral">&quot;.&quot;</span></div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_mimo&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160; </div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;    <span class="keyword">subroutine </span>ls_search_miso(this, fcn, xold, grad, dir, x, fold, fx, &amp;</div>
+<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;            ib, err)</div>
+<div class="line"><a name="l00430"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4">  430</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xold, dir, grad</div>
+<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">optional</span> :: fold</div>
+<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fx</div>
+<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160; </div>
+<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div>
+<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: three = 3.0d0</div>
+<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160; </div>
+<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, fcnvrg</div>
+<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n, neval, niter, flag, maxeval</div>
+<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;<span class="keywordtype">        real</span>(real64) :: alam, alam1, alamin, f1, slope, temp, test, tmplam, &amp;</div>
+<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;            alpha, tolx, lambdamin, f, fo</div>
+<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordtype">character(len = 128)</span> :: errmsg</div>
+<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160; </div>
+<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;        niter = 0</div>
+<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        n = fcn%get_variable_count()</div>
+<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;        tolx = two * epsilon(tolx)</div>
+<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        alpha = this%m_alpha</div>
+<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        lambdamin = this%m_factor</div>
+<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        maxeval = this%m_maxEval</div>
+<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = zero</div>
+<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;            ib%iter_count = niter</div>
+<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160; </div>
+<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        <span class="comment">! Input Checking</span></div>
+<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div>
+<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(xold) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(grad) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;            flag = 4</div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(dir) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;            flag = 5</div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            flag = 6</div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div>
+<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div>
+<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div>
+<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160; </div>
+<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        <span class="comment">! Establish the &quot;old&quot; function value</span></div>
+<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fold)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;            fo = fold</div>
+<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;            <span class="comment">! Evaluate the function</span></div>
+<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;            fo = fcn%fcn(xold)</div>
+<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160; </div>
+<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;        <span class="comment">! Compute the slope parameter</span></div>
+<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        slope = dot_product(grad, dir)</div>
+<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        <span class="keywordflow">if</span> (slope &gt;= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;            <span class="comment">! ERROR: The slope should not be pointing uphill - invalid direction</span></div>
+<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div>
+<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;                <span class="stringliteral">&quot;The search direction vector appears to be pointing in &quot;</span> // &amp;</div>
+<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;                <span class="stringliteral">&quot;an uphill direction -  away from a minimum.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;                nl_divergent_behavior_error)</div>
+<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160; </div>
+<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <span class="comment">! Compute the minimum lambda value (length along the search direction)</span></div>
+<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;        test = zero</div>
+<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;            temp = abs(dir(i)) / max(abs(xold(i)), one)</div>
+<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;            <span class="keywordflow">if</span> (temp &gt; test) test = temp</div>
+<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        alamin = tolx / test</div>
+<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        alam = one</div>
+<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160; </div>
+<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        <span class="comment">! Iteration Loop</span></div>
+<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div>
+<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;            <span class="comment">! Step along the specified direction by the amount ALAM</span></div>
+<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;            x = xold + alam * dir</div>
+<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;            f = fcn%fcn(x)</div>
+<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;            niter = niter + 1</div>
+<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160; </div>
+<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;            <span class="comment">! Check the step</span></div>
+<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;            <span class="keywordflow">if</span> (alam &lt; alamin) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;                <span class="comment">! Either the solution has converged due to negligible change in</span></div>
+<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;                <span class="comment">! the root values, or the line search may have fully</span></div>
+<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;                <span class="comment">! backtracked.  In the event the solution fully backtracked,</span></div>
+<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;                <span class="comment">! we&#39;ll issue a warning to inform the user of the potential</span></div>
+<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;                <span class="comment">! issue.</span></div>
+<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;                <span class="keywordflow">if</span> (norm2(x - xold) == zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;                    <span class="comment">! The line search fully backtracked</span></div>
+<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, &amp;</div>
+<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;                        <span class="stringliteral">&quot;The line search appears to have fully &quot;</span> // &amp;</div>
+<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;                        <span class="stringliteral">&quot;backtracked.  As such, check results carefully, &quot;</span> // &amp;</div>
+<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;                        <span class="stringliteral">&quot;and/or consider attempting the solve without &quot;</span> // &amp;</div>
+<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;                        <span class="stringliteral">&quot;the line search.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;                        nl_convergence_error)</div>
+<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;                x = xold</div>
+<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;                xcnvrg = .true.</div>
+<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f &lt;= fo + alpha * alam * slope) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;                <span class="comment">! The function has converged</span></div>
+<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;                fcnvrg = .true.</div>
+<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;                <span class="comment">! Convergence has not yet occurred, continue backtracking</span></div>
+<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;                tmplam = min_backtrack_search(niter, fo, f, f1, alam, &amp;</div>
+<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;                    alam1, slope)</div>
+<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160; </div>
+<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;            <span class="comment">! Set up parameters for the cubic model as we&#39;ve already been</span></div>
+<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;            <span class="comment">! through once with the quadratic model without success.</span></div>
+<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;            alam1 = alam</div>
+<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;            f1 = f</div>
+<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;            alam = max(tmplam, lambdamin * alam)</div>
+<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160; </div>
+<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;            <span class="comment">! Ensure we haven&#39;t performed too many function evaluations</span></div>
+<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;                <span class="comment">! ERROR: Too many function evaluations</span></div>
+<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;                flag = 1</div>
+<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fx)) fx = f</div>
+<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160; </div>
+<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;            ib%iter_count = niter</div>
+<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160; </div>
+<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;The line search failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, <span class="stringliteral">&quot;.&quot;</span></div>
+<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ls_search_miso&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160; </div>
+<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>min_backtrack_search(mode, f0, f, f1, alam, alam1, &amp;</div>
+<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;            slope) <span class="keyword">result</span>(lam)</div>
+<div class="line"><a name="l00622"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0">  622</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: mode</div>
+<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: f0, f, f1, alam, alam1, slope</div>
+<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="keywordtype">        real</span>(real64) :: lam</div>
+<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160; </div>
+<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: three = 3.0d0</div>
+<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160; </div>
+<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;<span class="keywordtype">        real</span>(real64) :: rhs1, rhs2, a, b, disc</div>
+<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160; </div>
+<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;        <span class="keywordflow">if</span> (mode == 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;            <span class="comment">! Use a quadratic function approximation</span></div>
+<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;            lam = -slope / (two * (f - f0 - slope))</div>
+<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;            <span class="comment">! Use a cubic function</span></div>
+<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;            rhs1 = f - f0 - alam * slope</div>
+<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;            rhs2 = f1 - f0 - alam1 * slope</div>
+<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;            a = (rhs1 / alam**2 - rhs2 / alam1**2) / (alam - alam1)</div>
+<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;            b = (-alam1 * rhs1 / alam**2 + alam * rhs2 / alam1**2) / &amp;</div>
+<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;                (alam - alam1)</div>
+<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;            <span class="keywordflow">if</span> (a == zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;                lam = -slope / (two * b)</div>
+<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                disc = b**2 - three * a * slope</div>
+<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;                <span class="keywordflow">if</span> (disc &lt; zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;                    lam = p5 * alam</div>
+<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt;= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;                    lam = (-b + sqrt(disc)) / (three * a)</div>
+<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;                    lam = -slope / (b + sqrt(disc))</div>
+<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;            <span class="keywordflow">if</span> (lam &gt; p5 * alam) lam = p5 * alam</div>
+<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160; </div>
+<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;    <span class="keyword">subroutine </span>limit_search_vector(x, lim)</div>
+<div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a">  673</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160; </div>
+<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;<span class="keywordtype">        real</span>(real64) :: mag</div>
+<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160; </div>
+<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;        mag = norm2(x)</div>
+<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;        <span class="keywordflow">if</span> (mag == 0.0d0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;        <span class="keywordflow">if</span> (mag &gt; lim) x = (lim / mag) * x</div>
+<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160; </div>
+<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="astructnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
+<div class="ttc" id="anamespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_linesearch.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__optimize_8f90_source.html b/doc/html/nonlin__optimize_8f90_source.html
index 9ce3227..7ce15c3 100644
--- a/doc/html/nonlin__optimize_8f90_source.html
+++ b/doc/html/nonlin__optimize_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_optimize.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_optimize.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,26 +91,192 @@
 <div class="title">nonlin_optimize.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">! REF:</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt_Algorithms#Nelder-Mead_Simplex</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt_Algorithms</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">! https://scicomp.stackexchange.com/questions/14787/fortran-library-for-minimization-or-maximization-of-functions-optimization-prob</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__optimize.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : la_matrix_format_error</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>, limit_search_vector</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : rank1_update, tri_mtx_mult, cholesky_rank1_update, &amp;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        cholesky_rank1_downdate, solve_cholesky</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">private</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1bfgs.html">bfgs</a></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! NONLIN_OPTIMIZE_NELDER_MEAD.F90</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html">   33</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a>) :: <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2">   36</a></span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: m_simplex</div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555">   39</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_initsize = 1.0d0</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">  134</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; nm_solve</div><div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2">  145</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_simplex =&gt; nm_get_simplex</div><div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">  163</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_simplex =&gt; nm_set_simplex</div><div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4">  176</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_initial_size =&gt; nm_get_size</div><div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">  193</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_initial_size =&gt; nm_set_size</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;</div><div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7">  214</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">private</span> :: extrapolate =&gt; nm_extrapolate</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        <span class="keyword">module</span> subroutine nm_solve(this, fcn, x, fout, ib, err)</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;        <span class="keyword">module</span> function nm_extrapolate(this, fcn, y, pcent, ihi, fac, neval, &amp;</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                work) result(ytry)</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y, pcent</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ihi</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: fac</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(inout)</span> :: neval</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: work</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;            <span class="keywordtype">real(real64)</span> :: ytry</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_simplex(this) result(p)</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: p</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="keyword">module</span> subroutine nm_set_simplex(this, x)</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(:,:)</span> :: x</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_size(this) result(x)</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        <span class="keyword">module</span> subroutine nm_set_size(this, x)</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="comment">! NONLIN_OPTIMIZE_LINE_SEARCH.F90</span></div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html">  266</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a>) :: line_search_optimizer</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a">  269</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">allocatable</span> :: m_linesearch</div><div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d">  272</a></span>&#160;        <span class="keywordtype">logical</span> :: m_uselinesearch = .true.</div><div class="line"><a name="l00274"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">  274</a></span>&#160;        <span class="keywordtype">real(real64)</span> :: m_xtol = 1.0d-12</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010">  285</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_line_search =&gt; lso_get_line_search</div><div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">  295</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_line_search =&gt; lso_set_line_search</div><div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">  305</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_default_line_search =&gt; lso_set_default</div><div class="line"><a name="l00315"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">  315</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_line_search_defined =&gt; &amp;</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;            lso_is_line_search_defined</div><div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082">  326</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_use_line_search =&gt; lso_get_use_search</div><div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">  336</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_use_line_search =&gt; lso_set_use_search</div><div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">  346</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; lso_get_var_tol</div><div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">  356</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; lso_set_var_tol</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;</div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;        <span class="keyword">module</span> subroutine lso_get_line_search(this, ls)</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;</div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        <span class="keyword">module</span> subroutine lso_set_line_search(this, ls)</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: ls</div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;</div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;        <span class="keyword">module</span> subroutine lso_set_default(this)</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>) :: ls</div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;</div><div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_is_line_search_defined(this) result(x)</div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_use_search(this) result(x)</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="keyword">module</span> subroutine lso_set_use_search(this, x)</div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_var_tol(this) result(x)</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;            <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;</div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;        <span class="keyword">module</span> subroutine lso_set_var_tol(this, x)</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;</div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00405"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1bfgs.html">  405</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_optimizer) :: bfgs</div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385">  489</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; bfgs_solve</div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;        <span class="keyword">module</span> subroutine bfgs_solve(this, fcn, x, fout, ib, err)</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;            <span class="keywordtype">class</span>(bfgs), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="structnonlin__optimize_1_1nelder__mead_html"><div class="ttname"><a href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></div><div class="ttdoc">Defines a solver based upon Nelder and Mead&amp;#39;s simplex algorithm for minimization of functions of mult...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00033">nonlin_optimize.f90:33</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__optimizer_html"><div class="ttname"><a href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></div><div class="ttdoc">A base class for optimization of an equation of multiple variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01767">nonlin_core.f90:1767</a></div></div>
-<div class="ttc" id="structnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
-<div class="ttc" id="namespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
-<div class="ttc" id="namespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
-<div class="ttc" id="structnonlin__optimize_1_1bfgs_html"><div class="ttname"><a href="structnonlin__optimize_1_1bfgs.html">nonlin_optimize::bfgs</a></div><div class="ttdoc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00405">nonlin_optimize.f90:405</a></div></div>
-<div class="ttc" id="structnonlin__optimize_1_1line__search__optimizer_html"><div class="ttname"><a href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></div><div class="ttdoc">A class describing equation optimizers that use a line search algorithm to improve convergence behavi...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00266">nonlin_optimize.f90:266</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">! REF:</span></div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt_Algorithms#Nelder-Mead_Simplex</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt_Algorithms</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">! https://scicomp.stackexchange.com/questions/14787/fortran-library-for-minimization-or-maximization-of-functions-optimization-prob</span></div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">! http://ab-initio.mit.edu/wiki/index.php/NLopt</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160; </div>
+<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__optimize.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span>linalg_constants, <span class="keywordtype">only</span> : la_matrix_format_error</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>, limit_search_vector</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : rank1_update, tri_mtx_mult, cholesky_rank1_update, &amp;</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        cholesky_rank1_downdate, solve_cholesky</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a></div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__optimize_1_1bfgs.html">bfgs</a></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160; </div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! NONLIN_OPTIMIZE_NELDER_MEAD.F90</span></div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html">   33</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a>) :: <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2">   36</a></span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: m_simplex</div>
+<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555">   39</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_initsize = 1.0d0</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">  134</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; nm_solve</div>
+<div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2">  145</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_simplex =&gt; nm_get_simplex</div>
+<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">  163</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_simplex =&gt; nm_set_simplex</div>
+<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4">  176</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_initial_size =&gt; nm_get_size</div>
+<div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">  193</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_initial_size =&gt; nm_set_size</div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160; </div>
+<div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7">  214</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">private</span> :: extrapolate =&gt; nm_extrapolate</div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160; </div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        <span class="keyword">module</span> subroutine nm_solve(this, fcn, x, fout, ib, err)</div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160; </div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;        <span class="keyword">module</span> function nm_extrapolate(this, fcn, y, pcent, ihi, fac, neval, &amp;</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                work) result(ytry)</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y, pcent</div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ihi</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: fac</div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(inout)</span> :: neval</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: work</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;<span class="keywordtype">            real</span>(real64) :: ytry</div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160; </div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_simplex(this) result(p)</div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: p</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160; </div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="keyword">module</span> subroutine nm_set_simplex(this, x)</div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">dimension(:,:)</span> :: x</div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160; </div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_size(this) result(x)</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160; </div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        <span class="keyword">module</span> subroutine nm_set_size(this, x)</div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160; </div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="comment">! NONLIN_OPTIMIZE_LINE_SEARCH.F90</span></div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html">  266</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a>) :: line_search_optimizer</div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a">  269</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">allocatable</span> :: m_linesearch</div>
+<div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d">  272</a></span>&#160;        <span class="keywordtype">logical</span> :: m_uselinesearch = .true.</div>
+<div class="line"><a name="l00274"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">  274</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: m_xtol = 1.0d-12</div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010">  285</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_line_search =&gt; lso_get_line_search</div>
+<div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">  295</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_line_search =&gt; lso_set_line_search</div>
+<div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">  305</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_default_line_search =&gt; lso_set_default</div>
+<div class="line"><a name="l00315"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">  315</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_line_search_defined =&gt; &amp;</div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;            lso_is_line_search_defined</div>
+<div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082">  326</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_use_line_search =&gt; lso_get_use_search</div>
+<div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">  336</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_use_line_search =&gt; lso_set_use_search</div>
+<div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">  346</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_var_tolerance =&gt; lso_get_var_tol</div>
+<div class="line"><a name="l00356"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">  356</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_var_tolerance =&gt; lso_set_var_tol</div>
+<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160; </div>
+<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;        <span class="keyword">module</span> subroutine lso_get_line_search(this, ls)</div>
+<div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160; </div>
+<div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;        <span class="keyword">module</span> subroutine lso_set_line_search(this, ls)</div>
+<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160; </div>
+<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;        <span class="keyword">module</span> subroutine lso_set_default(this)</div>
+<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>) :: ls</div>
+<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160; </div>
+<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_is_line_search_defined(this) result(x)</div>
+<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160; </div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_use_search(this) result(x)</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160; </div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="keyword">module</span> subroutine lso_set_use_search(this, x)</div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160; </div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;<span class="keywordtype">            real</span>(real64) :: x</div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160; </div>
+<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;        <span class="keyword">module</span> subroutine lso_set_var_tol(this, x)</div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;            <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160; </div>
+<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00405"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1bfgs.html">  405</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_optimizer) :: bfgs</div>
+<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385">  489</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; bfgs_solve</div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160; </div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;        <span class="keyword">module</span> subroutine bfgs_solve(this, fcn, x, fout, ib, err)</div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;            <span class="keywordtype">class</span>(bfgs), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div>
+<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160; </div>
+<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__optimize_1_1nelder__mead_html"><div class="ttname"><a href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></div><div class="ttdoc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of mult...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00033">nonlin_optimize.f90:33</a></div></div>
+<div class="ttc" id="astructnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
+<div class="ttc" id="anamespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__optimizer_html"><div class="ttname"><a href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></div><div class="ttdoc">A base class for optimization of an equation of multiple variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01767">nonlin_core.f90:1767</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
+<div class="ttc" id="astructnonlin__optimize_1_1bfgs_html"><div class="ttname"><a href="structnonlin__optimize_1_1bfgs.html">nonlin_optimize::bfgs</a></div><div class="ttdoc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple va...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00405">nonlin_optimize.f90:405</a></div></div>
+<div class="ttc" id="astructnonlin__optimize_1_1line__search__optimizer_html"><div class="ttname"><a href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></div><div class="ttdoc">A class describing equation optimizers that use a line search algorithm to improve convergence behavi...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00266">nonlin_optimize.f90:266</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_optimize.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__optimize__bfgs_8f90_source.html b/doc/html/nonlin__optimize__bfgs_8f90_source.html
index dfd3db7..18a9bee 100644
--- a/doc/html/nonlin__optimize__bfgs_8f90_source.html
+++ b/doc/html/nonlin__optimize__bfgs_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_optimize_bfgs.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_optimize_bfgs.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,252 @@
 <div class="title">nonlin_optimize_bfgs.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_bfgs.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_bfgs</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;    <span class="keyword">module</span> subroutine bfgs_solve(this, fcn, x, fout, ib, err)</div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(bfgs), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: negone = -1.0d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: factor = 1.0d2</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: small = 1.0d-10</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, gcnvrg</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n, maxeval, neval, ngrad, flag, iter</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">real(real64)</span> :: xtol, gtol, fp, stpmax, fret, xtest, gtest, temp, ydx</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: g, dx, u, v, y, gold, xnew, bdx</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: b, r</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        n = fcn%get_variable_count()</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        gtol = this%get_tolerance()</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        iter = 0</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        neval = 0</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        ngrad = 0</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        gcnvrg = .false.</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%gradient_count = ngrad</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%converge_on_fcn = .false.</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, &amp;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) &amp;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                <span class="stringliteral">&quot;It was expected to receive a coordinate vector of length &quot;</span>, &amp;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                n, <span class="stringliteral">&quot; , but a vector of length &quot;</span>, <span class="keyword">size</span>(x), <span class="stringliteral">&quot; was received.&quot;</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        <span class="keyword">allocate</span>(g(n), stat = flag)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dx(n), stat = flag)</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(u(n), stat = flag)</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(v(n), stat = flag)</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(y(n), stat = flag)</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(bdx(n), stat = flag)</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(gold(n), stat = flag)</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xnew(n), stat = flag)</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(b(n,n), stat = flag)</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(r(n,n), stat = flag)</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="comment">! ERROR: Memory Error</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, &amp;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        fp = fcn%fcn(x)</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keyword">call </span>fcn%gradient(x, g, fp)</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        neval = 1</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        ngrad = 1</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="comment">! Check for a &quot;zero&quot; gradient at the initial point</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        gtest = norm2(g)</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">if</span> (gtest &lt; gtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            gcnvrg = .true.</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <span class="comment">! Main Loop</span></div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        flag = 0</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordflow">if</span> (.not.gcnvrg) <span class="keywordflow">then</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">do</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                <span class="comment">! Update the iteration counter</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                iter = iter + 1</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                <span class="comment">! Define the initial direction, and a limit on the line search</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                <span class="comment">! step</span></div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                    dx = -g</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                    stpmax = factor * max(norm2(x), <span class="keywordtype">real</span>(n, real64))</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="comment">! Perform the line search</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                    <span class="keyword">call </span>limit_search_vector(dx, stpmax)</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, x, g, dx, xnew, fp, fret, lib, errmgr)</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    neval = neval + lib%fcn_count</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                    fp = fret</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    xnew = x + dx</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                    fp = fcn%fcn(xnew)</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    neval = neval + 1</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Update the gradient and line direction</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                    dx(i) = xnew(i) - x(i)</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                    x(i) = xnew(i)</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    gold(i) = g(i)</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                <span class="keyword">call </span>fcn%gradient(x, g, fp)</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                ngrad = ngrad + 1</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                <span class="comment">! Test for convergence on the change in X</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                xtest = zero</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                    temp = abs(dx(i)) / max(abs(x(i)), one)</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                    xtest = max(temp, xtest)</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                <span class="keywordflow">if</span> (xtest &lt; xtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                    xcnvrg = .true.</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                <span class="comment">! Test for convergence on the gradient</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                gtest = norm2(g)</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                <span class="keywordflow">if</span> (gtest &lt; gtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    gcnvrg = .true.</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                <span class="comment">! Perform the BFGS update</span></div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                y = g - gold</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                ydx = dot_product(y, dx)</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                <span class="comment">! Establish an initial approximation to the Hessian matrix</span></div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                    temp = sqrt(dot_product(y, y) / ydx)</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="keyword">call </span>dlaset(<span class="stringliteral">&#39;A&#39;</span>, n, n, zero, temp, r, n)</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                <span class="comment">! Compute: B = R**T * R</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="keyword">call </span>tri_mtx_mult(.true., one, r, zero, b)</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                <span class="comment">! Compute bdx = B * dX (B is symmetric)</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keyword">call </span>dsymv(<span class="stringliteral">&#39;u&#39;</span>, n, one, b, n, dx, 1, zero, bdx, 1)</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                <span class="comment">! Perform the actual update</span></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                <span class="keywordflow">if</span> (ydx &gt; small) <span class="keywordflow">then</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    <span class="comment">! Compute the rank 1 update and downdate</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    u = y / sqrt(ydx)</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    v = bdx / sqrt(dot_product(dx, bdx))</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    <span class="keyword">call </span>cholesky_rank1_update(r, u)</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                    <span class="keyword">call </span>cholesky_rank1_downdate(r, v)</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! Else just skip the update</span></div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                <span class="comment">! Compute the solution to: B * dx = -g = (R**T * R) * dx</span></div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                dx = -g</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                <span class="keyword">call </span>solve_cholesky(.true., r, dx)</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                <span class="comment">! Print iteration status</span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                    print *, <span class="stringliteral">&quot;&quot;</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, neval</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fp</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xtest</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Gradient: &quot;</span>, gtest</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    flag = 1</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;            ib%gradient_count = ngrad</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;            ib%converge_on_fcn = .false.</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="comment">! Get the function value at the computed minimum</span></div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fout)) fout = fp</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3AE8.3)&#39;</span>) &amp;</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                <span class="stringliteral">&quot;The algorithm failed to converge.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                <span class="stringliteral">&quot;Function Value: &quot;</span>, fp, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;                <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xtest, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;                <span class="stringliteral">&quot;Gradient: &quot;</span>, gtest</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_bfgs.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_bfgs</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;    <span class="keyword">module</span> subroutine bfgs_solve(this, fcn, x, fout, ib, err)</div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(bfgs), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160; </div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: negone = -1.0d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: factor = 1.0d2</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: small = 1.0d-10</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: xcnvrg, gcnvrg</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n, maxeval, neval, ngrad, flag, iter</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keywordtype">        real</span>(real64) :: xtol, gtol, fp, stpmax, fret, xtest, gtest, temp, ydx</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: g, dx, u, v, y, gold, xnew, bdx</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: b, r</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160; </div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        n = fcn%get_variable_count()</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        gtol = this%get_tolerance()</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        ngrad = 0</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        gcnvrg = .false.</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%gradient_count = ngrad</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%converge_on_fcn = .false.</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160; </div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                <span class="stringliteral">&quot;It was expected to receive a coordinate vector of length &quot;</span>, &amp;</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                n, <span class="stringliteral">&quot; , but a vector of length &quot;</span>, <span class="keyword">size</span>(x), <span class="stringliteral">&quot; was received.&quot;</span></div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160; </div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        <span class="keyword">allocate</span>(g(n), stat = flag)</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dx(n), stat = flag)</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(u(n), stat = flag)</div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(v(n), stat = flag)</div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(y(n), stat = flag)</div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(bdx(n), stat = flag)</div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(gold(n), stat = flag)</div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xnew(n), stat = flag)</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(b(n,n), stat = flag)</div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(r(n,n), stat = flag)</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="comment">! ERROR: Memory Error</span></div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160; </div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        fp = fcn%fcn(x)</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keyword">call </span>fcn%gradient(x, g, fp)</div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        neval = 1</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        ngrad = 1</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160; </div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="comment">! Check for a &quot;zero&quot; gradient at the initial point</span></div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        gtest = norm2(g)</div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">if</span> (gtest &lt; gtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            gcnvrg = .true.</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160; </div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <span class="comment">! Main Loop</span></div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordflow">if</span> (.not.gcnvrg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                <span class="comment">! Update the iteration counter</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                iter = iter + 1</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160; </div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;                <span class="comment">! Define the initial direction, and a limit on the line search</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                <span class="comment">! step</span></div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                    dx = -g</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                    stpmax = factor * max(norm2(x), real(n, real64))</div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160; </div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="comment">! Perform the line search</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                    <span class="keyword">call </span>limit_search_vector(dx, stpmax)</div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, x, g, dx, xnew, fp, fret, lib, errmgr)</div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    neval = neval + lib%fcn_count</div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                    fp = fret</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    xnew = x + dx</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                    fp = fcn%fcn(xnew)</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    neval = neval + 1</div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160; </div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Update the gradient and line direction</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                    dx(i) = xnew(i) - x(i)</div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                    x(i) = xnew(i)</div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    gold(i) = g(i)</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                <span class="keyword">call </span>fcn%gradient(x, g, fp)</div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                ngrad = ngrad + 1</div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160; </div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                <span class="comment">! Test for convergence on the change in X</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                xtest = zero</div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                    temp = abs(dx(i)) / max(abs(x(i)), one)</div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                    xtest = max(temp, xtest)</div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                <span class="keywordflow">if</span> (xtest &lt; xtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                    xcnvrg = .true.</div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160; </div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                <span class="comment">! Test for convergence on the gradient</span></div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                gtest = norm2(g)</div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                <span class="keywordflow">if</span> (gtest &lt; gtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    gcnvrg = .true.</div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160; </div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                <span class="comment">! Perform the BFGS update</span></div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                y = g - gold</div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                ydx = dot_product(y, dx)</div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160; </div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                <span class="comment">! Establish an initial approximation to the Hessian matrix</span></div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                <span class="keywordflow">if</span> (iter == 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                    temp = sqrt(dot_product(y, y) / ydx)</div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="keyword">call </span>dlaset(<span class="stringliteral">&#39;A&#39;</span>, n, n, zero, temp, r, n)</div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160; </div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                <span class="comment">! Compute: B = R**T * R</span></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="keyword">call </span>tri_mtx_mult(.true., one, r, zero, b)</div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160; </div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                <span class="comment">! Compute bdx = B * dX (B is symmetric)</span></div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keyword">call </span>dsymv(<span class="stringliteral">&#39;u&#39;</span>, n, one, b, n, dx, 1, zero, bdx, 1)</div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160; </div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                <span class="comment">! Perform the actual update</span></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                <span class="keywordflow">if</span> (ydx &gt; small) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    <span class="comment">! Compute the rank 1 update and downdate</span></div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    u = y / sqrt(ydx)</div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    v = bdx / sqrt(dot_product(dx, bdx))</div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    <span class="keyword">call </span>cholesky_rank1_update(r, u)</div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                    <span class="keyword">call </span>cholesky_rank1_downdate(r, v)</div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="keywordflow">                end if</span> <span class="comment">! Else just skip the update</span></div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160; </div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                <span class="comment">! Compute the solution to: B * dx = -g = (R**T * R) * dx</span></div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                dx = -g</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                <span class="keyword">call </span>solve_cholesky(.true., r, dx)</div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160; </div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                <span class="comment">! Print iteration status</span></div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                    print *, <span class="stringliteral">&quot;&quot;</span></div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, neval</div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fp</div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xtest</div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                    print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Gradient: &quot;</span>, gtest</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160; </div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    flag = 1</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160; </div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;            ib%gradient_count = ngrad</div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;            ib%converge_on_fcn = .false.</div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160; </div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="comment">! Get the function value at the computed minimum</span></div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fout)) fout = fp</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160; </div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3AE8.3)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                <span class="stringliteral">&quot;The algorithm failed to converge.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                <span class="stringliteral">&quot;Function Value: &quot;</span>, fp, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;                <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xtest, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;                <span class="stringliteral">&quot;Gradient: &quot;</span>, gtest</div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;bfgs_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_optimize_bfgs.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__optimize__line__search_8f90_source.html b/doc/html/nonlin__optimize__line__search_8f90_source.html
index 2af7d05..a48a087 100644
--- a/doc/html/nonlin__optimize__line__search_8f90_source.html
+++ b/doc/html/nonlin__optimize__line__search_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_optimize_line_search.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_optimize_line_search.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,78 @@
 <div class="title">nonlin_optimize_line_search.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_line_search.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_line_search</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine lso_get_line_search(this, ls)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) &amp;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;            <span class="keyword">allocate</span>(ls, source = this%m_lineSearch)</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ----------------------</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keyword">module</span> subroutine lso_set_line_search(this, ls)</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: ls</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) <span class="keyword">deallocate</span>(this%m_lineSearch)</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keyword">allocate</span>(this%m_lineSearch, source = ls)</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keyword">module</span> subroutine lso_set_default(this)</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">type</span>(line_search) :: ls</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keyword">call </span>this%set_line_search(ls)</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_is_line_search_defined(this) result(x)</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        x = <span class="keyword">allocated</span>(this%m_lineSearch)</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_use_search(this) result(x)</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        x = this%m_useLineSearch</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">module</span> subroutine lso_set_use_search(this, x)</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        this%m_useLineSearch = x</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_var_tol(this) result(x)</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        x = this%m_xtol</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    <span class="keyword">module</span> subroutine lso_set_var_tol(this, x)</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        this%m_xtol = x</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_line_search.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_line_search</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine lso_get_line_search(this, ls)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) &amp;</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;            <span class="keyword">allocate</span>(ls, source = this%m_lineSearch)</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160; </div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ----------------------</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keyword">module</span> subroutine lso_set_line_search(this, ls)</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) <span class="keyword">deallocate</span>(this%m_lineSearch)</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keyword">allocate</span>(this%m_lineSearch, source = ls)</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keyword">module</span> subroutine lso_set_default(this)</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">type</span>(line_search) :: ls</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keyword">call </span>this%set_line_search(ls)</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160; </div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_is_line_search_defined(this) result(x)</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        x = <span class="keyword">allocated</span>(this%m_lineSearch)</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160; </div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_use_search(this) result(x)</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        x = this%m_useLineSearch</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160; </div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">module</span> subroutine lso_set_use_search(this, x)</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        this%m_useLineSearch = x</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160; </div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lso_get_var_tol(this) result(x)</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        x = this%m_xtol</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160; </div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    <span class="keyword">module</span> subroutine lso_set_var_tol(this, x)</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <span class="keywordtype">class</span>(line_search_optimizer), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        this%m_xtol = x</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_optimize_line_search.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__optimize__nelder__mead_8f90_source.html b/doc/html/nonlin__optimize__nelder__mead_8f90_source.html
index 1dd5fa9..81ffba1 100644
--- a/doc/html/nonlin__optimize__nelder__mead_8f90_source.html
+++ b/doc/html/nonlin__optimize__nelder__mead_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_optimize_nelder_mead.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_optimize_nelder_mead.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,345 @@
 <div class="title">nonlin_optimize_nelder_mead.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_nelder_mead.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_nelder_mead</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine nm_solve(this, fcn, x, fout, ib, err)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: negone = -1.0d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: buildSimplex, fcnvrg</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ihi, ilo, ihi2, ndim, npts, flag, neval, iter, &amp;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            maxeval</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">real(real64)</span> :: ftol, rtol, ftry, fsave, fval, swp</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: f, pcent, pmin, work</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        ndim = fcn%get_variable_count()</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        npts = ndim + 1</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        buildsimplex = .true.</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        ftol = this%get_tolerance()</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        iter = 0</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        neval = 0</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%converge_on_chng = .false.</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, &amp;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= ndim) <span class="keywordflow">then</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) &amp;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                <span class="stringliteral">&quot;It was expected to receive a coordinate vector of length &quot;</span>, &amp;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                ndim, <span class="stringliteral">&quot; , but a vector of length &quot;</span>, <span class="keyword">size</span>(x), <span class="stringliteral">&quot; was received.&quot;</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        <span class="comment">! Ensure that if an initial simplex was defined, that it is</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="comment">! appropriately sized.  If not, simply create a new simplex of the</span></div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <span class="comment">! appropriate size.</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="comment">! This matrix must be NDIM-by-NPTS</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">size</span>(this%m_simplex, 1) /= ndim .or. &amp;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                <span class="keyword">size</span>(this%m_simplex, 2) /= npts) <span class="keywordflow">then</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                    <span class="keyword">deallocate</span>(this%m_simplex)</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;                buildsimplex = .true.</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;                <span class="comment">! The simplex is appropriately sized</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                buildsimplex = .false.</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keyword">allocate</span>(f(npts), stat = flag)</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(pcent(ndim), stat = flag)</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(pmin(ndim), stat = flag)</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(work(ndim), stat = flag)</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (buildsimplex .and. flag == 0) <span class="keyword">allocate</span>(this%m_simplex(ndim, npts))</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, &amp;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="comment">! Define the initial simplex, if needed</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">if</span> (buildsimplex) <span class="keywordflow">then</span></div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            this%m_simplex(:,1) = x</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            <span class="keywordflow">do</span> i = 2, npts</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;                this%m_simplex(:,i) = x</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                this%m_simplex(i,i+1) = this%m_simplex(i,i+1) + this%m_initSize</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <span class="comment">! Evaluate the function at each vertex of the simplex</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordflow">do</span> i = 1, npts</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            f(i) = fcn%fcn(this%m_simplex(:,i))</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        neval = npts</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        fval = f(1)</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            pcent(i) = sum(this%m_simplex(i,:))</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="comment">! Main Loop</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="comment">! Update the iteration counter</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;            iter = iter + 1</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;            <span class="comment">! Determine the characteristics of each vertex</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;            ilo = 1</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">if</span> (f(1) &gt; f(2)) <span class="keywordflow">then</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                ihi = 1</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                ihi2 = 2</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                ihi = 2</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                ihi2 = 1</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            <span class="keywordflow">do</span> i = 1, npts</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                <span class="keywordflow">if</span> (f(i) &lt;= f(ilo)) ilo = i</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="keywordflow">if</span> (f(i) &gt; f(ihi)) <span class="keywordflow">then</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    ihi2 = ihi</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                    ihi = i</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f(i) &gt; f(ihi2)) <span class="keywordflow">then</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                    <span class="keywordflow">if</span> (i /= ihi) ihi2 = i</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            <span class="comment">! Check for convergence.  Nelder and Mead recommend using the</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="comment">! following convergence test: sqrt(sum(f - favg)**2 / n); however,</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;            <span class="comment">! it seems that a sufficient check may be made using only the</span></div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            <span class="comment">! extreme function values of the simplex (highest and lowest valued</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            <span class="comment">! points).</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;            rtol = abs(f(ihi) - f(ilo))</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;            <span class="keywordflow">if</span> (rtol &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                swp = f(1)</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                f(1) = f(ilo)</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                f(ilo) = swp</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                    swp = this%m_simplex(i,1)</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    this%m_simplex(i,1) = this%m_simplex(i,ilo)</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    this%m_simplex(i,ilo) = swp</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                    x(i) = this%m_simplex(i,1)</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                fval = f(1)</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                fcnvrg = .true.</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            <span class="comment">! Start of a new iteration by reflecting the simplex at its largest</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="comment">! point.</span></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            ftry = this%extrapolate(fcn, f, pcent, ihi, negone, neval, work)</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">if</span> (ftry &lt;= f(ilo)) <span class="keywordflow">then</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                <span class="comment">! The result of the reflection is better than the current</span></div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                <span class="comment">! best point.  As a result, try a factor of 2 in the reflected</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="comment">! direction.  Again, the highest point is of interest.</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                ftry = this%extrapolate(fcn, f, pcent, ihi, two, neval, work)</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ftry &gt;= f(ihi2)) <span class="keywordflow">then</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="comment">! The reflected point is worse than the second highest, so look</span></div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                <span class="comment">! for an intermediate lower point (contract the simplex)</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                fsave = f(ihi)</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                ftry = this%extrapolate(fcn, f, pcent, ihi, half, neval, work)</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                <span class="keywordflow">if</span> (ftry &gt;= fsave) <span class="keywordflow">then</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    <span class="comment">! Cannot improve on the high point.  Try to contract around</span></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    <span class="comment">! the low point.</span></div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    <span class="keywordflow">do</span> i = 1, npts</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                        <span class="keywordflow">if</span> (i /= ilo) <span class="keywordflow">then</span></div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;                            pcent = half * (this%m_simplex(:,i) + &amp;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                                this%m_simplex(:,ilo))</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                            this%m_simplex(:,i) = pcent</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                            f(i) = fcn%fcn(pcent)</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="keywordflow">                        end if</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="keywordflow">                    end do</span></div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                    neval = neval + npts</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                    <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                        pcent(i) = sum(this%m_simplex(i,:))</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="keywordflow">                    end do</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            <span class="comment">! Print iteration status</span></div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                print *, <span class="stringliteral">&quot;&quot;</span></div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, neval</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fval</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Convergence Parameter: &quot;</span>, rtol</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                flag = 1</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            ib%converge_on_chng = .false.</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        <span class="comment">! Get the function value at the computed minimum</span></div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fout)) fout = fval</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                <span class="stringliteral">&quot;The algorithm failed to converge.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                <span class="stringliteral">&quot;Convergence Parameter: &quot;</span>, rtol, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                <span class="stringliteral">&quot;Convergence Criteria: &quot;</span>, ftol</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;    <span class="keyword">module</span> function nm_extrapolate(this, fcn, y, pcent, ihi, fac, neval, &amp;</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;            work) result(ytry)</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y, pcent</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ihi</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: fac</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(inout)</span> :: neval</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: work</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        <span class="keywordtype">real(real64)</span> :: ytry</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ndim</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        <span class="keywordtype">real(real64)</span> :: fac1, fac2</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        ndim = <span class="keyword">size</span>(this%m_simplex, 1)</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;         <span class="comment">! Define a trial point</span></div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;         fac1 = (one - fac) / ndim</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;         fac2 = fac1 - fac</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;         <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            work(i) = pcent(i) * fac1 - this%m_simplex(i,ihi) * fac2</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;<span class="keywordflow">         end do</span></div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;         <span class="comment">! Evaluate the function at the trial point, and then replace if the</span></div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;         <span class="comment">! trial provides an improvement</span></div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;         ytry = fcn%fcn(work)</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;         neval = neval + 1</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;         <span class="keywordflow">if</span> (ytry &lt; y(ihi)) <span class="keywordflow">then</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;            y(ihi) = ytry</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;            <span class="keywordflow">do</span> i = 1, ndim</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;                pcent(i) = pcent(i) + work(i) - this%m_simplex(i,ihi)</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;                this%m_simplex(i,ihi) = work(i)</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;<span class="keywordflow">         end if</span></div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_simplex(this) result(p)</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: p</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            m = <span class="keyword">size</span>(this%m_simplex, 1)</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;            n = <span class="keyword">size</span>(this%m_simplex, 2)</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;            <span class="keyword">allocate</span>(p(m,n))</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;            p = this%m_simplex</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;    <span class="keyword">module</span> subroutine nm_set_simplex(this, x)</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(:,:)</span> :: x</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        m = <span class="keyword">size</span>(x, 1)</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        n = <span class="keyword">size</span>(x, 2)</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">size</span>(this%m_simplex, 1) /= m .or. &amp;</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;                <span class="keyword">size</span>(this%m_simplex, 2) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;                <span class="keyword">deallocate</span>(this%m_simplex)</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;                <span class="keyword">allocate</span>(this%m_simplex(m, n))</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;            <span class="keyword">allocate</span>(this%m_simplex(m, n))</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;        this%m_simplex = x</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_size(this) result(x)</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        <span class="keywordtype">real(real64)</span> :: x</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        x = this%m_initSize</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keyword">module</span> subroutine nm_set_size(this, x)</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        this%m_initSize = x</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_optimize_nelder_mead.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>) nonlin_optimize_nelder_mead</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine nm_solve(this, fcn, x, fout, ib, err)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: fout</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: negone = -1.0d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: buildSimplex, fcnvrg</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ihi, ilo, ihi2, ndim, npts, flag, neval, iter, &amp;</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            maxeval</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">        real</span>(real64) :: ftol, rtol, ftry, fsave, fval, swp</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: f, pcent, pmin, work</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160; </div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        ndim = fcn%get_variable_count()</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        npts = ndim + 1</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        buildsimplex = .true.</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        ftol = this%get_tolerance()</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%converge_on_chng = .false.</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160; </div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= ndim) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                <span class="stringliteral">&quot;It was expected to receive a coordinate vector of length &quot;</span>, &amp;</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                ndim, <span class="stringliteral">&quot; , but a vector of length &quot;</span>, <span class="keyword">size</span>(x), <span class="stringliteral">&quot; was received.&quot;</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160; </div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        <span class="comment">! Ensure that if an initial simplex was defined, that it is</span></div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        <span class="comment">! appropriately sized.  If not, simply create a new simplex of the</span></div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <span class="comment">! appropriate size.</span></div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="comment">! This matrix must be NDIM-by-NPTS</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">size</span>(this%m_simplex, 1) /= ndim .or. &amp;</div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                <span class="keyword">size</span>(this%m_simplex, 2) /= npts) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                    <span class="keyword">deallocate</span>(this%m_simplex)</div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;                buildsimplex = .true.</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;                <span class="comment">! The simplex is appropriately sized</span></div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                buildsimplex = .false.</div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160; </div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="keyword">allocate</span>(f(npts), stat = flag)</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(pcent(ndim), stat = flag)</div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(pmin(ndim), stat = flag)</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(work(ndim), stat = flag)</div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (buildsimplex .and. flag == 0) <span class="keyword">allocate</span>(this%m_simplex(ndim, npts))</div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160; </div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="comment">! Define the initial simplex, if needed</span></div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">if</span> (buildsimplex) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            this%m_simplex(:,1) = x</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            <span class="keywordflow">do</span> i = 2, npts</div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;                this%m_simplex(:,i) = x</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                this%m_simplex(i,i+1) = this%m_simplex(i,i+1) + this%m_initSize</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160; </div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <span class="comment">! Evaluate the function at each vertex of the simplex</span></div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordflow">do</span> i = 1, npts</div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            f(i) = fcn%fcn(this%m_simplex(:,i))</div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        neval = npts</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        fval = f(1)</div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160; </div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            pcent(i) = sum(this%m_simplex(i,:))</div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160; </div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="comment">! Main Loop</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="comment">! Update the iteration counter</span></div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;            iter = iter + 1</div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160; </div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;            <span class="comment">! Determine the characteristics of each vertex</span></div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;            ilo = 1</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">if</span> (f(1) &gt; f(2)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                ihi = 1</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                ihi2 = 2</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                ihi = 2</div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                ihi2 = 1</div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            <span class="keywordflow">do</span> i = 1, npts</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                <span class="keywordflow">if</span> (f(i) &lt;= f(ilo)) ilo = i</div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="keywordflow">if</span> (f(i) &gt; f(ihi)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    ihi2 = ihi</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                    ihi = i</div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (f(i) &gt; f(ihi2)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                    <span class="keywordflow">if</span> (i /= ihi) ihi2 = i</div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160; </div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            <span class="comment">! Check for convergence.  Nelder and Mead recommend using the</span></div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="comment">! following convergence test: sqrt(sum(f - favg)**2 / n); however,</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;            <span class="comment">! it seems that a sufficient check may be made using only the</span></div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            <span class="comment">! extreme function values of the simplex (highest and lowest valued</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            <span class="comment">! points).</span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;            rtol = abs(f(ihi) - f(ilo))</div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;            <span class="keywordflow">if</span> (rtol &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                swp = f(1)</div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                f(1) = f(ilo)</div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                f(ilo) = swp</div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                    swp = this%m_simplex(i,1)</div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    this%m_simplex(i,1) = this%m_simplex(i,ilo)</div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    this%m_simplex(i,ilo) = swp</div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                    x(i) = this%m_simplex(i,1)</div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                fval = f(1)</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                fcnvrg = .true.</div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160; </div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            <span class="comment">! Start of a new iteration by reflecting the simplex at its largest</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="comment">! point.</span></div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            ftry = this%extrapolate(fcn, f, pcent, ihi, negone, neval, work)</div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">if</span> (ftry &lt;= f(ilo)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                <span class="comment">! The result of the reflection is better than the current</span></div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                <span class="comment">! best point.  As a result, try a factor of 2 in the reflected</span></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                <span class="comment">! direction.  Again, the highest point is of interest.</span></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                ftry = this%extrapolate(fcn, f, pcent, ihi, two, neval, work)</div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ftry &gt;= f(ihi2)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="comment">! The reflected point is worse than the second highest, so look</span></div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                <span class="comment">! for an intermediate lower point (contract the simplex)</span></div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                fsave = f(ihi)</div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                ftry = this%extrapolate(fcn, f, pcent, ihi, half, neval, work)</div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                <span class="keywordflow">if</span> (ftry &gt;= fsave) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    <span class="comment">! Cannot improve on the high point.  Try to contract around</span></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    <span class="comment">! the low point.</span></div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    <span class="keywordflow">do</span> i = 1, npts</div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                        <span class="keywordflow">if</span> (i /= ilo) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;                            pcent = half * (this%m_simplex(:,i) + &amp;</div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                                this%m_simplex(:,ilo))</div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                            this%m_simplex(:,i) = pcent</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                            f(i) = fcn%fcn(pcent)</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="keywordflow">                        end if</span></div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="keywordflow">                    end do</span></div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                    neval = neval + npts</div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                    <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                        pcent(i) = sum(this%m_simplex(i,:))</div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="keywordflow">                    end do</span></div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160; </div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            <span class="comment">! Print iteration status</span></div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                print *, <span class="stringliteral">&quot;&quot;</span></div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration: &quot;</span>, iter</div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, neval</div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fval</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                print <span class="stringliteral">&#39;(AE8.3)&#39;</span>, <span class="stringliteral">&quot;Convergence Parameter: &quot;</span>, rtol</div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160; </div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                flag = 1</div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160; </div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            ib%converge_on_chng = .false.</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160; </div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        <span class="comment">! Get the function value at the computed minimum</span></div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(fout)) fout = fval</div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160; </div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                <span class="stringliteral">&quot;The algorithm failed to converge.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                <span class="stringliteral">&quot;Convergence Parameter: &quot;</span>, rtol, new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                <span class="stringliteral">&quot;Convergence Criteria: &quot;</span>, ftol</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;nm_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160; </div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;    <span class="keyword">module</span> function nm_extrapolate(this, fcn, y, pcent, ihi, fac, neval, &amp;</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;            work) result(ytry)</div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="keywordtype">class</span>(fcnnvar_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y, pcent</div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ihi</div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: fac</div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(inout)</span> :: neval</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: work</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="keywordtype">        real</span>(real64) :: ytry</div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160; </div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160; </div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ndim</div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="keywordtype">        real</span>(real64) :: fac1, fac2</div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160; </div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        ndim = <span class="keyword">size</span>(this%m_simplex, 1)</div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160; </div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;         <span class="comment">! Define a trial point</span></div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;         fac1 = (one - fac) / ndim</div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;         fac2 = fac1 - fac</div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;         <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            work(i) = pcent(i) * fac1 - this%m_simplex(i,ihi) * fac2</div>
+<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;<span class="keywordflow">         end do</span></div>
+<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160; </div>
+<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;         <span class="comment">! Evaluate the function at the trial point, and then replace if the</span></div>
+<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;         <span class="comment">! trial provides an improvement</span></div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;         ytry = fcn%fcn(work)</div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;         neval = neval + 1</div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;         <span class="keywordflow">if</span> (ytry &lt; y(ihi)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;            y(ihi) = ytry</div>
+<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;            <span class="keywordflow">do</span> i = 1, ndim</div>
+<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;                pcent(i) = pcent(i) + work(i) - this%m_simplex(i,ihi)</div>
+<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;                this%m_simplex(i,ihi) = work(i)</div>
+<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;<span class="keywordflow">         end if</span></div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160; </div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_simplex(this) result(p)</div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: p</div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            m = <span class="keyword">size</span>(this%m_simplex, 1)</div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;            n = <span class="keyword">size</span>(this%m_simplex, 2)</div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;            <span class="keyword">allocate</span>(p(m,n))</div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;            p = this%m_simplex</div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160; </div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;    <span class="keyword">module</span> subroutine nm_set_simplex(this, x)</div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">dimension(:,:)</span> :: x</div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        <span class="keywordtype">integer(int32)</span> :: m, n</div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        m = <span class="keyword">size</span>(x, 1)</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        n = <span class="keyword">size</span>(x, 2)</div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_simplex)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">size</span>(this%m_simplex, 1) /= m .or. &amp;</div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;                <span class="keyword">size</span>(this%m_simplex, 2) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;                <span class="keyword">deallocate</span>(this%m_simplex)</div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;                <span class="keyword">allocate</span>(this%m_simplex(m, n))</div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;            <span class="keyword">allocate</span>(this%m_simplex(m, n))</div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;        this%m_simplex = x</div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160; </div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function nm_get_size(this) result(x)</div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="keywordtype">        real</span>(real64) :: x</div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        x = this%m_initSize</div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160; </div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keyword">module</span> subroutine nm_set_size(this, x)</div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keywordtype">class</span>(nelder_mead), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        this%m_initSize = x</div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_optimize_nelder_mead.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__polynomials_8f90_source.html b/doc/html/nonlin__polynomials_8f90_source.html
index 4b29fc8..dcb087b 100644
--- a/doc/html/nonlin__polynomials_8f90_source.html
+++ b/doc/html/nonlin__polynomials_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_polynomials.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_polynomials.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,18 +91,794 @@
 <div class="title">nonlin_polynomials.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_polynomials.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! TO DO:</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! - Multiplication (convolution)</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">! - Division (deconvolution)</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">! - C interface</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : eigen, solve_least_squares</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a>, <span class="keywordtype">only</span> : nl_invalid_input_error, nl_array_size_error, &amp;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        nl_out_of_memory_error</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keywordtype">private</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keywordtype">public</span> :: <a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">assignment</span>(=)</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(+)</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(-)</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(*)</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! INTERFACES</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1assignment_07_0A_08.html">   32</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">assignment</span>(=)</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    <span class="keyword">module procedure</span> :: poly_equals</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keyword">module procedure</span> :: poly_dbl_equals</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    <span class="keyword">module procedure</span> :: poly_equals_array</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">end interface</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">   39</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(+)</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_add</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">end interface</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07-_08.html">   44</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(-)</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_subtract</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="keyword">end interface</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">   49</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(*)</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_mult</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <span class="keyword">module procedure</span> :: poly_dbl_mult</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keyword">module procedure</span> :: dbl_poly_mult</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keyword">end interface</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="comment">! TYPES</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html">   60</a></span>&#160;<span class="keyword">type</span> <a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordtype">private</span></div><div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27">   63</a></span>&#160;    <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: m_coeffs</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3">   66</a></span>&#160;    generic, <span class="keywordtype">public</span> :: initialize =&gt; init_poly, init_poly_coeffs</div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a">   68</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: order =&gt; get_poly_order</div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee">   70</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fit =&gt; poly_fit</div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912">   73</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fit_thru_zero =&gt; poly_fit_thru_zero</div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980">   75</a></span>&#160;    generic, <span class="keywordtype">public</span> :: evaluate =&gt; evaluate_real, evaluate_complex</div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd">   77</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: companion_mtx =&gt; poly_companion_mtx</div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26">   79</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: roots =&gt; poly_roots</div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c">   81</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get =&gt; get_poly_coefficient</div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620">   83</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_all =&gt; get_poly_coefficients</div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd">   85</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set =&gt; set_poly_coefficient</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordtype">procedure</span> :: evaluate_real =&gt; poly_eval_double</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;    <span class="keywordtype">procedure</span> :: evaluate_complex =&gt; poly_eval_complex</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <span class="keywordtype">procedure</span> :: init_poly</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    <span class="keywordtype">procedure</span> :: init_poly_coeffs</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keyword">end type</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">! POLYNOMIAL MEMBERS</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="keyword">    subroutine </span>init_poly(this, order, err)</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee">  111</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n, istat</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        n = order + 1</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordflow">if</span> (order &lt; 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            <span class="comment">! ERROR: Negative order is not supported</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;init_polynomial&quot;</span>, &amp;</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="stringliteral">&quot;A negative polynomial order is not supported.&quot;</span>, &amp;</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_coeffs)) <span class="keyword">deallocate</span>(this%m_coeffs)</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        <span class="keyword">allocate</span>(this%m_coeffs(n), stat = istat)</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <span class="keywordflow">if</span> (istat /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;init_polynomial&quot;</span>, &amp;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        this%m_coeffs = zero</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="keyword">    subroutine </span>init_poly_coeffs(this, c, err)</div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf">  168</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: c</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        n = <span class="keyword">size</span>(c)</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        <span class="comment">! Initialize the polynomial</span></div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="keyword">call </span>init_poly(this, n - 1, errmgr)</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;        <span class="comment">! Populate the polynomial coefficients</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;            <span class="keyword">call </span>this%set(i, c(i))</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;    <span class="keyword">pure function </span>get_poly_order(this) <span class="keyword">result</span>(n)</div><div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6">  204</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">allocated</span>(this%m_coeffs)) <span class="keywordflow">then</span></div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            n = -1</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            n = <span class="keyword">size</span>(this%m_coeffs) - 1</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="keyword">    subroutine </span>poly_fit(this, x, y, order, err)</div><div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735">  285</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordtype">integer(int32)</span>:: j, n, ncols, flag</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        n = <span class="keyword">size</span>(x)</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        ncols = order + 1</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(y) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            <span class="comment">! ERROR: Array size mismatch</span></div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, <span class="stringliteral">&quot;Array size mismatch.&quot;</span>, &amp;</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order &gt;= n .or. order &lt; 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;            <span class="comment">! ERROR: Requested order does not make sense</span></div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, <span class="stringliteral">&quot;The requested &quot;</span> // &amp;</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;                <span class="stringliteral">&quot;polynomial order is not valid for this data set.&quot;</span>, &amp;</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keyword">allocate</span>(a(n,ncols), stat = flag)</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, &amp;</div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;</div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        <span class="comment">! Ensure the polynomial object is initialized and sized appropriately</span></div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        <span class="keywordflow">if</span> (this%order() /= order) <span class="keywordflow">then</span></div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;            <span class="keyword">call </span>this%initialize(order, errmgr)</div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;</div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        <span class="comment">! Populate A</span></div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;            a(j,1) = one</div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;            a(j,2) = x(j)</div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;        <span class="keywordflow">do</span> j = 3, ncols</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;            a(:,j) = a(:,j-1) * x</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;        <span class="comment">! Solve: A * coeffs = y</span></div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="keyword">call </span>solve_least_squares(a, y, err = errmgr)</div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        <span class="comment">! Extract the coefficients from the first order+1 elements of Y</span></div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;        this%m_coeffs = y(1:ncols)</div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;<span class="keyword">    subroutine </span>poly_fit_thru_zero(this, x, y, order, err)</div><div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766">  376</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y</div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;        <span class="keywordtype">integer(int32)</span>:: j, n, ncols, flag</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;        n = <span class="keyword">size</span>(x)</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        ncols = order</div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;</div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(y) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;            <span class="comment">! ERROR: Array size mismatch</span></div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;                <span class="stringliteral">&quot;Array size mismatch.&quot;</span>, nl_array_size_error)</div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order &gt;= n .or. order &lt; 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;            <span class="comment">! ERROR: Requested order does not make sense</span></div><div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div><div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                <span class="stringliteral">&quot;The requested polynomial order is not valid for this &quot;</span> // &amp;</div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                <span class="stringliteral">&quot;data set.&quot;</span>, nl_invalid_input_error)</div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;</div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;        <span class="keyword">allocate</span>(a(n,ncols), stat = flag)</div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;        <span class="comment">! Ensure the polynomial object is initialized and sized appropriately</span></div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        <span class="keywordflow">if</span> (this%order() /= order) <span class="keywordflow">then</span></div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;            <span class="keyword">call </span>this%initialize(order, errmgr)</div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;            <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;</div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;        <span class="comment">! Populate A</span></div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        a(:,1) = x</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        <span class="keywordflow">do</span> j = 2, ncols</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;            a(:,j) = a(:,j-1) * x</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        <span class="comment">! Solve: A * coeffs = y</span></div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        <span class="keyword">call </span>solve_least_squares(a, y, err = errmgr)</div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;</div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="comment">! Extract the coefficients from the first order+1 elements of Y</span></div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        this%m_coeffs(1) = zero</div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        this%m_coeffs(2:ncols+1) = y(1:ncols)</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;</div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;    <span class="keyword">elemental function </span>poly_eval_double(this, x) <span class="keyword">result</span>(y)</div><div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383">  453</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;        <span class="keywordtype">real(real64)</span> :: y</div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;</div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, order, n</div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        order = this%order()</div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        n = order + 1</div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <span class="keywordflow">if</span> (order == -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;            y = zero</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order == 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            y = this%m_coeffs(1)</div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;</div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        y =this%m_coeffs(n) * x + this%m_coeffs(order)</div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;        <span class="keywordflow">do</span> j = n - 2, 1, -1</div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;            y = y * x + this%m_coeffs(j)</div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;    <span class="keyword">elemental function </span>poly_eval_complex(this, x) <span class="keyword">result</span>(y)</div><div class="line"><a name="l00490"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51">  490</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="keywordtype">complex(real64)</span> :: y</div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">parameter</span> :: zero = (0.0d0, 0.0d0)</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;</div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, order, n</div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;        order = this%order()</div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        n = order + 1</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        <span class="keywordflow">if</span> (order == -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;            y = zero</div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order == 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;            y = this%m_coeffs(1)</div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;</div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;        y =this%m_coeffs(n) * x + this%m_coeffs(order)</div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;        <span class="keywordflow">do</span> j = n - 2, 1, -1</div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;            y = y * x + this%m_coeffs(j)</div><div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;</div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;    <span class="keyword">pure function </span>poly_companion_mtx(this) <span class="keyword">result</span>(c)</div><div class="line"><a name="l00530"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a">  530</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(this%order(), this%order())</span> :: c</div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;</div><div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n</div><div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;</div><div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;        n = this%order()</div><div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        <span class="keywordflow">if</span> (n == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        c = zero</div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;            c(i,n) = -this%m_coeffs(i) / this%m_coeffs(n + 1)</div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;            <span class="keywordflow">if</span> (i &lt; n) c(i+1,i) = one</div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;</div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;<span class="keyword">    function </span>poly_roots(this, err) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00615"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343">  615</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">dimension(this%order())</span> :: z</div><div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;</div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: c</div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;        n = this%order()</div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;</div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! Quick Return</span></div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span></div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;</div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        <span class="comment">! Compute the companion matrix</span></div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        c = this%companion_mtx()</div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;</div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="comment">! Compute the eigenvalues of the companion matrix.  The eigenvalues are</span></div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="comment">! the roots of the polynomial.</span></div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keyword">call </span>eigen(c, z, err = err)</div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;</div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;<span class="keyword">    function </span>get_poly_coefficient(this, ind, err) <span class="keyword">result</span>(c)</div><div class="line"><a name="l00656"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d">  656</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ind</div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;        <span class="keywordtype">real(real64)</span> :: c</div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;</div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;</div><div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        c = 0.0d0</div><div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;</div><div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;        <span class="comment">! Quick Return</span></div><div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;</div><div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;        <span class="keywordflow">if</span> (ind &lt;= 0 .or. ind &gt; this%order() + 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;            <span class="comment">! ERROR: Index out of range</span></div><div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;get_polynomial_coefficient&quot;</span>, &amp;</div><div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;                <span class="stringliteral">&quot;The specified index is outside the bounds of the &quot;</span> // &amp;</div><div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;                <span class="stringliteral">&quot;coefficient array.&quot;</span>, nl_invalid_input_error)</div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;</div><div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;        <span class="comment">! Get the coefficient</span></div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        c = this%m_coeffs(ind)</div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;</div><div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;    <span class="keyword">pure function </span>get_poly_coefficients(this) <span class="keyword">result</span>(c)</div><div class="line"><a name="l00699"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3">  699</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">dimension(this%order() + 1)</span> :: c</div><div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;</div><div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;        c = this%m_coeffs</div><div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;</div><div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;<span class="keyword">    subroutine </span>set_poly_coefficient(this, ind, c, err)</div><div class="line"><a name="l00725"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0">  725</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ind</div><div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: c</div><div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;</div><div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;</div><div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;</div><div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;        <span class="comment">! Quick Return</span></div><div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;</div><div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;        <span class="keywordflow">if</span> (ind &lt;= 0 .or. ind &gt; this%order() + 1) <span class="keywordflow">then</span></div><div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;            <span class="comment">! ERROR: Index out of range</span></div><div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;set_polynomial_coefficient&quot;</span>, &amp;</div><div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;                <span class="stringliteral">&quot;The specified index is outside the bounds of the &quot;</span> // &amp;</div><div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;                <span class="stringliteral">&quot;coefficient array.&quot;</span>, nl_invalid_input_error)</div><div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160;</div><div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        this%m_coeffs(ind) = c</div><div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160;</div><div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;<span class="comment">! OPERATORS</span></div><div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;<span class="keyword">    subroutine </span>poly_equals(x, y)</div><div class="line"><a name="l00766"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82">  766</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(in)</span> :: y</div><div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;</div><div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div><div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;</div><div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;        ord = y%order()</div><div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        <span class="keywordflow">if</span> (x%order() /= ord) <span class="keyword">call </span>x%initialize(ord)</div><div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div><div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;            <span class="keyword">call </span>x%set(i, y%get(i))</div><div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;</div><div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;<span class="keyword">    subroutine </span>poly_dbl_equals(x, y)</div><div class="line"><a name="l00787"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08">  787</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: y</div><div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;</div><div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div><div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;</div><div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        ord = x%order()</div><div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div><div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;            <span class="keyword">call </span>x%set(i, y)</div><div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;</div><div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;<span class="keyword">    subroutine </span>poly_equals_array(x, y)</div><div class="line"><a name="l00807"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949">  807</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;        <span class="keywordtype">class</span>(polynomial), <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: y</div><div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;        <span class="keyword">call </span>x%initialize(y)</div><div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;</div><div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;<span class="keyword">    function </span>poly_poly_add(x, y) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00821"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2">  821</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div><div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div><div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;</div><div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, max_ord, x_ord, y_ord</div><div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;</div><div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;        x_ord = x%order()</div><div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        y_ord = y%order()</div><div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        max_ord = max(x_ord, y_ord)</div><div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;        <span class="keyword">call </span>z%initialize(max_ord)</div><div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;</div><div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;        <span class="comment">! Quick Return</span></div><div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord /= -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div><div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord /= -1 .and. y_ord == -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div><div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;</div><div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <span class="keywordflow">if</span> (x_ord &gt; y_ord) <span class="keywordflow">then</span></div><div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;            <span class="keywordflow">do</span> i = 1, y_ord + 1</div><div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div><div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;            <span class="keywordflow">do</span> i = y_ord + 2, x_ord</div><div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div><div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord &lt; y_ord) <span class="keywordflow">then</span></div><div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;            <span class="keywordflow">do</span> i = 1, x_ord + 1</div><div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div><div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;            <span class="keywordflow">do</span> i = x_ord + 2, y_ord + 1</div><div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div><div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div><div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;</div><div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;<span class="keyword">    function </span>poly_poly_subtract(x, y) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00878"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf">  878</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div><div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div><div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;</div><div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, max_ord, x_ord, y_ord</div><div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;</div><div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;        x_ord = x%order()</div><div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;        y_ord = y%order()</div><div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;        max_ord = max(x_ord, y_ord)</div><div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;        <span class="keyword">call </span>z%initialize(max_ord)</div><div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;</div><div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;        <span class="comment">! Quick Return</span></div><div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord == -1) <span class="keywordflow">return</span></div><div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord /= -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div><div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord /= -1 .and. y_ord == -1) <span class="keywordflow">then</span></div><div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div><div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;</div><div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;        <span class="keywordflow">if</span> (x_ord &gt; y_ord) <span class="keywordflow">then</span></div><div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;            <span class="keywordflow">do</span> i = 1, y_ord + 1</div><div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div><div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;            <span class="keywordflow">do</span> i = y_ord + 2, x_ord</div><div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div><div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord &lt; y_ord) <span class="keywordflow">then</span></div><div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;            <span class="keywordflow">do</span> i = 1, x_ord + 1</div><div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div><div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            <span class="keywordflow">do</span> i = x_ord + 2, y_ord + 1</div><div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;                <span class="keyword">call </span>z%set(i, -y%get(i))</div><div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div><div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div><div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;</div><div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;<span class="keyword">    function </span>poly_poly_mult(x, y) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00935"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60">  935</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div><div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div><div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;</div><div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, j, m, n</div><div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;        <span class="keywordtype">real(real64)</span> :: val</div><div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;</div><div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        n = x%order() + 1</div><div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;        m = y%order() + 1</div><div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        <span class="keyword">call </span>z%initialize(x%order() + y%order()) <span class="comment">! Sets z to all zeros</span></div><div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;</div><div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div><div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;            <span class="keywordflow">do</span> j = 1, m</div><div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;                val = z%get(i + j - 1) + x%get(i) * y%get(j)</div><div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;                <span class="keyword">call </span>z%set(i + j - 1, val)</div><div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;</div><div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;<span class="keyword">    function </span>poly_dbl_mult(x, y) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00965"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2">  965</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: y</div><div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div><div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;</div><div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div><div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;</div><div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;        ord = x%order()</div><div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keyword">call </span>z%initialize(ord)</div><div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div><div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;            <span class="keyword">call </span>z%set(i, x%get(i) * y)</div><div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;</div><div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;<span class="keyword">    function </span>dbl_poly_mult(x, y) <span class="keyword">result</span>(z)</div><div class="line"><a name="l00989"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">  989</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: y</div><div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div><div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;</div><div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div><div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;</div><div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;        ord = y%order()</div><div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;        <span class="keyword">call </span>z%initialize(ord)</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;            <span class="keyword">call </span>z%set(i, y%get(i) * x)</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;<span class="comment">! Example Polynomial Code (Coefficients go from lowest order to highest)</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;<span class="comment">! src: https://github.com/JuliaMath/Polynomials.jl</span></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;<span class="comment">!</span></div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;<span class="comment">! function *{T,S}(p1::Poly{T}, p2::Poly{S})</span></div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;<span class="comment">!     if p1.var != p2.var</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;<span class="comment">!         error(&quot;Polynomials must have same variable&quot;)</span></div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;<span class="comment">!     R = promote_type(T,S)</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;<span class="comment">!     n = length(p1)-1</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;<span class="comment">!     m = length(p2)-1</span></div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;<span class="comment">!     a = zeros(R,m+n+1)</span></div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;<span class="comment">!     for i = 0:n</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;<span class="comment">!         for j = 0:m</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;<span class="comment">!             a[i+j+1] += p1[i] * p2[j]</span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;<span class="comment">!         end</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;<span class="comment">!     Poly(a,p1.var)</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;<span class="comment">! end</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;<span class="comment">! ## older . operators, hack to avoid warning on v0.6</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;<span class="comment">! dot_operators = quote</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;<span class="comment">!     @compat Base.:.+{T&lt;:Number}(c::T, p::Poly) = +(p, c)</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;<span class="comment">!     @compat Base.:.+{T&lt;:Number}(p::Poly, c::T) = +(p, c)</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;<span class="comment">!     @compat Base.:.-{T&lt;:Number}(p::Poly, c::T) = +(p, -c)</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;<span class="comment">!     @compat Base.:.-{T&lt;:Number}(c::T, p::Poly) = +(p, -c)</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;<span class="comment">!     @compat Base.:.*{T&lt;:Number,S}(c::T, p::Poly{S}) = Poly(c * p.a, p.var)</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;<span class="comment">!     @compat Base.:.*{T&lt;:Number,S}(p::Poly{S}, c::T) = Poly(p.a * c, p.var)</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;<span class="comment">! end</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;<span class="comment">! VERSION &lt; v&quot;0.6.0-dev&quot; &amp;&amp; eval(dot_operators)</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;<span class="comment">! # are any values NaN</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;<span class="comment">! hasnan(p::Poly) = reduce(|, (@compat isnan.(p.a)))</span></div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;<span class="comment">! function divrem{T, S}(num::Poly{T}, den::Poly{S})</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;<span class="comment">!     if num.var != den.var</span></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;<span class="comment">!         error(&quot;Polynomials must have same variable&quot;)</span></div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;<span class="comment">!     m = length(den)-1</span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;<span class="comment">!     if m == 0 &amp;&amp; den[0] == 0</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;<span class="comment">!         throw(DivideError())</span></div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;<span class="comment">!     R = typeof(one(T)/one(S))</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;<span class="comment">!     n = length(num)-1</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;<span class="comment">!     deg = n-m+1</span></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;<span class="comment">!     if deg &lt;= 0</span></div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;<span class="comment">!         return convert(Poly{R}, zero(num)), convert(Poly{R}, num)</span></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;<span class="comment">!     aQ = zeros(R, deg)</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;<span class="comment">!     # aR = deepcopy(num.a)</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;<span class="comment">!     # @show num.a</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;<span class="comment">!     aR = R[ num.a[i] for i = 1:n+1 ]</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;<span class="comment">!     for i = n:-1:m</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;<span class="comment">!         quot = aR[i+1] / den[m]</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;<span class="comment">!         aQ[i-m+1] = quot</span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;<span class="comment">!         for j = 0:m</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;<span class="comment">!             elem = den[j]*quot</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;<span class="comment">!             aR[i-(m-j)+1] -= elem</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;<span class="comment">!         end</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;<span class="comment">!     end</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;<span class="comment">!     pQ = Poly(aQ, num.var)</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;<span class="comment">!     pR = Poly(aR, num.var)</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;<span class="comment">!     return pQ, pR</span></div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;<span class="comment">! end</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;<span class="comment">! div(num::Poly, den::Poly) = divrem(num, den)[1]</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;<span class="comment">! rem(num::Poly, den::Poly) = divrem(num, den)[2]</span></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;<span class="comment">! ==(p1::Poly, p2::Poly) = (p1.var == p2.var &amp;&amp; p1.a == p2.a)</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;<span class="comment">! ==(p1::Poly, n::Number) = (coeffs(p1) == [n])</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;<span class="comment">! ==(n::Number, p1::Poly) = (p1 == n)</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="namespacenonlin__polynomials_html"><div class="ttname"><a href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="ttdoc">polynomials </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00013">nonlin_polynomials.f90:13</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="structnonlin__polynomials_1_1polynomial_html"><div class="ttname"><a href="structnonlin__polynomials_1_1polynomial.html">nonlin_polynomials::polynomial</a></div><div class="ttdoc">Defines a polynomial, and associated routines for performing polynomial operations. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00060">nonlin_polynomials.f90:60</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_polynomials.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160; </div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">! TO DO:</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! - Multiplication (convolution)</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">! - Division (deconvolution)</span></div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">! - C interface</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160; </div>
+<div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html">   13</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : eigen, solve_least_squares</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a>, <span class="keywordtype">only</span> : nl_invalid_input_error, nl_array_size_error, &amp;</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        nl_out_of_memory_error</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keywordtype">private</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keywordtype">public</span> :: <a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">assignment</span>(=)</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(+)</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(-)</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">public</span> :: <span class="keyword">operator</span>(*)</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160; </div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! INTERFACES</span></div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">   32</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">assignment</span>(=)</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    <span class="keyword">module procedure</span> :: poly_equals</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keyword">module procedure</span> :: poly_dbl_equals</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    <span class="keyword">module procedure</span> :: poly_equals_array</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">end interface</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160; </div>
+<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">   39</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(+)</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_add</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">end interface</span></div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160; </div>
+<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07-_08.html">   44</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(-)</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_subtract</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="keyword">end interface</span></div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160; </div>
+<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">   49</a></span>&#160;<span class="keyword">interface</span> <span class="keyword">operator</span>(*)</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keyword">module procedure</span> :: poly_poly_mult</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <span class="keyword">module procedure</span> :: poly_dbl_mult</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keyword">module procedure</span> :: dbl_poly_mult</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keyword">end interface</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160; </div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="comment">! TYPES</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html">   60</a></span>&#160;<span class="keyword">type</span> <a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a></div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordtype">private</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27">   63</a></span>&#160;<span class="keywordtype">    real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: m_coeffs</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3">   66</a></span>&#160;    generic, <span class="keywordtype">public</span> :: initialize =&gt; init_poly, init_poly_coeffs</div>
+<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a">   68</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: order =&gt; get_poly_order</div>
+<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee">   70</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fit =&gt; poly_fit</div>
+<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912">   73</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: fit_thru_zero =&gt; poly_fit_thru_zero</div>
+<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980">   75</a></span>&#160;    generic, <span class="keywordtype">public</span> :: evaluate =&gt; evaluate_real, evaluate_complex</div>
+<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd">   77</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: companion_mtx =&gt; poly_companion_mtx</div>
+<div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26">   79</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: roots =&gt; poly_roots</div>
+<div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c">   81</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get =&gt; get_poly_coefficient</div>
+<div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620">   83</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_all =&gt; get_poly_coefficients</div>
+<div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd">   85</a></span>&#160;    <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set =&gt; set_poly_coefficient</div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160; </div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordtype">procedure</span> :: evaluate_real =&gt; poly_eval_double</div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;    <span class="keywordtype">procedure</span> :: evaluate_complex =&gt; poly_eval_complex</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    <span class="keywordtype">procedure</span> :: init_poly</div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    <span class="keywordtype">procedure</span> :: init_poly_coeffs</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keyword">end type</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160; </div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">! POLYNOMIAL MEMBERS</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    <span class="keyword">subroutine </span>init_poly(this, order, err)</div>
+<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee">  111</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160; </div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160; </div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n, istat</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160; </div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        n = order + 1</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160; </div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordflow">if</span> (order &lt; 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            <span class="comment">! ERROR: Negative order is not supported</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;init_polynomial&quot;</span>, &amp;</div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="stringliteral">&quot;A negative polynomial order is not supported.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160; </div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_coeffs)) <span class="keyword">deallocate</span>(this%m_coeffs)</div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        <span class="keyword">allocate</span>(this%m_coeffs(n), stat = istat)</div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        <span class="keywordflow">if</span> (istat /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;init_polynomial&quot;</span>, &amp;</div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        this%m_coeffs = zero</div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160; </div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    <span class="keyword">subroutine </span>init_poly_coeffs(this, c, err)</div>
+<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf">  168</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: c</div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160; </div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n</div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160; </div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        n = <span class="keyword">size</span>(c)</div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160; </div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        <span class="comment">! Initialize the polynomial</span></div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="keyword">call </span>init_poly(this, n - 1, errmgr)</div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160; </div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;        <span class="comment">! Populate the polynomial coefficients</span></div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;            <span class="keyword">call </span>this%set(i, c(i))</div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160; </div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>get_poly_order(this) <span class="keyword">result</span>(n)</div>
+<div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6">  204</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">allocated</span>(this%m_coeffs)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            n = -1</div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            n = <span class="keyword">size</span>(this%m_coeffs) - 1</div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160; </div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;    <span class="keyword">subroutine </span>poly_fit(this, x, y, order, err)</div>
+<div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735">  285</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160; </div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160; </div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordtype">integer(int32)</span>:: j, n, ncols, flag</div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160; </div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        n = <span class="keyword">size</span>(x)</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        ncols = order + 1</div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160; </div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(y) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            <span class="comment">! ERROR: Array size mismatch</span></div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, <span class="stringliteral">&quot;Array size mismatch.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order &gt;= n .or. order &lt; 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;            <span class="comment">! ERROR: Requested order does not make sense</span></div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, <span class="stringliteral">&quot;The requested &quot;</span> // &amp;</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;                <span class="stringliteral">&quot;polynomial order is not valid for this data set.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160; </div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keyword">allocate</span>(a(n,ncols), stat = flag)</div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit&quot;</span>, &amp;</div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160; </div>
+<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        <span class="comment">! Ensure the polynomial object is initialized and sized appropriately</span></div>
+<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        <span class="keywordflow">if</span> (this%order() /= order) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;            <span class="keyword">call </span>this%initialize(order, errmgr)</div>
+<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160; </div>
+<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        <span class="comment">! Populate A</span></div>
+<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;        <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;            a(j,1) = one</div>
+<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;            a(j,2) = x(j)</div>
+<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;        <span class="keywordflow">do</span> j = 3, ncols</div>
+<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;            a(:,j) = a(:,j-1) * x</div>
+<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160; </div>
+<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;        <span class="comment">! Solve: A * coeffs = y</span></div>
+<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="keyword">call </span>solve_least_squares(a, y, err = errmgr)</div>
+<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160; </div>
+<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        <span class="comment">! Extract the coefficients from the first order+1 elements of Y</span></div>
+<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;        this%m_coeffs = y(1:ncols)</div>
+<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160; </div>
+<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;    <span class="keyword">subroutine </span>poly_fit_thru_zero(this, x, y, order, err)</div>
+<div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766">  376</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: y</div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: order</div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160; </div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160; </div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;        <span class="keywordtype">integer(int32)</span>:: j, n, ncols, flag</div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:,:)</span> :: a</div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160; </div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;        n = <span class="keyword">size</span>(x)</div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        ncols = order</div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160; </div>
+<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(y) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;            <span class="comment">! ERROR: Array size mismatch</span></div>
+<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div>
+<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;                <span class="stringliteral">&quot;Array size mismatch.&quot;</span>, nl_array_size_error)</div>
+<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order &gt;= n .or. order &lt; 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;            <span class="comment">! ERROR: Requested order does not make sense</span></div>
+<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div>
+<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;                <span class="stringliteral">&quot;The requested polynomial order is not valid for this &quot;</span> // &amp;</div>
+<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;                <span class="stringliteral">&quot;data set.&quot;</span>, nl_invalid_input_error)</div>
+<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160; </div>
+<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;        <span class="keyword">allocate</span>(a(n,ncols), stat = flag)</div>
+<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;polynomial_fit_thru_zero&quot;</span>, &amp;</div>
+<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160; </div>
+<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;        <span class="comment">! Ensure the polynomial object is initialized and sized appropriately</span></div>
+<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        <span class="keywordflow">if</span> (this%order() /= order) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;            <span class="keyword">call </span>this%initialize(order, errmgr)</div>
+<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;            <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160; </div>
+<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;        <span class="comment">! Populate A</span></div>
+<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        a(:,1) = x</div>
+<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        <span class="keywordflow">do</span> j = 2, ncols</div>
+<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;            a(:,j) = a(:,j-1) * x</div>
+<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160; </div>
+<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        <span class="comment">! Solve: A * coeffs = y</span></div>
+<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        <span class="keyword">call </span>solve_least_squares(a, y, err = errmgr)</div>
+<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        <span class="keywordflow">if</span> (errmgr%has_error_occurred()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160; </div>
+<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="comment">! Extract the coefficients from the first order+1 elements of Y</span></div>
+<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;        this%m_coeffs(1) = zero</div>
+<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        this%m_coeffs(2:ncols+1) = y(1:ncols)</div>
+<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160; </div>
+<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;    <span class="keywordtype">elemental</span> <span class="keyword">function </span>poly_eval_double(this, x) <span class="keyword">result</span>(y)</div>
+<div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383">  453</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;<span class="keywordtype">        real</span>(real64) :: y</div>
+<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160; </div>
+<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160; </div>
+<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, order, n</div>
+<div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160; </div>
+<div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;        order = this%order()</div>
+<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;        n = order + 1</div>
+<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <span class="keywordflow">if</span> (order == -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;            y = zero</div>
+<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order == 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            y = this%m_coeffs(1)</div>
+<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160; </div>
+<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;        y =this%m_coeffs(n) * x + this%m_coeffs(order)</div>
+<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;        <span class="keywordflow">do</span> j = n - 2, 1, -1</div>
+<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;            y = y * x + this%m_coeffs(j)</div>
+<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160; </div>
+<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;    <span class="keywordtype">elemental</span> <span class="keyword">function </span>poly_eval_complex(this, x) <span class="keyword">result</span>(y)</div>
+<div class="line"><a name="l00490"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51">  490</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="keywordtype">complex(real64)</span> :: y</div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160; </div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">parameter</span> :: zero = (0.0d0, 0.0d0)</div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160; </div>
+<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, order, n</div>
+<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160; </div>
+<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;        order = this%order()</div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        n = order + 1</div>
+<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        <span class="keywordflow">if</span> (order == -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;            y = zero</div>
+<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (order == 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;            y = this%m_coeffs(1)</div>
+<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160; </div>
+<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;        y =this%m_coeffs(n) * x + this%m_coeffs(order)</div>
+<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;        <span class="keywordflow">do</span> j = n - 2, 1, -1</div>
+<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;            y = y * x + this%m_coeffs(j)</div>
+<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160; </div>
+<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>poly_companion_mtx(this) <span class="keyword">result</span>(c)</div>
+<div class="line"><a name="l00530"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a">  530</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">dimension(this%order(), this%order())</span> :: c</div>
+<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160; </div>
+<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160; </div>
+<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, n</div>
+<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160; </div>
+<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;        n = this%order()</div>
+<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        <span class="keywordflow">if</span> (n == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        c = zero</div>
+<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;            c(i,n) = -this%m_coeffs(i) / this%m_coeffs(n + 1)</div>
+<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;            <span class="keywordflow">if</span> (i &lt; n) c(i+1,i) = one</div>
+<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160; </div>
+<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;    <span class="keyword">function </span>poly_roots(this, err) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00615"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343">  615</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        <span class="keywordtype">complex(real64)</span>, <span class="keywordtype">dimension(this%order())</span> :: z</div>
+<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160; </div>
+<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: c</div>
+<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160; </div>
+<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;        n = this%order()</div>
+<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160; </div>
+<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! Quick Return</span></div>
+<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160; </div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        <span class="comment">! Compute the companion matrix</span></div>
+<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        c = this%companion_mtx()</div>
+<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160; </div>
+<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="comment">! Compute the eigenvalues of the companion matrix.  The eigenvalues are</span></div>
+<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="comment">! the roots of the polynomial.</span></div>
+<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keyword">call </span>eigen(c, z, err = err)</div>
+<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160; </div>
+<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;    <span class="keyword">function </span>get_poly_coefficient(this, ind, err) <span class="keyword">result</span>(c)</div>
+<div class="line"><a name="l00656"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d">  656</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ind</div>
+<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;<span class="keywordtype">        real</span>(real64) :: c</div>
+<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160; </div>
+<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160; </div>
+<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        c = 0.0d0</div>
+<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160; </div>
+<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;        <span class="comment">! Quick Return</span></div>
+<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160; </div>
+<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;        <span class="keywordflow">if</span> (ind &lt;= 0 .or. ind &gt; this%order() + 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;            <span class="comment">! ERROR: Index out of range</span></div>
+<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;get_polynomial_coefficient&quot;</span>, &amp;</div>
+<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;                <span class="stringliteral">&quot;The specified index is outside the bounds of the &quot;</span> // &amp;</div>
+<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;                <span class="stringliteral">&quot;coefficient array.&quot;</span>, nl_invalid_input_error)</div>
+<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160; </div>
+<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;        <span class="comment">! Get the coefficient</span></div>
+<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        c = this%m_coeffs(ind)</div>
+<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160; </div>
+<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">function </span>get_poly_coefficients(this) <span class="keyword">result</span>(c)</div>
+<div class="line"><a name="l00699"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3">  699</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">dimension(this%order() + 1)</span> :: c</div>
+<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160; </div>
+<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;        c = this%m_coeffs</div>
+<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160; </div>
+<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;    <span class="keyword">subroutine </span>set_poly_coefficient(this, ind, c, err)</div>
+<div class="line"><a name="l00725"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0">  725</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: ind</div>
+<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: c</div>
+<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160; </div>
+<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160; </div>
+<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160; </div>
+<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;        <span class="comment">! Quick Return</span></div>
+<div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;        <span class="keywordflow">if</span> (this%order() == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160; </div>
+<div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;        <span class="keywordflow">if</span> (ind &lt;= 0 .or. ind &gt; this%order() + 1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;            <span class="comment">! ERROR: Index out of range</span></div>
+<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;set_polynomial_coefficient&quot;</span>, &amp;</div>
+<div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;                <span class="stringliteral">&quot;The specified index is outside the bounds of the &quot;</span> // &amp;</div>
+<div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;                <span class="stringliteral">&quot;coefficient array.&quot;</span>, nl_invalid_input_error)</div>
+<div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00752"></a><span class="lineno">  752</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00753"></a><span class="lineno">  753</span>&#160; </div>
+<div class="line"><a name="l00754"></a><span class="lineno">  754</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00755"></a><span class="lineno">  755</span>&#160;        this%m_coeffs(ind) = c</div>
+<div class="line"><a name="l00756"></a><span class="lineno">  756</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00757"></a><span class="lineno">  757</span>&#160; </div>
+<div class="line"><a name="l00758"></a><span class="lineno">  758</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;<span class="comment">! OPERATORS</span></div>
+<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;    <span class="keyword">subroutine </span>poly_equals(x, y)</div>
+<div class="line"><a name="l00766"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82">  766</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: y</div>
+<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160; </div>
+<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div>
+<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160; </div>
+<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;        ord = y%order()</div>
+<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        <span class="keywordflow">if</span> (x%order() /= ord) <span class="keyword">call </span>x%initialize(ord)</div>
+<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div>
+<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;            <span class="keyword">call </span>x%set(i, y%get(i))</div>
+<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160; </div>
+<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;    <span class="keyword">subroutine </span>poly_dbl_equals(x, y)</div>
+<div class="line"><a name="l00787"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08">  787</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: y</div>
+<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160; </div>
+<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div>
+<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160; </div>
+<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        ord = x%order()</div>
+<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div>
+<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;            <span class="keyword">call </span>x%set(i, y)</div>
+<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160; </div>
+<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;    <span class="keyword">subroutine </span>poly_equals_array(x, y)</div>
+<div class="line"><a name="l00807"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949">  807</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: y</div>
+<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;        <span class="keyword">call </span>x%initialize(y)</div>
+<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160; </div>
+<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;    <span class="keyword">function </span>poly_poly_add(x, y) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00821"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2">  821</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div>
+<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div>
+<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160; </div>
+<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, max_ord, x_ord, y_ord</div>
+<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160; </div>
+<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;        x_ord = x%order()</div>
+<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        y_ord = y%order()</div>
+<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        max_ord = max(x_ord, y_ord)</div>
+<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;        <span class="keyword">call </span>z%initialize(max_ord)</div>
+<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160; </div>
+<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;        <span class="comment">! Quick Return</span></div>
+<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord /= -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div>
+<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord /= -1 .and. y_ord == -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div>
+<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160; </div>
+<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <span class="keywordflow">if</span> (x_ord &gt; y_ord) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;            <span class="keywordflow">do</span> i = 1, y_ord + 1</div>
+<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div>
+<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;            <span class="keywordflow">do</span> i = y_ord + 2, x_ord</div>
+<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div>
+<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord &lt; y_ord) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;            <span class="keywordflow">do</span> i = 1, x_ord + 1</div>
+<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div>
+<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;            <span class="keywordflow">do</span> i = x_ord + 2, y_ord + 1</div>
+<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div>
+<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) + y%get(i))</div>
+<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160; </div>
+<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;    <span class="keyword">function </span>poly_poly_subtract(x, y) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00878"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf">  878</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div>
+<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div>
+<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160; </div>
+<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, max_ord, x_ord, y_ord</div>
+<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160; </div>
+<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;        x_ord = x%order()</div>
+<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;        y_ord = y%order()</div>
+<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;        max_ord = max(x_ord, y_ord)</div>
+<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;        <span class="keyword">call </span>z%initialize(max_ord)</div>
+<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160; </div>
+<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;        <span class="comment">! Quick Return</span></div>
+<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord == -1) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        <span class="keywordflow">if</span> (x_ord == -1 .and. y_ord /= -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;                <span class="keyword">call </span>z%set(i, y%get(i))</div>
+<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord /= -1 .and. y_ord == -1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div>
+<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160; </div>
+<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;        <span class="keywordflow">if</span> (x_ord &gt; y_ord) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;            <span class="keywordflow">do</span> i = 1, y_ord + 1</div>
+<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div>
+<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;            <span class="keywordflow">do</span> i = y_ord + 2, x_ord</div>
+<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i))</div>
+<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x_ord &lt; y_ord) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;            <span class="keywordflow">do</span> i = 1, x_ord + 1</div>
+<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div>
+<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;            <span class="keywordflow">do</span> i = x_ord + 2, y_ord + 1</div>
+<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;                <span class="keyword">call </span>z%set(i, -y%get(i))</div>
+<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;            <span class="keywordflow">do</span> i = 1, max_ord + 1</div>
+<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                <span class="keyword">call </span>z%set(i, x%get(i) - y%get(i))</div>
+<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160; </div>
+<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;    <span class="keyword">function </span>poly_poly_mult(x, y) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00935"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60">  935</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x, y</div>
+<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div>
+<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160; </div>
+<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, j, m, n</div>
+<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;<span class="keywordtype">        real</span>(real64) :: val</div>
+<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160; </div>
+<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        n = x%order() + 1</div>
+<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;        m = y%order() + 1</div>
+<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        <span class="keyword">call </span>z%initialize(x%order() + y%order()) <span class="comment">! Sets z to all zeros</span></div>
+<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160; </div>
+<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;            <span class="keywordflow">do</span> j = 1, m</div>
+<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;                val = z%get(i + j - 1) + x%get(i) * y%get(j)</div>
+<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;                <span class="keyword">call </span>z%set(i + j - 1, val)</div>
+<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160; </div>
+<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;    <span class="keyword">function </span>poly_dbl_mult(x, y) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00965"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2">  965</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: y</div>
+<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div>
+<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160; </div>
+<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div>
+<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160; </div>
+<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;        ord = x%order()</div>
+<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keyword">call </span>z%initialize(ord)</div>
+<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div>
+<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;            <span class="keyword">call </span>z%set(i, x%get(i) * y)</div>
+<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160; </div>
+<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;    <span class="keyword">function </span>dbl_poly_mult(x, y) <span class="keyword">result</span>(z)</div>
+<div class="line"><a name="l00989"></a><span class="lineno"><a class="line" href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">  989</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>), <span class="keywordtype">intent(in)</span> :: y</div>
+<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a>) :: z</div>
+<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160; </div>
+<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, ord</div>
+<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160; </div>
+<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;        ord = y%order()</div>
+<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;        <span class="keyword">call </span>z%initialize(ord)</div>
+<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;        <span class="keywordflow">do</span> i = 1, ord + 1</div>
+<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;            <span class="keyword">call </span>z%set(i, y%get(i) * x)</div>
+<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160; </div>
+<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160; </div>
+<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;<span class="comment">! Example Polynomial Code (Coefficients go from lowest order to highest)</span></div>
+<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;<span class="comment">! src: https://github.com/JuliaMath/Polynomials.jl</span></div>
+<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;<span class="comment">!</span></div>
+<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;<span class="comment">! function *{T,S}(p1::Poly{T}, p2::Poly{S})</span></div>
+<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;<span class="comment">!     if p1.var != p2.var</span></div>
+<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;<span class="comment">!         error(&quot;Polynomials must have same variable&quot;)</span></div>
+<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;<span class="comment">!     R = promote_type(T,S)</span></div>
+<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;<span class="comment">!     n = length(p1)-1</span></div>
+<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;<span class="comment">!     m = length(p2)-1</span></div>
+<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;<span class="comment">!     a = zeros(R,m+n+1)</span></div>
+<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160; </div>
+<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;<span class="comment">!     for i = 0:n</span></div>
+<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160;<span class="comment">!         for j = 0:m</span></div>
+<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;<span class="comment">!             a[i+j+1] += p1[i] * p2[j]</span></div>
+<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;<span class="comment">!         end</span></div>
+<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;<span class="comment">!     Poly(a,p1.var)</span></div>
+<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;<span class="comment">! end</span></div>
+<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160; </div>
+<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;<span class="comment">! ## older . operators, hack to avoid warning on v0.6</span></div>
+<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;<span class="comment">! dot_operators = quote</span></div>
+<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;<span class="comment">!     @compat Base.:.+{T&lt;:Number}(c::T, p::Poly) = +(p, c)</span></div>
+<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;<span class="comment">!     @compat Base.:.+{T&lt;:Number}(p::Poly, c::T) = +(p, c)</span></div>
+<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;<span class="comment">!     @compat Base.:.-{T&lt;:Number}(p::Poly, c::T) = +(p, -c)</span></div>
+<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;<span class="comment">!     @compat Base.:.-{T&lt;:Number}(c::T, p::Poly) = +(p, -c)</span></div>
+<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;<span class="comment">!     @compat Base.:.*{T&lt;:Number,S}(c::T, p::Poly{S}) = Poly(c * p.a, p.var)</span></div>
+<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;<span class="comment">!     @compat Base.:.*{T&lt;:Number,S}(p::Poly{S}, c::T) = Poly(p.a * c, p.var)</span></div>
+<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;<span class="comment">! end</span></div>
+<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;<span class="comment">! VERSION &lt; v&quot;0.6.0-dev&quot; &amp;&amp; eval(dot_operators)</span></div>
+<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160; </div>
+<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160; </div>
+<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;<span class="comment">! # are any values NaN</span></div>
+<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;<span class="comment">! hasnan(p::Poly) = reduce(|, (@compat isnan.(p.a)))</span></div>
+<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160; </div>
+<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;<span class="comment">! function divrem{T, S}(num::Poly{T}, den::Poly{S})</span></div>
+<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;<span class="comment">!     if num.var != den.var</span></div>
+<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;<span class="comment">!         error(&quot;Polynomials must have same variable&quot;)</span></div>
+<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;<span class="comment">!     m = length(den)-1</span></div>
+<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;<span class="comment">!     if m == 0 &amp;&amp; den[0] == 0</span></div>
+<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;<span class="comment">!         throw(DivideError())</span></div>
+<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;<span class="comment">!     R = typeof(one(T)/one(S))</span></div>
+<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;<span class="comment">!     n = length(num)-1</span></div>
+<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;<span class="comment">!     deg = n-m+1</span></div>
+<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;<span class="comment">!     if deg &lt;= 0</span></div>
+<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;<span class="comment">!         return convert(Poly{R}, zero(num)), convert(Poly{R}, num)</span></div>
+<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160; </div>
+<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;<span class="comment">!     aQ = zeros(R, deg)</span></div>
+<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;<span class="comment">!     # aR = deepcopy(num.a)</span></div>
+<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;<span class="comment">!     # @show num.a</span></div>
+<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;<span class="comment">!     aR = R[ num.a[i] for i = 1:n+1 ]</span></div>
+<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;<span class="comment">!     for i = n:-1:m</span></div>
+<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;<span class="comment">!         quot = aR[i+1] / den[m]</span></div>
+<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;<span class="comment">!         aQ[i-m+1] = quot</span></div>
+<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;<span class="comment">!         for j = 0:m</span></div>
+<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;<span class="comment">!             elem = den[j]*quot</span></div>
+<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;<span class="comment">!             aR[i-(m-j)+1] -= elem</span></div>
+<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;<span class="comment">!         end</span></div>
+<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;<span class="comment">!     end</span></div>
+<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;<span class="comment">!     pQ = Poly(aQ, num.var)</span></div>
+<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;<span class="comment">!     pR = Poly(aR, num.var)</span></div>
+<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160; </div>
+<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;<span class="comment">!     return pQ, pR</span></div>
+<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;<span class="comment">! end</span></div>
+<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160; </div>
+<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;<span class="comment">! div(num::Poly, den::Poly) = divrem(num, den)[1]</span></div>
+<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;<span class="comment">! rem(num::Poly, den::Poly) = divrem(num, den)[2]</span></div>
+<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160; </div>
+<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;<span class="comment">! ==(p1::Poly, p2::Poly) = (p1.var == p2.var &amp;&amp; p1.a == p2.a)</span></div>
+<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;<span class="comment">! ==(p1::Poly, n::Number) = (coeffs(p1) == [n])</span></div>
+<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;<span class="comment">! ==(n::Number, p1::Poly) = (p1 == n)</span></div>
+<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__polynomials_html"><div class="ttname"><a href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="ttdoc">polynomials</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00013">nonlin_polynomials.f90:13</a></div></div>
+<div class="ttc" id="astructnonlin__polynomials_1_1polynomial_html"><div class="ttname"><a href="structnonlin__polynomials_1_1polynomial.html">nonlin_polynomials::polynomial</a></div><div class="ttdoc">Defines a polynomial, and associated routines for performing polynomial operations.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00060">nonlin_polynomials.f90:60</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_polynomials.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve_8f90_source.html b/doc/html/nonlin__solve_8f90_source.html
index 1aea8f4..6b3cf03 100644
--- a/doc/html/nonlin__solve_8f90_source.html
+++ b/doc/html/nonlin__solve_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,31 +91,265 @@
 <div class="title">nonlin_solve.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00008"></a><span class="lineno"><a class="line" href="namespacenonlin__solve.html">    8</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>, limit_search_vector</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : qr_factor, form_qr, qr_rank1_update, lu_factor, &amp;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        rank1_update, mtx_mult, recip_mult_array, solve_triangular_system, &amp;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        solve_lu</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">implicit none</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">private</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keywordtype">public</span> :: test_convergence</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">! NONLIN_SOLVE_LINE_SEARCH.F90</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html">   31</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a>) :: <a class="code" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882">   34</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">allocatable</span> :: m_linesearch</div><div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf">   37</a></span>&#160;        <span class="keywordtype">logical</span> :: m_uselinesearch = .true.</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">   48</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_line_search =&gt; lss_get_line_search</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">   58</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_line_search =&gt; lss_set_line_search</div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">   68</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_default_line_search =&gt; lss_set_default</div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">   78</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_line_search_defined =&gt; &amp;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            lss_is_line_search_defined</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">   89</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_use_line_search =&gt; lss_get_use_search</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">   99</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_use_line_search =&gt; lss_set_use_search</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keyword">module</span> subroutine lss_get_line_search(this, ls)</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keyword">module</span> subroutine lss_set_line_search(this, ls)</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: ls</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keyword">module</span> subroutine lss_set_default(this)</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>) :: ls</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_is_line_search_defined(this) result(x)</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_get_use_search(this) result(x)</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;            <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keyword">module</span> subroutine lss_set_use_search(this, x)</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="comment">! NONLIN_SOLVE_QUASI_NEWTON.F90</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html">  139</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_solver) :: quasi_newton_solver</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="keywordtype">private</span></div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8">  142</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_jdelta = 5</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">  237</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; qns_solve</div><div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3">  248</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_jacobian_interval =&gt; qns_get_jac_interval</div><div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">  259</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_jacobian_interval =&gt; qns_set_jac_interval</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keyword">module</span> subroutine qns_solve(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function qns_get_jac_interval(this) result(n)</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;<span class="keyword">        end function</span></div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        <span class="keyword">module</span> subroutine qns_set_jac_interval(this, n)</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__solver.html">  287</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_solver) :: newton_solver</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">  378</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; ns_solve</div><div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="keyword">module</span> subroutine ns_solve(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;            <span class="keywordtype">class</span>(newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;</div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="comment">! NONLIN_SOLVE_BRENT.F90</span></div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00398"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1brent__solver.html">  398</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a>) :: brent_solver</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">  479</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; brent_solve</div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;        <span class="keyword">module</span> subroutine brent_solve(this, fcn, x, lim, f, ib, err)</div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;            <span class="keywordtype">class</span>(brent_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;<span class="comment">! NONLIN_SOLVE_NEWTON1VAR.F90</span></div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00502"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__1var__solver.html">  502</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a>) :: newton_1var_solver</div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;    <span class="keyword">contains</span></div><div class="line"><a name="l00591"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">  591</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; newt1var_solve</div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;<span class="keyword">    end type</span></div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;    <span class="keyword">interface</span></div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;        <span class="keyword">module</span> subroutine newt1var_solve(this, fcn, x, lim, f, ib, err)</div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;            <span class="keywordtype">class</span>(newton_1var_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;            <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;<span class="keyword">        end subroutine</span></div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="keyword">    end interface</span></div><div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;</div><div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="comment">! ******************************************************************************</span></div><div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;<span class="comment">! GENERAL ROUTINES</span></div><div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;<span class="keyword">    subroutine </span>test_convergence(x, xo, f, g, lg, xtol, ftol, gtol, c, cx, cf, &amp;</div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;            cg, xnorm, fnorm)</div><div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456">  631</a></span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x, xo, f, g</div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: xtol, ftol, gtol</div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: lg</div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(out)</span> :: c, cx, cf, cg</div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span> :: xnorm, fnorm</div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;</div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;</div><div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, nvar, neqn</div><div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;        <span class="keywordtype">real(real64)</span> :: test, dxmax, fc, den</div><div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;</div><div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        nvar = <span class="keyword">size</span>(x)</div><div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        neqn = <span class="keyword">size</span>(f)</div><div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        cx = .false.</div><div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        cf = .false.</div><div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        cg = .false.</div><div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;        c = .false.</div><div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;        fc = half * dot_product(f, f)</div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        fnorm = zero</div><div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        xnorm = zero</div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;</div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="comment">! Test for convergence on residual</span></div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;            fnorm = max(abs(f(i)), fnorm)</div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        <span class="keywordflow">if</span> (fnorm &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;            cf = .true.</div><div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;            c = .true.</div><div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;</div><div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="comment">! Test the change in solution</span></div><div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;        <span class="keywordflow">do</span> i = 1, nvar</div><div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;            test = abs(x(i) - xo(i)) / max(abs(x(i)), one)</div><div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            xnorm = max(test, xnorm)</div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;        <span class="keywordflow">if</span> (xnorm &lt; xtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;            cx = .true.</div><div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;            c = .true.</div><div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160;</div><div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;        <span class="comment">! Test for zero gradient slope - do not set convergence flag</span></div><div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;        <span class="keywordflow">if</span> (lg) <span class="keywordflow">then</span></div><div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;            test = zero</div><div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;            den = max(fc, half * nvar)</div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;            <span class="keywordflow">do</span> i = 1, nvar</div><div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                dxmax = abs(g(i)) * max(abs(x(i)), one) / den</div><div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;                test = max(test, dxmax)</div><div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;            <span class="keywordflow">if</span> (test &lt; gtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                cg = .true.</div><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;</div><div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;<span class="keyword">end module</span></div><div class="ttc" id="structnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
-<div class="ttc" id="structnonlin__solve_1_1quasi__newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></div><div class="ttdoc">Defines a quasi-Newton type solver based upon Broyden&amp;#39;s method. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00139">nonlin_solve.f90:139</a></div></div>
-<div class="ttc" id="structnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
-<div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
-<div class="ttc" id="structnonlin__solve_1_1line__search__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></div><div class="ttdoc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00031">nonlin_solve.f90:31</a></div></div>
-<div class="ttc" id="structnonlin__solve_1_1newton__1var__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1newton__1var__solver.html">nonlin_solve::newton_1var_solver</a></div><div class="ttdoc">Defines a solver based upon Newtons&amp;#39;s method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton&amp;#39;s method in order to keep bounds upon the Newton iterations. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00502">nonlin_solve.f90:502</a></div></div>
-<div class="ttc" id="namespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
-<div class="ttc" id="namespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1equation__solver__1var_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></div><div class="ttdoc">A base class for various solvers of equations of one variable. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01512">nonlin_core.f90:1512</a></div></div>
-<div class="ttc" id="structnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
-<div class="ttc" id="structnonlin__solve_1_1newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1newton__solver.html">nonlin_solve::newton_solver</a></div><div class="ttdoc">Defines a Newton solver. </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00287">nonlin_solve.f90:287</a></div></div>
-<div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
-<div class="ttc" id="structnonlin__solve_1_1brent__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1brent__solver.html">nonlin_solve::brent_solver</a></div><div class="ttdoc">Defines a solver based upon Brent&amp;#39;s method for solving an equation of one variable without using deri...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00398">nonlin_solve.f90:398</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00008"></a><span class="lineno"><a class="line" href="namespacenonlin__solve.html">    8</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env, only : int32, real64</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>, limit_search_vector</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keywordtype">use </span>linalg_core, <span class="keywordtype">only</span> : qr_factor, form_qr, qr_rank1_update, lu_factor, &amp;</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        rank1_update, mtx_mult, recip_mult_array, solve_triangular_system, &amp;</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        solve_lu</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;    <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a></div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a></div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    <span class="keywordtype">public</span> :: test_convergence</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160; </div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">! NONLIN_SOLVE_LINE_SEARCH.F90</span></div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html">   31</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">abstract</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a>) :: <a class="code" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a></div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882">   34</a></span>&#160;        <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">allocatable</span> :: m_linesearch</div>
+<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf">   37</a></span>&#160;        <span class="keywordtype">logical</span> :: m_uselinesearch = .true.</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">   48</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_line_search =&gt; lss_get_line_search</div>
+<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">   58</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_line_search =&gt; lss_set_line_search</div>
+<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">   68</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_default_line_search =&gt; lss_set_default</div>
+<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">   78</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: is_line_search_defined =&gt; &amp;</div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            lss_is_line_search_defined</div>
+<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">   89</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_use_line_search =&gt; lss_get_use_search</div>
+<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">   99</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_use_line_search =&gt; lss_set_use_search</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160; </div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keyword">module</span> subroutine lss_get_line_search(this, ls)</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160; </div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keyword">module</span> subroutine lss_set_line_search(this, ls)</div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160; </div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <span class="keyword">module</span> subroutine lss_set_default(this)</div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__linesearch_1_1line__search.html">line_search</a>) :: ls</div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160; </div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_is_line_search_defined(this) result(x)</div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160; </div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_get_use_search(this) result(x)</div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;            <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160; </div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keyword">module</span> subroutine lss_set_use_search(this, x)</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160; </div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="comment">! NONLIN_SOLVE_QUASI_NEWTON.F90</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html">  139</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_solver) :: quasi_newton_solver</div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="keywordtype">private</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8">  142</a></span>&#160;        <span class="keywordtype">integer(int32)</span> :: m_jdelta = 5</div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">  237</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; qns_solve</div>
+<div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3">  248</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: get_jacobian_interval =&gt; qns_get_jac_interval</div>
+<div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">  259</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: set_jacobian_interval =&gt; qns_set_jac_interval</div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160; </div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keyword">module</span> subroutine qns_solve(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160; </div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        <span class="keywordtype">pure</span> <span class="keyword">module</span> function qns_get_jac_interval(this) result(n)</div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;            <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160; </div>
+<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        <span class="keyword">module</span> subroutine qns_set_jac_interval(this, n)</div>
+<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;            <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;            <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160; </div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__solver.html">  287</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(line_search_solver) :: newton_solver</div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">  378</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; ns_solve</div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160; </div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="keyword">module</span> subroutine ns_solve(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;            <span class="keywordtype">class</span>(newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160; </div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;<span class="comment">! NONLIN_SOLVE_BRENT.F90</span></div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00398"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1brent__solver.html">  398</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a>) :: brent_solver</div>
+<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">  479</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; brent_solve</div>
+<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160; </div>
+<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;        <span class="keyword">module</span> subroutine brent_solve(this, fcn, x, lim, f, ib, err)</div>
+<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;            <span class="keywordtype">class</span>(brent_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160; </div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;<span class="comment">! NONLIN_SOLVE_NEWTON1VAR.F90</span></div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00502"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__1var__solver.html">  502</a></span>&#160;    <span class="keyword">type</span>, <span class="keyword">extends</span>(<a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a>) :: newton_1var_solver</div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00591"></a><span class="lineno"><a class="line" href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">  591</a></span>&#160;        <span class="keywordtype">procedure</span>, <span class="keywordtype">public</span> :: solve =&gt; newt1var_solve</div>
+<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;        <span class="keyword">module</span> subroutine newt1var_solve(this, fcn, x, lim, f, ib, err)</div>
+<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;            <span class="keywordtype">class</span>(newton_1var_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160; </div>
+<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;<span class="comment">! GENERAL ROUTINES</span></div>
+<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;    <span class="keyword">subroutine </span>test_convergence(x, xo, f, g, lg, xtol, ftol, gtol, c, cx, cf, &amp;</div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;            cg, xnorm, fnorm)</div>
+<div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456">  631</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x, xo, f, g</div>
+<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: xtol, ftol, gtol</div>
+<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: lg</div>
+<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(out)</span> :: c, cx, cf, cg</div>
+<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span> :: xnorm, fnorm</div>
+<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160; </div>
+<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160; </div>
+<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, nvar, neqn</div>
+<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;<span class="keywordtype">        real</span>(real64) :: test, dxmax, fc, den</div>
+<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160; </div>
+<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        nvar = <span class="keyword">size</span>(x)</div>
+<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;        neqn = <span class="keyword">size</span>(f)</div>
+<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        cx = .false.</div>
+<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        cf = .false.</div>
+<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        cg = .false.</div>
+<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;        c = .false.</div>
+<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;        fc = half * dot_product(f, f)</div>
+<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        fnorm = zero</div>
+<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        xnorm = zero</div>
+<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160; </div>
+<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="comment">! Test for convergence on residual</span></div>
+<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div>
+<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;            fnorm = max(abs(f(i)), fnorm)</div>
+<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        <span class="keywordflow">if</span> (fnorm &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;            cf = .true.</div>
+<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;            c = .true.</div>
+<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160; </div>
+<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;        <span class="comment">! Test the change in solution</span></div>
+<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;        <span class="keywordflow">do</span> i = 1, nvar</div>
+<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;            test = abs(x(i) - xo(i)) / max(abs(x(i)), one)</div>
+<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;            xnorm = max(test, xnorm)</div>
+<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00673"></a><span class="lineno">  673</span>&#160;        <span class="keywordflow">if</span> (xnorm &lt; xtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00674"></a><span class="lineno">  674</span>&#160;            cx = .true.</div>
+<div class="line"><a name="l00675"></a><span class="lineno">  675</span>&#160;            c = .true.</div>
+<div class="line"><a name="l00676"></a><span class="lineno">  676</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00677"></a><span class="lineno">  677</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00678"></a><span class="lineno">  678</span>&#160; </div>
+<div class="line"><a name="l00679"></a><span class="lineno">  679</span>&#160;        <span class="comment">! Test for zero gradient slope - do not set convergence flag</span></div>
+<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;        <span class="keywordflow">if</span> (lg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;            test = zero</div>
+<div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;            den = max(fc, half * nvar)</div>
+<div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;            <span class="keywordflow">do</span> i = 1, nvar</div>
+<div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;                dxmax = abs(g(i)) * max(abs(x(i)), one) / den</div>
+<div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;                test = max(test, dxmax)</div>
+<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;            <span class="keywordflow">if</span> (test &lt; gtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                cg = .true.</div>
+<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160; </div>
+<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1quasi__newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></div><div class="ttdoc">Defines a quasi-Newton type solver based upon Broyden's method.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00139">nonlin_solve.f90:139</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="astructnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
+<div class="ttc" id="anamespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1line__search__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></div><div class="ttdoc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00031">nonlin_solve.f90:31</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__solver__1var_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></div><div class="ttdoc">A base class for various solvers of equations of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01512">nonlin_core.f90:1512</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1equation__solver_html"><div class="ttname"><a href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></div><div class="ttdoc">A base class for various solvers of nonlinear systems of equations.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01260">nonlin_core.f90:1260</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1newton__solver.html">nonlin_solve::newton_solver</a></div><div class="ttdoc">Defines a Newton solver.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00287">nonlin_solve.f90:287</a></div></div>
+<div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1brent__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1brent__solver.html">nonlin_solve::brent_solver</a></div><div class="ttdoc">Defines a solver based upon Brent's method for solving an equation of one variable without using deri...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00398">nonlin_solve.f90:398</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1newton__1var__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1newton__1var__solver.html">nonlin_solve::newton_1var_solver</a></div><div class="ttdoc">Defines a solver based upon Newtons's method for solving an equation of one variable....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00502">nonlin_solve.f90:502</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve__brent_8f90_source.html b/doc/html/nonlin__solve__brent_8f90_source.html
index f7582d7..32ad04e 100644
--- a/doc/html/nonlin__solve__brent_8f90_source.html
+++ b/doc/html/nonlin__solve__brent_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve_brent.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve_brent.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,220 @@
 <div class="title">nonlin_solve_brent.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_brent.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_brent</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine brent_solve(this, fcn, x, lim, f, ib, err)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(brent_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: three = 3.0d0</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">logical</span> :: fcnvrg, xcnvrg</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">integer(int32)</span> :: neval, maxeval, flag, iter</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">real(real64)</span> :: ftol, xtol, a, b, c, fa, fb, fc, p, q, r, s, xm, e, d, &amp;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;            mn1, mn2, eps, tol1, temp</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        x = zero</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        a = min(lim%x1, lim%x2)</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        b = max(lim%x1, lim%x2)</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        neval = 0</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        iter = 0</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        eps = epsilon(eps)</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        ftol = this%get_fcn_tolerance()</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = zero</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, &amp;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">if</span> (abs(a - b) &lt; eps) <span class="keywordflow">then</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="comment">! ERROR: Search limits are too tight</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;Search limits have no &quot;</span> // &amp;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="stringliteral">&quot;appreciable difference between them.  Lower Limit: &quot;</span>, a, &amp;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;, Upper Limit: &quot;</span>, b</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        flag = 0</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        fa = fcn%fcn(a)</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        fb = fcn%fcn(b)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        neval = 2</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        fc = fb</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            <span class="comment">! Increment the iteration counter</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            iter = iter + 1</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            <span class="comment">! Adjust the bounding interval</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="keywordflow">if</span> ((fb &gt; zero .and. fc &gt;= zero) .or. &amp;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                    (fb &lt; zero .and. fc &lt; zero)) <span class="keywordflow">then</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                c = a</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;                fc = fa</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                d = b - a</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                e = d</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keywordflow">if</span> (abs(fc) &lt; abs(fb)) <span class="keywordflow">then</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                a = b</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;                b = c</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;                c = a</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;                fa = fb</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;                fb = fc</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;                fc = fa</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="comment">! Convergence Check</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            tol1 = two * eps * abs(b) + half * xtol</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            xm = half * (c - b)</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            <span class="keywordflow">if</span> (abs(fb) &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                x = b</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                fcnvrg = .true.</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">if</span> (abs(xm) &lt;= tol1) <span class="keywordflow">then</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                x = b</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                xcnvrg = .true.</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            <span class="comment">! Actual Method</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            <span class="keywordflow">if</span> (abs(e) &gt;= tol1 .and. abs(fa) &gt; abs(fb)) <span class="keywordflow">then</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                <span class="comment">! Attempt the inverse quadratic interpolation to determine</span></div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;                <span class="comment">! the root</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;                s = fb / fa</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="keywordflow">if</span> (abs(a - c) &lt; eps) <span class="keywordflow">then</span> <span class="comment">! a == c</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                    p = two * xm * s</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                    q = one - s</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    q = fa / fc</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                    r = fb / fc</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                    p = s * (two * xm * q * (q - r) - (b - a) * (r - one))</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    q = (q - one) * (r - one) * (s - one)</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                <span class="comment">! Ensure we&#39;re within bounds</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                <span class="keywordflow">if</span> (p &gt; zero) q = -q</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                p = abs(p)</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                mn1 = three * xm * q - abs(tol1 * q)</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                mn2 = abs(e * q)</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="keywordflow">if</span> (mn1 &lt; mn2) <span class="keywordflow">then</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    temp = mn1</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    temp = mn2</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                <span class="keywordflow">if</span> (two * p &lt; temp) <span class="keywordflow">then</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                    <span class="comment">! Accept the interpolation</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                    e = d</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                    d = p / q</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                    <span class="comment">! The interpolation failed, use bisection</span></div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                    d = xm</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                    e = d</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                <span class="comment">! The bounds are decreasing too slowly, use bisection</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                d = xm</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                e = d</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            <span class="comment">! Move the last best guess to the lower limit parameter (A)</span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;            a = b</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;            fa = fb</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            <span class="keywordflow">if</span> (abs(d) &gt; tol1) <span class="keywordflow">then</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                b = b + d</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                b = b + sign(tol1, xm)</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            fb = fcn%fcn(b)</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            <span class="comment">! Print iteration status</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, 0, xm, fb)</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                flag = 1</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        <span class="comment">! Report out iteration statistics and other optional outputs</span></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fb</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            ib%jacobian_count = 0</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;            ib%converge_on_zero_diff = .false.</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xm, &amp;</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fb</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_brent.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_brent</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine brent_solve(this, fcn, x, lim, f, ib, err)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(brent_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160; </div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: three = 3.0d0</div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160; </div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">logical</span> :: fcnvrg, xcnvrg</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">integer(int32)</span> :: neval, maxeval, flag, iter</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">        real</span>(real64) :: ftol, xtol, a, b, c, fa, fb, fc, p, q, r, s, xm, e, d, &amp;</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;            mn1, mn2, eps, tol1, temp</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160; </div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        x = zero</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        a = min(lim%x1, lim%x2)</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        b = max(lim%x1, lim%x2)</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        eps = epsilon(eps)</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        ftol = this%get_fcn_tolerance()</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = zero</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160; </div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">if</span> (abs(a - b) &lt; eps) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="comment">! ERROR: Search limits are too tight</span></div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;Search limits have no &quot;</span> // &amp;</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="stringliteral">&quot;appreciable difference between them.  Lower Limit: &quot;</span>, a, &amp;</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;, Upper Limit: &quot;</span>, b</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160; </div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        fa = fcn%fcn(a)</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        fb = fcn%fcn(b)</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        neval = 2</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        fc = fb</div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            <span class="comment">! Increment the iteration counter</span></div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            iter = iter + 1</div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160; </div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            <span class="comment">! Adjust the bounding interval</span></div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="keywordflow">if</span> ((fb &gt; zero .and. fc &gt;= zero) .or. &amp;</div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                    (fb &lt; zero .and. fc &lt; zero)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                c = a</div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;                fc = fa</div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                d = b - a</div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;                e = d</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keywordflow">if</span> (abs(fc) &lt; abs(fb)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                a = b</div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;                b = c</div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;                c = a</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;                fa = fb</div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;                fb = fc</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;                fc = fa</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160; </div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="comment">! Convergence Check</span></div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            tol1 = two * eps * abs(b) + half * xtol</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            xm = half * (c - b)</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            <span class="keywordflow">if</span> (abs(fb) &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                x = b</div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;                fcnvrg = .true.</div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">if</span> (abs(xm) &lt;= tol1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                x = b</div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                xcnvrg = .true.</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160; </div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            <span class="comment">! Actual Method</span></div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;            <span class="keywordflow">if</span> (abs(e) &gt;= tol1 .and. abs(fa) &gt; abs(fb)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                <span class="comment">! Attempt the inverse quadratic interpolation to determine</span></div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;                <span class="comment">! the root</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;                s = fb / fa</div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="keywordflow">if</span> (abs(a - c) &lt; eps) <span class="keywordflow">then</span> <span class="comment">! a == c</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                    p = two * xm * s</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                    q = one - s</div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    q = fa / fc</div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                    r = fb / fc</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                    p = s * (two * xm * q * (q - r) - (b - a) * (r - one))</div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    q = (q - one) * (r - one) * (s - one)</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160; </div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                <span class="comment">! Ensure we&#39;re within bounds</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                <span class="keywordflow">if</span> (p &gt; zero) q = -q</div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                p = abs(p)</div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                mn1 = three * xm * q - abs(tol1 * q)</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                mn2 = abs(e * q)</div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="keywordflow">if</span> (mn1 &lt; mn2) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                    temp = mn1</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    temp = mn2</div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                <span class="keywordflow">if</span> (two * p &lt; temp) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                    <span class="comment">! Accept the interpolation</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                    e = d</div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                    d = p / q</div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                    <span class="comment">! The interpolation failed, use bisection</span></div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                    d = xm</div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                    e = d</div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                <span class="comment">! The bounds are decreasing too slowly, use bisection</span></div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                d = xm</div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                e = d</div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160; </div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            <span class="comment">! Move the last best guess to the lower limit parameter (A)</span></div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;            a = b</div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;            fa = fb</div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            <span class="keywordflow">if</span> (abs(d) &gt; tol1) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                b = b + d</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                b = b + sign(tol1, xm)</div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            fb = fcn%fcn(b)</div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160; </div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            <span class="comment">! Print iteration status</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, 0, xm, fb)</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160; </div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                flag = 1</div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160; </div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;        <span class="comment">! Report out iteration statistics and other optional outputs</span></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fb</div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            ib%jacobian_count = 0</div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;            ib%converge_on_zero_diff = .false.</div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160; </div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xm, &amp;</div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fb</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve_brent.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve__line__search_8f90_source.html b/doc/html/nonlin__solve__line__search_8f90_source.html
index 5308d24..0c25faa 100644
--- a/doc/html/nonlin__solve__line__search_8f90_source.html
+++ b/doc/html/nonlin__solve__line__search_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve_line_search.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve_line_search.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,64 @@
 <div class="title">nonlin_solve_line_search.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_line_search.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_line_search</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine lss_get_line_search(this, ls)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) &amp;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;            <span class="keyword">allocate</span>(ls, source = this%m_lineSearch)</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ----------------------</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keyword">module</span> subroutine lss_set_line_search(this, ls)</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: ls</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) <span class="keyword">deallocate</span>(this%m_lineSearch)</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keyword">allocate</span>(this%m_lineSearch, source = ls)</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keyword">module</span> subroutine lss_set_default(this)</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">type</span>(line_search) :: ls</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keyword">call </span>this%set_line_search(ls)</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_is_line_search_defined(this) result(x)</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        x = <span class="keyword">allocated</span>(this%m_lineSearch)</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_get_use_search(this) result(x)</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        x = this%m_useLineSearch</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">module</span> subroutine lss_set_use_search(this, x)</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        this%m_useLineSearch = x</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_line_search.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_line_search</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine lss_get_line_search(this, ls)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) &amp;</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;            <span class="keyword">allocate</span>(ls, source = this%m_lineSearch)</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160; </div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ----------------------</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keyword">module</span> subroutine lss_set_line_search(this, ls)</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">allocated</span>(this%m_lineSearch)) <span class="keyword">deallocate</span>(this%m_lineSearch)</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keyword">allocate</span>(this%m_lineSearch, source = ls)</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    <span class="keyword">module</span> subroutine lss_set_default(this)</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">type</span>(line_search) :: ls</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keyword">call </span>this%set_line_search(ls)</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160; </div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_is_line_search_defined(this) result(x)</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        x = <span class="keyword">allocated</span>(this%m_lineSearch)</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160; </div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function lss_get_use_search(this) result(x)</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        x = this%m_useLineSearch</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160; </div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">module</span> subroutine lss_set_use_search(this, x)</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordtype">class</span>(line_search_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordtype">logical</span>, <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        this%m_useLineSearch = x</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve_line_search.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve__newton1var_8f90_source.html b/doc/html/nonlin__solve__newton1var_8f90_source.html
index 6c63e06..227218e 100644
--- a/doc/html/nonlin__solve__newton1var_8f90_source.html
+++ b/doc/html/nonlin__solve__newton1var_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve_newton1var.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve_newton1var.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,231 @@
 <div class="title">nonlin_solve_newton1var.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_newton1var.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_newton1var</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine newt1var_solve(this, fcn, x, lim, f, ib, err)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(newton_1var_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span> :: x</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: two = 2.0d0</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: fcnvrg, xcnvrg, dcnvrg</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: neval, ndiff, maxeval, flag, iter</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">real(real64)</span> :: ftol, xtol, dtol, xh, xl, fh, fl, x1, x2, eps, dxold, &amp;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;            dx, df, temp, ff</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        dcnvrg = .false.</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        neval = 0</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        ndiff = 0</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        iter = 0</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        ftol = this%get_fcn_tolerance()</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        dtol = this%get_diff_tolerance()</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = zero</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%jacobian_count = ndiff</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%converge_on_zero_diff = dcnvrg</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        x1 = min(lim%x1, lim%x2)</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        x2 = max(lim%x1, lim%x2)</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        eps = epsilon(eps)</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, &amp;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">if</span> (abs(x1 - x2) &lt; eps) <span class="keywordflow">then</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="comment">! ERROR: Search limits are too tight</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;Search limits have no &quot;</span> // &amp;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="stringliteral">&quot;appreciable difference between them.  Lower Limit: &quot;</span>, x1, &amp;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;, Upper Limit: &quot;</span>, x2</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="comment">! See if the root is one of the end points</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        flag = 0</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        fl = fcn%fcn(x1)</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        fh = fcn%fcn(x2)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        neval = 2</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keywordflow">if</span> (abs(fl) &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            x = x1</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fl</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                ib%converge_on_fcn = .true.</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                ib%fcn_count = 2</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (abs(fh) &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            x = x2</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fh</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                ib%converge_on_fcn = .true.</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                ib%fcn_count = 2</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (fl &lt; zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            xl = x1</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            xh = x2</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            xl = x2</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            xh = x1</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        x = p5 * (x1 + x2)</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        dxold = abs(x2 - x1)</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        dx = dxold</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        ff = fcn%fcn(x)</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        df = fcn%diff(x, ff)</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        neval = neval + 1</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        ndiff = ndiff + 1</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keywordflow">do</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            <span class="comment">! Increment the iteration counter</span></div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            iter = iter + 1</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            <span class="comment">! Bisect if the Newton step went out of range, or if the rate</span></div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            <span class="comment">! of change was too slow</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            <span class="keywordflow">if</span> ((((x - xh) * df - ff) * ((x - xl) * df - ff) &gt; zero) .or. &amp;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                (abs(two * ff) &gt; abs(dxold * df))) &amp;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordflow">then</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <span class="comment">! Bisection</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                dxold = dx</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                dx = p5 * (xh - xl)</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                x = xl + dx</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                <span class="keywordflow">if</span> (abs(xl - x) &lt; xtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    <span class="comment">! Convergence as the change in root is within tolerance</span></div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                    xcnvrg = .true.</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Newton&#39;s Method</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                dxold = dx</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                dx = ff / df</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                temp = x</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                x = x - dx</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="keywordflow">if</span> (abs(temp - x) &lt; xtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    <span class="comment">! Convergence as the change in root is within tolerance</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                    xcnvrg = .true.</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="comment">! Update function values</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;            ff = fcn%fcn(x)</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            df = fcn%diff(x, ff)</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;            ndiff = ndiff + 1</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;            <span class="comment">! Check for convergence</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;            <span class="keywordflow">if</span> (abs(ff) &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                fcnvrg = .true.</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            <span class="keywordflow">if</span> (abs(dx) &lt; xtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                xcnvrg = .true.</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;            <span class="keywordflow">if</span> (abs(df) &lt; dtol) <span class="keywordflow">then</span></div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                dcnvrg = .true.</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            <span class="comment">! Update the bracket on the root</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="keywordflow">if</span> (ff &lt; zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                xl = x</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                xh = x</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            <span class="comment">! Print status</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, ndiff, dx, ff)</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                flag = 1</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                <span class="keywordflow">exit</span></div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="comment">! Ensure the function value is current with the estimate of the root</span></div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) <span class="keywordflow">then</span></div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            f = fcn%fcn(x)</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            neval = neval + 1</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;        <span class="comment">! Report out iteration statistics and other optional outputs</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = ff</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;            ib%jacobian_count = ndiff</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            ib%converge_on_zero_diff = dcnvrg</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Root estimate: &quot;</span>, x, &amp;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, ff</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;newt1var_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_newton1var.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_newton1var</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine newt1var_solve(this, fcn, x, lim, f, ib, err)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(newton_1var_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">type</span>(value_pair), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160; </div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: p5 = 0.5d0</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: two = 2.0d0</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: fcnvrg, xcnvrg, dcnvrg</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: neval, ndiff, maxeval, flag, iter</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keywordtype">        real</span>(real64) :: ftol, xtol, dtol, xh, xl, fh, fl, x1, x2, eps, dxold, &amp;</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;            dx, df, temp, ff</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160; </div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        dcnvrg = .false.</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        ndiff = 0</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        ftol = this%get_fcn_tolerance()</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        dtol = this%get_diff_tolerance()</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = zero</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;            ib%jacobian_count = ndiff</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%converge_on_zero_diff = dcnvrg</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        x1 = min(lim%x1, lim%x2)</div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        x2 = max(lim%x1, lim%x2)</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        eps = epsilon(eps)</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160; </div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="keywordflow">if</span> (abs(x1 - x2) &lt; eps) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="comment">! ERROR: Search limits are too tight</span></div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;Search limits have no &quot;</span> // &amp;</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="stringliteral">&quot;appreciable difference between them.  Lower Limit: &quot;</span>, x1, &amp;</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;, Upper Limit: &quot;</span>, x2</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;brent_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160; </div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="comment">! See if the root is one of the end points</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        fl = fcn%fcn(x1)</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        fh = fcn%fcn(x2)</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        neval = 2</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keywordflow">if</span> (abs(fl) &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            x = x1</div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fl</div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                ib%converge_on_fcn = .true.</div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                ib%fcn_count = 2</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (abs(fh) &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            x = x2</div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = fh</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;                ib%converge_on_fcn = .true.</div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                ib%fcn_count = 2</div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160; </div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (fl &lt; zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            xl = x1</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            xh = x2</div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            xl = x2</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            xh = x1</div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        x = p5 * (x1 + x2)</div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        dxold = abs(x2 - x1)</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        dx = dxold</div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        ff = fcn%fcn(x)</div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        df = fcn%diff(x, ff)</div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        neval = neval + 1</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        ndiff = ndiff + 1</div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            <span class="comment">! Increment the iteration counter</span></div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            iter = iter + 1</div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160; </div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            <span class="comment">! Bisect if the Newton step went out of range, or if the rate</span></div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            <span class="comment">! of change was too slow</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            <span class="keywordflow">if</span> ((((x - xh) * df - ff) * ((x - xl) * df - ff) &gt; zero) .or. &amp;</div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                (abs(two * ff) &gt; abs(dxold * df))) &amp;</div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <span class="comment">! Bisection</span></div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                dxold = dx</div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                dx = p5 * (xh - xl)</div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                x = xl + dx</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                <span class="keywordflow">if</span> (abs(xl - x) &lt; xtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                    <span class="comment">! Convergence as the change in root is within tolerance</span></div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                    xcnvrg = .true.</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Newton&#39;s Method</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                dxold = dx</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                dx = ff / df</div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                temp = x</div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                x = x - dx</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="keywordflow">if</span> (abs(temp - x) &lt; xtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    <span class="comment">! Convergence as the change in root is within tolerance</span></div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                    xcnvrg = .true.</div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160; </div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            <span class="comment">! Update function values</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;            ff = fcn%fcn(x)</div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            df = fcn%diff(x, ff)</div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;            ndiff = ndiff + 1</div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160; </div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;            <span class="comment">! Check for convergence</span></div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;            <span class="keywordflow">if</span> (abs(ff) &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                fcnvrg = .true.</div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;            <span class="keywordflow">if</span> (abs(dx) &lt; xtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                xcnvrg = .true.</div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;            <span class="keywordflow">if</span> (abs(df) &lt; dtol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                dcnvrg = .true.</div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160; </div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            <span class="comment">! Update the bracket on the root</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="keywordflow">if</span> (ff &lt; zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                xl = x</div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                xh = x</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160; </div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            <span class="comment">! Print status</span></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keyword">call </span>print_status(iter, neval, ndiff, dx, ff)</div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160; </div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;            <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                flag = 1</div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160; </div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="comment">! Ensure the function value is current with the estimate of the root</span></div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;            f = fcn%fcn(x)</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;            neval = neval + 1</div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160; </div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;        <span class="comment">! Report out iteration statistics and other optional outputs</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(f)) f = ff</div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;            ib%jacobian_count = ndiff</div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            ib%converge_on_zero_diff = dcnvrg</div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160; </div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Root estimate: &quot;</span>, x, &amp;</div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, ff</div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;newt1var_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve_newton1var.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve__newton_8f90_source.html b/doc/html/nonlin__solve__newton_8f90_source.html
index f878fd1..7254a5e 100644
--- a/doc/html/nonlin__solve__newton_8f90_source.html
+++ b/doc/html/nonlin__solve__newton_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve_newton.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve_newton.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,258 @@
 <div class="title">nonlin_solve_newton.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_newton.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_newton</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine ns_solve(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: mintol = 1.0d-12</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: factor = 1.0d2</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">logical</span> :: check, xcnvrg, fcnvrg, gcnvrg</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, lwork, flag, neval, iter, maxeval, njac</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: dir, grad, xold, work</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">real(real64)</span> :: ftol, xtol, gtol, f, fold, stpmax, xnorm, fnorm, temp, test</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        gcnvrg = .false.</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        neqn = fcn%get_equation_count()</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        nvar = fcn%get_variable_count()</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        neval = 0</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        iter = 0</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        njac = 0</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        ftol = this%get_fcn_tolerance()</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        gtol = this%get_gradient_tolerance()</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! Input Checking</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">if</span> (nvar /= neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="comment">! ERROR: # of equations doesn&#39;t match # of variables</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) <span class="stringliteral">&quot;The number of equations (&quot;</span>, neqn, &amp;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                <span class="stringliteral">&quot;) does not match the number of unknowns (&quot;</span>, nvar, <span class="stringliteral">&quot;).&quot;</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        flag = 0</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            flag = 3</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            flag = 4</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keyword">allocate</span>(ipvt(nvar), stat = flag)</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dir(nvar), stat = flag)</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(grad(nvar), stat = flag)</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xold(nvar), stat = flag)</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(jac(nvar, neqn), stat = flag)</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fv = fvec, olwork = lwork)</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keyword">allocate</span>(work(lwork), stat = flag)</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <span class="comment">! Test to see if the initial guess is a root</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        f = half * dot_product(fvec, fvec)</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        neval = neval + 1</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        test = zero</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            test = max(abs(fvec(i)), test)</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordflow">if</span> (test &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            fcnvrg = .true.</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        <span class="keywordflow">if</span> (.not.fcnvrg) <span class="keywordflow">then</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            <span class="comment">! Compute the maximum step size for the line search process</span></div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;            stpmax = factor * max(norm2(x), <span class="keywordtype">real</span>(nvar, real64))</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            <span class="comment">! Main Iteration Loop</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keywordflow">do</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Increment the iteration counter</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                iter = iter + 1</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="comment">! Compute the Jacobian</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                <span class="keyword">call </span>fcn%jacobian(x, jac, fvec, work)</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                njac = njac + 1</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                <span class="comment">! Compute the gradient</span></div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                <span class="keywordflow">do</span> i = 1, nvar</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                    grad(i) = dot_product(jac(:,i), fvec)</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="keywordflow">                end do</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="comment">! Compute the LU factorization of the Jacobian</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                <span class="keyword">call </span>lu_factor(jac, ipvt, errmgr)</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                <span class="keywordflow">if</span> (errmgr%has_warning_occurred()) <span class="keywordflow">then</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                    <span class="comment">! The Jacobian is singular - warning was issued already, so</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                    <span class="comment">! simply exit the routine.  Do not return as a return at</span></div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="comment">! this point would not allow for proper updating of the</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                    <span class="comment">! iteration tracking parameters</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                <span class="comment">! Store previous iteration values</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                xold = x</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                fold = f</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                <span class="comment">! Define the right-hand-side for the linear system</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                dir = -fvec</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="comment">! Solve the linear system of equations</span></div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                <span class="keyword">call </span>solve_lu(jac, ipvt, dir)</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                <span class="comment">! Apply the line search if needed</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="comment">! Define the step length for the line search</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                    temp = dot_product(dir, dir)</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                    <span class="keywordflow">if</span> (temp &gt; stpmax) dir = dir * (stpmax / temp)</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    <span class="comment">! Apply the line search</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                    <span class="keyword">call </span>limit_search_vector(dir, stpmax)</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, xold, grad, dir, x, fvec, &amp;</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                        fold, f, lib, errmgr)</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                    neval = neval + lib%fcn_count</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="comment">! No line search - just update the solution estimate</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    x = x + dir</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    f = half * dot_product(fvec, fvec)</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    neval = neval + 1</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                <span class="comment">! Check for convergence</span></div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                <span class="keyword">call </span>test_convergence(x, xold, fvec, grad, .true., xtol, &amp;</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                    ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                <span class="keywordflow">if</span> (check) <span class="keywordflow">then</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;                    <span class="comment">! The solution has converged</span></div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gcnvrg) <span class="keywordflow">then</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                    <span class="comment">! The solution appears to have settled at a point where</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                    <span class="comment">! the gradient has a zero slope</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                    <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                        <span class="stringliteral">&quot;It appears the solution has settled to &quot;</span> // &amp;</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                        <span class="stringliteral">&quot;a point where the slope of the gradient &quot;</span> // &amp;</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                        <span class="stringliteral">&quot;is effectively zero.  &quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                        <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                        <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                        <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                        new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                        nl_spurious_convergence_error)</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                <span class="comment">! Print status</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                    <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    flag = 1</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_newton.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_newton</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine ns_solve(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: mintol = 1.0d-12</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: factor = 1.0d2</div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160; </div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">logical</span> :: check, xcnvrg, fcnvrg, gcnvrg</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, lwork, flag, neval, iter, maxeval, njac</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: ipvt</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: dir, grad, xold, work</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keywordtype">        real</span>(real64) :: ftol, xtol, gtol, f, fold, stpmax, xnorm, fnorm, temp, test</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160; </div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        gcnvrg = .false.</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        neqn = fcn%get_equation_count()</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        nvar = fcn%get_variable_count()</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        njac = 0</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        ftol = this%get_fcn_tolerance()</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        gtol = this%get_gradient_tolerance()</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160; </div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! Input Checking</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">if</span> (nvar /= neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            <span class="comment">! ERROR: # of equations doesn&#39;t match # of variables</span></div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) <span class="stringliteral">&quot;The number of equations (&quot;</span>, neqn, &amp;</div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                <span class="stringliteral">&quot;) does not match the number of unknowns (&quot;</span>, nvar, <span class="stringliteral">&quot;).&quot;</span></div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            flag = 4</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160; </div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keyword">allocate</span>(ipvt(nvar), stat = flag)</div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dir(nvar), stat = flag)</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(grad(nvar), stat = flag)</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xold(nvar), stat = flag)</div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(jac(nvar, neqn), stat = flag)</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keyword">call </span>fcn%jacobian(x, jac, fv = fvec, olwork = lwork)</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keyword">allocate</span>(work(lwork), stat = flag)</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160; </div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <span class="comment">! Test to see if the initial guess is a root</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        f = half * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        neval = neval + 1</div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        test = zero</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            test = max(abs(fvec(i)), test)</div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        <span class="keywordflow">if</span> (test &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            fcnvrg = .true.</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160; </div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        <span class="keywordflow">if</span> (.not.fcnvrg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            <span class="comment">! Compute the maximum step size for the line search process</span></div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;            stpmax = factor * max(norm2(x), real(nvar, real64))</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160; </div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            <span class="comment">! Main Iteration Loop</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;            <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                <span class="comment">! Increment the iteration counter</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                iter = iter + 1</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160; </div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                <span class="comment">! Compute the Jacobian</span></div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                <span class="keyword">call </span>fcn%jacobian(x, jac, fvec, work)</div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                njac = njac + 1</div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160; </div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                <span class="comment">! Compute the gradient</span></div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                <span class="keywordflow">do</span> i = 1, nvar</div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                    grad(i) = dot_product(jac(:,i), fvec)</div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="keywordflow">                end do</span></div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160; </div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="comment">! Compute the LU factorization of the Jacobian</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                <span class="keyword">call </span>lu_factor(jac, ipvt, errmgr)</div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                <span class="keywordflow">if</span> (errmgr%has_warning_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                    <span class="comment">! The Jacobian is singular - warning was issued already, so</span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                    <span class="comment">! simply exit the routine.  Do not return as a return at</span></div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="comment">! this point would not allow for proper updating of the</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                    <span class="comment">! iteration tracking parameters</span></div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160; </div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                <span class="comment">! Store previous iteration values</span></div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                xold = x</div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                fold = f</div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160; </div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                <span class="comment">! Define the right-hand-side for the linear system</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                dir = -fvec</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160; </div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="comment">! Solve the linear system of equations</span></div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                <span class="keyword">call </span>solve_lu(jac, ipvt, dir)</div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160; </div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                <span class="comment">! Apply the line search if needed</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="comment">! Define the step length for the line search</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                    temp = dot_product(dir, dir)</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                    <span class="keywordflow">if</span> (temp &gt; stpmax) dir = dir * (stpmax / temp)</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160; </div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    <span class="comment">! Apply the line search</span></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                    <span class="keyword">call </span>limit_search_vector(dir, stpmax)</div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, xold, grad, dir, x, fvec, &amp;</div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                        fold, f, lib, errmgr)</div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                    neval = neval + lib%fcn_count</div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="comment">! No line search - just update the solution estimate</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    x = x + dir</div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                    <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                    f = half * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    neval = neval + 1</div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160; </div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                <span class="comment">! Check for convergence</span></div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                <span class="keyword">call </span>test_convergence(x, xold, fvec, grad, .true., xtol, &amp;</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                    ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                <span class="keywordflow">if</span> (check) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;                    <span class="comment">! The solution has converged</span></div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gcnvrg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                    <span class="comment">! The solution appears to have settled at a point where</span></div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;                    <span class="comment">! the gradient has a zero slope</span></div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                    <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                        <span class="stringliteral">&quot;It appears the solution has settled to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                        <span class="stringliteral">&quot;a point where the slope of the gradient &quot;</span> // &amp;</div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                        <span class="stringliteral">&quot;is effectively zero.  &quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                        <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;                        <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                        <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                        new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                        nl_spurious_convergence_error)</div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160; </div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                <span class="comment">! Print status</span></div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                    <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160; </div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    flag = 1</div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160; </div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160; </div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;ns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve_newton.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__solve__quasi__newton_8f90_source.html b/doc/html/nonlin__solve__quasi__newton_8f90_source.html
index d1db286..47be11e 100644
--- a/doc/html/nonlin__solve__quasi__newton_8f90_source.html
+++ b/doc/html/nonlin__solve__quasi__newton_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_solve_quasi_newton.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_solve_quasi_newton.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,345 @@
 <div class="title">nonlin_solve_quasi_newton.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_quasi_newton.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_quasi_newton</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine qns_solve(this, fcn, x, fvec, ib, err)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: half = 0.5d0</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: one = 1.0d0</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: factor = 1.0d2</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: restart, xcnvrg, fcnvrg, gcnvrg, check</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, flag, lw1, lw2, lw3, neval, iter, &amp;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            maxeval, jcount, njac</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: work, tau, dx, df, fvold, &amp;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;            xold, s</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: q, r, b</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordtype">real(real64)</span> :: test, f, fold, temp, ftol, xtol, gtol, &amp;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;            stpmax, x2, xnorm, fnorm</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        restart = .true.</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        xcnvrg = .false.</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        fcnvrg = .false.</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        gcnvrg = .false.</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        neqn = fcn%get_equation_count()</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        nvar = fcn%get_variable_count()</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        neval = 0</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        iter = 0</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        njac = 0</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        ftol = this%get_fcn_tolerance()</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        xtol = this%get_var_tolerance()</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        gtol = this%get_gradient_tolerance()</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        maxeval = this%get_max_fcn_evals()</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            errmgr =&gt; err</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            errmgr =&gt; deferr</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="comment">! Input Check</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;                nl_invalid_operation_error)</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="keywordflow">if</span> (nvar /= neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            <span class="comment">! ERROR: # of equations doesn&#39;t match # of variables</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) <span class="stringliteral">&quot;The number of equations (&quot;</span>, neqn, &amp;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;                <span class="stringliteral">&quot;) does not match the number of unknowns (&quot;</span>, nvar, <span class="stringliteral">&quot;).&quot;</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                nl_invalid_input_error)</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        flag = 0</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            flag = 3</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            flag = 4</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                nl_array_size_error)</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keyword">allocate</span>(q(neqn, neqn), stat = flag)</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(r(neqn, nvar), stat = flag)</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(tau(min(neqn, nvar)), stat = flag)</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(b(neqn, nvar), stat = flag)</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(df(neqn), stat = flag)</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(fvold(neqn), stat = flag)</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xold(nvar), stat = flag)</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dx(nvar), stat = flag)</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(s(neqn), stat = flag)</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keyword">call </span>qr_factor(r, tau, work, lw1)</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keyword">call </span>form_qr(r, tau, q, work, lw2)</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="keyword">call </span>fcn%jacobian(x, b, fv = fvec, olwork = lw3)</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keyword">allocate</span>(work(max(lw1, lw2, lw3)), stat = flag)</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="comment">! Test to see if the initial guess is a root</span></div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        f = half * dot_product(fvec, fvec)</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        neval = neval + 1</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        test = zero</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            test = max(abs(fvec(i)), test)</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="keywordflow">        end do</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        <span class="keywordflow">if</span> (test &lt; ftol) <span class="keywordflow">then</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            fcnvrg = .true.</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        <span class="keywordflow">if</span> (.not.fcnvrg) <span class="keywordflow">then</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            <span class="comment">! Determine the maximum line search step</span></div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;            stpmax = factor * max(norm2(x), <span class="keywordtype">real</span>(nvar, real64))</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="comment">! Main Iteration Loop</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            <span class="keywordflow">do</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="comment">! Update the iteration counter</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                iter = iter + 1</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                <span class="comment">! Compute or update the Jacobian</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                <span class="keywordflow">if</span> (restart) <span class="keywordflow">then</span></div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="comment">! Compute the Jacobian</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                    <span class="keyword">call </span>fcn%jacobian(x, b, fvec, work)</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                    njac = njac + 1</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                    <span class="comment">! Compute the QR factorization, and form Q &amp; R</span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                    r = b <span class="comment">! Copy the Jacobian - we&#39;ll need it later</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    <span class="keyword">call </span>qr_factor(r, tau, work)</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    <span class="keyword">call </span>form_qr(r, tau, q, work)</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                    <span class="comment">! Reset the Jacobian iteration counter</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                    jcount = 0</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                    <span class="comment">! Apply the rank 1 update to Q and R</span></div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                    df = fvec - fvold</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                    dx = x - xold</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                    x2 = dot_product(dx, dx)</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="comment">! Compute S = ALPHA * (DF - B * DX)</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                    s = (df - matmul(b, dx))</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                    <span class="keyword">call </span>recip_mult_array(x2, s)</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    <span class="comment">! Compute the new Q and R matrices for the rank1 update:</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                    <span class="comment">! B&#39; = B + ALPHA * S * DX**T</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                    <span class="keyword">call </span>rank1_update(one, s, dx, b)</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                    <span class="keyword">call </span>qr_rank1_update(q, r, s, dx, work) <span class="comment">! S &amp; DX overwritten</span></div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                    <span class="comment">! Increment the counter tracking how many iterations have</span></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="comment">! passed since the last Jacobian recalculation</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    jcount = jcount + 1</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                <span class="comment">! Compute GRAD = B**T * F, store in DX</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                <span class="keyword">call </span>mtx_mult(.true., one, b, fvec, zero, dx)</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                <span class="comment">! Store FVEC and X</span></div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                xold = x</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                fvold = fvec</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                fold = f</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                <span class="comment">! Solve the linear system: B * DX = -F for DX noting that</span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="comment">! B = Q * R.  As such, form -Q**T * F, and store in DF</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                <span class="keyword">call </span>mtx_mult(.true., -one, q, fvec, zero, df)</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                <span class="comment">! Now we have R * DX = -Q**T * F, and since R is upper</span></div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                <span class="comment">! triangular, the solution is readily computed.  The solution</span></div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                <span class="comment">! will be stored in the first NVAR elements of DF</span></div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                <span class="keyword">call </span>solve_triangular_system(.true., .false., .true., r, &amp;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                    df(1:nvar))</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                <span class="comment">! Ensure the new solution estimate is heading in a sensible</span></div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                <span class="comment">! direction.  If not, it is likely time to update the Jacobian</span></div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                temp = dot_product(dx, df(1:nvar))</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                <span class="keywordflow">if</span> (temp &gt;= zero) <span class="keywordflow">then</span></div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;                    restart = .true.</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;                    <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                        <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="keywordflow">                    end if</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                    cycle</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                <span class="comment">! Apply the line search if needed</span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    <span class="comment">! Define the step length for the line search</span></div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    temp = dot_product(df(1:nvar), df(1:nvar))</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                    <span class="keywordflow">if</span> (temp &gt; stpmax) df(1:nvar) = df(1:nvar) * (stpmax / temp)</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                    <span class="comment">! Apply the line search</span></div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;                    <span class="keyword">call </span>limit_search_vector(df(1:nvar), stpmax)</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, xold, dx, df(1:nvar), x, fvec, fold, &amp;</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                        f, lib, errmgr)</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;                    neval = neval + lib%fcn_count</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                    <span class="comment">! No line search - just update the solution estimate</span></div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                    x = x + df(1:nvar)</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                    <span class="keyword">call </span>fcn%fcn(x, fvec)</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                    f = half * dot_product(fvec, fvec)</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                    neval = neval + 1</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                <span class="comment">! Test for convergence</span></div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                <span class="keywordflow">if</span> (lib%converge_on_zero_diff .and. &amp;</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                        this%get_use_line_search()) <span class="keywordflow">then</span></div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                    <span class="keyword">call </span>test_convergence(x, xold, fvec, dx, .true., xtol, &amp;</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                        ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;                    <span class="keyword">call </span>test_convergence(x, xold, fvec, dx, .false., xtol, &amp;</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                        ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;                <span class="keywordflow">if</span> (.not.check) <span class="keywordflow">then</span></div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;                    <span class="comment">! The solution did not converge, figure out why</span></div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;                    <span class="keywordflow">if</span> (gcnvrg) <span class="keywordflow">then</span></div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                        <span class="comment">! The slope of the gradient is sufficiently close to</span></div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;                        <span class="comment">! zero to cause issue.</span></div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;                        <span class="keywordflow">if</span> (restart) <span class="keywordflow">then</span></div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;                            <span class="comment">! We&#39;ve already tried recalculating a new Jacobian,</span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;                            <span class="comment">! issue a warning</span></div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;                            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                                <span class="stringliteral">&quot;It appears the solution has settled to &quot;</span> // &amp;</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;                                <span class="stringliteral">&quot;a point where the slope of the gradient &quot;</span> // &amp;</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;                                <span class="stringliteral">&quot;is effectively zero.  &quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;                                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;                                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;                                <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;                                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                            <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;nqs_solve&quot;</span>, &amp;</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;                                trim(errmsg), nl_spurious_convergence_error)</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;                            <span class="keywordflow">exit</span></div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;                        <span class="keywordflow">else</span></div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;                            <span class="comment">! Try computing a new Jacobian</span></div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;                            restart = .true.</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="keywordflow">                        end if</span></div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;                    <span class="keywordflow">else</span></div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;                        <span class="comment">! We have not converged, but we&#39;re not stuck with a</span></div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;                        <span class="comment">! zero slope gradient vector either.  Go ahead and</span></div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;                        <span class="comment">! continue the iteration process without recomputing</span></div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;                        <span class="comment">! the Jacobian - unless the user dictates a</span></div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;                        <span class="comment">! recaclulation.</span></div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                        <span class="keywordflow">if</span> (jcount &gt;= this%m_jDelta) <span class="keywordflow">then</span></div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;                            restart = .true.</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;                        <span class="keywordflow">else</span></div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;                            restart = .false.</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;<span class="keywordflow">                        end if</span></div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="keywordflow">                    end if</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;                  <span class="comment">! The solution has converged.  It&#39;s OK to exit</span></div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;                  <span class="keywordflow">exit</span></div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;                <span class="comment">! Print status</span></div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;                    <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;                    flag = 1</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;                    <span class="keywordflow">exit</span></div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="comment">! Report out iteration statistics</span></div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;            ib%iter_count = iter</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;            ib%fcn_count = neval</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;            ib%jacobian_count = njac</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;            ib%gradient_count = 0</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            ib%converge_on_fcn = fcnvrg</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            ib%converge_on_chng = xcnvrg</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="comment">! Check for convergence issues</span></div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;                nl_convergence_error)</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function qns_get_jac_interval(this) result(n)</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        n = this%m_jDelta</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="comment">! --------------------</span></div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keyword">module</span> subroutine qns_set_jac_interval(this, n)</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        this%m_jDelta = n</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_solve_quasi_newton.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>) nonlin_solve_quasi_newton</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine qns_solve(this, fcn, x, fvec, ib, err)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fvec</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior), <span class="keywordtype">optional</span> :: ib</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: half = 0.5d0</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: one = 1.0d0</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: factor = 1.0d2</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160; </div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        <span class="keywordtype">logical</span> :: restart, xcnvrg, fcnvrg, gcnvrg, check</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, neqn, nvar, flag, lw1, lw2, lw3, neval, iter, &amp;</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            maxeval, jcount, njac</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: work, tau, dx, df, fvold, &amp;</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;            xold, s</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:,:)</span> :: q, r, b</div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keywordtype">        real</span>(real64) :: test, f, fold, temp, ftol, xtol, gtol, &amp;</div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;            stpmax, x2, xnorm, fnorm</div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: lib</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(errors), <span class="keywordtype">pointer</span> :: errmgr</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">type</span>(errors), <span class="keywordtype">target</span> :: deferr</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">character(len = 256)</span> :: errmsg</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordtype">class</span>(line_search), <span class="keywordtype">allocatable</span> :: ls</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160; </div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;        restart = .true.</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        xcnvrg = .false.</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        fcnvrg = .false.</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        gcnvrg = .false.</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        neqn = fcn%get_equation_count()</div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        nvar = fcn%get_variable_count()</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        neval = 0</div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        iter = 0</div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        njac = 0</div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        ftol = this%get_fcn_tolerance()</div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        xtol = this%get_var_tolerance()</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        gtol = this%get_gradient_tolerance()</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        maxeval = this%get_max_fcn_evals()</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            errmgr =&gt; err</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;            errmgr =&gt; deferr</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <span class="keywordflow">if</span> (.not.this%is_line_search_defined()) &amp;</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                <span class="keyword">call </span>this%set_default_line_search()</div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <span class="keyword">call </span>this%get_line_search(ls)</div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160; </div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="comment">! Input Check</span></div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;        <span class="keywordflow">if</span> (.not.fcn%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="comment">! ERROR: No function is defined</span></div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                <span class="stringliteral">&quot;No function has been defined.&quot;</span>, &amp;</div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;                nl_invalid_operation_error)</div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="keywordflow">if</span> (nvar /= neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            <span class="comment">! ERROR: # of equations doesn&#39;t match # of variables</span></div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AI0A)&#39;</span>) <span class="stringliteral">&quot;The number of equations (&quot;</span>, neqn, &amp;</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;                <span class="stringliteral">&quot;) does not match the number of unknowns (&quot;</span>, nvar, <span class="stringliteral">&quot;).&quot;</span></div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                nl_invalid_input_error)</div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= nvar) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(fvec) /= neqn) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;            flag = 4</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;            <span class="comment">! One of the input arrays is not sized correctly</span></div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0A)&#39;</span>) <span class="stringliteral">&quot;Input number &quot;</span>, flag, &amp;</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                <span class="stringliteral">&quot; is not sized correctly.&quot;</span></div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;                nl_array_size_error)</div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160; </div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keyword">allocate</span>(q(neqn, neqn), stat = flag)</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(r(neqn, nvar), stat = flag)</div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(tau(min(neqn, nvar)), stat = flag)</div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(b(neqn, nvar), stat = flag)</div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(df(neqn), stat = flag)</div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(fvold(neqn), stat = flag)</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(xold(nvar), stat = flag)</div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(dx(nvar), stat = flag)</div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <span class="keywordflow">if</span> (flag == 0) <span class="keyword">allocate</span>(s(neqn), stat = flag)</div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keyword">call </span>qr_factor(r, tau, work, lw1)</div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        <span class="keyword">call </span>form_qr(r, tau, q, work, lw2)</div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;        <span class="keyword">call </span>fcn%jacobian(x, b, fv = fvec, olwork = lw3)</div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keyword">allocate</span>(work(max(lw1, lw2, lw3)), stat = flag)</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            <span class="comment">! ERROR: Out of memory</span></div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;                <span class="stringliteral">&quot;Insufficient memory available.&quot;</span>, nl_out_of_memory_error)</div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160; </div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        <span class="comment">! Test to see if the initial guess is a root</span></div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        f = half * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        neval = neval + 1</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        test = zero</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;        <span class="keywordflow">do</span> i = 1, neqn</div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;            test = max(abs(fvec(i)), test)</div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;        <span class="keywordflow">if</span> (test &lt; ftol) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;            fcnvrg = .true.</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160; </div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;        flag = 0 <span class="comment">! Used to check for convergence errors</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;        <span class="keywordflow">if</span> (.not.fcnvrg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;            <span class="comment">! Determine the maximum line search step</span></div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;            stpmax = factor * max(norm2(x), real(nvar, real64))</div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160; </div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="comment">! Main Iteration Loop</span></div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            <span class="keywordflow">do</span></div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                <span class="comment">! Update the iteration counter</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                iter = iter + 1</div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160; </div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                <span class="comment">! Compute or update the Jacobian</span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                <span class="keywordflow">if</span> (restart) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                    <span class="comment">! Compute the Jacobian</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                    <span class="keyword">call </span>fcn%jacobian(x, b, fvec, work)</div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                    njac = njac + 1</div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160; </div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                    <span class="comment">! Compute the QR factorization, and form Q &amp; R</span></div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                    r = b <span class="comment">! Copy the Jacobian - we&#39;ll need it later</span></div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                    <span class="keyword">call </span>qr_factor(r, tau, work)</div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                    <span class="keyword">call </span>form_qr(r, tau, q, work)</div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160; </div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                    <span class="comment">! Reset the Jacobian iteration counter</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                    jcount = 0</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                    <span class="comment">! Apply the rank 1 update to Q and R</span></div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                    df = fvec - fvold</div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                    dx = x - xold</div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                    x2 = dot_product(dx, dx)</div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160; </div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                    <span class="comment">! Compute S = ALPHA * (DF - B * DX)</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                    s = (df - matmul(b, dx))</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                    <span class="keyword">call </span>recip_mult_array(x2, s)</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160; </div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    <span class="comment">! Compute the new Q and R matrices for the rank1 update:</span></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                    <span class="comment">! B&#39; = B + ALPHA * S * DX**T</span></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                    <span class="keyword">call </span>rank1_update(one, s, dx, b)</div>
+<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                    <span class="keyword">call </span>qr_rank1_update(q, r, s, dx, work) <span class="comment">! S &amp; DX overwritten</span></div>
+<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160; </div>
+<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                    <span class="comment">! Increment the counter tracking how many iterations have</span></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="comment">! passed since the last Jacobian recalculation</span></div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    jcount = jcount + 1</div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160; </div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                <span class="comment">! Compute GRAD = B**T * F, store in DX</span></div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                <span class="keyword">call </span>mtx_mult(.true., one, b, fvec, zero, dx)</div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160; </div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                <span class="comment">! Store FVEC and X</span></div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                xold = x</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                fvold = fvec</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;                fold = f</div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160; </div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;                <span class="comment">! Solve the linear system: B * DX = -F for DX noting that</span></div>
+<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;                <span class="comment">! B = Q * R.  As such, form -Q**T * F, and store in DF</span></div>
+<div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;                <span class="keyword">call </span>mtx_mult(.true., -one, q, fvec, zero, df)</div>
+<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160; </div>
+<div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;                <span class="comment">! Now we have R * DX = -Q**T * F, and since R is upper</span></div>
+<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;                <span class="comment">! triangular, the solution is readily computed.  The solution</span></div>
+<div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;                <span class="comment">! will be stored in the first NVAR elements of DF</span></div>
+<div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;                <span class="keyword">call </span>solve_triangular_system(.true., .false., .true., r, &amp;</div>
+<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;                    df(1:nvar))</div>
+<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160; </div>
+<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;                <span class="comment">! Ensure the new solution estimate is heading in a sensible</span></div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;                <span class="comment">! direction.  If not, it is likely time to update the Jacobian</span></div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                temp = dot_product(dx, df(1:nvar))</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;                <span class="keywordflow">if</span> (temp &gt;= zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;                    restart = .true.</div>
+<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;                    <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                        <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;<span class="keywordflow">                    end if</span></div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                    cycle</div>
+<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160; </div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                <span class="comment">! Apply the line search if needed</span></div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                <span class="keywordflow">if</span> (this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    <span class="comment">! Define the step length for the line search</span></div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    temp = dot_product(df(1:nvar), df(1:nvar))</div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                    <span class="keywordflow">if</span> (temp &gt; stpmax) df(1:nvar) = df(1:nvar) * (stpmax / temp)</div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160; </div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                    <span class="comment">! Apply the line search</span></div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;                    <span class="keyword">call </span>limit_search_vector(df(1:nvar), stpmax)</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;                    <span class="keyword">call </span>ls%search(fcn, xold, dx, df(1:nvar), x, fvec, fold, &amp;</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                        f, lib, errmgr)</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;                    neval = neval + lib%fcn_count</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                    <span class="comment">! No line search - just update the solution estimate</span></div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                    x = x + df(1:nvar)</div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                    <span class="keyword">call </span>fcn%fcn(x, fvec)</div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                    f = half * dot_product(fvec, fvec)</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                    neval = neval + 1</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160; </div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                <span class="comment">! Test for convergence</span></div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                <span class="keywordflow">if</span> (lib%converge_on_zero_diff .and. &amp;</div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                        this%get_use_line_search()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                    <span class="keyword">call </span>test_convergence(x, xold, fvec, dx, .true., xtol, &amp;</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                        ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;                    <span class="keyword">call </span>test_convergence(x, xold, fvec, dx, .false., xtol, &amp;</div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                        ftol, gtol, check, xcnvrg, fcnvrg, gcnvrg, xnorm, fnorm)</div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;                <span class="keywordflow">if</span> (.not.check) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;                    <span class="comment">! The solution did not converge, figure out why</span></div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;                    <span class="keywordflow">if</span> (gcnvrg) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                        <span class="comment">! The slope of the gradient is sufficiently close to</span></div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;                        <span class="comment">! zero to cause issue.</span></div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;                        <span class="keywordflow">if</span> (restart) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;                            <span class="comment">! We&#39;ve already tried recalculating a new Jacobian,</span></div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;                            <span class="comment">! issue a warning</span></div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;                            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) &amp;</div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                                <span class="stringliteral">&quot;It appears the solution has settled to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;                                <span class="stringliteral">&quot;a point where the slope of the gradient &quot;</span> // &amp;</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;                                <span class="stringliteral">&quot;is effectively zero.  &quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;                                <span class="stringliteral">&quot;Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;                                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // &amp;</div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;                                <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;                                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                            <span class="keyword">call </span>errmgr%report_warning(<span class="stringliteral">&quot;nqs_solve&quot;</span>, &amp;</div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;                                trim(errmsg), nl_spurious_convergence_error)</div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;                            <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;                        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;                            <span class="comment">! Try computing a new Jacobian</span></div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;                            restart = .true.</div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;<span class="keywordflow">                        end if</span></div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;                    <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;                        <span class="comment">! We have not converged, but we&#39;re not stuck with a</span></div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;                        <span class="comment">! zero slope gradient vector either.  Go ahead and</span></div>
+<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;                        <span class="comment">! continue the iteration process without recomputing</span></div>
+<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;                        <span class="comment">! the Jacobian - unless the user dictates a</span></div>
+<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;                        <span class="comment">! recaclulation.</span></div>
+<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                        <span class="keywordflow">if</span> (jcount &gt;= this%m_jDelta) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;                            restart = .true.</div>
+<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;                        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;                            restart = .false.</div>
+<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;<span class="keywordflow">                        end if</span></div>
+<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="keywordflow">                    end if</span></div>
+<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;                  <span class="comment">! The solution has converged.  It&#39;s OK to exit</span></div>
+<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;                  <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160; </div>
+<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;                <span class="comment">! Print status</span></div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;                <span class="keywordflow">if</span> (this%get_print_status()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;                    <span class="keyword">call </span>print_status(iter, neval, njac, xnorm, fnorm)</div>
+<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160; </div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;                <span class="comment">! Ensure we haven&#39;t made too many function evaluations</span></div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;                <span class="keywordflow">if</span> (neval &gt;= maxeval) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;                    flag = 1</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;                    <span class="keywordflow">exit</span></div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160; </div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="comment">! Report out iteration statistics</span></div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(ib)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;            ib%iter_count = iter</div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;            ib%fcn_count = neval</div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;            ib%jacobian_count = njac</div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;            ib%gradient_count = 0</div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            ib%converge_on_fcn = fcnvrg</div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            ib%converge_on_chng = xcnvrg</div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;            ib%converge_on_zero_diff = gcnvrg</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160; </div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="comment">! Check for convergence issues</span></div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <span class="keyword">write</span>(errmsg, <span class="stringliteral">&#39;(AI0AE8.3AE8.3)&#39;</span>) <span class="stringliteral">&quot;The algorithm failed to &quot;</span> // &amp;</div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;                <span class="stringliteral">&quot;converge.  Function evaluations performed: &quot;</span>, neval, &amp;</div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;                <span class="stringliteral">&quot;.&quot;</span> // new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Change in Variable: &quot;</span>, xnorm, &amp;</div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;                new_line(<span class="stringliteral">&#39;c&#39;</span>) // <span class="stringliteral">&quot;Residual: &quot;</span>, fnorm</div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;            <span class="keyword">call </span>errmgr%report_error(<span class="stringliteral">&quot;qns_solve&quot;</span>, trim(errmsg), &amp;</div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;                nl_convergence_error)</div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160; </div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function qns_get_jac_interval(this) result(n)</div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        n = this%m_jDelta</div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160; </div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="comment">! --------------------</span></div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keyword">module</span> subroutine qns_set_jac_interval(this, n)</div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;        <span class="keywordtype">class</span>(quasi_newton_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: n</div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        this%m_jDelta = n</div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_solve_quasi_newton.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/nonlin__vecfcn__helper_8f90_source.html b/doc/html/nonlin__vecfcn__helper_8f90_source.html
index 7f7f404..1bc348a 100644
--- a/doc/html/nonlin__vecfcn__helper_8f90_source.html
+++ b/doc/html/nonlin__vecfcn__helper_8f90_source.html
@@ -1,11 +1,11 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>nonlin: D:/Projects/Code/nonlin/src/nonlin_vecfcn_helper.f90 Source File</title>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/src/nonlin_vecfcn_helper.f90 Source File</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -91,16 +91,192 @@
 <div class="title">nonlin_vecfcn_helper.f90</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_vecfcn_helper.f90</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_vecfcn_helper</div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine vfh_set_fcn(this, fcn, nfcn, nvar)</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nfcn, nvar</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        this%m_fcn =&gt; fcn</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        this%m_nfcn = nfcn</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        this%m_nvar = nvar</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keyword">module</span> subroutine vfh_set_jac(this, jac)</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: jac</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        this%m_jac =&gt; jac</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_fcn_defined(this) result(x)</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_jac_defined(this) result(x)</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">logical</span> :: x</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        x = <span class="keyword">associated</span>(this%m_jac)</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    <span class="keyword">module</span> subroutine vfh_fcn(this, x, f)</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordflow">if</span> (this%is_fcn_defined()) <span class="keywordflow">then</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;            <span class="keyword">call </span>this%m_fcn(x, f)</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <span class="keyword">module</span> subroutine vfh_jac_fcn(this, x, jac, fv, work, olwork, err)</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="comment">! Arguments</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: fv</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: work</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: olwork, err</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="comment">! Parameters</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">parameter</span> :: zero = 0.0d0</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="comment">! Local Variables</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, m, n, lwork, flag</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordtype">real(real64)</span> :: eps, epsmch, h, temp</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: fptr, f1ptr</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">target</span>, <span class="keywordtype">dimension(:)</span> :: wrk</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="comment">! Initialization</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 0</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="comment">! m = this%m_nfcn</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! n = this%m_nvar</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        m = this%get_equation_count()</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        n = this%get_variable_count()</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        <span class="comment">! Input Checking</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        flag = 0</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            flag = 2</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(jac, 1) /= m .or. <span class="keyword">size</span>(jac, 2) /= n) <span class="keywordflow">then</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            flag = 3</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="comment">! ERROR: Incorrectly sized input arrays</span></div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = flag</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">return</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="comment">! Process</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">if</span> (.not.this%is_fcn_defined()) <span class="keywordflow">return</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_jac)) <span class="keywordflow">then</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            <span class="comment">! Workspace Query</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(olwork)) <span class="keywordflow">then</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                olwork = 0</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                <span class="keywordflow">return</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="comment">! Call the user-defined Jacobian routine</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keyword">call </span>this%m_jac(x, jac)</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        <span class="keywordflow">else</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            <span class="comment">! Compute the Jacobian via finite differences</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;                lwork = m</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;                lwork = 2 * m</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(olwork)) <span class="keywordflow">then</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                <span class="comment">! The user is just making a workspace query.  Simply return the</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;                <span class="comment">! workspace length, and exit the routine.</span></div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                olwork = lwork</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                <span class="keywordflow">return</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="comment">! Local Memory Allocation</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(work)) <span class="keywordflow">then</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">size</span>(work) &lt; lwork) <span class="keywordflow">then</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                    <span class="comment">! ERROR: Workspace is too small</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 5</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                    <span class="keywordflow">return</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                f1ptr =&gt; work(1:m)</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">size</span>(fv) &lt; m) <span class="keywordflow">then</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                        <span class="comment">! ERROR: Function vector too small</span></div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;                        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 4</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;                        <span class="keywordflow">return</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keywordflow">                    end if</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                    fptr =&gt; fv(1:m)</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                    fptr =&gt; work(m+1:2*m)</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    <span class="keyword">call </span>this%fcn(x, fptr)</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">else</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                <span class="keyword">allocate</span>(wrk(lwork), stat = flag)</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    <span class="comment">! ERROR: Memory issues</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = -1</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                    <span class="keywordflow">return</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                f1ptr =&gt; wrk(1:m)</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                    fptr =&gt; fv(1:m)</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                <span class="keywordflow">else</span></div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                    fptr =&gt; wrk(m+1:2*m)</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    <span class="keyword">call </span>this%fcn(x, fptr)</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keywordflow">                end if</span></div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="keywordflow">            end if</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="comment">! Establish step size factors</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            epsmch = epsilon(epsmch)</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            eps = sqrt(epsmch)</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            <span class="comment">! Compute the derivatives via finite differences</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                temp = x(j)</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                h = eps * abs(temp)</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                <span class="keywordflow">if</span> (h == zero) h = eps</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                x(j) = temp + h</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                <span class="keyword">call </span>this%fcn(x, f1ptr)</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                x(j) = temp</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                jac(:,j) = (f1ptr - fptr) / h</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="keywordflow">            end do</span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;<span class="keywordflow">        end if</span></div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;<span class="keyword">    end subroutine</span></div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nfcn(this) result(n)</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;        n = this%m_nfcn</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nvar(this) result(n)</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;        n = this%m_nvar</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keyword">    end function</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="keyword">end </span>submodule</div><div class="ttc" id="namespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core </div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_vecfcn_helper.f90</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;submodule(<a class="code" href="namespacenonlin__core.html">nonlin_core</a>) nonlin_vecfcn_helper</div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keyword">module</span> subroutine vfh_set_fcn(this, fcn, nfcn, nvar)</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;        <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(in)</span> :: nfcn, nvar</div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;        this%m_fcn =&gt; fcn</div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;        this%m_nfcn = nfcn</div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;        this%m_nvar = nvar</div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160; </div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;    <span class="keyword">module</span> subroutine vfh_set_jac(this, jac)</div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(inout)</span> :: this</div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">pointer</span> :: jac</div>
+<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        this%m_jac =&gt; jac</div>
+<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160; </div>
+<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_fcn_defined(this) result(x)</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        x = <span class="keyword">associated</span>(this%m_fcn)</div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160; </div>
+<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_is_jac_defined(this) result(x)</div>
+<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">logical</span> :: x</div>
+<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        x = <span class="keyword">associated</span>(this%m_jac)</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160; </div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    <span class="keyword">module</span> subroutine vfh_fcn(this, x, f)</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;        <span class="keywordflow">if</span> (this%is_fcn_defined()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;            <span class="keyword">call </span>this%m_fcn(x, f)</div>
+<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160; </div>
+<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <span class="keyword">module</span> subroutine vfh_jac_fcn(this, x, jac, fv, work, olwork, err)</div>
+<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: fv</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: work</div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: olwork, err</div>
+<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160; </div>
+<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <span class="comment">! Parameters</span></div>
+<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">parameter</span> :: zero = 0.0d0</div>
+<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160; </div>
+<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="keywordtype">integer(int32)</span> :: j, m, n, lwork, flag</div>
+<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;<span class="keywordtype">        real</span>(real64) :: eps, epsmch, h, temp</div>
+<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: fptr, f1ptr</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">target</span>, <span class="keywordtype">dimension(:)</span> :: wrk</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160; </div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 0</div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="comment">! m = this%m_nfcn</span></div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        <span class="comment">! n = this%m_nvar</span></div>
+<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        m = this%get_equation_count()</div>
+<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        n = this%get_variable_count()</div>
+<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160; </div>
+<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        <span class="comment">! Input Checking</span></div>
+<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        flag = 0</div>
+<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">size</span>(x) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;            flag = 2</div>
+<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<span class="keyword">size</span>(jac, 1) /= m .or. <span class="keyword">size</span>(jac, 2) /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            flag = 3</div>
+<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="comment">! ERROR: Incorrectly sized input arrays</span></div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = flag</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160; </div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">if</span> (.not.this%is_fcn_defined()) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keywordflow">if</span> (<span class="keyword">associated</span>(this%m_jac)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;            <span class="comment">! Workspace Query</span></div>
+<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(olwork)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;                olwork = 0</div>
+<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160; </div>
+<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;            <span class="comment">! Call the user-defined Jacobian routine</span></div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            <span class="keyword">call </span>this%m_jac(x, jac)</div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            <span class="comment">! Compute the Jacobian via finite differences</span></div>
+<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;                lwork = m</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;                lwork = 2 * m</div>
+<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160; </div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(olwork)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                <span class="comment">! The user is just making a workspace query.  Simply return the</span></div>
+<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;                <span class="comment">! workspace length, and exit the routine.</span></div>
+<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                olwork = lwork</div>
+<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;                <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160; </div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;            <span class="comment">! Local Memory Allocation</span></div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;            <span class="keywordflow">if</span> (<span class="keyword">present</span>(work)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">size</span>(work) &lt; lwork) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                    <span class="comment">! ERROR: Workspace is too small</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 5</div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;                    <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                f1ptr =&gt; work(1:m)</div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">size</span>(fv) &lt; m) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                        <span class="comment">! ERROR: Function vector too small</span></div>
+<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;                        <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = 4</div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;                        <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keywordflow">                    end if</span></div>
+<div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                    fptr =&gt; fv(1:m)</div>
+<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                    fptr =&gt; work(m+1:2*m)</div>
+<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                    <span class="keyword">call </span>this%fcn(x, fptr)</div>
+<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;            <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                <span class="keyword">allocate</span>(wrk(lwork), stat = flag)</div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                <span class="keywordflow">if</span> (flag /= 0) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                    <span class="comment">! ERROR: Memory issues</span></div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                    <span class="keywordflow">if</span> (<span class="keyword">present</span>(err)) err = -1</div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                    <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                f1ptr =&gt; wrk(1:m)</div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;                <span class="keywordflow">if</span> (<span class="keyword">present</span>(fv)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;                    fptr =&gt; fv(1:m)</div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;                <span class="keywordflow">else</span></div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                    fptr =&gt; wrk(m+1:2*m)</div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                    <span class="keyword">call </span>this%fcn(x, fptr)</div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keywordflow">                end if</span></div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;<span class="keywordflow">            end if</span></div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160; </div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;            <span class="comment">! Establish step size factors</span></div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;            epsmch = epsilon(epsmch)</div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;            eps = sqrt(epsmch)</div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160; </div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;            <span class="comment">! Compute the derivatives via finite differences</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;            <span class="keywordflow">do</span> j = 1, n</div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;                temp = x(j)</div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                h = eps * abs(temp)</div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                <span class="keywordflow">if</span> (h == zero) h = eps</div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                x(j) = temp + h</div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;                <span class="keyword">call </span>this%fcn(x, f1ptr)</div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                x(j) = temp</div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                jac(:,j) = (f1ptr - fptr) / h</div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="keywordflow">            end do</span></div>
+<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160; </div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nfcn(this) result(n)</div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;        n = this%m_nfcn</div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160; </div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordtype">pure</span> <span class="keyword">module</span> function vfh_get_nvar(this) result(n)</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        <span class="keywordtype">class</span>(vecfcn_helper), <span class="keywordtype">intent(in)</span> :: this</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        <span class="keywordtype">integer(int32)</span> :: n</div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;        n = this%m_nvar</div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="keyword">end </span>submodule</div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><b>nonlin_vecfcn_helper.f90</b></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/resize.js b/doc/html/resize.js
index 6617aee..f5291d9 100644
--- a/doc/html/resize.js
+++ b/doc/html/resize.js
@@ -131,6 +131,6 @@ function initResizable()
   var _preventDefault = function(evt) { evt.preventDefault(); };
   $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault);
   $(".ui-resizable-handle").dblclick(collapseExpand);
-  $(window).load(resizeHeight);
+  $(window).on('load',resizeHeight);
 }
 /* @license-end */
diff --git a/doc/html/search/all_0.html b/doc/html/search/all_0.html
index 5125b94..a52d5f0 100644
--- a/doc/html/search/all_0.html
+++ b/doc/html/search/all_0.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_0.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_0.js b/doc/html/search/all_0.js
index d423b4f..4762ec2 100644
--- a/doc/html/search/all_0.js
+++ b/doc/html/search/all_0.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['assignment_28_3d_29',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html',1,'nonlin_polynomials']]]
+  ['assignment_28_3d_29_0',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/all_1.html b/doc/html/search/all_1.html
index b8ff871..0fcb704 100644
--- a/doc/html/search/all_1.html
+++ b/doc/html/search/all_1.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_1.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_1.js b/doc/html/search/all_1.js
index 4a1b5a4..3c0b1e0 100644
--- a/doc/html/search/all_1.js
+++ b/doc/html/search/all_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['bfgs',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
-  ['brent_5fsolver',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
+  ['bfgs_1',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
+  ['brent_5fsolver_2',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_10.html b/doc/html/search/all_10.html
index 50bc449..c234738 100644
--- a/doc/html/search/all_10.html
+++ b/doc/html/search/all_10.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_10.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_10.js b/doc/html/search/all_10.js
index d06b996..0a6b9fb 100644
--- a/doc/html/search/all_10.js
+++ b/doc/html/search/all_10.js
@@ -1,26 +1,26 @@
 var searchData=
 [
-  ['search',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
-  ['set',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
-  ['set_5fdefault_5fline_5fsearch',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
-  ['set_5fdiff_5ftolerance',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
-  ['set_5fdistance_5ffactor',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
-  ['set_5ffcn',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
-  ['set_5ffcn_5ftolerance',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
-  ['set_5fgradient_5ffcn',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
-  ['set_5fgradient_5ftolerance',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
-  ['set_5finitial_5fsize',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fjacobian',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
-  ['set_5fjacobian_5finterval',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
-  ['set_5fline_5fsearch',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
-  ['set_5fmax_5ffcn_5fevals',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
-  ['set_5fpoly_5fcoefficient',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
-  ['set_5fprint_5fstatus',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
-  ['set_5fscaling_5ffactor',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
-  ['set_5fsimplex',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fstep_5fscaling_5ffactor',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
-  ['set_5ftolerance',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
-  ['set_5fuse_5fline_5fsearch',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
-  ['set_5fvar_5ftolerance',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
-  ['solve',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
+  ['search_144',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
+  ['set_145',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
+  ['set_5fdefault_5fline_5fsearch_146',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
+  ['set_5fdiff_5ftolerance_147',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
+  ['set_5fdistance_5ffactor_148',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
+  ['set_5ffcn_149',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
+  ['set_5ffcn_5ftolerance_150',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
+  ['set_5fgradient_5ffcn_151',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
+  ['set_5fgradient_5ftolerance_152',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
+  ['set_5finitial_5fsize_153',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fjacobian_154',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
+  ['set_5fjacobian_5finterval_155',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
+  ['set_5fline_5fsearch_156',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
+  ['set_5fmax_5ffcn_5fevals_157',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
+  ['set_5fpoly_5fcoefficient_158',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
+  ['set_5fprint_5fstatus_159',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
+  ['set_5fscaling_5ffactor_160',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
+  ['set_5fsimplex_161',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fstep_5fscaling_5ffactor_162',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
+  ['set_5ftolerance_163',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
+  ['set_5fuse_5fline_5fsearch_164',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
+  ['set_5fvar_5ftolerance_165',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
+  ['solve_166',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
 ];
diff --git a/doc/html/search/all_11.html b/doc/html/search/all_11.html
index b35c8bf..2f927fe 100644
--- a/doc/html/search/all_11.html
+++ b/doc/html/search/all_11.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_11.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_11.js b/doc/html/search/all_11.js
index 4057448..9c4b689 100644
--- a/doc/html/search/all_11.js
+++ b/doc/html/search/all_11.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['test_5fconvergence',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
+  ['test_5fconvergence_167',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_12.html b/doc/html/search/all_12.html
index fd26524..6b0988c 100644
--- a/doc/html/search/all_12.html
+++ b/doc/html/search/all_12.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_12.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_12.js b/doc/html/search/all_12.js
index 7d88db2..546fa78 100644
--- a/doc/html/search/all_12.js
+++ b/doc/html/search/all_12.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['value_5fpair',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
-  ['vecfcn',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
-  ['vecfcn_5fhelper',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
+  ['value_5fpair_168',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
+  ['vecfcn_169',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
+  ['vecfcn_5fhelper_170',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_13.html b/doc/html/search/all_13.html
index 04f66e2..7e5f42a 100644
--- a/doc/html/search/all_13.html
+++ b/doc/html/search/all_13.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_13.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_13.js b/doc/html/search/all_13.js
index ac3fb91..ee892d0 100644
--- a/doc/html/search/all_13.js
+++ b/doc/html/search/all_13.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['x1',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
-  ['x2',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
+  ['x1_171',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
+  ['x2_172',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
 ];
diff --git a/doc/html/search/all_2.html b/doc/html/search/all_2.html
index 2f17735..19c530f 100644
--- a/doc/html/search/all_2.html
+++ b/doc/html/search/all_2.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_2.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_2.js b/doc/html/search/all_2.js
index fe5178d..e75bf0f 100644
--- a/doc/html/search/all_2.js
+++ b/doc/html/search/all_2.js
@@ -1,7 +1,7 @@
 var searchData=
 [
-  ['companion_5fmtx',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]],
-  ['converge_5fon_5fchng',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5ffcn',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5fzero_5fdiff',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
+  ['companion_5fmtx_3',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]],
+  ['converge_5fon_5fchng_4',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffcn_5',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5fzero_5fdiff_6',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/all_3.html b/doc/html/search/all_3.html
index a3e6f7d..1ae887f 100644
--- a/doc/html/search/all_3.html
+++ b/doc/html/search/all_3.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_3.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_3.js b/doc/html/search/all_3.js
index dbceb59..754578f 100644
--- a/doc/html/search/all_3.js
+++ b/doc/html/search/all_3.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['dbl_5fpoly_5fmult',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
-  ['diff',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
+  ['dbl_5fpoly_5fmult_7',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
+  ['diff_8',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
 ];
diff --git a/doc/html/search/all_4.html b/doc/html/search/all_4.html
index 6452295..14c90ef 100644
--- a/doc/html/search/all_4.html
+++ b/doc/html/search/all_4.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_4.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_4.js b/doc/html/search/all_4.js
index e96f488..f4b3485 100644
--- a/doc/html/search/all_4.js
+++ b/doc/html/search/all_4.js
@@ -1,8 +1,8 @@
 var searchData=
 [
-  ['equation_5foptimizer',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
-  ['equation_5fsolver',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
-  ['equation_5fsolver_5f1var',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]],
-  ['evaluate',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
-  ['extrapolate',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
+  ['equation_5foptimizer_9',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
+  ['equation_5fsolver_10',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
+  ['equation_5fsolver_5f1var_11',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]],
+  ['evaluate_12',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
+  ['extrapolate_13',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
 ];
diff --git a/doc/html/search/all_5.html b/doc/html/search/all_5.html
index e59e1d5..60fa53e 100644
--- a/doc/html/search/all_5.html
+++ b/doc/html/search/all_5.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_5.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_5.js b/doc/html/search/all_5.js
index dda280e..34f41df 100644
--- a/doc/html/search/all_5.js
+++ b/doc/html/search/all_5.js
@@ -1,11 +1,11 @@
 var searchData=
 [
-  ['fcn',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
-  ['fcn1var',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
-  ['fcn1var_5fhelper',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
-  ['fcn_5fcount',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]],
-  ['fcnnvar',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
-  ['fcnnvar_5fhelper',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]],
-  ['fit',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
-  ['fit_5fthru_5fzero',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
+  ['fcn_14',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
+  ['fcn1var_15',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
+  ['fcn1var_5fhelper_16',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
+  ['fcn_5fcount_17',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]],
+  ['fcnnvar_18',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
+  ['fcnnvar_5fhelper_19',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]],
+  ['fit_20',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
+  ['fit_5fthru_5fzero_21',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/all_6.html b/doc/html/search/all_6.html
index f75a754..7180363 100644
--- a/doc/html/search/all_6.html
+++ b/doc/html/search/all_6.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_6.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_6.js b/doc/html/search/all_6.js
index 41ad6e1..2185be2 100644
--- a/doc/html/search/all_6.js
+++ b/doc/html/search/all_6.js
@@ -1,28 +1,28 @@
 var searchData=
 [
-  ['get',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fall',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fdiff_5ftolerance',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
-  ['get_5fdistance_5ffactor',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
-  ['get_5fequation_5fcount',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
-  ['get_5ffcn_5ftolerance',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
-  ['get_5fgradient_5ftolerance',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
-  ['get_5finitial_5fsize',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fjacobian_5finterval',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
-  ['get_5fline_5fsearch',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
-  ['get_5fmax_5ffcn_5fevals',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
-  ['get_5fpoly_5fcoefficient',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5fcoefficients',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5forder',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
-  ['get_5fprint_5fstatus',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
-  ['get_5fscaling_5ffactor',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
-  ['get_5fsimplex',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fstep_5fscaling_5ffactor',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
-  ['get_5ftolerance',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
-  ['get_5fuse_5fline_5fsearch',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
-  ['get_5fvar_5ftolerance',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
-  ['get_5fvariable_5fcount',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
-  ['gradient',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]],
-  ['gradient_5fcount',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]],
-  ['gradientfcn',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
+  ['get_22',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fall_23',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fdiff_5ftolerance_24',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
+  ['get_5fdistance_5ffactor_25',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
+  ['get_5fequation_5fcount_26',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
+  ['get_5ffcn_5ftolerance_27',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
+  ['get_5fgradient_5ftolerance_28',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
+  ['get_5finitial_5fsize_29',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fjacobian_5finterval_30',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
+  ['get_5fline_5fsearch_31',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
+  ['get_5fmax_5ffcn_5fevals_32',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
+  ['get_5fpoly_5fcoefficient_33',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5fcoefficients_34',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5forder_35',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
+  ['get_5fprint_5fstatus_36',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
+  ['get_5fscaling_5ffactor_37',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
+  ['get_5fsimplex_38',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fstep_5fscaling_5ffactor_39',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
+  ['get_5ftolerance_40',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
+  ['get_5fuse_5fline_5fsearch_41',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
+  ['get_5fvar_5ftolerance_42',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
+  ['get_5fvariable_5fcount_43',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
+  ['gradient_44',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]],
+  ['gradient_5fcount_45',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]],
+  ['gradientfcn_46',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_7.html b/doc/html/search/all_7.html
index 88acd94..ee6d2e4 100644
--- a/doc/html/search/all_7.html
+++ b/doc/html/search/all_7.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_7.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_7.js b/doc/html/search/all_7.js
index 042786f..9cd50f3 100644
--- a/doc/html/search/all_7.js
+++ b/doc/html/search/all_7.js
@@ -1,13 +1,13 @@
 var searchData=
 [
-  ['init_5fpoly',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
-  ['init_5fpoly_5fcoeffs',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
-  ['initialize',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
-  ['is_5fderivative_5fdefined',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
-  ['is_5ffcn_5fdefined',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
-  ['is_5fgradient_5fdefined',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
-  ['is_5fjacobian_5fdefined',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
-  ['is_5fline_5fsearch_5fdefined',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]],
-  ['iter_5fcount',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]],
-  ['iteration_5fbehavior',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
+  ['init_5fpoly_47',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
+  ['init_5fpoly_5fcoeffs_48',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
+  ['initialize_49',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
+  ['is_5fderivative_5fdefined_50',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
+  ['is_5ffcn_5fdefined_51',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
+  ['is_5fgradient_5fdefined_52',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
+  ['is_5fjacobian_5fdefined_53',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
+  ['is_5fline_5fsearch_5fdefined_54',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]],
+  ['iter_5fcount_55',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]],
+  ['iteration_5fbehavior_56',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_8.html b/doc/html/search/all_8.html
index b74d5fd..7829aa4 100644
--- a/doc/html/search/all_8.html
+++ b/doc/html/search/all_8.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_8.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_8.js b/doc/html/search/all_8.js
index ce3d3c5..db9a759 100644
--- a/doc/html/search/all_8.js
+++ b/doc/html/search/all_8.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['jacobian',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]],
-  ['jacobian_5fcount',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]],
-  ['jacobianfcn',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
+  ['jacobian_57',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]],
+  ['jacobian_5fcount_58',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]],
+  ['jacobianfcn_59',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_9.html b/doc/html/search/all_9.html
index 95e88dd..e4242c7 100644
--- a/doc/html/search/all_9.html
+++ b/doc/html/search/all_9.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_9.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_9.js b/doc/html/search/all_9.js
index da57dc2..d66c18b 100644
--- a/doc/html/search/all_9.js
+++ b/doc/html/search/all_9.js
@@ -1,22 +1,22 @@
 var searchData=
 [
-  ['least_5fsquares_5fsolver',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
-  ['limit_5fsearch_5fvector',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
-  ['line_5fsearch',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
-  ['line_5fsearch_5foptimizer',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
-  ['line_5fsearch_5fsolver',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]],
-  ['lmfactor',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
-  ['lmpar',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
-  ['lmsolve',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
-  ['ls_5fget_5fdist',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fmax_5feval',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fscale',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmimo',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmiso',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fdist',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fmax_5feval',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fscale',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
-  ['lss_5fget_5ffactor',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
-  ['lss_5fset_5ffactor',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
-  ['lss_5fsolve',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
+  ['least_5fsquares_5fsolver_60',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
+  ['limit_5fsearch_5fvector_61',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
+  ['line_5fsearch_62',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
+  ['line_5fsearch_5foptimizer_63',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
+  ['line_5fsearch_5fsolver_64',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]],
+  ['lmfactor_65',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
+  ['lmpar_66',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
+  ['lmsolve_67',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
+  ['ls_5fget_5fdist_68',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fmax_5feval_69',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fscale_70',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmimo_71',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmiso_72',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fdist_73',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fmax_5feval_74',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fscale_75',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
+  ['lss_5fget_5ffactor_76',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
+  ['lss_5fset_5ffactor_77',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
+  ['lss_5fsolve_78',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
 ];
diff --git a/doc/html/search/all_a.html b/doc/html/search/all_a.html
index 3148a8e..47a4a78 100644
--- a/doc/html/search/all_a.html
+++ b/doc/html/search/all_a.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_a.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_a.js b/doc/html/search/all_a.js
index 48a7b7f..25056a9 100644
--- a/doc/html/search/all_a.js
+++ b/doc/html/search/all_a.js
@@ -1,25 +1,25 @@
 var searchData=
 [
-  ['m_5falpha',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
-  ['m_5fcoeffs',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
-  ['m_5fdiff',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
-  ['m_5fdifftol',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
-  ['m_5ffactor',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
-  ['m_5ffcn',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
-  ['m_5ffcntol',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
-  ['m_5fgrad',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
-  ['m_5fgtol',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
-  ['m_5finitsize',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5fjac',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fjdelta',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
-  ['m_5flinesearch',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
-  ['m_5fmaxeval',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
-  ['m_5fnfcn',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fnvar',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
-  ['m_5fprintstatus',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
-  ['m_5fsimplex',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5ftol',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
-  ['m_5fuselinesearch',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
-  ['m_5fxtol',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]],
-  ['min_5fbacktrack_5fsearch',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
+  ['m_5falpha_79',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
+  ['m_5fcoeffs_80',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
+  ['m_5fdiff_81',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
+  ['m_5fdifftol_82',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
+  ['m_5ffactor_83',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
+  ['m_5ffcn_84',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
+  ['m_5ffcntol_85',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
+  ['m_5fgrad_86',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
+  ['m_5fgtol_87',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
+  ['m_5finitsize_88',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5fjac_89',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fjdelta_90',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
+  ['m_5flinesearch_91',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
+  ['m_5fmaxeval_92',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
+  ['m_5fnfcn_93',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fnvar_94',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
+  ['m_5fprintstatus_95',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
+  ['m_5fsimplex_96',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5ftol_97',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
+  ['m_5fuselinesearch_98',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
+  ['m_5fxtol_99',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]],
+  ['min_5fbacktrack_5fsearch_100',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
 ];
diff --git a/doc/html/search/all_b.html b/doc/html/search/all_b.html
index f2a3c8d..1320a43 100644
--- a/doc/html/search/all_b.html
+++ b/doc/html/search/all_b.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_b.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_b.js b/doc/html/search/all_b.js
index 822a5ca..bd3f9d3 100644
--- a/doc/html/search/all_b.js
+++ b/doc/html/search/all_b.js
@@ -1,24 +1,25 @@
 var searchData=
 [
-  ['nelder_5fmead',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
-  ['newton_5f1var_5fsolver',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
-  ['newton_5fsolver',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
-  ['nl_5farray_5fsize_5ferror',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
-  ['nl_5fconvergence_5ferror',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
-  ['nl_5fdivergent_5fbehavior_5ferror',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
-  ['nl_5finvalid_5finput_5ferror',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
-  ['nl_5finvalid_5foperation_5ferror',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
-  ['nl_5fout_5fof_5fmemory_5ferror',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
-  ['nl_5fspurious_5fconvergence_5ferror',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
-  ['nl_5ftolerance_5ftoo_5fsmall_5ferror',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]],
-  ['nonlin_5fconstants',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
-  ['nonlin_5fcore',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
-  ['nonlin_5fleast_5fsquares',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
-  ['nonlin_5flinesearch',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
-  ['nonlin_5foptimize',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
-  ['nonlin_5foptimize_5ffcn',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
-  ['nonlin_5fpolynomials',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
-  ['nonlin_5fsolve',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]],
-  ['nonlin_5fsolver',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver_5f1var',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
+  ['nelder_5fmead_101',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
+  ['newton_5f1var_5fsolver_102',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
+  ['newton_5fsolver_103',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
+  ['nl_5farray_5fsize_5ferror_104',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
+  ['nl_5fconvergence_5ferror_105',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
+  ['nl_5fdivergent_5fbehavior_5ferror_106',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
+  ['nl_5finvalid_5finput_5ferror_107',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
+  ['nl_5finvalid_5foperation_5ferror_108',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
+  ['nl_5fout_5fof_5fmemory_5ferror_109',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
+  ['nl_5fspurious_5fconvergence_5ferror_110',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
+  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_111',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]],
+  ['nonlin_5fc_5fapi_112',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
+  ['nonlin_5fconstants_113',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
+  ['nonlin_5fcore_114',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
+  ['nonlin_5fleast_5fsquares_115',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
+  ['nonlin_5flinesearch_116',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
+  ['nonlin_5foptimize_117',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
+  ['nonlin_5foptimize_5ffcn_118',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
+  ['nonlin_5fpolynomials_119',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
+  ['nonlin_5fsolve_120',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]],
+  ['nonlin_5fsolver_121',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_5f1var_122',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_c.html b/doc/html/search/all_c.html
index 6376810..32a3a1b 100644
--- a/doc/html/search/all_c.html
+++ b/doc/html/search/all_c.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_c.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_c.js b/doc/html/search/all_c.js
index 69a661a..b966f90 100644
--- a/doc/html/search/all_c.js
+++ b/doc/html/search/all_c.js
@@ -1,7 +1,7 @@
 var searchData=
 [
-  ['operator_28_2a_29',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2b_29',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2d_29',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]],
-  ['order',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
+  ['operator_28_2a_29_123',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2b_29_124',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2d_29_125',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]],
+  ['order_126',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/all_d.html b/doc/html/search/all_d.html
index cc52c79..a386096 100644
--- a/doc/html/search/all_d.html
+++ b/doc/html/search/all_d.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_d.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_d.js b/doc/html/search/all_d.js
index 7399df1..09620c1 100644
--- a/doc/html/search/all_d.js
+++ b/doc/html/search/all_d.js
@@ -1,18 +1,18 @@
 var searchData=
 [
-  ['poly_5fcompanion_5fmtx',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
-  ['poly_5fdbl_5fequals',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
-  ['poly_5fdbl_5fmult',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
-  ['poly_5fequals',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
-  ['poly_5fequals_5farray',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
-  ['poly_5feval_5fcomplex',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
-  ['poly_5feval_5fdouble',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
-  ['poly_5ffit',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
-  ['poly_5ffit_5fthru_5fzero',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
-  ['poly_5fpoly_5fadd',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
-  ['poly_5fpoly_5fmult',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
-  ['poly_5fpoly_5fsubtract',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
-  ['poly_5froots',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
-  ['polynomial',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]],
-  ['print_5fstatus',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
+  ['poly_5fcompanion_5fmtx_127',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
+  ['poly_5fdbl_5fequals_128',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
+  ['poly_5fdbl_5fmult_129',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
+  ['poly_5fequals_130',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
+  ['poly_5fequals_5farray_131',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
+  ['poly_5feval_5fcomplex_132',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
+  ['poly_5feval_5fdouble_133',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
+  ['poly_5ffit_134',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
+  ['poly_5ffit_5fthru_5fzero_135',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
+  ['poly_5fpoly_5fadd_136',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
+  ['poly_5fpoly_5fmult_137',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
+  ['poly_5fpoly_5fsubtract_138',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
+  ['poly_5froots_139',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
+  ['polynomial_140',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]],
+  ['print_5fstatus_141',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_e.html b/doc/html/search/all_e.html
index 85b39bd..2931618 100644
--- a/doc/html/search/all_e.html
+++ b/doc/html/search/all_e.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_e.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_e.js b/doc/html/search/all_e.js
index 4f58d6e..5dbc4be 100644
--- a/doc/html/search/all_e.js
+++ b/doc/html/search/all_e.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['quasi_5fnewton_5fsolver',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
+  ['quasi_5fnewton_5fsolver_142',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_f.html b/doc/html/search/all_f.html
index 89fa15a..ca42a52 100644
--- a/doc/html/search/all_f.html
+++ b/doc/html/search/all_f.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="all_f.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/all_f.js b/doc/html/search/all_f.js
index c49890d..ee78db9 100644
--- a/doc/html/search/all_f.js
+++ b/doc/html/search/all_f.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['roots',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
+  ['roots_143',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/classes_0.html b/doc/html/search/classes_0.html
index e935fdf..d585e6a 100644
--- a/doc/html/search/classes_0.html
+++ b/doc/html/search/classes_0.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_0.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_0.js b/doc/html/search/classes_0.js
index d423b4f..626e4e8 100644
--- a/doc/html/search/classes_0.js
+++ b/doc/html/search/classes_0.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['assignment_28_3d_29',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html',1,'nonlin_polynomials']]]
+  ['assignment_28_3d_29_173',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_1.html b/doc/html/search/classes_1.html
index 3df6e80..baeb182 100644
--- a/doc/html/search/classes_1.html
+++ b/doc/html/search/classes_1.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_1.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_1.js b/doc/html/search/classes_1.js
index 4a1b5a4..efd8e59 100644
--- a/doc/html/search/classes_1.js
+++ b/doc/html/search/classes_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['bfgs',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
-  ['brent_5fsolver',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
+  ['bfgs_174',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
+  ['brent_5fsolver_175',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_2.html b/doc/html/search/classes_2.html
index 028694f..d267279 100644
--- a/doc/html/search/classes_2.html
+++ b/doc/html/search/classes_2.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_2.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_2.js b/doc/html/search/classes_2.js
index c810c86..874404d 100644
--- a/doc/html/search/classes_2.js
+++ b/doc/html/search/classes_2.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['equation_5foptimizer',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
-  ['equation_5fsolver',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
-  ['equation_5fsolver_5f1var',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]]
+  ['equation_5foptimizer_176',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
+  ['equation_5fsolver_177',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
+  ['equation_5fsolver_5f1var_178',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_3.html b/doc/html/search/classes_3.html
index 2b1abe3..8a5cbe1 100644
--- a/doc/html/search/classes_3.html
+++ b/doc/html/search/classes_3.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_3.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_3.js b/doc/html/search/classes_3.js
index 2c88c65..3361b4d 100644
--- a/doc/html/search/classes_3.js
+++ b/doc/html/search/classes_3.js
@@ -1,7 +1,7 @@
 var searchData=
 [
-  ['fcn1var',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
-  ['fcn1var_5fhelper',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
-  ['fcnnvar',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
-  ['fcnnvar_5fhelper',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]]
+  ['fcn1var_179',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
+  ['fcn1var_5fhelper_180',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
+  ['fcnnvar_181',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
+  ['fcnnvar_5fhelper_182',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_4.html b/doc/html/search/classes_4.html
index 8735214..300b9ab 100644
--- a/doc/html/search/classes_4.html
+++ b/doc/html/search/classes_4.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_4.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_4.js b/doc/html/search/classes_4.js
index c986224..d9c59a5 100644
--- a/doc/html/search/classes_4.js
+++ b/doc/html/search/classes_4.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['gradientfcn',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
+  ['gradientfcn_183',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_5.html b/doc/html/search/classes_5.html
index ba8b1c6..e7afb2c 100644
--- a/doc/html/search/classes_5.html
+++ b/doc/html/search/classes_5.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_5.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_5.js b/doc/html/search/classes_5.js
index e3b3300..2cdf3ac 100644
--- a/doc/html/search/classes_5.js
+++ b/doc/html/search/classes_5.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['iteration_5fbehavior',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
+  ['iteration_5fbehavior_184',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_6.html b/doc/html/search/classes_6.html
index f585093..f397fd5 100644
--- a/doc/html/search/classes_6.html
+++ b/doc/html/search/classes_6.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_6.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_6.js b/doc/html/search/classes_6.js
index a8e5f26..28aa3b2 100644
--- a/doc/html/search/classes_6.js
+++ b/doc/html/search/classes_6.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['jacobianfcn',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
+  ['jacobianfcn_185',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_7.html b/doc/html/search/classes_7.html
index 6418529..6453cb7 100644
--- a/doc/html/search/classes_7.html
+++ b/doc/html/search/classes_7.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_7.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_7.js b/doc/html/search/classes_7.js
index 348b30c..4b051f3 100644
--- a/doc/html/search/classes_7.js
+++ b/doc/html/search/classes_7.js
@@ -1,7 +1,7 @@
 var searchData=
 [
-  ['least_5fsquares_5fsolver',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
-  ['line_5fsearch',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
-  ['line_5fsearch_5foptimizer',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
-  ['line_5fsearch_5fsolver',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]]
+  ['least_5fsquares_5fsolver_186',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
+  ['line_5fsearch_187',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
+  ['line_5fsearch_5foptimizer_188',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
+  ['line_5fsearch_5fsolver_189',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_8.html b/doc/html/search/classes_8.html
index 87af6f6..f2f78e9 100644
--- a/doc/html/search/classes_8.html
+++ b/doc/html/search/classes_8.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_8.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_8.js b/doc/html/search/classes_8.js
index 72a184e..892ea45 100644
--- a/doc/html/search/classes_8.js
+++ b/doc/html/search/classes_8.js
@@ -1,9 +1,9 @@
 var searchData=
 [
-  ['nelder_5fmead',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
-  ['newton_5f1var_5fsolver',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
-  ['newton_5fsolver',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
-  ['nonlin_5foptimize_5ffcn',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver_5f1var',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
+  ['nelder_5fmead_190',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
+  ['newton_5f1var_5fsolver_191',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
+  ['newton_5fsolver_192',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
+  ['nonlin_5foptimize_5ffcn_193',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_194',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_5f1var_195',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_9.html b/doc/html/search/classes_9.html
index f830ae0..e4e148f 100644
--- a/doc/html/search/classes_9.html
+++ b/doc/html/search/classes_9.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_9.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_9.js b/doc/html/search/classes_9.js
index 466d1fb..c317b3c 100644
--- a/doc/html/search/classes_9.js
+++ b/doc/html/search/classes_9.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['operator_28_2a_29',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2b_29',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2d_29',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]]
+  ['operator_28_2a_29_196',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2b_29_197',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2d_29_198',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_a.html b/doc/html/search/classes_a.html
index 0fd3b7a..157ebcb 100644
--- a/doc/html/search/classes_a.html
+++ b/doc/html/search/classes_a.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_a.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_a.js b/doc/html/search/classes_a.js
index eb13144..a51ff71 100644
--- a/doc/html/search/classes_a.js
+++ b/doc/html/search/classes_a.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['polynomial',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]]
+  ['polynomial_199',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_b.html b/doc/html/search/classes_b.html
index 886abdf..02927f7 100644
--- a/doc/html/search/classes_b.html
+++ b/doc/html/search/classes_b.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_b.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_b.js b/doc/html/search/classes_b.js
index 4f58d6e..9836b56 100644
--- a/doc/html/search/classes_b.js
+++ b/doc/html/search/classes_b.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['quasi_5fnewton_5fsolver',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
+  ['quasi_5fnewton_5fsolver_200',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_c.html b/doc/html/search/classes_c.html
index 52ec267..ab9f404 100644
--- a/doc/html/search/classes_c.html
+++ b/doc/html/search/classes_c.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="classes_c.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/classes_c.js b/doc/html/search/classes_c.js
index 7d88db2..38ee2a3 100644
--- a/doc/html/search/classes_c.js
+++ b/doc/html/search/classes_c.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['value_5fpair',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
-  ['vecfcn',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
-  ['vecfcn_5fhelper',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
+  ['value_5fpair_201',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
+  ['vecfcn_202',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
+  ['vecfcn_5fhelper_203',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/functions_0.html b/doc/html/search/functions_0.html
index 0539c8c..8a729f7 100644
--- a/doc/html/search/functions_0.html
+++ b/doc/html/search/functions_0.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_0.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_0.js b/doc/html/search/functions_0.js
index 0c81373..f6c3054 100644
--- a/doc/html/search/functions_0.js
+++ b/doc/html/search/functions_0.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['companion_5fmtx',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]]
+  ['companion_5fmtx_212',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_1.html b/doc/html/search/functions_1.html
index 4878b3d..d4929aa 100644
--- a/doc/html/search/functions_1.html
+++ b/doc/html/search/functions_1.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_1.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_1.js b/doc/html/search/functions_1.js
index dbceb59..66bf87f 100644
--- a/doc/html/search/functions_1.js
+++ b/doc/html/search/functions_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['dbl_5fpoly_5fmult',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
-  ['diff',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
+  ['dbl_5fpoly_5fmult_213',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
+  ['diff_214',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
 ];
diff --git a/doc/html/search/functions_2.html b/doc/html/search/functions_2.html
index 67d2a39..07e3fda 100644
--- a/doc/html/search/functions_2.html
+++ b/doc/html/search/functions_2.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_2.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_2.js b/doc/html/search/functions_2.js
index b2c80f8..c3f6bf4 100644
--- a/doc/html/search/functions_2.js
+++ b/doc/html/search/functions_2.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['evaluate',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
-  ['extrapolate',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
+  ['evaluate_215',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
+  ['extrapolate_216',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
 ];
diff --git a/doc/html/search/functions_3.html b/doc/html/search/functions_3.html
index 1f0eedb..40bd389 100644
--- a/doc/html/search/functions_3.html
+++ b/doc/html/search/functions_3.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_3.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_3.js b/doc/html/search/functions_3.js
index 29c5cef..b140c91 100644
--- a/doc/html/search/functions_3.js
+++ b/doc/html/search/functions_3.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['fcn',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
-  ['fit',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
-  ['fit_5fthru_5fzero',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
+  ['fcn_217',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
+  ['fit_218',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
+  ['fit_5fthru_5fzero_219',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_4.html b/doc/html/search/functions_4.html
index c5bf87a..8a4df4c 100644
--- a/doc/html/search/functions_4.html
+++ b/doc/html/search/functions_4.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_4.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_4.js b/doc/html/search/functions_4.js
index 74e25e8..8e28850 100644
--- a/doc/html/search/functions_4.js
+++ b/doc/html/search/functions_4.js
@@ -1,26 +1,26 @@
 var searchData=
 [
-  ['get',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fall',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fdiff_5ftolerance',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
-  ['get_5fdistance_5ffactor',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
-  ['get_5fequation_5fcount',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
-  ['get_5ffcn_5ftolerance',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
-  ['get_5fgradient_5ftolerance',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
-  ['get_5finitial_5fsize',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fjacobian_5finterval',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
-  ['get_5fline_5fsearch',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
-  ['get_5fmax_5ffcn_5fevals',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
-  ['get_5fpoly_5fcoefficient',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5fcoefficients',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5forder',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
-  ['get_5fprint_5fstatus',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
-  ['get_5fscaling_5ffactor',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
-  ['get_5fsimplex',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fstep_5fscaling_5ffactor',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
-  ['get_5ftolerance',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
-  ['get_5fuse_5fline_5fsearch',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
-  ['get_5fvar_5ftolerance',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
-  ['get_5fvariable_5fcount',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
-  ['gradient',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]]
+  ['get_220',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fall_221',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fdiff_5ftolerance_222',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
+  ['get_5fdistance_5ffactor_223',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
+  ['get_5fequation_5fcount_224',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
+  ['get_5ffcn_5ftolerance_225',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
+  ['get_5fgradient_5ftolerance_226',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
+  ['get_5finitial_5fsize_227',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fjacobian_5finterval_228',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
+  ['get_5fline_5fsearch_229',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
+  ['get_5fmax_5ffcn_5fevals_230',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
+  ['get_5fpoly_5fcoefficient_231',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5fcoefficients_232',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5forder_233',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
+  ['get_5fprint_5fstatus_234',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
+  ['get_5fscaling_5ffactor_235',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
+  ['get_5fsimplex_236',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fstep_5fscaling_5ffactor_237',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
+  ['get_5ftolerance_238',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
+  ['get_5fuse_5fline_5fsearch_239',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
+  ['get_5fvar_5ftolerance_240',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
+  ['get_5fvariable_5fcount_241',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
+  ['gradient_242',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]]
 ];
diff --git a/doc/html/search/functions_5.html b/doc/html/search/functions_5.html
index a34446c..2b983b2 100644
--- a/doc/html/search/functions_5.html
+++ b/doc/html/search/functions_5.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_5.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_5.js b/doc/html/search/functions_5.js
index f412f1f..ab8696c 100644
--- a/doc/html/search/functions_5.js
+++ b/doc/html/search/functions_5.js
@@ -1,11 +1,11 @@
 var searchData=
 [
-  ['init_5fpoly',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
-  ['init_5fpoly_5fcoeffs',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
-  ['initialize',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
-  ['is_5fderivative_5fdefined',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
-  ['is_5ffcn_5fdefined',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
-  ['is_5fgradient_5fdefined',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
-  ['is_5fjacobian_5fdefined',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
-  ['is_5fline_5fsearch_5fdefined',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]]
+  ['init_5fpoly_243',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
+  ['init_5fpoly_5fcoeffs_244',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
+  ['initialize_245',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
+  ['is_5fderivative_5fdefined_246',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
+  ['is_5ffcn_5fdefined_247',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
+  ['is_5fgradient_5fdefined_248',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
+  ['is_5fjacobian_5fdefined_249',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
+  ['is_5fline_5fsearch_5fdefined_250',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]]
 ];
diff --git a/doc/html/search/functions_6.html b/doc/html/search/functions_6.html
index 6fd4b1f..f7d283d 100644
--- a/doc/html/search/functions_6.html
+++ b/doc/html/search/functions_6.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_6.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_6.js b/doc/html/search/functions_6.js
index 3e49c7f..059ddf2 100644
--- a/doc/html/search/functions_6.js
+++ b/doc/html/search/functions_6.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['jacobian',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]]
+  ['jacobian_251',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]]
 ];
diff --git a/doc/html/search/functions_7.html b/doc/html/search/functions_7.html
index 6e09abf..a74fe44 100644
--- a/doc/html/search/functions_7.html
+++ b/doc/html/search/functions_7.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_7.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_7.js b/doc/html/search/functions_7.js
index 37862cc..edebc53 100644
--- a/doc/html/search/functions_7.js
+++ b/doc/html/search/functions_7.js
@@ -1,18 +1,18 @@
 var searchData=
 [
-  ['limit_5fsearch_5fvector',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
-  ['lmfactor',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
-  ['lmpar',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
-  ['lmsolve',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
-  ['ls_5fget_5fdist',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fmax_5feval',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fscale',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmimo',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmiso',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fdist',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fmax_5feval',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fscale',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
-  ['lss_5fget_5ffactor',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
-  ['lss_5fset_5ffactor',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
-  ['lss_5fsolve',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
+  ['limit_5fsearch_5fvector_252',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
+  ['lmfactor_253',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
+  ['lmpar_254',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
+  ['lmsolve_255',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
+  ['ls_5fget_5fdist_256',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fmax_5feval_257',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fscale_258',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmimo_259',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmiso_260',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fdist_261',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fmax_5feval_262',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fscale_263',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
+  ['lss_5fget_5ffactor_264',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
+  ['lss_5fset_5ffactor_265',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
+  ['lss_5fsolve_266',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
 ];
diff --git a/doc/html/search/functions_8.html b/doc/html/search/functions_8.html
index d59ea97..75fc0be 100644
--- a/doc/html/search/functions_8.html
+++ b/doc/html/search/functions_8.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_8.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_8.js b/doc/html/search/functions_8.js
index 5c9cf50..bab07c1 100644
--- a/doc/html/search/functions_8.js
+++ b/doc/html/search/functions_8.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['min_5fbacktrack_5fsearch',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
+  ['min_5fbacktrack_5fsearch_267',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
 ];
diff --git a/doc/html/search/functions_9.html b/doc/html/search/functions_9.html
index 5ccec42..7541c9e 100644
--- a/doc/html/search/functions_9.html
+++ b/doc/html/search/functions_9.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_9.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_9.js b/doc/html/search/functions_9.js
index ba101f2..e883c9a 100644
--- a/doc/html/search/functions_9.js
+++ b/doc/html/search/functions_9.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['order',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
+  ['order_268',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_a.html b/doc/html/search/functions_a.html
index 3958eb7..5a5be63 100644
--- a/doc/html/search/functions_a.html
+++ b/doc/html/search/functions_a.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_a.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_a.js b/doc/html/search/functions_a.js
index b6d326d..32d3f27 100644
--- a/doc/html/search/functions_a.js
+++ b/doc/html/search/functions_a.js
@@ -1,17 +1,17 @@
 var searchData=
 [
-  ['poly_5fcompanion_5fmtx',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
-  ['poly_5fdbl_5fequals',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
-  ['poly_5fdbl_5fmult',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
-  ['poly_5fequals',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
-  ['poly_5fequals_5farray',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0A_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
-  ['poly_5feval_5fcomplex',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
-  ['poly_5feval_5fdouble',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
-  ['poly_5ffit',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
-  ['poly_5ffit_5fthru_5fzero',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
-  ['poly_5fpoly_5fadd',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
-  ['poly_5fpoly_5fmult',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
-  ['poly_5fpoly_5fsubtract',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
-  ['poly_5froots',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
-  ['print_5fstatus',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
+  ['poly_5fcompanion_5fmtx_269',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
+  ['poly_5fdbl_5fequals_270',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
+  ['poly_5fdbl_5fmult_271',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
+  ['poly_5fequals_272',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
+  ['poly_5fequals_5farray_273',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
+  ['poly_5feval_5fcomplex_274',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
+  ['poly_5feval_5fdouble_275',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
+  ['poly_5ffit_276',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
+  ['poly_5ffit_5fthru_5fzero_277',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
+  ['poly_5fpoly_5fadd_278',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
+  ['poly_5fpoly_5fmult_279',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
+  ['poly_5fpoly_5fsubtract_280',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
+  ['poly_5froots_281',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
+  ['print_5fstatus_282',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/functions_b.html b/doc/html/search/functions_b.html
index b99b702..fc2d5aa 100644
--- a/doc/html/search/functions_b.html
+++ b/doc/html/search/functions_b.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_b.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_b.js b/doc/html/search/functions_b.js
index c49890d..ab0463c 100644
--- a/doc/html/search/functions_b.js
+++ b/doc/html/search/functions_b.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['roots',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
+  ['roots_283',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_c.html b/doc/html/search/functions_c.html
index 3a33d87..a1a1437 100644
--- a/doc/html/search/functions_c.html
+++ b/doc/html/search/functions_c.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_c.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_c.js b/doc/html/search/functions_c.js
index d06b996..c96cb54 100644
--- a/doc/html/search/functions_c.js
+++ b/doc/html/search/functions_c.js
@@ -1,26 +1,26 @@
 var searchData=
 [
-  ['search',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
-  ['set',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
-  ['set_5fdefault_5fline_5fsearch',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
-  ['set_5fdiff_5ftolerance',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
-  ['set_5fdistance_5ffactor',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
-  ['set_5ffcn',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
-  ['set_5ffcn_5ftolerance',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
-  ['set_5fgradient_5ffcn',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
-  ['set_5fgradient_5ftolerance',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
-  ['set_5finitial_5fsize',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fjacobian',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
-  ['set_5fjacobian_5finterval',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
-  ['set_5fline_5fsearch',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
-  ['set_5fmax_5ffcn_5fevals',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
-  ['set_5fpoly_5fcoefficient',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
-  ['set_5fprint_5fstatus',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
-  ['set_5fscaling_5ffactor',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
-  ['set_5fsimplex',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fstep_5fscaling_5ffactor',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
-  ['set_5ftolerance',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
-  ['set_5fuse_5fline_5fsearch',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
-  ['set_5fvar_5ftolerance',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
-  ['solve',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
+  ['search_284',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
+  ['set_285',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
+  ['set_5fdefault_5fline_5fsearch_286',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
+  ['set_5fdiff_5ftolerance_287',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
+  ['set_5fdistance_5ffactor_288',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
+  ['set_5ffcn_289',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
+  ['set_5ffcn_5ftolerance_290',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
+  ['set_5fgradient_5ffcn_291',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
+  ['set_5fgradient_5ftolerance_292',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
+  ['set_5finitial_5fsize_293',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fjacobian_294',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
+  ['set_5fjacobian_5finterval_295',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
+  ['set_5fline_5fsearch_296',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
+  ['set_5fmax_5ffcn_5fevals_297',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
+  ['set_5fpoly_5fcoefficient_298',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
+  ['set_5fprint_5fstatus_299',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
+  ['set_5fscaling_5ffactor_300',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
+  ['set_5fsimplex_301',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fstep_5fscaling_5ffactor_302',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
+  ['set_5ftolerance_303',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
+  ['set_5fuse_5fline_5fsearch_304',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
+  ['set_5fvar_5ftolerance_305',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
+  ['solve_306',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
 ];
diff --git a/doc/html/search/functions_d.html b/doc/html/search/functions_d.html
index 31b75b8..4375535 100644
--- a/doc/html/search/functions_d.html
+++ b/doc/html/search/functions_d.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="functions_d.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/functions_d.js b/doc/html/search/functions_d.js
index 4057448..8d45837 100644
--- a/doc/html/search/functions_d.js
+++ b/doc/html/search/functions_d.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['test_5fconvergence',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
+  ['test_5fconvergence_307',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/mag_sel.png b/doc/html/search/mag_sel.png
index 81f6040a2092402b4d98f9ffa8855d12a0d4ca17..39c0ed52a25dd9d080ee0d42ae6c6042bdfa04d7 100644
GIT binary patch
delta 387
zcmdnYa*=t0qy!5C1A|rTQ#&BVlJ4m1$iT3%pZiZD>qIj>9tNf)Z+91l|Ly%}_D@ul
zsAn(n^mS!_#KX=lBk2D&{60|65l<J#5RLO^FYWa@oFKyX;C<TpNzwv;=1$rce!(?e
z_Q*;u`CXz_f|DLS61db<rg>M6-Px1V)%<Brd%O5K|4DV>FZ&<fTHJZ)$mFeyH<T)W
zE6sh%F^6;NnrTxHy^)aNJa4w7S3J?>RBYX~=GOWPWxZh<9+s(!r~e-Dn&F(J7joYq
z)l&8Vdty#vcB0OmiB?q{_kF5^+l}W}R~ek~dmFbhU{|SDOj*f>4|Dl@%X_EZYArBb
z&|I6VJJ<T+kB`@)z1RP{IJ=fnPIcF&f2y{JfgVyVag8WRNi0dVN-jzTQVd20h8DVp
zM!E*(0U?HlRz?<9hUVG^237_Jy7tbuQFP?yr(~v8BI!WW5R>#f9jJl9)78&qol`;+
E09^HzBLDyZ

delta 506
zcmV<W0R{fi1G5B>865@y005ATEwumu010qNS#tmY3ljhU3ljkVnw%JsF)n`rxk*Gp
zRCwCtl)H)|K@^6++7>zxx&tqG15pu7)IiiXFflOc2k;dXd>%13GZAy?Rz!q0=|E6a
z6vV)&ZBS~G9oe0kbqyw1*gvY`{Pop2oKq#FlzgXt@Xh-7fxh>}`Fxg>$%N%{$!4=5
znM{(;=c!aG1Ofr^Do{u%Ih}t_axfTRS=J{*wOXaoXb=nr#mgB^r&BD;B9%%}DwW7&
zGOSiBX0sWS$%IHGLcLypy=2?A0VtQtR4NrTO%tI|NGgiLdcDTBZR+(pqtQtA`~AmZ
z!!W4TYT{E<w%aWL#bOan(*%H~X`)al@M|0phG9HlfcUb@i9`Yb$8moE-X~rD+&|(U
zpyH2Xlgs4*7>~!8ritsi(lkxR<1ql~bQ*wKt@eOE?ecoPmc!wY`F#GRDI5;d>2%O_
zT>y+mqmLK-4)i=v?shvCiv^D3u;1^A$K#~aX>8l(bUG1@MrpU(59rej0X)x>uIu7?
z9=F>KpU;P)C|oWVdc9H}$K#P$EJmx<dJ28K6jfD)s;Zw1e!pKfn@zgiF4yao>-CDR
w>wnMinOxVEhr@yU{Z2NUeXZpG=lgma09mNIXv$B;rvLx|07*qoM6N<$g8jzt3IG5A

diff --git a/doc/html/search/namespaces_0.html b/doc/html/search/namespaces_0.html
index f55ca63..93c99f9 100644
--- a/doc/html/search/namespaces_0.html
+++ b/doc/html/search/namespaces_0.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="namespaces_0.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/namespaces_0.js b/doc/html/search/namespaces_0.js
index bc5006c..9cb3a6b 100644
--- a/doc/html/search/namespaces_0.js
+++ b/doc/html/search/namespaces_0.js
@@ -1,10 +1,11 @@
 var searchData=
 [
-  ['nonlin_5fconstants',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
-  ['nonlin_5fcore',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
-  ['nonlin_5fleast_5fsquares',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
-  ['nonlin_5flinesearch',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
-  ['nonlin_5foptimize',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
-  ['nonlin_5fpolynomials',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
-  ['nonlin_5fsolve',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]]
+  ['nonlin_5fc_5fapi_204',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
+  ['nonlin_5fconstants_205',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
+  ['nonlin_5fcore_206',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
+  ['nonlin_5fleast_5fsquares_207',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
+  ['nonlin_5flinesearch_208',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
+  ['nonlin_5foptimize_209',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
+  ['nonlin_5fpolynomials_210',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
+  ['nonlin_5fsolve_211',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]]
 ];
diff --git a/doc/html/search/nomatches.html b/doc/html/search/nomatches.html
index b1ded27..4377320 100644
--- a/doc/html/search/nomatches.html
+++ b/doc/html/search/nomatches.html
@@ -1,4 +1,4 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
diff --git a/doc/html/search/search_l.png b/doc/html/search/search_l.png
index c872f4da4a01d0754f923e6c94fd8159c0621bd1..fd5f7daa41a4c79b4ae9bea5aa7bdfb94e14084b 100644
GIT binary patch
delta 490
zcmcb^vYlmuqy!5C1A|rTQ#&BVlJ4m1$iT3%pZiZD>qIj>9tNf)Z+91l|Ly%}_D@ul
zsAn(n^mS!_#KX=lBk2D&{5}H%qn4+OV~EE2-brV@oB~DMzW1v2cBy@1;GO-&?&6Y~
zW{oDf18$B2lAZ#+TwkXx5}KGW%Q0X<<5h);bqD4*s<~D5&%3JN__k|%zOPw(Dc}7@
z-4ptmhf6B&&b!_FjBE9pn*uC5&60xesh+<(kE_1GagvF-8H=anvo~dTmJ2<pSnM=a
zYQ7mur_Vc=KQ;l29JyWDZCN~fev0|+o3}F2P%CNIx5trL8gA}<cc1qPiOH&eRG9J7
z<ifc}f%_b|eRo%1h+kMg?QxbQD_=Y#XWHp4|L@3Yv6bBqd~oOD{y#VJ78Z8RC_Y*B
z*FLF4Y09bO`h|&0^g4D{L~1UQi4#?^$;~?!Z(ky8tB|cz^_G=W`r*vWUo#Y)Ct96t
zeEah3-M@Uj?a$6{OVSU&|6ObO{0*O(^K3Ux_n4R93k+-364!{5l*E!$tK_0oAjM#0
zU}&LhXryak9%5){Wn^JxXs&HwU}a#SYwvs;qQM-hBR4-KGp!Q0j+mt1=|CL}p00i_
I>zopr03(~h8~^|S

delta 547
zcmV+;0^I$#1l$CW865@y005ATEwumu010qNS#tmY3ljhU3ljkVnw%JsF)n`r;z>k7
zRCwB~R6VQOP#AvB$vH7i{6H{96zot$7cZT<7246EF5Np6N}+$IbiG6Wg#87A+NFaX
z+=_^xM1#gCtshC=E{%9^uQX_%?YwXvo{#q&MnpJ8uh(O?ZRc&<Zo01fZnN3kY`5D4
z=NybN{0l51>~_1%^SsPxG<tvSy6%T;HhYuH<wQE2hNfvy6eT`kr_*8c`TWUvJigU+
z{duKQ5vFM(l}bU=GzcNU7>h+H0ARIRr6-fgr(&`AvRbVopU=ZE3`i-#IY(T(03h1!
zHlI$XuT0Z?QLoowSr&9%hm;bRKr9vulZf8dYBk-mEEt9XAp|Z3_dI{ESuU5KManqm
zxCT53f<~cGcyz6@BcYV?X(p55QD*n|()axbFP@uoRaLW*RmK>?FuWV`8P(_JTuM0x
za9oSH>v7gH5q0+a{n6^xr4Z4#^?DtIVF)6+o={Pgua4vV-0gPwAK-~Z;>U8i{O&jo
zeBVD>zu$Ij!bYR<D+qgn+u?BNEEWp{K>#AUxE%gx1-^Km_jxcFjAyeMMJ1h6Nkljt
z4md6I&Tj)?DTMgwd7j(v_urRFrN_}zR8<vH%D)r~As&o}ogP}PmH<#EqBp9lHVwll
lCX-2_X_~@0kCnmi0RT1S)n3r;4E+EA002ovPDHLkV1jrN|Fi%A

diff --git a/doc/html/search/search_r.png b/doc/html/search/search_r.png
index 97ee8b439687084201b79c6f776a41f495c6392a..1af5d21ee13e070d7600f1c4657fde843b953a69 100644
GIT binary patch
delta 476
zcmaFDvXW(jqy!5C1B3bOsg*#ACEd~2k%3`jKlh(R)`@0%JPb@p-tI08|J(b|?4PJ8
zQO{oD>Fdh=h=-k9M$rFl_<aTjMj1~R#}JM4t&<$RnF2-J<UO@HSH*Tu``bM2Z<E;H
zX=0AuP21ddduZ`!E@@qOR%L~&$clj72U=E|35G1-o59=E_xagevBeKs9^ct)`@LxA
zcj4JTZobHq-uUC<D!cyzjujp5e?oSsYWJUw_*qcD+`@W7-N(<(C)L?hOO?KV{>8(j
zC{h<AlVfGFV&cS)C3al`J({hH{AZi%%{daMX%zO!rQPhjO4O~O1uR{5ym@yvujLfd
zunGzN6vJTAIO%M=m#VrSQ@h&By8@n<o)p=ZT$+AnU5ifM=cKe}PAc7}R+@<xE&raD
zXZb+)aQF4y_2ulhOq?oY&0gJqUsZGZcXn=}3hO%$uBwPDce7ScxFpV2S#`Akpm6Hy
zh#gU<UE5FoVHVnu{Ci^Y#Y4c*RV{IiC`m~yNwrEYN(E93Mh1o!x`sx&2Ie7#hE_%v
tR)*%<1_o9J2D<jnw^20Y=BH$)RWfMe)De^PI~}Nl!PC{xWt~$(695HTy<`9Y

delta 556
zcmV+{0@MAe1mpye865@y005nmUGe|`010qNS#tmY3ljhU3ljkVnw%JsF)n`r>PbXF
zRCwB?)W514K@<k?Z}y+E3TvfSi=>j&X?z2*SxFI6-@HT2E2K=9X9%PbEK*!TBw&g(
zDMC;|A)uGlRkOS9vd-?zNs%bR4d$w+ox_iFnE8fvIvv7^5<(>Te12Li7C)9srCzmK
z{ZcNM{YIl9j{DePFgOWiS%!ZkNe~2q@H}s`*=&ATmUUaJ)!sCl&0hz|_x+QQl=6Uu
zVTk2&N#pTY#&P_?w(aMR<Aeafq?9KiB7&3>Qc9$0iYSV(SS&Cc4u$Kw?`yT%O{>+4
zG{)E|2aGW&iUJ~nuIn%i1G!udhGD2u%BS=B{Aa)4f2H7o#TWx)44QwYp-?EGQmLR`
zuWJBatk>&D4~C9GRaIe{CMuN*Y}>YiAb55*w8!?7RjXAdgm|nRU-P-8>pCpUg0Abk
z1Egu%*;6Ts0@E~^VHnGcRy)T2PIh+{L`2}63nKceT!Tm{5r*N0h`wJn(Qdbc=XpI<
zRejI}C8Z?JIZY;$MYn(3eL_S~E?G$kf%STwOsCU#LWpkwpzRN{EIZ`sU-={YlWop9
zR;!g54u_wDAb8zwx6^y+C!%`@5g|=eaLy6Ov2<P6pUq}H&iPBnaqbT9a5Ng>fB#XE
uB-n1ZVH8E5Ip=Q~W4DguM8|!<2LNApMvO2l*qs0X002ovPDBK*LSTZi=Kr7o

diff --git a/doc/html/search/variables_0.html b/doc/html/search/variables_0.html
index 51f7bd6..a2a3ae6 100644
--- a/doc/html/search/variables_0.html
+++ b/doc/html/search/variables_0.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_0.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_0.js b/doc/html/search/variables_0.js
index f5b2cca..e299af2 100644
--- a/doc/html/search/variables_0.js
+++ b/doc/html/search/variables_0.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['converge_5fon_5fchng',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5ffcn',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5fzero_5fdiff',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
+  ['converge_5fon_5fchng_308',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffcn_309',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5fzero_5fdiff_310',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_1.html b/doc/html/search/variables_1.html
index f46154d..b243c42 100644
--- a/doc/html/search/variables_1.html
+++ b/doc/html/search/variables_1.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_1.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_1.js b/doc/html/search/variables_1.js
index 8900161..b7114ba 100644
--- a/doc/html/search/variables_1.js
+++ b/doc/html/search/variables_1.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['fcn_5fcount',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]]
+  ['fcn_5fcount_311',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_2.html b/doc/html/search/variables_2.html
index 15275b7..647df20 100644
--- a/doc/html/search/variables_2.html
+++ b/doc/html/search/variables_2.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_2.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_2.js b/doc/html/search/variables_2.js
index a937c36..4e48273 100644
--- a/doc/html/search/variables_2.js
+++ b/doc/html/search/variables_2.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['gradient_5fcount',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]]
+  ['gradient_5fcount_312',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_3.html b/doc/html/search/variables_3.html
index fbc3671..9dc9b89 100644
--- a/doc/html/search/variables_3.html
+++ b/doc/html/search/variables_3.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_3.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_3.js b/doc/html/search/variables_3.js
index e02e72e..bdc29e3 100644
--- a/doc/html/search/variables_3.js
+++ b/doc/html/search/variables_3.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['iter_5fcount',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]]
+  ['iter_5fcount_313',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_4.html b/doc/html/search/variables_4.html
index 8067e67..78cc2c7 100644
--- a/doc/html/search/variables_4.html
+++ b/doc/html/search/variables_4.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_4.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_4.js b/doc/html/search/variables_4.js
index a47fafc..c83a0ab 100644
--- a/doc/html/search/variables_4.js
+++ b/doc/html/search/variables_4.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['jacobian_5fcount',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]]
+  ['jacobian_5fcount_314',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_5.html b/doc/html/search/variables_5.html
index 7e95e94..dfa3558 100644
--- a/doc/html/search/variables_5.html
+++ b/doc/html/search/variables_5.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_5.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_5.js b/doc/html/search/variables_5.js
index 88bb836..859a5e0 100644
--- a/doc/html/search/variables_5.js
+++ b/doc/html/search/variables_5.js
@@ -1,24 +1,24 @@
 var searchData=
 [
-  ['m_5falpha',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
-  ['m_5fcoeffs',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
-  ['m_5fdiff',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
-  ['m_5fdifftol',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
-  ['m_5ffactor',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
-  ['m_5ffcn',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
-  ['m_5ffcntol',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
-  ['m_5fgrad',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
-  ['m_5fgtol',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
-  ['m_5finitsize',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5fjac',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fjdelta',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
-  ['m_5flinesearch',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
-  ['m_5fmaxeval',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
-  ['m_5fnfcn',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fnvar',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
-  ['m_5fprintstatus',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
-  ['m_5fsimplex',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5ftol',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
-  ['m_5fuselinesearch',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
-  ['m_5fxtol',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]]
+  ['m_5falpha_315',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
+  ['m_5fcoeffs_316',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
+  ['m_5fdiff_317',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
+  ['m_5fdifftol_318',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
+  ['m_5ffactor_319',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
+  ['m_5ffcn_320',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
+  ['m_5ffcntol_321',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
+  ['m_5fgrad_322',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
+  ['m_5fgtol_323',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
+  ['m_5finitsize_324',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5fjac_325',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fjdelta_326',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
+  ['m_5flinesearch_327',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
+  ['m_5fmaxeval_328',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
+  ['m_5fnfcn_329',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fnvar_330',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
+  ['m_5fprintstatus_331',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
+  ['m_5fsimplex_332',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5ftol_333',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
+  ['m_5fuselinesearch_334',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
+  ['m_5fxtol_335',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]]
 ];
diff --git a/doc/html/search/variables_6.html b/doc/html/search/variables_6.html
index 3d398e6..cd462bd 100644
--- a/doc/html/search/variables_6.html
+++ b/doc/html/search/variables_6.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_6.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_6.js b/doc/html/search/variables_6.js
index cd04d0e..79f72a6 100644
--- a/doc/html/search/variables_6.js
+++ b/doc/html/search/variables_6.js
@@ -1,11 +1,11 @@
 var searchData=
 [
-  ['nl_5farray_5fsize_5ferror',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
-  ['nl_5fconvergence_5ferror',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
-  ['nl_5fdivergent_5fbehavior_5ferror',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
-  ['nl_5finvalid_5finput_5ferror',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
-  ['nl_5finvalid_5foperation_5ferror',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
-  ['nl_5fout_5fof_5fmemory_5ferror',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
-  ['nl_5fspurious_5fconvergence_5ferror',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
-  ['nl_5ftolerance_5ftoo_5fsmall_5ferror',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]]
+  ['nl_5farray_5fsize_5ferror_336',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
+  ['nl_5fconvergence_5ferror_337',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
+  ['nl_5fdivergent_5fbehavior_5ferror_338',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
+  ['nl_5finvalid_5finput_5ferror_339',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
+  ['nl_5finvalid_5foperation_5ferror_340',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
+  ['nl_5fout_5fof_5fmemory_5ferror_341',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
+  ['nl_5fspurious_5fconvergence_5ferror_342',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
+  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_343',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]]
 ];
diff --git a/doc/html/search/variables_7.html b/doc/html/search/variables_7.html
index 7b79146..47994b8 100644
--- a/doc/html/search/variables_7.html
+++ b/doc/html/search/variables_7.html
@@ -1,7 +1,7 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html><head><title></title>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <link rel="stylesheet" type="text/css" href="search.css"/>
 <script type="text/javascript" src="variables_7.js"></script>
 <script type="text/javascript" src="search.js"></script>
diff --git a/doc/html/search/variables_7.js b/doc/html/search/variables_7.js
index ac3fb91..3ee0049 100644
--- a/doc/html/search/variables_7.js
+++ b/doc/html/search/variables_7.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['x1',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
-  ['x2',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
+  ['x1_344',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
+  ['x2_345',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
 ];
diff --git a/doc/html/structnonlin__core_1_1equation__optimizer-members.html b/doc/html/structnonlin__core_1_1equation__optimizer-members.html
index f1fa928..b9b6b92 100644
--- a/doc/html/structnonlin__core_1_1equation__optimizer-members.html
+++ b/doc/html/structnonlin__core_1_1equation__optimizer-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -111,7 +111,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1equation__optimizer.html b/doc/html/structnonlin__core_1_1equation__optimizer.html
index 90e384c..d3d3c3e 100644
--- a/doc/html/structnonlin__core_1_1equation__optimizer.html
+++ b/doc/html/structnonlin__core_1_1equation__optimizer.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::equation_optimizer Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -106,32 +106,32 @@
   <map id="nonlin_5Fcore::equation_5Foptimizer_map" name="nonlin_5Fcore::equation_5Foptimizer_map">
 <area href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi..." alt="nonlin_optimize::line_search_optimizer" shape="rect" coords="0,56,227,80"/>
 <area href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult..." alt="nonlin_optimize::nelder_mead" shape="rect" coords="237,56,464,80"/>
-<area href="structnonlin__optimize_1_1bfgs.html" title="Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple..." alt="nonlin_optimize::bfgs" shape="rect" coords="0,112,227,136"/>
-</map>
- </div></div>
+<area href="structnonlin__optimize_1_1bfgs.html" title="Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple va..." alt="nonlin_optimize::bfgs" shape="rect" coords="0,112,227,136"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ace21c015ea34abffb4422ca1f5a7cf3b"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b">get_max_fcn_evals</a> =&gt; oe_get_max_eval</td></tr>
-<tr class="memdesc:ace21c015ea34abffb4422ca1f5a7cf3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed.  <a href="#ace21c015ea34abffb4422ca1f5a7cf3b">More...</a><br /></td></tr>
+<tr class="memdesc:ace21c015ea34abffb4422ca1f5a7cf3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed.  <a href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b">More...</a><br /></td></tr>
 <tr class="separator:ace21c015ea34abffb4422ca1f5a7cf3b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6c551cb42fa08ea1921169676d22591c"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a> =&gt; oe_set_max_eval</td></tr>
-<tr class="memdesc:a6c551cb42fa08ea1921169676d22591c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed.  <a href="#a6c551cb42fa08ea1921169676d22591c">More...</a><br /></td></tr>
+<tr class="memdesc:a6c551cb42fa08ea1921169676d22591c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed.  <a href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">More...</a><br /></td></tr>
 <tr class="separator:a6c551cb42fa08ea1921169676d22591c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abf732e2442a2671c22a277cb433195d1"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1">get_tolerance</a> =&gt; oe_get_tol</td></tr>
-<tr class="memdesc:abf732e2442a2671c22a277cb433195d1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the tolerance on convergence.  <a href="#abf732e2442a2671c22a277cb433195d1">More...</a><br /></td></tr>
+<tr class="memdesc:abf732e2442a2671c22a277cb433195d1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the tolerance on convergence.  <a href="structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1">More...</a><br /></td></tr>
 <tr class="separator:abf732e2442a2671c22a277cb433195d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7b2c2a096683a7758a487194a8d35868"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">set_tolerance</a> =&gt; oe_set_tol</td></tr>
-<tr class="memdesc:a7b2c2a096683a7758a487194a8d35868"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the tolerance on convergence.  <a href="#a7b2c2a096683a7758a487194a8d35868">More...</a><br /></td></tr>
+<tr class="memdesc:a7b2c2a096683a7758a487194a8d35868"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the tolerance on convergence.  <a href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">More...</a><br /></td></tr>
 <tr class="separator:a7b2c2a096683a7758a487194a8d35868"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a63fdb11e6eb358cace29507f7e112485"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485">get_print_status</a> =&gt; oe_get_print_status</td></tr>
-<tr class="memdesc:a63fdb11e6eb358cace29507f7e112485"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="#a63fdb11e6eb358cace29507f7e112485">More...</a><br /></td></tr>
+<tr class="memdesc:a63fdb11e6eb358cace29507f7e112485"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485">More...</a><br /></td></tr>
 <tr class="separator:a63fdb11e6eb358cace29507f7e112485"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acbad8ebeefbd80e0e1d0d4d4701f7ae5"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">set_print_status</a> =&gt; oe_set_print_status</td></tr>
-<tr class="memdesc:acbad8ebeefbd80e0e1d0d4d4701f7ae5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="#acbad8ebeefbd80e0e1d0d4d4701f7ae5">More...</a><br /></td></tr>
+<tr class="memdesc:acbad8ebeefbd80e0e1d0d4d4701f7ae5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">More...</a><br /></td></tr>
 <tr class="separator:acbad8ebeefbd80e0e1d0d4d4701f7ae5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a09e6312fb045d465a9baffd534500917"><td class="memItemLeft" align="right" valign="top">procedure(<a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a>), deferred, pass, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917">solve</a></td></tr>
-<tr class="memdesc:a09e6312fb045d465a9baffd534500917"><td class="mdescLeft">&#160;</td><td class="mdescRight">Optimizes the equation.  <a href="#a09e6312fb045d465a9baffd534500917">More...</a><br /></td></tr>
+<tr class="memdesc:a09e6312fb045d465a9baffd534500917"><td class="mdescLeft">&#160;</td><td class="mdescRight">Optimizes the equation.  <a href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917">More...</a><br /></td></tr>
 <tr class="separator:a09e6312fb045d465a9baffd534500917"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -151,7 +151,63 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A base class for optimization of an equation of multiple variables. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of a function of multipler variables by means of the BFGS method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span> :: grad</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f</div><div class="line"></div><div class="line">    <span class="comment">! Tell the solver where to find the function</span></div><div class="line">    fcn =&gt; beale</div><div class="line">    grad =&gt; bealegrad</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line">    <span class="keyword">call </span>obj%set_gradient_fcn(grad)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Compute the solution</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The Beale function:</span></div><div class="line">    <span class="comment">! f(x) = (1.5 - x + xy)**2 + (2.25 - x + xy**2)**2 + (2.625 - x + xy**3)**2</span></div><div class="line">    <span class="comment">! The minimum is at x = 3, y = 0.5, and f(3, 0.5) = 0</span></div><div class="line"><span class="keyword">    function </span>beale(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = (1.5d0 - x(1) + x(1) * x(2))**2 + &amp;</div><div class="line">            (2.25d0 - x(1) + x(1) * x(2)**2)**2 + &amp;</div><div class="line">            (2.625d0 - x(1) + x(1) * x(2)**3)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"></div><div class="line">    <span class="comment">! The gradient</span></div><div class="line"><span class="keyword">    subroutine </span>bealegrad(x, g)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div><div class="line"></div><div class="line">        g(1) = 2.0d0 * (x(2)**3 - 1.0d0) * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div><div class="line">            2.0d0 * (x(2)**2 - 1.0d0) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div><div class="line">            2.0d0 * (x(2) - 1.0d0) * (x(1) * x(2) - x(1) + 1.5d0)</div><div class="line"></div><div class="line">        g(2) = 6.0d0 * x(1) * x(2)**2 * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div><div class="line">            4.0d0 * x(1) * x(2) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div><div class="line">            2.0d0 * x(1) * (x(1) * x(2) - x(1) + 1.5d0)</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (3.00000, 0.50000)</div><div class="line">Function Value: 0.999E-28</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of a function of multipler variables by means of the BFGS method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span> :: grad</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Tell the solver where to find the function</span></div>
+<div class="line">    fcn =&gt; beale</div>
+<div class="line">    grad =&gt; bealegrad</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line">    <span class="keyword">call </span>obj%set_gradient_fcn(grad)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Compute the solution</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The Beale function:</span></div>
+<div class="line">    <span class="comment">! f(x) = (1.5 - x + xy)**2 + (2.25 - x + xy**2)**2 + (2.625 - x + xy**3)**2</span></div>
+<div class="line">    <span class="comment">! The minimum is at x = 3, y = 0.5, and f(3, 0.5) = 0</span></div>
+<div class="line">    <span class="keyword">function </span>beale(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = (1.5d0 - x(1) + x(1) * x(2))**2 + &amp;</div>
+<div class="line">            (2.25d0 - x(1) + x(1) * x(2)**2)**2 + &amp;</div>
+<div class="line">            (2.625d0 - x(1) + x(1) * x(2)**3)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! The gradient</span></div>
+<div class="line">    <span class="keyword">subroutine </span>bealegrad(x, g)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div>
+<div class="line"> </div>
+<div class="line">        g(1) = 2.0d0 * (x(2)**3 - 1.0d0) * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div>
+<div class="line">            2.0d0 * (x(2)**2 - 1.0d0) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div>
+<div class="line">            2.0d0 * (x(2) - 1.0d0) * (x(1) * x(2) - x(1) + 1.5d0)</div>
+<div class="line"> </div>
+<div class="line">        g(2) = 6.0d0 * x(1) * x(2)**2 * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div>
+<div class="line">            4.0d0 * x(1) * x(2) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div>
+<div class="line">            2.0d0 * x(1) * (x(1) * x(2) - x(1) + 1.5d0)</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (3.00000, 0.50000)</div>
+<div class="line">Function Value: 0.999E-28</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01767">1767</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -171,10 +227,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ace21c015ea34abffb4422ca1
 </div><div class="memdoc">
 
 <p>Gets the maximum number of function evaluations allowed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -200,10 +257,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a63fdb11e6eb358cace29507f
 </div><div class="memdoc">
 
 <p>Gets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_print_status(<span class="keywordtype">class</span>(equation_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_print_status(<span class="keywordtype">class</span>(equation_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -229,10 +287,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#abf732e2442a2671c22a277cb
 </div><div class="memdoc">
 
 <p>Gets the tolerance on convergence. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_tolerance(class(equation_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_tolerance(class(equation_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -258,10 +317,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6c551cb42fa08ea192116967
 </div><div class="memdoc">
 
 <p>Sets the maximum number of function evaluations allowed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_optimizer) this, integer(int32) n)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_optimizer) this, integer(int32) n)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The maximum number of function evaluations. </td></tr>
   </table>
   </dd>
@@ -287,10 +347,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#acbad8ebeefbd80e0e1d0d4d4
 </div><div class="memdoc">
 
 <p>Sets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_optimizer) this, logical x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_optimizer) this, logical x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>True if the iteration status should be printed; else, false. </td></tr>
   </table>
   </dd>
@@ -316,10 +377,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7b2c2a096683a7758a487194
 </div><div class="memdoc">
 
 <p>Sets the tolerance on convergence. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_tolerance(class(equation_optimizer) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_tolerance(class(equation_optimizer) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The convergence tolerance. </td></tr>
   </table>
   </dd>
@@ -345,24 +407,26 @@ <h2 class="memtitle"><span class="permalink"><a href="#a09e6312fb045d465a9baffd5
 </div><div class="memdoc">
 
 <p>Optimizes the equation. </p>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. ">equation_optimizer</a> type for an example on how to solve a system of equations. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables.">equation_optimizer</a> type for an example on how to solve a system of equations. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01843">1843</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1equation__solver-members.html b/doc/html/structnonlin__core_1_1equation__solver-members.html
index 9d399b7..1d382d1 100644
--- a/doc/html/structnonlin__core_1_1equation__solver-members.html
+++ b/doc/html/structnonlin__core_1_1equation__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -117,7 +117,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1equation__solver.html b/doc/html/structnonlin__core_1_1equation__solver.html
index 877faa8..fd0c441 100644
--- a/doc/html/structnonlin__core_1_1equation__solver.html
+++ b/doc/html/structnonlin__core_1_1equation__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::equation_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,47 +104,47 @@
  <div class="center">
   <img src="structnonlin__core_1_1equation__solver.png" usemap="#nonlin_5Fcore::equation_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fcore::equation_5Fsolver_map" name="nonlin_5Fcore::equation_5Fsolver_map">
-<area href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems. " alt="nonlin_least_squares::least_squares_solver" shape="rect" coords="0,56,255,80"/>
+<area href="structnonlin__least__squares_1_1least__squares__solver.html" title="Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems." alt="nonlin_least_squares::least_squares_solver" shape="rect" coords="0,56,255,80"/>
 <area href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior..." alt="nonlin_solve::line_search_solver" shape="rect" coords="265,56,520,80"/>
-<area href="structnonlin__solve_1_1newton__solver.html" title="Defines a Newton solver. " alt="nonlin_solve::newton_solver" shape="rect" coords="132,112,387,136"/>
-<area href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method. " alt="nonlin_solve::quasi_newton_solver" shape="rect" coords="397,112,652,136"/>
-</map>
- </div></div>
+<area href="structnonlin__solve_1_1newton__solver.html" title="Defines a Newton solver." alt="nonlin_solve::newton_solver" shape="rect" coords="132,112,387,136"/>
+<area href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method." alt="nonlin_solve::quasi_newton_solver" shape="rect" coords="397,112,652,136"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a0670a9e7d0f8dc633526b1b97d7734c9"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9">get_max_fcn_evals</a> =&gt; es_get_max_eval</td></tr>
-<tr class="memdesc:a0670a9e7d0f8dc633526b1b97d7734c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single solve.  <a href="#a0670a9e7d0f8dc633526b1b97d7734c9">More...</a><br /></td></tr>
+<tr class="memdesc:a0670a9e7d0f8dc633526b1b97d7734c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single solve.  <a href="structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9">More...</a><br /></td></tr>
 <tr class="separator:a0670a9e7d0f8dc633526b1b97d7734c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af3836cf0b0f8c668770e91d0d8797599"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a> =&gt; es_set_max_eval</td></tr>
-<tr class="memdesc:af3836cf0b0f8c668770e91d0d8797599"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single solve.  <a href="#af3836cf0b0f8c668770e91d0d8797599">More...</a><br /></td></tr>
+<tr class="memdesc:af3836cf0b0f8c668770e91d0d8797599"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single solve.  <a href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">More...</a><br /></td></tr>
 <tr class="separator:af3836cf0b0f8c668770e91d0d8797599"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0c51ee3aa81149bc42686cb09dbd1e33"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33">get_fcn_tolerance</a> =&gt; es_get_fcn_tol</td></tr>
-<tr class="memdesc:a0c51ee3aa81149bc42686cb09dbd1e33"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on function value tolerance.  <a href="#a0c51ee3aa81149bc42686cb09dbd1e33">More...</a><br /></td></tr>
+<tr class="memdesc:a0c51ee3aa81149bc42686cb09dbd1e33"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on function value tolerance.  <a href="structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33">More...</a><br /></td></tr>
 <tr class="separator:a0c51ee3aa81149bc42686cb09dbd1e33"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ade98091a104abab7cec9d0d252aa8e50"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a> =&gt; es_set_fcn_tol</td></tr>
-<tr class="memdesc:ade98091a104abab7cec9d0d252aa8e50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on function value tolerance.  <a href="#ade98091a104abab7cec9d0d252aa8e50">More...</a><br /></td></tr>
+<tr class="memdesc:ade98091a104abab7cec9d0d252aa8e50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on function value tolerance.  <a href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">More...</a><br /></td></tr>
 <tr class="separator:ade98091a104abab7cec9d0d252aa8e50"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab1a0a9fe3ee8186dcf71448ee5d85b05"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">get_var_tolerance</a> =&gt; es_get_var_tol</td></tr>
-<tr class="memdesc:ab1a0a9fe3ee8186dcf71448ee5d85b05"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="#ab1a0a9fe3ee8186dcf71448ee5d85b05">More...</a><br /></td></tr>
+<tr class="memdesc:ab1a0a9fe3ee8186dcf71448ee5d85b05"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">More...</a><br /></td></tr>
 <tr class="separator:ab1a0a9fe3ee8186dcf71448ee5d85b05"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa9ed008b99b75224094322d79eddf69d"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a> =&gt; es_set_var_tol</td></tr>
-<tr class="memdesc:aa9ed008b99b75224094322d79eddf69d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="#aa9ed008b99b75224094322d79eddf69d">More...</a><br /></td></tr>
+<tr class="memdesc:aa9ed008b99b75224094322d79eddf69d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">More...</a><br /></td></tr>
 <tr class="separator:aa9ed008b99b75224094322d79eddf69d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa5308e1748c83d72c58776b9a0a879e6"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6">get_gradient_tolerance</a> =&gt; es_get_grad_tol</td></tr>
-<tr class="memdesc:aa5308e1748c83d72c58776b9a0a879e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on slope of the gradient vector tolerance.  <a href="#aa5308e1748c83d72c58776b9a0a879e6">More...</a><br /></td></tr>
+<tr class="memdesc:aa5308e1748c83d72c58776b9a0a879e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on slope of the gradient vector tolerance.  <a href="structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6">More...</a><br /></td></tr>
 <tr class="separator:aa5308e1748c83d72c58776b9a0a879e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1d8b29f2386cfa3f9be06056fd4e2797"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a> =&gt; es_set_grad_tol</td></tr>
-<tr class="memdesc:a1d8b29f2386cfa3f9be06056fd4e2797"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on slope of the gradient vector tolerance.  <a href="#a1d8b29f2386cfa3f9be06056fd4e2797">More...</a><br /></td></tr>
+<tr class="memdesc:a1d8b29f2386cfa3f9be06056fd4e2797"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on slope of the gradient vector tolerance.  <a href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">More...</a><br /></td></tr>
 <tr class="separator:a1d8b29f2386cfa3f9be06056fd4e2797"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7311f7f8d873f01df406eb3efddb2a47"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47">get_print_status</a> =&gt; es_get_print_status</td></tr>
-<tr class="memdesc:a7311f7f8d873f01df406eb3efddb2a47"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="#a7311f7f8d873f01df406eb3efddb2a47">More...</a><br /></td></tr>
+<tr class="memdesc:a7311f7f8d873f01df406eb3efddb2a47"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47">More...</a><br /></td></tr>
 <tr class="separator:a7311f7f8d873f01df406eb3efddb2a47"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a63276d7b2f2232649dab2db1c65b3cd5"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a> =&gt; es_set_print_status</td></tr>
-<tr class="memdesc:a63276d7b2f2232649dab2db1c65b3cd5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="#a63276d7b2f2232649dab2db1c65b3cd5">More...</a><br /></td></tr>
+<tr class="memdesc:a63276d7b2f2232649dab2db1c65b3cd5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">More...</a><br /></td></tr>
 <tr class="separator:a63276d7b2f2232649dab2db1c65b3cd5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae93cd9cca4d3181aa699261553a62391"><td class="memItemLeft" align="right" valign="top">procedure(<a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a>), deferred, pass, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391">solve</a></td></tr>
-<tr class="memdesc:ae93cd9cca4d3181aa699261553a62391"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the system of equations.  <a href="#ae93cd9cca4d3181aa699261553a62391">More...</a><br /></td></tr>
+<tr class="memdesc:ae93cd9cca4d3181aa699261553a62391"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the system of equations.  <a href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391">More...</a><br /></td></tr>
 <tr class="separator:ae93cd9cca4d3181aa699261553a62391"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -172,7 +172,98 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A base class for various solvers of nonlinear systems of equations. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of the newton_solver type, which includes this type in its inheritance chain, to solve a system of equations. Several options are utilized in the example to illustrate much of the solver functionallity. Notice, many of these options are not necessary to compute the solution; however, they do provide means of control over the solver. For a more minimalistic example see the <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> type. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div><div class="line"></div><div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div><div class="line">    fcn =&gt; fcns</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div><div class="line"></div><div class="line">    <span class="comment">! Set up solver parameters</span></div><div class="line">    <span class="keyword">call </span>solver%set_max_fcn_evals(1000) <span class="comment">! Specify the maximum number of function evaluations before iteration termination</span></div><div class="line">    <span class="keyword">call </span>solver%set_fcn_tolerance(1.0d-10)</div><div class="line">    <span class="keyword">call </span>solver%set_var_tolerance(1.0d-10)</div><div class="line">    <span class="keyword">call </span>solver%set_gradient_tolerance(1.0d-10)</div><div class="line"></div><div class="line">    <span class="comment">! Tell the solver to print out a status update at each iteration - the default behavior does not print updates</span></div><div class="line">    <span class="keyword">call </span>solver%set_print_status(.true.)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations, but include solver statistics tracking</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f, tracking)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print *, <span class="stringliteral">&quot;&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration Count: &quot;</span>, tracking%iter_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Jacobian Evaluations: &quot;</span>, tracking%jacobian_count</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Zero Slope Gradient Vector: &quot;</span>, tracking%converge_on_zero_diff</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line"><span class="keyword">    subroutine </span>fcns(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Iteration: 1</div><div class="line">Function Evaluations: 3</div><div class="line">Jacobian Evaluations: 1</div><div class="line">Change in Variable: 0.545E+00</div><div class="line">Residual: 0.272E+02</div><div class="line"></div><div class="line">Iteration: 2</div><div class="line">Function Evaluations: 5</div><div class="line">Jacobian Evaluations: 2</div><div class="line">Change in Variable: 0.504E+00</div><div class="line">Residual: 0.743E+01</div><div class="line"></div><div class="line">Iteration: 3</div><div class="line">Function Evaluations: 6</div><div class="line">Jacobian Evaluations: 3</div><div class="line">Change in Variable: 0.132E+00</div><div class="line">Residual: 0.522E+00</div><div class="line"></div><div class="line">Iteration: 4</div><div class="line">Function Evaluations: 7</div><div class="line">Jacobian Evaluations: 4</div><div class="line">Change in Variable: 0.882E-02</div><div class="line">Residual: 0.199E-02</div><div class="line"></div><div class="line">Iteration: 5</div><div class="line">Function Evaluations: 8</div><div class="line">Jacobian Evaluations: 5</div><div class="line">Change in Variable: 0.389E-04</div><div class="line">Residual: 0.302E-07</div><div class="line"></div><div class="line">Solution: (5.00000, 3.00000)</div><div class="line">Residual: (0.000E+00, 0.000E+00)</div><div class="line">Iteration Count: 6</div><div class="line">Function Evaluations: 9</div><div class="line">Jacobian Evaluations: 6</div><div class="line">Converge on Function Value: T</div><div class="line">Converge on Change in Variable: F</div><div class="line">Converge on Zero Slope Gradient Vector: F</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of the newton_solver type, which includes this type in its inheritance chain, to solve a system of equations. Several options are utilized in the example to illustrate much of the solver functionallity. Notice, many of these options are not necessary to compute the solution; however, they do provide means of control over the solver. For a more minimalistic example see the <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> type. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div>
+<div class="line">    fcn =&gt; fcns</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Set up solver parameters</span></div>
+<div class="line">    <span class="keyword">call </span>solver%set_max_fcn_evals(1000) <span class="comment">! Specify the maximum number of function evaluations before iteration termination</span></div>
+<div class="line">    <span class="keyword">call </span>solver%set_fcn_tolerance(1.0d-10)</div>
+<div class="line">    <span class="keyword">call </span>solver%set_var_tolerance(1.0d-10)</div>
+<div class="line">    <span class="keyword">call </span>solver%set_gradient_tolerance(1.0d-10)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Tell the solver to print out a status update at each iteration - the default behavior does not print updates</span></div>
+<div class="line">    <span class="keyword">call </span>solver%set_print_status(.true.)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations, but include solver statistics tracking</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f, tracking)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print *, <span class="stringliteral">&quot;&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iteration Count: &quot;</span>, tracking%iter_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Jacobian Evaluations: &quot;</span>, tracking%jacobian_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Zero Slope Gradient Vector: &quot;</span>, tracking%converge_on_zero_diff</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcns(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Iteration: 1</div>
+<div class="line">Function Evaluations: 3</div>
+<div class="line">Jacobian Evaluations: 1</div>
+<div class="line">Change in Variable: 0.545E+00</div>
+<div class="line">Residual: 0.272E+02</div>
+<div class="line"> </div>
+<div class="line">Iteration: 2</div>
+<div class="line">Function Evaluations: 5</div>
+<div class="line">Jacobian Evaluations: 2</div>
+<div class="line">Change in Variable: 0.504E+00</div>
+<div class="line">Residual: 0.743E+01</div>
+<div class="line"> </div>
+<div class="line">Iteration: 3</div>
+<div class="line">Function Evaluations: 6</div>
+<div class="line">Jacobian Evaluations: 3</div>
+<div class="line">Change in Variable: 0.132E+00</div>
+<div class="line">Residual: 0.522E+00</div>
+<div class="line"> </div>
+<div class="line">Iteration: 4</div>
+<div class="line">Function Evaluations: 7</div>
+<div class="line">Jacobian Evaluations: 4</div>
+<div class="line">Change in Variable: 0.882E-02</div>
+<div class="line">Residual: 0.199E-02</div>
+<div class="line"> </div>
+<div class="line">Iteration: 5</div>
+<div class="line">Function Evaluations: 8</div>
+<div class="line">Jacobian Evaluations: 5</div>
+<div class="line">Change in Variable: 0.389E-04</div>
+<div class="line">Residual: 0.302E-07</div>
+<div class="line"> </div>
+<div class="line">Solution: (5.00000, 3.00000)</div>
+<div class="line">Residual: (0.000E+00, 0.000E+00)</div>
+<div class="line">Iteration Count: 6</div>
+<div class="line">Function Evaluations: 9</div>
+<div class="line">Jacobian Evaluations: 6</div>
+<div class="line">Converge on Function Value: T</div>
+<div class="line">Converge on Change in Variable: F</div>
+<div class="line">Converge on Zero Slope Gradient Vector: F</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01260">1260</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -192,10 +283,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0c51ee3aa81149bc42686cb0
 </div><div class="memdoc">
 
 <p>Gets the convergence on function value tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">real(real64)</span> get_fcn_tolerance(<span class="keywordtype">class</span>(equation_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> real(real64) get_fcn_tolerance(<span class="keywordtype">class</span>(equation_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -221,10 +313,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa5308e1748c83d72c58776b9
 </div><div class="memdoc">
 
 <p>Gets the convergence on slope of the gradient vector tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_gradient_tolerance(class(equation_solver))</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_gradient_tolerance(class(equation_solver))</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -250,10 +343,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0670a9e7d0f8dc633526b1b9
 </div><div class="memdoc">
 
 <p>Gets the maximum number of function evaluations allowed during a single solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -279,10 +373,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7311f7f8d873f01df406eb3e
 </div><div class="memdoc">
 
 <p>Gets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_print_status(<span class="keywordtype">class</span>(equation_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_print_status(<span class="keywordtype">class</span>(equation_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -308,10 +403,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab1a0a9fe3ee8186dcf71448e
 </div><div class="memdoc">
 
 <p>Gets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(equation_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(equation_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -337,15 +433,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#ade98091a104abab7cec9d0d2
 </div><div class="memdoc">
 
 <p>Sets the convergence on function value tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn_tolerance(class(equation_solver) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn_tolerance(class(equation_solver) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to establish the function value tolerance. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to establish the function value tolerance. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01322">1322</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -367,15 +464,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1d8b29f2386cfa3f9be06056
 </div><div class="memdoc">
 
 <p>Sets the convergence on slope of the gradient vector tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_gradient_tolerance(class(equation_solver) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_gradient_tolerance(class(equation_solver) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to establish the gradient vector slope tolerance. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to establish the gradient vector slope tolerance. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01372">1372</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -397,15 +495,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#af3836cf0b0f8c668770e91d0
 </div><div class="memdoc">
 
 <p>Sets the maximum number of function evaluations allowed during a single solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_solver) this, integer(int32) n)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_solver) this, integer(int32) n)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The maximum number of function evaluations.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to establish the limit on number of function evaluations. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to establish the limit on number of function evaluations. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01298">1298</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -427,15 +526,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#a63276d7b2f2232649dab2db1
 </div><div class="memdoc">
 
 <p>Sets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_solver) this, logical x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_solver) this, logical x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>True if the iteration status should be printed; else, false.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to enable iteration update printing. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to enable iteration update printing. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01398">1398</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -457,15 +557,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa9ed008b99b75224094322d7
 </div><div class="memdoc">
 
 <p>Sets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(equation_solver) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(equation_solver) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to establish the change in variable tolerance. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to establish the change in variable tolerance. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01346">1346</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -487,24 +588,26 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae93cd9cca4d3181aa6992615
 </div><div class="memdoc">
 
 <p>Solves the system of equations. </p>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to solve a system of equations. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to solve a system of equations. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01404">1404</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1equation__solver.html">equation_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1equation__solver__1var-members.html b/doc/html/structnonlin__core_1_1equation__solver__1var-members.html
index b8e62b4..670dcb2 100644
--- a/doc/html/structnonlin__core_1_1equation__solver__1var-members.html
+++ b/doc/html/structnonlin__core_1_1equation__solver__1var-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -117,7 +117,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1equation__solver__1var.html b/doc/html/structnonlin__core_1_1equation__solver__1var.html
index cbcd1c6..32595ac 100644
--- a/doc/html/structnonlin__core_1_1equation__solver__1var.html
+++ b/doc/html/structnonlin__core_1_1equation__solver__1var.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::equation_solver_1var Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -105,44 +105,44 @@
   <img src="structnonlin__core_1_1equation__solver__1var.png" usemap="#nonlin_5Fcore::equation_5Fsolver_5F1var_map" alt=""/>
   <map id="nonlin_5Fcore::equation_5Fsolver_5F1var_map" name="nonlin_5Fcore::equation_5Fsolver_5F1var_map">
 <area href="structnonlin__solve_1_1brent__solver.html" title="Defines a solver based upon Brent&#39;s method for solving an equation of one variable without using deri..." alt="nonlin_solve::brent_solver" shape="rect" coords="0,56,207,80"/>
-<area href="structnonlin__solve_1_1newton__1var__solver.html" title="Defines a solver based upon Newtons&#39;s method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton&#39;s method in order to keep bounds upon the Newton iterations. " alt="nonlin_solve::newton_1var_solver" shape="rect" coords="217,56,424,80"/>
-</map>
- </div></div>
+<area href="structnonlin__solve_1_1newton__1var__solver.html" title="Defines a solver based upon Newtons&#39;s method for solving an equation of one variable...." alt="nonlin_solve::newton_1var_solver" shape="rect" coords="217,56,424,80"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a6ea37e230a439181905b883a3030709e"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">get_max_fcn_evals</a> =&gt; es1_get_max_eval</td></tr>
-<tr class="memdesc:a6ea37e230a439181905b883a3030709e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single solve.  <a href="#a6ea37e230a439181905b883a3030709e">More...</a><br /></td></tr>
+<tr class="memdesc:a6ea37e230a439181905b883a3030709e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the maximum number of function evaluations allowed during a single solve.  <a href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">More...</a><br /></td></tr>
 <tr class="separator:a6ea37e230a439181905b883a3030709e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ace2de97eb055f2cdf54303946d8f8240"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">set_max_fcn_evals</a> =&gt; es1_set_max_eval</td></tr>
-<tr class="memdesc:ace2de97eb055f2cdf54303946d8f8240"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single solve.  <a href="#ace2de97eb055f2cdf54303946d8f8240">More...</a><br /></td></tr>
+<tr class="memdesc:ace2de97eb055f2cdf54303946d8f8240"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the maximum number of function evaluations allowed during a single solve.  <a href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">More...</a><br /></td></tr>
 <tr class="separator:ace2de97eb055f2cdf54303946d8f8240"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0b57aabf05b077747a8936874186f69b"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b">get_fcn_tolerance</a> =&gt; es1_get_fcn_tol</td></tr>
-<tr class="memdesc:a0b57aabf05b077747a8936874186f69b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on function value tolerance.  <a href="#a0b57aabf05b077747a8936874186f69b">More...</a><br /></td></tr>
+<tr class="memdesc:a0b57aabf05b077747a8936874186f69b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on function value tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b">More...</a><br /></td></tr>
 <tr class="separator:a0b57aabf05b077747a8936874186f69b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a050cd49292b4f19821b41257d2d417a2"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">set_fcn_tolerance</a> =&gt; es1_set_fcn_tol</td></tr>
-<tr class="memdesc:a050cd49292b4f19821b41257d2d417a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on function value tolerance.  <a href="#a050cd49292b4f19821b41257d2d417a2">More...</a><br /></td></tr>
+<tr class="memdesc:a050cd49292b4f19821b41257d2d417a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on function value tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">More...</a><br /></td></tr>
 <tr class="separator:a050cd49292b4f19821b41257d2d417a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aea34033d4aac455d3a594b121e02bc89"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89">get_var_tolerance</a> =&gt; es1_get_var_tol</td></tr>
-<tr class="memdesc:aea34033d4aac455d3a594b121e02bc89"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="#aea34033d4aac455d3a594b121e02bc89">More...</a><br /></td></tr>
+<tr class="memdesc:aea34033d4aac455d3a594b121e02bc89"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89">More...</a><br /></td></tr>
 <tr class="separator:aea34033d4aac455d3a594b121e02bc89"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aedf6fe06fbfe663afd49994f9c660a95"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">set_var_tolerance</a> =&gt; es1_set_var_tol</td></tr>
-<tr class="memdesc:aedf6fe06fbfe663afd49994f9c660a95"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="#aedf6fe06fbfe663afd49994f9c660a95">More...</a><br /></td></tr>
+<tr class="memdesc:aedf6fe06fbfe663afd49994f9c660a95"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">More...</a><br /></td></tr>
 <tr class="separator:aedf6fe06fbfe663afd49994f9c660a95"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aab7f802f44c5638cdb6d888bebdf4bda"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda">get_print_status</a> =&gt; es1_get_print_status</td></tr>
-<tr class="memdesc:aab7f802f44c5638cdb6d888bebdf4bda"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="#aab7f802f44c5638cdb6d888bebdf4bda">More...</a><br /></td></tr>
+<tr class="memdesc:aab7f802f44c5638cdb6d888bebdf4bda"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda">More...</a><br /></td></tr>
 <tr class="separator:aab7f802f44c5638cdb6d888bebdf4bda"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3fd3ba8518ef537ea6f93f7a1e3e13f0"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">set_print_status</a> =&gt; es1_set_print_status</td></tr>
-<tr class="memdesc:a3fd3ba8518ef537ea6f93f7a1e3e13f0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="#a3fd3ba8518ef537ea6f93f7a1e3e13f0">More...</a><br /></td></tr>
+<tr class="memdesc:a3fd3ba8518ef537ea6f93f7a1e3e13f0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a logical value determining if iteration status should be printed.  <a href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">More...</a><br /></td></tr>
 <tr class="separator:a3fd3ba8518ef537ea6f93f7a1e3e13f0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a683e1bf6bd5ef7fd05c338dad1dc96c9"><td class="memItemLeft" align="right" valign="top">procedure(<a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a>), deferred, pass, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9">solve</a></td></tr>
-<tr class="memdesc:a683e1bf6bd5ef7fd05c338dad1dc96c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="#a683e1bf6bd5ef7fd05c338dad1dc96c9">More...</a><br /></td></tr>
+<tr class="memdesc:a683e1bf6bd5ef7fd05c338dad1dc96c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9">More...</a><br /></td></tr>
 <tr class="separator:a683e1bf6bd5ef7fd05c338dad1dc96c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0d88f798646df6e9ac00c87a42875e54"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54">get_diff_tolerance</a> =&gt; es1_get_diff_tol</td></tr>
-<tr class="memdesc:a0d88f798646df6e9ac00c87a42875e54"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on slope of the function (derivative) tolerance.  <a href="#a0d88f798646df6e9ac00c87a42875e54">More...</a><br /></td></tr>
+<tr class="memdesc:a0d88f798646df6e9ac00c87a42875e54"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on slope of the function (derivative) tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54">More...</a><br /></td></tr>
 <tr class="separator:a0d88f798646df6e9ac00c87a42875e54"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a238e8bb1bd7c5b1f5c4b513b11ac4b20"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">set_diff_tolerance</a> =&gt; es1_set_diff_tol</td></tr>
-<tr class="memdesc:a238e8bb1bd7c5b1f5c4b513b11ac4b20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on slope of the function (derivative) tolerance.  <a href="#a238e8bb1bd7c5b1f5c4b513b11ac4b20">More...</a><br /></td></tr>
+<tr class="memdesc:a238e8bb1bd7c5b1f5c4b513b11ac4b20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on slope of the function (derivative) tolerance.  <a href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">More...</a><br /></td></tr>
 <tr class="separator:a238e8bb1bd7c5b1f5c4b513b11ac4b20"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -170,7 +170,46 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A base class for various solvers of equations of one variable. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates the solution of an equation of one variable by means of Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local variables</span></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line"></div><div class="line">    <span class="comment">! Define the search limits</span></div><div class="line">    limits%x1 = 1.5d0</div><div class="line">    limits%x2 = 5.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Establish the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function:</span></div><div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = sin(x) / x</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.15159</div><div class="line">The residual: -0.751E-11</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates the solution of an equation of one variable by means of Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the search limits</span></div>
+<div class="line">    limits%x1 = 1.5d0</div>
+<div class="line">    limits%x2 = 5.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Establish the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function:</span></div>
+<div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = sin(x) / x</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.15159</div>
+<div class="line">The residual: -0.751E-11</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01512">1512</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -190,10 +229,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0d88f798646df6e9ac00c87a
 </div><div class="memdoc">
 
 <p>Gets the convergence on slope of the function (derivative) tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_diff_tolerance(class(equation_solver_1var) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_diff_tolerance(class(equation_solver_1var) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -219,10 +259,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a0b57aabf05b077747a893687
 </div><div class="memdoc">
 
 <p>Gets the convergence on function value tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_fcn_tolerance(class(equation_solver_1var) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_fcn_tolerance(class(equation_solver_1var) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -248,10 +289,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6ea37e230a439181905b883a
 </div><div class="memdoc">
 
 <p>Gets the maximum number of function evaluations allowed during a single solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_solver_1var) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">integer(int32) </span><span class="keyword">function </span>get_max_fcn_evals(class(equation_solver_1var) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -277,10 +319,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#aab7f802f44c5638cdb6d888b
 </div><div class="memdoc">
 
 <p>Gets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>get_print_status(class(equation_solver_1var) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>get_print_status(class(equation_solver_1var) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -306,10 +349,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#aea34033d4aac455d3a594b12
 </div><div class="memdoc">
 
 <p>Gets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(equation_solver_1var) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(equation_solver_1var) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -335,15 +379,16 @@ <h2 class="memtitle"><span class="permalink"><a href="#a238e8bb1bd7c5b1f5c4b513b
 </div><div class="memdoc">
 
 <p>Sets the convergence on slope of the function (derivative) tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_diff_tolerance(class(equation_solver_1var) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_diff_tolerance(class(equation_solver_1var) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. ">equation_solver</a> type for an example on how to establish the gradient vector slope tolerance. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations.">equation_solver</a> type for an example on how to establish the gradient vector slope tolerance. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01640">1640</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -365,10 +410,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a050cd49292b4f19821b41257
 </div><div class="memdoc">
 
 <p>Sets the convergence on function value tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn_tolerance(class(equation_solver_1var) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn_tolerance(class(equation_solver_1var) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value. </td></tr>
   </table>
   </dd>
@@ -394,10 +440,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ace2de97eb055f2cdf5430394
 </div><div class="memdoc">
 
 <p>Sets the maximum number of function evaluations allowed during a single solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_solver_1var) this, integer(int32) n)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_max_fcn_evals(class(equation_solver_1var) this, integer(int32) n)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The maximum number of function evaluations. </td></tr>
   </table>
   </dd>
@@ -423,10 +470,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a3fd3ba8518ef537ea6f93f7a
 </div><div class="memdoc">
 
 <p>Sets a logical value determining if iteration status should be printed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_solver_1var) this, logical x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_print_status(class(equation_solver_1var) this, logical x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>True if the iteration status should be printed; else, false. </td></tr>
   </table>
   </dd>
@@ -452,10 +500,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#aedf6fe06fbfe663afd49994f
 </div><div class="memdoc">
 
 <p>Sets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(equation_solver_1var) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(equation_solver_1var) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The tolerance value. </td></tr>
   </table>
   </dd>
@@ -481,24 +530,26 @@ <h2 class="memtitle"><span class="permalink"><a href="#a683e1bf6bd5ef7fd05c338da
 </div><div class="memdoc">
 
 <p>Solves the equation. </p>
-<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. ">equation_solver_1var</a> type for an example on how to solve a system of equations. </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>See the <a class="el" href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable.">equation_solver_1var</a> type for an example on how to solve a system of equations. </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01614">1614</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1fcn1var__helper-members.html b/doc/html/structnonlin__core_1_1fcn1var__helper-members.html
index acfaa4a..ef0d990 100644
--- a/doc/html/structnonlin__core_1_1fcn1var__helper-members.html
+++ b/doc/html/structnonlin__core_1_1fcn1var__helper-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -109,7 +109,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1fcn1var__helper.html b/doc/html/structnonlin__core_1_1fcn1var__helper.html
index 4b463f5..c4ba893 100644
--- a/doc/html/structnonlin__core_1_1fcn1var__helper.html
+++ b/doc/html/structnonlin__core_1_1fcn1var__helper.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::fcn1var_helper Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,19 +102,19 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:aee8fdfd1502ae3c5b38b1ce96eb5ec93"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93">fcn</a> =&gt; f1h_fcn</td></tr>
-<tr class="memdesc:aee8fdfd1502ae3c5b38b1ce96eb5ec93"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the function to evaluate.  <a href="#aee8fdfd1502ae3c5b38b1ce96eb5ec93">More...</a><br /></td></tr>
+<tr class="memdesc:aee8fdfd1502ae3c5b38b1ce96eb5ec93"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the function to evaluate.  <a href="structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93">More...</a><br /></td></tr>
 <tr class="separator:aee8fdfd1502ae3c5b38b1ce96eb5ec93"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6c02a892c66ac75a6dba7a0fd5d641ce"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce">is_fcn_defined</a> =&gt; f1h_is_fcn_defined</td></tr>
-<tr class="memdesc:a6c02a892c66ac75a6dba7a0fd5d641ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function containing the equation to solve has been assigned.  <a href="#a6c02a892c66ac75a6dba7a0fd5d641ce">More...</a><br /></td></tr>
+<tr class="memdesc:a6c02a892c66ac75a6dba7a0fd5d641ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function containing the equation to solve has been assigned.  <a href="structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce">More...</a><br /></td></tr>
 <tr class="separator:a6c02a892c66ac75a6dba7a0fd5d641ce"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae8e92bea80019e27bdea08ed600e6271"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271">set_fcn</a> =&gt; f1h_set_fcn</td></tr>
-<tr class="memdesc:ae8e92bea80019e27bdea08ed600e6271"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the equations to solve.  <a href="#ae8e92bea80019e27bdea08ed600e6271">More...</a><br /></td></tr>
+<tr class="memdesc:ae8e92bea80019e27bdea08ed600e6271"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the equations to solve.  <a href="structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271">More...</a><br /></td></tr>
 <tr class="separator:ae8e92bea80019e27bdea08ed600e6271"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad27fa3d960ce7d5310a2be2d9b7f8d7c"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c">is_derivative_defined</a> =&gt; f1h_is_diff_defined</td></tr>
-<tr class="memdesc:ad27fa3d960ce7d5310a2be2d9b7f8d7c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function containing the derivative of the function to solve is defined.  <a href="#ad27fa3d960ce7d5310a2be2d9b7f8d7c">More...</a><br /></td></tr>
+<tr class="memdesc:ad27fa3d960ce7d5310a2be2d9b7f8d7c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function containing the derivative of the function to solve is defined.  <a href="structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c">More...</a><br /></td></tr>
 <tr class="separator:ad27fa3d960ce7d5310a2be2d9b7f8d7c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a798d9b180392537c564ac69cc1b81952"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952">diff</a> =&gt; f1h_diff_fcn</td></tr>
-<tr class="memdesc:a798d9b180392537c564ac69cc1b81952"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the derivative of the function. If a routine for computing the derivative is not defined, the derivative is estimated via finite differences.  <a href="#a798d9b180392537c564ac69cc1b81952">More...</a><br /></td></tr>
+<tr class="memdesc:a798d9b180392537c564ac69cc1b81952"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the derivative of the function. If a routine for computing the derivative is not defined, the derivative is estimated via finite differences.  <a href="structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952">More...</a><br /></td></tr>
 <tr class="separator:a798d9b180392537c564ac69cc1b81952"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aee47d4795f22dad4bbf602073e5abf4d"><td class="memItemLeft" align="right" valign="top"><a id="aee47d4795f22dad4bbf602073e5abf4d"></a>
 procedure, public&#160;</td><td class="memItemRight" valign="bottom"><b>set_diff</b> =&gt; f1h_set_diff</td></tr>
@@ -124,7 +124,7 @@
 Private Attributes</h2></td></tr>
 <tr class="memitem:a77004284243a6f28ce78d908864e8da7"><td class="memItemLeft" align="right" valign="top"><a id="a77004284243a6f28ce78d908864e8da7"></a>
 procedure(<a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>), pointer, nopass&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7">m_fcn</a> =&gt; null()</td></tr>
-<tr class="memdesc:a77004284243a6f28ce78d908864e8da7"><td class="mdescLeft">&#160;</td><td class="mdescRight">A pointer to the target <a class="el" href="interfacenonlin__core_1_1fcn1var.html" title="Describes a function of one variable. ">fcn1var</a> routine. <br /></td></tr>
+<tr class="memdesc:a77004284243a6f28ce78d908864e8da7"><td class="mdescLeft">&#160;</td><td class="mdescRight">A pointer to the target <a class="el" href="interfacenonlin__core_1_1fcn1var.html" title="Describes a function of one variable.">fcn1var</a> routine. <br /></td></tr>
 <tr class="separator:a77004284243a6f28ce78d908864e8da7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3ac77259ff44c2c92cdd1f80b5b4421d"><td class="memItemLeft" align="right" valign="top"><a id="a3ac77259ff44c2c92cdd1f80b5b4421d"></a>
 procedure(<a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>), pointer, nopass&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d">m_diff</a> =&gt; null()</td></tr>
@@ -133,7 +133,46 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of this type to solve an equation using Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local variables</span></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line"></div><div class="line">    <span class="comment">! Define the search limits</span></div><div class="line">    limits%x1 = 1.5d0</div><div class="line">    limits%x2 = 5.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Establish the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function:</span></div><div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = sin(x) / x</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div><div class="line">The residual: -0.751E-11</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of this type to solve an equation using Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the search limits</span></div>
+<div class="line">    limits%x1 = 1.5d0</div>
+<div class="line">    limits%x2 = 5.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Establish the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function:</span></div>
+<div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = sin(x) / x</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div>
+<div class="line">The residual: -0.751E-11</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00682">682</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -153,10 +192,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a798d9b180392537c564ac69c
 </div><div class="memdoc">
 
 <p>Computes the derivative of the function. If a routine for computing the derivative is not defined, the derivative is estimated via finite differences. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>derivative(class(fcn1var_helper) this, real(real64) x, optional real(real64) f)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>derivative(class(fcn1var_helper) this, real(real64) x, optional real(real64) f)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The value of the independent variable at which the derivative is to be computed. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">f</td><td>An optional input specifying the function value at <code>x</code>. If supplied, and the derivative is being estimated numerically, the function will not be evaluated at <code>x</code>. </td></tr>
   </table>
@@ -183,10 +223,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#aee8fdfd1502ae3c5b38b1ce9
 </div><div class="memdoc">
 
 <p>Executes the routine containing the function to evaluate. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>fcn(class(fcn1var_helper) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>fcn(class(fcn1var_helper) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The value of the independent variable at which the function should be evaluated. </td></tr>
   </table>
   </dd>
@@ -213,10 +254,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ad27fa3d960ce7d5310a2be2d
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the function containing the derivative of the function to solve is defined. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_derivative_defined(class(fcn1var_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_derivative_defined(class(fcn1var_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -242,10 +284,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a6c02a892c66ac75a6dba7a0f
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the function containing the equation to solve has been assigned. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_fcn_defined(class(fcn1var_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_fcn_defined(class(fcn1var_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -271,32 +314,74 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae8e92bea80019e27bdea08ed
 </div><div class="memdoc">
 
 <p>Establishes a pointer to the routine containing the equations to solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(fcn1var_helper) this, procedure(fcn1var) pointer fcn)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(fcn1var_helper) this, procedure(fcn1var) pointer fcn)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0...">fcn1var_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcn1var__helper.html" title="Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.">fcn1var_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function pointer.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this routine to inform the solver of the function to solve. This particular example utilizes Brent's method to compute the solution. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local variables</span></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line"></div><div class="line">    <span class="comment">! Define the search limits</span></div><div class="line">    limits%x1 = 1.5d0</div><div class="line">    limits%x2 = 5.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Establish the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function:</span></div><div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = sin(x) / x</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div><div class="line">The residual: -0.751E-11</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this routine to inform the solver of the function to solve. This particular example utilizes Brent's method to compute the solution. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the search limits</span></div>
+<div class="line">    limits%x1 = 1.5d0</div>
+<div class="line">    limits%x2 = 5.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Establish the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function:</span></div>
+<div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = x * pi for n = 1, 2, 3, ...</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = sin(x) / x</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div>
+<div class="line">The residual: -0.751E-11</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00771">771</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1fcnnvar__helper-members.html b/doc/html/structnonlin__core_1_1fcnnvar__helper-members.html
index c86b303..4717861 100644
--- a/doc/html/structnonlin__core_1_1fcnnvar__helper-members.html
+++ b/doc/html/structnonlin__core_1_1fcnnvar__helper-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -111,7 +111,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1fcnnvar__helper.html b/doc/html/structnonlin__core_1_1fcnnvar__helper.html
index 0089ffc..8554beb 100644
--- a/doc/html/structnonlin__core_1_1fcnnvar__helper.html
+++ b/doc/html/structnonlin__core_1_1fcnnvar__helper.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::fcnnvar_helper Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,25 +102,25 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ac0e4eed2d730bce1c9d0814a1e444404"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404">fcn</a> =&gt; fnh_fcn</td></tr>
-<tr class="memdesc:ac0e4eed2d730bce1c9d0814a1e444404"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the function to evaluate.  <a href="#ac0e4eed2d730bce1c9d0814a1e444404">More...</a><br /></td></tr>
+<tr class="memdesc:ac0e4eed2d730bce1c9d0814a1e444404"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the function to evaluate.  <a href="structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404">More...</a><br /></td></tr>
 <tr class="separator:ac0e4eed2d730bce1c9d0814a1e444404"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7b8deec62bcf7707e33e2d6d065e6bbe"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe">is_fcn_defined</a> =&gt; fnh_is_fcn_defined</td></tr>
-<tr class="memdesc:a7b8deec62bcf7707e33e2d6d065e6bbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function has been assigned.  <a href="#a7b8deec62bcf7707e33e2d6d065e6bbe">More...</a><br /></td></tr>
+<tr class="memdesc:a7b8deec62bcf7707e33e2d6d065e6bbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the function has been assigned.  <a href="structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe">More...</a><br /></td></tr>
 <tr class="separator:a7b8deec62bcf7707e33e2d6d065e6bbe"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acc9a43e847b8114d2004ba0873858924"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924">set_fcn</a> =&gt; fnh_set_fcn</td></tr>
-<tr class="memdesc:acc9a43e847b8114d2004ba0873858924"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the function.  <a href="#acc9a43e847b8114d2004ba0873858924">More...</a><br /></td></tr>
+<tr class="memdesc:acc9a43e847b8114d2004ba0873858924"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the function.  <a href="structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924">More...</a><br /></td></tr>
 <tr class="separator:acc9a43e847b8114d2004ba0873858924"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ade676773e3157767d65f64f21f8aa090"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090">get_variable_count</a> =&gt; fnh_get_nvar</td></tr>
-<tr class="memdesc:ade676773e3157767d65f64f21f8aa090"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of variables in this system.  <a href="#ade676773e3157767d65f64f21f8aa090">More...</a><br /></td></tr>
+<tr class="memdesc:ade676773e3157767d65f64f21f8aa090"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of variables in this system.  <a href="structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090">More...</a><br /></td></tr>
 <tr class="separator:ade676773e3157767d65f64f21f8aa090"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac3eea5d29dd8aa70e76173fc0f30e022"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022">set_gradient_fcn</a> =&gt; fnh_set_grad</td></tr>
-<tr class="memdesc:ac3eea5d29dd8aa70e76173fc0f30e022"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the gradient vector of the function.  <a href="#ac3eea5d29dd8aa70e76173fc0f30e022">More...</a><br /></td></tr>
+<tr class="memdesc:ac3eea5d29dd8aa70e76173fc0f30e022"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the gradient vector of the function.  <a href="structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022">More...</a><br /></td></tr>
 <tr class="separator:ac3eea5d29dd8aa70e76173fc0f30e022"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8b884a36ba2b9c15c9b325fb08d7597f"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f">is_gradient_defined</a> =&gt; fnh_is_grad_defined</td></tr>
-<tr class="memdesc:a8b884a36ba2b9c15c9b325fb08d7597f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the routine containing the gradient has been assigned.  <a href="#a8b884a36ba2b9c15c9b325fb08d7597f">More...</a><br /></td></tr>
+<tr class="memdesc:a8b884a36ba2b9c15c9b325fb08d7597f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the routine containing the gradient has been assigned.  <a href="structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f">More...</a><br /></td></tr>
 <tr class="separator:a8b884a36ba2b9c15c9b325fb08d7597f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a94732556188c1ac5a2cfc6d6e9e06cf2"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2">gradient</a> =&gt; fnh_grad_fcn</td></tr>
-<tr class="memdesc:a94732556188c1ac5a2cfc6d6e9e06cf2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the gradient of the function.  <a href="#a94732556188c1ac5a2cfc6d6e9e06cf2">More...</a><br /></td></tr>
+<tr class="memdesc:a94732556188c1ac5a2cfc6d6e9e06cf2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the gradient of the function.  <a href="structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2">More...</a><br /></td></tr>
 <tr class="separator:a94732556188c1ac5a2cfc6d6e9e06cf2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -140,7 +140,42 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Defines a type capable of encapsulating an equation of N variables. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this type to find the minimum of a function of multiple variables. In this instance the Nelder-Mead simplex method is utilized to minimize the Rosenbrock function in two variables. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f</div><div class="line"></div><div class="line">    <span class="comment">! Initialization</span></div><div class="line">    fcn =&gt; rosenbrock</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div><div class="line">    <span class="keyword">call </span>random_number(x)</div><div class="line"></div><div class="line">    <span class="comment">! Call the solver</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">     <span class="comment">! Display the output</span></div><div class="line">     print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">     print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div><div class="line"><span class="keyword">    function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (1.00000, 1.00000)</div><div class="line">Function Value: 0.213E-12</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this type to find the minimum of a function of multiple variables. In this instance the Nelder-Mead simplex method is utilized to minimize the Rosenbrock function in two variables. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Initialization</span></div>
+<div class="line">    fcn =&gt; rosenbrock</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div>
+<div class="line">    <span class="keyword">call </span>random_number(x)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Call the solver</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">     <span class="comment">! Display the output</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div>
+<div class="line">    <span class="keyword">function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (1.00000, 1.00000)</div>
+<div class="line">Function Value: 0.213E-12</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00896">896</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -160,10 +195,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac0e4eed2d730bce1c9d0814a
 </div><div class="memdoc">
 
 <p>Executes the routine containing the function to evaluate. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>fcn(class(fcnnvar_helper) this, real(real64) x(:))</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>fcn(class(fcnnvar_helper) this, real(real64) x(:))</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The value of the independent variable at which the function should be evaluated. </td></tr>
   </table>
   </dd>
@@ -190,10 +226,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ade676773e3157767d65f64f2
 </div><div class="memdoc">
 
 <p>Gets the number of variables in this system. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure integer(int32) </span><span class="keyword">function </span>get_variable_count(class(fcnnvar_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">integer(int32) </span><span class="keyword">function </span>get_variable_count(class(fcnnvar_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -219,10 +256,13 @@ <h2 class="memtitle"><span class="permalink"><a href="#a94732556188c1ac5a2cfc6d6
 </div><div class="memdoc">
 
 <p>Computes the gradient of the function. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>gradient(class(fcnnvar_helper) this, real(real64) x(:), &amp;</div><div class="line"> <span class="keywordtype">real(real64)</span> g(:), <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> fv(:), &amp;</div><div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>gradient(class(fcnnvar_helper) this, real(real64) x(:), &amp;</div>
+<div class="line"><span class="keywordtype"> real</span>(real64) g(:), <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> fv(:), &amp;</div>
+<div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>An N-element array containing the independent variables defining the point about which the derivatives will be calculated. This array is restored upon output. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">g</td><td>An N-element array where the gradient will be written upon output. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fv</td><td>An optional input providing the function value at <code>x</code>. </td></tr>
@@ -255,10 +295,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7b8deec62bcf7707e33e2d6d
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the function has been assigned. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_fcn_defined(class(fcnnvar_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_fcn_defined(class(fcnnvar_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -284,10 +325,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a8b884a36ba2b9c15c9b325fb
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the routine containing the gradient has been assigned. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_gradient_defined(class(fcnnvar_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_gradient_defined(class(fcnnvar_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -313,16 +355,52 @@ <h2 class="memtitle"><span class="permalink"><a href="#acc9a43e847b8114d2004ba08
 </div><div class="memdoc">
 
 <p>Establishes a pointer to the routine containing the function. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(fcnnvar_helper) this, procedure(fcnnvar) pointer fcn, integer(int32) nvar)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(fcnnvar_helper) this, procedure(fcnnvar) pointer fcn, integer(int32) nvar)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function pointer. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">nvar</td><td>The number of variables in the function.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this routine to inform the solver of the function to optimize. This particular example utilizes the Nelder-Mead simplex method to minimize the function. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f</div><div class="line"></div><div class="line">    <span class="comment">! Initialization</span></div><div class="line">    fcn =&gt; rosenbrock</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div><div class="line">    <span class="keyword">call </span>random_number(x)</div><div class="line"></div><div class="line">    <span class="comment">! Call the solver</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">     <span class="comment">! Display the output</span></div><div class="line">     print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">     print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div><div class="line"><span class="keyword">    function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (1.00000, 1.00000)</div><div class="line">Function Value: 0.213E-12</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to use this routine to inform the solver of the function to optimize. This particular example utilizes the Nelder-Mead simplex method to minimize the function. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Initialization</span></div>
+<div class="line">    fcn =&gt; rosenbrock</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div>
+<div class="line">    <span class="keyword">call </span>random_number(x)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Call the solver</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">     <span class="comment">! Display the output</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">     print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div>
+<div class="line">    <span class="keyword">function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (1.00000, 1.00000)</div>
+<div class="line">Function Value: 0.213E-12</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00983">983</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -344,32 +422,91 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac3eea5d29dd8aa70e76173fc
 </div><div class="memdoc">
 
 <p>Establishes a pointer to the routine containing the gradient vector of the function. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_gradient_fcn(class(fcnnvar_helper) this, procedure(gradientfcn) pointer fcn)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_gradient_fcn(class(fcnnvar_helper) this, procedure(gradientfcn) pointer fcn)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables. ">fcnnvar_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" title="Defines a type capable of encapsulating an equation of N variables.">fcnnvar_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The pointer to the gradient routine.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of a user-defined gradient function. This particular example utilizes the BFGS method to minimize Beale's function. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span> :: grad</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f</div><div class="line"></div><div class="line">    <span class="comment">! Tell the solver where to find the function</span></div><div class="line">    fcn =&gt; beale</div><div class="line">    grad =&gt; bealegrad</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line">    <span class="keyword">call </span>obj%set_gradient_fcn(grad)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Compute the solution</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The Beale function:</span></div><div class="line">    <span class="comment">! f(x) = (1.5 - x + xy)**2 + (2.25 - x + xy**2)**2 + (2.625 - x + xy**3)**2</span></div><div class="line">    <span class="comment">! The minimum is at x = 3, y = 0.5, and f(3, 0.5) = 0</span></div><div class="line"><span class="keyword">    function </span>beale(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = (1.5d0 - x(1) + x(1) * x(2))**2 + &amp;</div><div class="line">            (2.25d0 - x(1) + x(1) * x(2)**2)**2 + &amp;</div><div class="line">            (2.625d0 - x(1) + x(1) * x(2)**3)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"></div><div class="line">    <span class="comment">! The gradient</span></div><div class="line"><span class="keyword">    subroutine </span>bealegrad(x, g)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div><div class="line"></div><div class="line">        g(1) = 2.0d0 * (x(2)**3 - 1.0d0) * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div><div class="line">            2.0d0 * (x(2)**2 - 1.0d0) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div><div class="line">            2.0d0 * (x(2) - 1.0d0) * (x(1) * x(2) - x(1) + 1.5d0)</div><div class="line"></div><div class="line">        g(2) = 6.0d0 * x(1) * x(2)**2 * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div><div class="line">            4.0d0 * x(1) * x(2) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div><div class="line">            2.0d0 * x(1) * (x(1) * x(2) - x(1) + 1.5d0)</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (3.00000, 0.50000)</div><div class="line">Function Value: 0.999E-28</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates the use of a user-defined gradient function. This particular example utilizes the BFGS method to minimize Beale's function. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span> :: grad</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Tell the solver where to find the function</span></div>
+<div class="line">    fcn =&gt; beale</div>
+<div class="line">    grad =&gt; bealegrad</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line">    <span class="keyword">call </span>obj%set_gradient_fcn(grad)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Compute the solution</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, f</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The Beale function:</span></div>
+<div class="line">    <span class="comment">! f(x) = (1.5 - x + xy)**2 + (2.25 - x + xy**2)**2 + (2.625 - x + xy**3)**2</span></div>
+<div class="line">    <span class="comment">! The minimum is at x = 3, y = 0.5, and f(3, 0.5) = 0</span></div>
+<div class="line">    <span class="keyword">function </span>beale(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = (1.5d0 - x(1) + x(1) * x(2))**2 + &amp;</div>
+<div class="line">            (2.25d0 - x(1) + x(1) * x(2)**2)**2 + &amp;</div>
+<div class="line">            (2.625d0 - x(1) + x(1) * x(2)**3)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! The gradient</span></div>
+<div class="line">    <span class="keyword">subroutine </span>bealegrad(x, g)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: g</div>
+<div class="line"> </div>
+<div class="line">        g(1) = 2.0d0 * (x(2)**3 - 1.0d0) * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div>
+<div class="line">            2.0d0 * (x(2)**2 - 1.0d0) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div>
+<div class="line">            2.0d0 * (x(2) - 1.0d0) * (x(1) * x(2) - x(1) + 1.5d0)</div>
+<div class="line"> </div>
+<div class="line">        g(2) = 6.0d0 * x(1) * x(2)**2 * (x(1) * x(2)**3 - x(1) + 2.625d0) + &amp;</div>
+<div class="line">            4.0d0 * x(1) * x(2) * (x(1) * x(2)**2 - x(1) + 2.25d0) + &amp;</div>
+<div class="line">            2.0d0 * x(1) * (x(1) * x(2) - x(1) + 1.5d0)</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Minimum: (3.00000, 0.50000)</div>
+<div class="line">Function Value: 0.999E-28</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l01070">1070</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1iteration__behavior-members.html b/doc/html/structnonlin__core_1_1iteration__behavior-members.html
index d4e785e..c553f82 100644
--- a/doc/html/structnonlin__core_1_1iteration__behavior-members.html
+++ b/doc/html/structnonlin__core_1_1iteration__behavior-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -108,7 +108,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1iteration__behavior.html b/doc/html/structnonlin__core_1_1iteration__behavior.html
index 8fe540a..8b57f34 100644
--- a/doc/html/structnonlin__core_1_1iteration__behavior.html
+++ b/doc/html/structnonlin__core_1_1iteration__behavior.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::iteration_behavior Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -134,7 +134,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00254">254</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -144,7 +144,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1value__pair-members.html b/doc/html/structnonlin__core_1_1value__pair-members.html
index 4d726a1..fb714c2 100644
--- a/doc/html/structnonlin__core_1_1value__pair-members.html
+++ b/doc/html/structnonlin__core_1_1value__pair-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -103,7 +103,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1value__pair.html b/doc/html/structnonlin__core_1_1value__pair.html
index aab2cd3..4132727 100644
--- a/doc/html/structnonlin__core_1_1value__pair.html
+++ b/doc/html/structnonlin__core_1_1value__pair.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::value_pair Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -114,7 +114,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00277">277</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -124,7 +124,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1vecfcn__helper-members.html b/doc/html/structnonlin__core_1_1vecfcn__helper-members.html
index c36ebe6..d942590 100644
--- a/doc/html/structnonlin__core_1_1vecfcn__helper-members.html
+++ b/doc/html/structnonlin__core_1_1vecfcn__helper-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -113,7 +113,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__core_1_1vecfcn__helper.html b/doc/html/structnonlin__core_1_1vecfcn__helper.html
index d85a922..48391db 100644
--- a/doc/html/structnonlin__core_1_1vecfcn__helper.html
+++ b/doc/html/structnonlin__core_1_1vecfcn__helper.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_core::vecfcn_helper Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,28 +102,28 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a41b867ae18398e8c7de44c6dc5b32aed"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed">set_fcn</a> =&gt; vfh_set_fcn</td></tr>
-<tr class="memdesc:a41b867ae18398e8c7de44c6dc5b32aed"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the system of equations to solve.  <a href="#a41b867ae18398e8c7de44c6dc5b32aed">More...</a><br /></td></tr>
+<tr class="memdesc:a41b867ae18398e8c7de44c6dc5b32aed"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine containing the system of equations to solve.  <a href="structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed">More...</a><br /></td></tr>
 <tr class="separator:a41b867ae18398e8c7de44c6dc5b32aed"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a28ad419ee7fd8d7f0529587d4a1bfc78"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78">set_jacobian</a> =&gt; vfh_set_jac</td></tr>
-<tr class="memdesc:a28ad419ee7fd8d7f0529587d4a1bfc78"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine for computing the Jacobian matrix of the system of equations. If no routine is defined, the Jacobian matrix will be computed numerically (this is the default state).  <a href="#a28ad419ee7fd8d7f0529587d4a1bfc78">More...</a><br /></td></tr>
+<tr class="memdesc:a28ad419ee7fd8d7f0529587d4a1bfc78"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a pointer to the routine for computing the Jacobian matrix of the system of equations. If no routine is defined, the Jacobian matrix will be computed numerically (this is the default state).  <a href="structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78">More...</a><br /></td></tr>
 <tr class="separator:a28ad419ee7fd8d7f0529587d4a1bfc78"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae5a78dc12bfaca9c6ee6a129611f6fae"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae">is_fcn_defined</a> =&gt; vfh_is_fcn_defined</td></tr>
-<tr class="memdesc:ae5a78dc12bfaca9c6ee6a129611f6fae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the subroutine containing the system of equations to solve has been assigned.  <a href="#ae5a78dc12bfaca9c6ee6a129611f6fae">More...</a><br /></td></tr>
+<tr class="memdesc:ae5a78dc12bfaca9c6ee6a129611f6fae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the subroutine containing the system of equations to solve has been assigned.  <a href="structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae">More...</a><br /></td></tr>
 <tr class="separator:ae5a78dc12bfaca9c6ee6a129611f6fae"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a95d28720ced834b78276792bc388ae3b"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b">is_jacobian_defined</a> =&gt; vfh_is_jac_defined</td></tr>
-<tr class="memdesc:a95d28720ced834b78276792bc388ae3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the subroutine containing the system of equations to solve has been assigned.  <a href="#a95d28720ced834b78276792bc388ae3b">More...</a><br /></td></tr>
+<tr class="memdesc:a95d28720ced834b78276792bc388ae3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests if the pointer to the subroutine containing the system of equations to solve has been assigned.  <a href="structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b">More...</a><br /></td></tr>
 <tr class="separator:a95d28720ced834b78276792bc388ae3b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a44c03a753473e7cc38776bf2005e1eb8"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8">fcn</a> =&gt; vfh_fcn</td></tr>
-<tr class="memdesc:a44c03a753473e7cc38776bf2005e1eb8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the system of equations to solve. No action is taken if the pointer to the subroutine has not been defined.  <a href="#a44c03a753473e7cc38776bf2005e1eb8">More...</a><br /></td></tr>
+<tr class="memdesc:a44c03a753473e7cc38776bf2005e1eb8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the system of equations to solve. No action is taken if the pointer to the subroutine has not been defined.  <a href="structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8">More...</a><br /></td></tr>
 <tr class="separator:a44c03a753473e7cc38776bf2005e1eb8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abb314c2501d0e7a1c973999c204abf8a"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a">jacobian</a> =&gt; vfh_jac_fcn</td></tr>
-<tr class="memdesc:abb314c2501d0e7a1c973999c204abf8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the Jacobian matrix if supplied. If not supplied, the Jacobian is computed via finite differences.  <a href="#abb314c2501d0e7a1c973999c204abf8a">More...</a><br /></td></tr>
+<tr class="memdesc:abb314c2501d0e7a1c973999c204abf8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes the routine containing the Jacobian matrix if supplied. If not supplied, the Jacobian is computed via finite differences.  <a href="structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a">More...</a><br /></td></tr>
 <tr class="separator:abb314c2501d0e7a1c973999c204abf8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab7d7b04b2705a59abf9f3533f65b9982"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982">get_equation_count</a> =&gt; vfh_get_nfcn</td></tr>
-<tr class="memdesc:ab7d7b04b2705a59abf9f3533f65b9982"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of equations in this system.  <a href="#ab7d7b04b2705a59abf9f3533f65b9982">More...</a><br /></td></tr>
+<tr class="memdesc:ab7d7b04b2705a59abf9f3533f65b9982"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of equations in this system.  <a href="structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982">More...</a><br /></td></tr>
 <tr class="separator:ab7d7b04b2705a59abf9f3533f65b9982"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab9531f2873b46cdbfd446a911cc285fc"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc">get_variable_count</a> =&gt; vfh_get_nvar</td></tr>
-<tr class="memdesc:ab9531f2873b46cdbfd446a911cc285fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of variables in this system.  <a href="#ab9531f2873b46cdbfd446a911cc285fc">More...</a><br /></td></tr>
+<tr class="memdesc:ab9531f2873b46cdbfd446a911cc285fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of variables in this system.  <a href="structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc">More...</a><br /></td></tr>
 <tr class="separator:ab9531f2873b46cdbfd446a911cc285fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -147,7 +147,45 @@
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver. </p>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates the most basic use of this type to solve a system of 2 equations and 2 unknowns using Newton's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div><div class="line">    fcn =&gt; fcns</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line"><span class="keyword">    subroutine </span>fcns(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (5.00000, 3.00000)</div><div class="line">Residual: (0.000E+00, 0.000E+00)</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates the most basic use of this type to solve a system of 2 equations and 2 unknowns using Newton's method. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div>
+<div class="line">    fcn =&gt; fcns</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcns(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (5.00000, 3.00000)</div>
+<div class="line">Residual: (0.000E+00, 0.000E+00)</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00339">339</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 </div><h2 class="groupheader">Member Function/Subroutine Documentation</h2>
@@ -167,10 +205,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a44c03a753473e7cc38776bf2
 </div><div class="memdoc">
 
 <p>Executes the routine containing the system of equations to solve. No action is taken if the pointer to the subroutine has not been defined. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>fcn(class(vecfcn_helper) this, real(real64) x(:), real(real64) f(:))</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>fcn(class(vecfcn_helper) this, real(real64) x(:), real(real64) f(:))</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the independent variables. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An M-element array that, on output, contains the values of the M functions. </td></tr>
   </table>
@@ -197,10 +236,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab7d7b04b2705a59abf9f3533
 </div><div class="memdoc">
 
 <p>Gets the number of equations in this system. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">integer(int32)</span> get_equation_count(<span class="keywordtype">class</span>(vecfcn_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">integer(int32)</span> get_equation_count(<span class="keywordtype">class</span>(vecfcn_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -226,10 +266,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab9531f2873b46cdbfd446a91
 </div><div class="memdoc">
 
 <p>Gets the number of variables in this system. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">integer(int32)</span> get_variable_count(<span class="keywordtype">class</span>(vecfcn_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">integer(int32)</span> get_variable_count(<span class="keywordtype">class</span>(vecfcn_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -255,10 +296,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae5a78dc12bfaca9c6ee6a129
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the subroutine containing the system of equations to solve has been assigned. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_fcn_defined(class(vecfcn_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_fcn_defined(class(vecfcn_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -284,10 +326,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#a95d28720ced834b78276792b
 </div><div class="memdoc">
 
 <p>Tests if the pointer to the subroutine containing the system of equations to solve has been assigned. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_jacobian_defined(class(vecfcn_helper) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_jacobian_defined(class(vecfcn_helper) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -313,10 +356,14 @@ <h2 class="memtitle"><span class="permalink"><a href="#abb314c2501d0e7a1c973999c
 </div><div class="memdoc">
 
 <p>Executes the routine containing the Jacobian matrix if supplied. If not supplied, the Jacobian is computed via finite differences. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>jacobian(class(vecfcn_helper) this real(real64) x(:), &amp;</div><div class="line"> <span class="keywordtype">real(real64)</span> jac(:), <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> fv(:), &amp;</div><div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> work(:), <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> lwork, &amp;</div><div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>jacobian(class(vecfcn_helper) this real(real64) x(:), &amp;</div>
+<div class="line"><span class="keywordtype"> real</span>(real64) jac(:), <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> fv(:), &amp;</div>
+<div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">real(real64)</span> work(:), <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> lwork, &amp;</div>
+<div class="line"> <span class="keywordtype">optional</span> <span class="keywordtype">integer(int32)</span> err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the independent variabls defining the point about which the derivatives will be calculated. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">jac</td><td>An M-by-N matrix where, on output, the Jacobian will be written. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fv</td><td>An optional M-element array containing the function values at <code>x</code>. If not supplied, the function values are computed at <code>x</code>. </td></tr>
@@ -352,17 +399,56 @@ <h2 class="memtitle"><span class="permalink"><a href="#a41b867ae18398e8c7de44c6d
 </div><div class="memdoc">
 
 <p>Establishes a pointer to the routine containing the system of equations to solve. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(vecfcn_helper) this, procedure(vecfcn) pointer fcn, integer(int32) nfcn, integer(int32) nvar)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_fcn(class(vecfcn_helper) this, procedure(vecfcn) pointer fcn, integer(int32) nfcn, integer(int32) nvar)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function pointer. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">nfcn</td><td>The number of functions. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">nvar</td><td>The number of variables.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to define the function to solve. Newton's method is being utilized via the newton_solver type. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div><div class="line">    fcn =&gt; fcns</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line"><span class="keyword">    subroutine </span>fcns(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (5.00000, 3.00000)</div><div class="line">Residual: (0.000E+00, 0.000E+00)</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to define the function to solve. Newton's method is being utilized via the newton_solver type. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Assign a pointer to the subroutine containing the equations to solve</span></div>
+<div class="line">    fcn =&gt; fcns</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2) <span class="comment">! There are 2 equations with 2 unknowns</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Define the routine containing the equations to solve.  The equations are:</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcns(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (5.00000, 3.00000)</div>
+<div class="line">Residual: (0.000E+00, 0.000E+00)</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00410">410</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
@@ -384,32 +470,89 @@ <h2 class="memtitle"><span class="permalink"><a href="#a28ad419ee7fd8d7f0529587d
 </div><div class="memdoc">
 
 <p>Establishes a pointer to the routine for computing the Jacobian matrix of the system of equations. If no routine is defined, the Jacobian matrix will be computed numerically (this is the default state). </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_jacobian(class(vecfcn_helper) this, procedure(jacobianfcn) pointer jac)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_jacobian(class(vecfcn_helper) this, procedure(jacobianfcn) pointer jac)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0...">vecfcn_helper</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__core_1_1vecfcn__helper.html" title="Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....">vecfcn_helper</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">jac</td><td>The function pointer.</td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example utilizes Newton's method to solve a system of 2 equations and 2 unknowns with a user-defined Jacobian. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">pointer</span> :: jac</div><div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Assign the function and Jacobian routines</span></div><div class="line">    fcn =&gt; fcns</div><div class="line">    jac =&gt; fcnjac</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div><div class="line">    <span class="keyword">call </span>obj%set_jacobian(jac)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess</span></div><div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The system of equations (source: https://www.mathworks.com/help/optim/ug/fsolve.html)</span></div><div class="line">    <span class="comment">! 2 * x1 - x2 = exp(-x1)</span></div><div class="line">    <span class="comment">! -x1 + 2 * x2 = exp(-x2)</span></div><div class="line"><span class="keyword">    subroutine </span>fcns(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = 2.0d0 * x(1) - x(2) - exp(-x(1))</div><div class="line">        f(2) = -x(1) + 2.0d0 * x(2) - exp(-x(2))</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"></div><div class="line">    <span class="comment">! The Jacobian matrix:</span></div><div class="line">    <span class="comment">!     | exp(-x1) + 2          -1     |</span></div><div class="line">    <span class="comment">! J = |                              |</span></div><div class="line">    <span class="comment">!     |     -1          exp(-x2) + 2 |</span></div><div class="line"><span class="keyword">    subroutine </span>fcnjac(x, jac)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div><div class="line">        jac(1,1) = exp(-x(1)) + 2.0d0</div><div class="line">        jac(2,1) = -1.0d0</div><div class="line">        jac(1,2) = -1.0d0</div><div class="line">        jac(2,2) = exp(-x(2)) + 2.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (0.56714, 0.56714)</div><div class="line">Residual: (-.693E-08, -.683E-08)</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example utilizes Newton's method to solve a system of 2 equations and 2 unknowns with a user-defined Jacobian. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">pointer</span> :: jac</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Assign the function and Jacobian routines</span></div>
+<div class="line">    fcn =&gt; fcns</div>
+<div class="line">    jac =&gt; fcnjac</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div>
+<div class="line">    <span class="keyword">call </span>obj%set_jacobian(jac)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess</span></div>
+<div class="line">    x = 1.0d0 <span class="comment">! Equivalent to x = [1.0d0, 1.0d0]</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5AF7.5A)&#39;</span>, <span class="stringliteral">&quot;Solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3AE9.3A)&#39;</span>, <span class="stringliteral">&quot;Residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The system of equations (source: https://www.mathworks.com/help/optim/ug/fsolve.html)</span></div>
+<div class="line">    <span class="comment">! 2 * x1 - x2 = exp(-x1)</span></div>
+<div class="line">    <span class="comment">! -x1 + 2 * x2 = exp(-x2)</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcns(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = 2.0d0 * x(1) - x(2) - exp(-x(1))</div>
+<div class="line">        f(2) = -x(1) + 2.0d0 * x(2) - exp(-x(2))</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! The Jacobian matrix:</span></div>
+<div class="line">    <span class="comment">!     | exp(-x1) + 2          -1     |</span></div>
+<div class="line">    <span class="comment">! J = |                              |</span></div>
+<div class="line">    <span class="comment">!     |     -1          exp(-x2) + 2 |</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcnjac(x, jac)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jac</div>
+<div class="line">        jac(1,1) = exp(-x(1)) + 2.0d0</div>
+<div class="line">        jac(2,1) = -1.0d0</div>
+<div class="line">        jac(1,2) = -1.0d0</div>
+<div class="line">        jac(2,2) = exp(-x(2)) + 2.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">Solution: (0.56714, 0.56714)</div>
+<div class="line">Residual: (-.693E-08, -.683E-08)</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__core_8f90_source.html#l00486">486</a> of file <a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__core_8f90_source.html">nonlin_core.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__core.html">nonlin_core</a></li><li class="navelem"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__least__squares_1_1least__squares__solver-members.html b/doc/html/structnonlin__least__squares_1_1least__squares__solver-members.html
index a1c386a..b1730c2 100644
--- a/doc/html/structnonlin__least__squares_1_1least__squares__solver-members.html
+++ b/doc/html/structnonlin__least__squares_1_1least__squares__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,13 +101,18 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e">get_step_scaling_factor</a>=&gt; lss_get_factor</td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">get_var_tolerance</a>=&gt; es_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d">m_factor</a></td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac">set_step_scaling_factor</a>=&gt; lss_set_factor</td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5">solve</a>=&gt; lss_solve</td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c">m_gtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac">set_step_scaling_factor</a>=&gt; lss_set_factor</td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5">solve</a>=&gt; lss_solve</td><td class="entry"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">nonlin_least_squares::least_squares_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -115,7 +120,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__least__squares_1_1least__squares__solver.html b/doc/html/structnonlin__least__squares_1_1least__squares__solver.html
index 67fecd4..f18a7b8 100644
--- a/doc/html/structnonlin__least__squares_1_1least__squares__solver.html
+++ b/doc/html/structnonlin__least__squares_1_1least__squares__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_least_squares::least_squares_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,9 +104,9 @@
  <div class="center">
   <img src="structnonlin__least__squares_1_1least__squares__solver.png" usemap="#nonlin_5Fleast_5Fsquares::least_5Fsquares_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fleast_5Fsquares::least_5Fsquares_5Fsolver_map" name="nonlin_5Fleast_5Fsquares::least_5Fsquares_5Fsolver_map">
-<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. " alt="nonlin_core::equation_solver" shape="rect" coords="0,0,255,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations." alt="nonlin_core::equation_solver" shape="rect" coords="0,0,255,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
@@ -169,7 +169,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__least__squares_8f90_source.html#l00021">21</a> of file <a class="el" href="nonlin__least__squares_8f90_source.html">nonlin_least_squares.f90</a>.</p>
 </div><hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__least__squares_8f90_source.html">nonlin_least_squares.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__least__squares_8f90_source.html">nonlin_least_squares.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -179,7 +179,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></li><li class="navelem"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__linesearch_1_1line__search-members.html b/doc/html/structnonlin__linesearch_1_1line__search-members.html
index c7c8cf5..aac8b38 100644
--- a/doc/html/structnonlin__linesearch_1_1line__search-members.html
+++ b/doc/html/structnonlin__linesearch_1_1line__search-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -113,7 +113,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__linesearch_1_1line__search.html b/doc/html/structnonlin__linesearch_1_1line__search.html
index 84b33fb..48782ed 100644
--- a/doc/html/structnonlin__linesearch_1_1line__search.html
+++ b/doc/html/structnonlin__linesearch_1_1line__search.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_linesearch::line_search Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -169,7 +169,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__linesearch_8f90_source.html#l00040">40</a> of file <a class="el" href="nonlin__linesearch_8f90_source.html">nonlin_linesearch.f90</a>.</p>
 </div><hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__linesearch_8f90_source.html">nonlin_linesearch.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__linesearch_8f90_source.html">nonlin_linesearch.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -179,7 +179,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a></li><li class="navelem"><a class="el" href="structnonlin__linesearch_1_1line__search.html">line_search</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1bfgs-members.html b/doc/html/structnonlin__optimize_1_1bfgs-members.html
index 871bdd0..d28ebe8 100644
--- a/doc/html/structnonlin__optimize_1_1bfgs-members.html
+++ b/doc/html/structnonlin__optimize_1_1bfgs-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,6 +101,12 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082">get_use_line_search</a>=&gt; lso_get_use_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">get_var_tolerance</a>=&gt; lso_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">is_line_search_defined</a>=&gt; lso_is_line_search_defined</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a">m_linesearch</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952">m_tol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">set_default_line_search</a>=&gt; lso_set_default</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">set_line_search</a>=&gt; lso_set_line_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a>=&gt; oe_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
@@ -116,7 +122,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1bfgs.html b/doc/html/structnonlin__optimize_1_1bfgs.html
index ae5f510..a8b6010 100644
--- a/doc/html/structnonlin__optimize_1_1bfgs.html
+++ b/doc/html/structnonlin__optimize_1_1bfgs.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_optimize::bfgs Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,14 +104,14 @@
   <img src="structnonlin__optimize_1_1bfgs.png" usemap="#nonlin_5Foptimize::bfgs_map" alt=""/>
   <map id="nonlin_5Foptimize::bfgs_map" name="nonlin_5Foptimize::bfgs_map">
 <area href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi..." alt="nonlin_optimize::line_search_optimizer" shape="rect" coords="0,56,227,80"/>
-<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. " alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,227,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables." alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,227,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ac3715dd630462bd1bcca31c5b3f04385"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385">solve</a> =&gt; bfgs_solve</td></tr>
-<tr class="memdesc:ac3715dd630462bd1bcca31c5b3f04385"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm for finding a minimum value of the specified function.  <a href="#ac3715dd630462bd1bcca31c5b3f04385">More...</a><br /></td></tr>
+<tr class="memdesc:ac3715dd630462bd1bcca31c5b3f04385"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm for finding a minimum value of the specified function.  <a href="structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385">More...</a><br /></td></tr>
 <tr class="separator:ac3715dd630462bd1bcca31c5b3f04385"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__optimize_1_1line__search__optimizer"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__optimize_1_1line__search__optimizer')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td></tr>
 <tr class="memitem:a2b1042174ffcc88914b97c27c120f010 inherit pub_methods_structnonlin__optimize_1_1line__search__optimizer"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010">get_line_search</a> =&gt; lso_get_line_search</td></tr>
@@ -182,7 +182,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac3715dd630462bd1bcca31c5
 </div><div class="memdoc">
 
 <p>Utilizes the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm for finding a minimum value of the specified function. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(bfgs) this, class(fcnnvar_helper) fcn, real(real64) x(:), real(real64) fout, optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(bfgs) this, class(fcnnvar_helper) fcn, real(real64) x(:), real(real64) fout, optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The bfgs_mead object. </td></tr>
@@ -200,7 +201,46 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac3715dd630462bd1bcca31c5
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of Rosenbrock's function using this BFGS solver. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__optimize_1_1bfgs.html">bfgs</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>, <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>, <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), fout</div><div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: ib</div><div class="line"></div><div class="line">    <span class="comment">! Initialization</span></div><div class="line">    fcn =&gt; rosenbrock</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div><div class="line">    <span class="keyword">call </span>random_number(x)</div><div class="line"></div><div class="line">    <span class="comment">! Call the solver</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, fout, ib)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF8.5AF8.5A)&#39;</span>, <span class="stringliteral">&quot;Rosenbrock Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fout</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, ib%iter_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, ib%fcn_count</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div><div class="line"><span class="keyword">    function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end</span></div></div><!-- fragment --> The above program yields the following output: <div class="fragment"><div class="line">Rosenbrock Minimum: ( 1.00000,  0.99999)</div><div class="line">Function Value: 0.200E-10</div><div class="line">Iterations: 47</div><div class="line">Function Evaluations: 70</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of Rosenbrock's function using this BFGS solver. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__optimize_1_1bfgs.html">bfgs</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>, <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>, <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(bfgs) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), fout</div>
+<div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: ib</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Initialization</span></div>
+<div class="line">    fcn =&gt; rosenbrock</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div>
+<div class="line">    <span class="keyword">call </span>random_number(x)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Call the solver</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, fout, ib)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF8.5AF8.5A)&#39;</span>, <span class="stringliteral">&quot;Rosenbrock Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fout</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, ib%iter_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, ib%fcn_count</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div>
+<div class="line">    <span class="keyword">function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end</span></div>
+</div><!-- fragment --> The above program yields the following output: <div class="fragment"><div class="line">Rosenbrock Minimum: ( 1.00000,  0.99999)</div>
+<div class="line">Function Value: 0.200E-10</div>
+<div class="line">Iterations: 47</div>
+<div class="line">Function Evaluations: 70</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li><a href="https://en.wikipedia.org/wiki/Broyden%E2%80%93Fletcher%E2%80%93Goldfarb%E2%80%93Shanno_algorithm">Wikipedia - BFGS Methods</a></li>
 <li><a href="https://en.wikipedia.org/wiki/Quasi-Newton_method">Wikipedia - Quasi-Newton Methods</a></li>
@@ -213,17 +253,23 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac3715dd630462bd1bcca31c5
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1fcnnvar_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcnnvar.html">nonlin_core::fcnnvar</a></div><div class="ttdoc">Describes a function of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00230">nonlin_core.f90:230</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__optimize_1_1bfgs_html"><div class="ttname"><a href="structnonlin__optimize_1_1bfgs.html">nonlin_optimize::bfgs</a></div><div class="ttdoc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple va...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00405">nonlin_optimize.f90:405</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a></li><li class="navelem"><a class="el" href="structnonlin__optimize_1_1bfgs.html">bfgs</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1line__search__optimizer-members.html b/doc/html/structnonlin__optimize_1_1line__search__optimizer-members.html
index c17a5de..9b3e3a9 100644
--- a/doc/html/structnonlin__optimize_1_1line__search__optimizer-members.html
+++ b/doc/html/structnonlin__optimize_1_1line__search__optimizer-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,16 +102,19 @@
   <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">get_var_tolerance</a>=&gt; lso_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">is_line_search_defined</a>=&gt; lso_is_line_search_defined</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a">m_linesearch</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">set_default_line_search</a>=&gt; lso_set_default</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">set_line_search</a>=&gt; lso_set_line_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a>=&gt; oe_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">set_print_status</a>=&gt; oe_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">set_tolerance</a>=&gt; oe_set_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">set_use_line_search</a>=&gt; lso_set_use_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">set_var_tolerance</a>=&gt; lso_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917">solve</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952">m_tol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">set_default_line_search</a>=&gt; lso_set_default</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">set_line_search</a>=&gt; lso_set_line_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a>=&gt; oe_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">set_print_status</a>=&gt; oe_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">set_tolerance</a>=&gt; oe_set_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">set_use_line_search</a>=&gt; lso_set_use_search</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">set_var_tolerance</a>=&gt; lso_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">nonlin_optimize::line_search_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917">solve</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -119,7 +122,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1line__search__optimizer.html b/doc/html/structnonlin__optimize_1_1line__search__optimizer.html
index 5e1fd28..ee68a0c 100644
--- a/doc/html/structnonlin__optimize_1_1line__search__optimizer.html
+++ b/doc/html/structnonlin__optimize_1_1line__search__optimizer.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_optimize::line_search_optimizer Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,36 +104,36 @@
  <div class="center">
   <img src="structnonlin__optimize_1_1line__search__optimizer.png" usemap="#nonlin_5Foptimize::line_5Fsearch_5Foptimizer_map" alt=""/>
   <map id="nonlin_5Foptimize::line_5Fsearch_5Foptimizer_map" name="nonlin_5Foptimize::line_5Fsearch_5Foptimizer_map">
-<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. " alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,227,24"/>
-<area href="structnonlin__optimize_1_1bfgs.html" title="Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple..." alt="nonlin_optimize::bfgs" shape="rect" coords="0,112,227,136"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables." alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,227,24"/>
+<area href="structnonlin__optimize_1_1bfgs.html" title="Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple va..." alt="nonlin_optimize::bfgs" shape="rect" coords="0,112,227,136"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a2b1042174ffcc88914b97c27c120f010"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010">get_line_search</a> =&gt; lso_get_line_search</td></tr>
-<tr class="memdesc:a2b1042174ffcc88914b97c27c120f010"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the line search module.  <a href="#a2b1042174ffcc88914b97c27c120f010">More...</a><br /></td></tr>
+<tr class="memdesc:a2b1042174ffcc88914b97c27c120f010"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the line search module.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010">More...</a><br /></td></tr>
 <tr class="separator:a2b1042174ffcc88914b97c27c120f010"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4683a073414a8f578d96c75cdd9642ff"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">set_line_search</a> =&gt; lso_set_line_search</td></tr>
-<tr class="memdesc:a4683a073414a8f578d96c75cdd9642ff"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the line search module.  <a href="#a4683a073414a8f578d96c75cdd9642ff">More...</a><br /></td></tr>
+<tr class="memdesc:a4683a073414a8f578d96c75cdd9642ff"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the line search module.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff">More...</a><br /></td></tr>
 <tr class="separator:a4683a073414a8f578d96c75cdd9642ff"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a711e12f53c96c51cb2499b1221a380e9"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">set_default_line_search</a> =&gt; lso_set_default</td></tr>
-<tr class="memdesc:a711e12f53c96c51cb2499b1221a380e9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a default line_search object for the line search module.  <a href="#a711e12f53c96c51cb2499b1221a380e9">More...</a><br /></td></tr>
+<tr class="memdesc:a711e12f53c96c51cb2499b1221a380e9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a default line_search object for the line search module.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9">More...</a><br /></td></tr>
 <tr class="separator:a711e12f53c96c51cb2499b1221a380e9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad3bdce0e57ac51e0269fd1bbbde560ba"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">is_line_search_defined</a> =&gt; lso_is_line_search_defined</td></tr>
-<tr class="memdesc:ad3bdce0e57ac51e0269fd1bbbde560ba"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to see if a line search module is defined.  <a href="#ad3bdce0e57ac51e0269fd1bbbde560ba">More...</a><br /></td></tr>
+<tr class="memdesc:ad3bdce0e57ac51e0269fd1bbbde560ba"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to see if a line search module is defined.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba">More...</a><br /></td></tr>
 <tr class="separator:ad3bdce0e57ac51e0269fd1bbbde560ba"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a58cb7ed2dc28b5d8873375c150dea082"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082">get_use_line_search</a> =&gt; lso_get_use_search</td></tr>
-<tr class="memdesc:a58cb7ed2dc28b5d8873375c150dea082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a value determining if a line-search should be employed.  <a href="#a58cb7ed2dc28b5d8873375c150dea082">More...</a><br /></td></tr>
+<tr class="memdesc:a58cb7ed2dc28b5d8873375c150dea082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a value determining if a line-search should be employed.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082">More...</a><br /></td></tr>
 <tr class="separator:a58cb7ed2dc28b5d8873375c150dea082"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:adab21b3e10e1805a38834b8797dca440"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">set_use_line_search</a> =&gt; lso_set_use_search</td></tr>
-<tr class="memdesc:adab21b3e10e1805a38834b8797dca440"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a value determining if a line-search should be employed.  <a href="#adab21b3e10e1805a38834b8797dca440">More...</a><br /></td></tr>
+<tr class="memdesc:adab21b3e10e1805a38834b8797dca440"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a value determining if a line-search should be employed.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440">More...</a><br /></td></tr>
 <tr class="separator:adab21b3e10e1805a38834b8797dca440"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5b431c601db2386d2e0b705978ef8de0"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">get_var_tolerance</a> =&gt; lso_get_var_tol</td></tr>
-<tr class="memdesc:a5b431c601db2386d2e0b705978ef8de0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="#a5b431c601db2386d2e0b705978ef8de0">More...</a><br /></td></tr>
+<tr class="memdesc:a5b431c601db2386d2e0b705978ef8de0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the convergence on change in variable tolerance.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0">More...</a><br /></td></tr>
 <tr class="separator:a5b431c601db2386d2e0b705978ef8de0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a12494ed3557543770f272cead196bb45"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">set_var_tolerance</a> =&gt; lso_set_var_tol</td></tr>
-<tr class="memdesc:a12494ed3557543770f272cead196bb45"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="#a12494ed3557543770f272cead196bb45">More...</a><br /></td></tr>
+<tr class="memdesc:a12494ed3557543770f272cead196bb45"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the convergence on change in variable tolerance.  <a href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">More...</a><br /></td></tr>
 <tr class="separator:a12494ed3557543770f272cead196bb45"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__core_1_1equation__optimizer"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__core_1_1equation__optimizer')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td></tr>
 <tr class="memitem:ace21c015ea34abffb4422ca1f5a7cf3b inherit pub_methods_structnonlin__core_1_1equation__optimizer"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b">get_max_fcn_evals</a> =&gt; oe_get_max_eval</td></tr>
@@ -194,7 +194,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2b1042174ffcc88914b97c27
 </div><div class="memdoc">
 
 <p>Gets the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>get_line_search(class(line_search_optimizer) this, allocatable class(line_search) ls)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>get_line_search(class(line_search_optimizer) this, allocatable class(line_search) ls)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -223,7 +224,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a58cb7ed2dc28b5d8873375c1
 </div><div class="memdoc">
 
 <p>Gets a value determining if a line-search should be employed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_use_line_search(<span class="keywordtype">class</span>(line_search_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">logical</span> get_use_line_search(<span class="keywordtype">class</span>(line_search_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -252,7 +254,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a5b431c601db2386d2e0b7059
 </div><div class="memdoc">
 
 <p>Gets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(line_search_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">real(real64) </span><span class="keyword">function </span>get_var_tolerance(class(line_search_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -281,7 +284,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ad3bdce0e57ac51e0269fd1bb
 </div><div class="memdoc">
 
 <p>Tests to see if a line search module is defined. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_line_search_defined(class(line_search_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_line_search_defined(class(line_search_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -310,7 +314,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a711e12f53c96c51cb2499b12
 </div><div class="memdoc">
 
 <p>Establishes a default line_search object for the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_default_line_search(class(line_search_optimizer) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_default_line_search(class(line_search_optimizer) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -338,7 +343,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a4683a073414a8f578d96c75c
 </div><div class="memdoc">
 
 <p>Sets the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_line_search(class(line_search_optimizer) this, class(line_search) ls)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_line_search(class(line_search_optimizer) this, class(line_search) ls)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -367,7 +373,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#adab21b3e10e1805a38834b87
 </div><div class="memdoc">
 
 <p>Sets a value determining if a line-search should be employed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_use_line_search(class(line_search_optimizer) this, logical x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_use_line_search(class(line_search_optimizer) this, logical x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -396,7 +403,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a12494ed3557543770f272cea
 </div><div class="memdoc">
 
 <p>Sets the convergence on change in variable tolerance. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(line_search_optimizer) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_var_tolerance(class(line_search_optimizer) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" title="A class describing equation optimizers that use a line search algorithm to improve convergence behavi...">line_search_optimizer</a> object. </td></tr>
@@ -410,7 +418,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a12494ed3557543770f272cea
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -420,7 +428,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a12494ed3557543770f272cea
     <li class="navelem"><a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a></li><li class="navelem"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1nelder__mead-members.html b/doc/html/structnonlin__optimize_1_1nelder__mead-members.html
index 641e847..57f640f 100644
--- a/doc/html/structnonlin__optimize_1_1nelder__mead-members.html
+++ b/doc/html/structnonlin__optimize_1_1nelder__mead-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -101,13 +101,16 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2">get_simplex</a>=&gt; nm_get_simplex</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1">get_tolerance</a>=&gt; oe_get_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555">m_initsize</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2">m_simplex</a></td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">set_initial_size</a>=&gt; nm_set_size</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a>=&gt; oe_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">set_print_status</a>=&gt; oe_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">set_simplex</a>=&gt; nm_set_simplex</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">set_tolerance</a>=&gt; oe_set_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">solve</a>=&gt; nm_solve</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952">m_tol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">set_initial_size</a>=&gt; nm_set_size</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c">set_max_fcn_evals</a>=&gt; oe_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5">set_print_status</a>=&gt; oe_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">set_simplex</a>=&gt; nm_set_simplex</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868">set_tolerance</a>=&gt; oe_set_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">solve</a>=&gt; nm_solve</td><td class="entry"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -115,7 +118,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__optimize_1_1nelder__mead.html b/doc/html/structnonlin__optimize_1_1nelder__mead.html
index 1df4281..a259b7d 100644
--- a/doc/html/structnonlin__optimize_1_1nelder__mead.html
+++ b/doc/html/structnonlin__optimize_1_1nelder__mead.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_optimize::nelder_mead Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -105,26 +105,26 @@
  <div class="center">
   <img src="structnonlin__optimize_1_1nelder__mead.png" usemap="#nonlin_5Foptimize::nelder_5Fmead_map" alt=""/>
   <map id="nonlin_5Foptimize::nelder_5Fmead_map" name="nonlin_5Foptimize::nelder_5Fmead_map">
-<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables. " alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,189,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__optimizer.html" title="A base class for optimization of an equation of multiple variables." alt="nonlin_core::equation_optimizer" shape="rect" coords="0,0,189,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a1cc60f4f3daecc2f314fd02ab05854c6"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">solve</a> =&gt; nm_solve</td></tr>
-<tr class="memdesc:a1cc60f4f3daecc2f314fd02ab05854c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes the Nelder-Mead simplex method for finding a minimum value of the specified function.  <a href="#a1cc60f4f3daecc2f314fd02ab05854c6">More...</a><br /></td></tr>
+<tr class="memdesc:a1cc60f4f3daecc2f314fd02ab05854c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes the Nelder-Mead simplex method for finding a minimum value of the specified function.  <a href="structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6">More...</a><br /></td></tr>
 <tr class="separator:a1cc60f4f3daecc2f314fd02ab05854c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af262957b196243601501c8540ed6edf2"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2">get_simplex</a> =&gt; nm_get_simplex</td></tr>
-<tr class="memdesc:af262957b196243601501c8540ed6edf2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets an N-by-(N+1) matrix containing the current simplex.  <a href="#af262957b196243601501c8540ed6edf2">More...</a><br /></td></tr>
+<tr class="memdesc:af262957b196243601501c8540ed6edf2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets an N-by-(N+1) matrix containing the current simplex.  <a href="structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2">More...</a><br /></td></tr>
 <tr class="separator:af262957b196243601501c8540ed6edf2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af135618858e807fc51ebd6063ac9c736"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">set_simplex</a> =&gt; nm_set_simplex</td></tr>
-<tr class="memdesc:af135618858e807fc51ebd6063ac9c736"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets an N-by-(N+1) matrix as the current simplex. Notice, if this matrix is different in size from the problem dimensionallity, the Nelder-Mead routine will replace it with an appropriately sized matrix.  <a href="#af135618858e807fc51ebd6063ac9c736">More...</a><br /></td></tr>
+<tr class="memdesc:af135618858e807fc51ebd6063ac9c736"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets an N-by-(N+1) matrix as the current simplex. Notice, if this matrix is different in size from the problem dimensionallity, the Nelder-Mead routine will replace it with an appropriately sized matrix.  <a href="structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736">More...</a><br /></td></tr>
 <tr class="separator:af135618858e807fc51ebd6063ac9c736"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad09b33f9ff6f17e1cc0d56befa1a77b4"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4">get_initial_size</a> =&gt; nm_get_size</td></tr>
-<tr class="memdesc:ad09b33f9ff6f17e1cc0d56befa1a77b4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry.  <a href="#ad09b33f9ff6f17e1cc0d56befa1a77b4">More...</a><br /></td></tr>
+<tr class="memdesc:ad09b33f9ff6f17e1cc0d56befa1a77b4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry.  <a href="structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4">More...</a><br /></td></tr>
 <tr class="separator:ad09b33f9ff6f17e1cc0d56befa1a77b4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7a7e271e79bbf0249dc2a64fd2f46a46"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">set_initial_size</a> =&gt; nm_set_size</td></tr>
-<tr class="memdesc:a7a7e271e79bbf0249dc2a64fd2f46a46"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry.  <a href="#a7a7e271e79bbf0249dc2a64fd2f46a46">More...</a><br /></td></tr>
+<tr class="memdesc:a7a7e271e79bbf0249dc2a64fd2f46a46"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry.  <a href="structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46">More...</a><br /></td></tr>
 <tr class="separator:a7a7e271e79bbf0249dc2a64fd2f46a46"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__core_1_1equation__optimizer"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__core_1_1equation__optimizer')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__core_1_1equation__optimizer.html">nonlin_core::equation_optimizer</a></td></tr>
 <tr class="memitem:ace21c015ea34abffb4422ca1f5a7cf3b inherit pub_methods_structnonlin__core_1_1equation__optimizer"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b">get_max_fcn_evals</a> =&gt; oe_get_max_eval</td></tr>
@@ -152,7 +152,7 @@
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
 <tr class="memitem:a4f23b7fdeadd1789895d385d3646d2a7"><td class="memItemLeft" align="right" valign="top">procedure, private&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7">extrapolate</a> =&gt; nm_extrapolate</td></tr>
-<tr class="memdesc:a4f23b7fdeadd1789895d385d3646d2a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Extrapolates by the specified factor through the simplex across from the largest point. If the extrapolation results in a better estimate, the current high point is replaced with the new estimate.  <a href="#a4f23b7fdeadd1789895d385d3646d2a7">More...</a><br /></td></tr>
+<tr class="memdesc:a4f23b7fdeadd1789895d385d3646d2a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Extrapolates by the specified factor through the simplex across from the largest point. If the extrapolation results in a better estimate, the current high point is replaced with the new estimate.  <a href="structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7">More...</a><br /></td></tr>
 <tr class="separator:a4f23b7fdeadd1789895d385d3646d2a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
@@ -195,7 +195,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a4f23b7fdeadd1789895d385d
 </div><div class="memdoc">
 
 <p>Extrapolates by the specified factor through the simplex across from the largest point. If the extrapolation results in a better estimate, the current high point is replaced with the new estimate. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>extrapolate(class(nelder_mead) this, class(fcnnvar_helper) fcn, real(real64) y(:), real(real64) pcent(:), integer(int32) ihi, real(real64) fac, integer(int32) neval, real(real64) work(:))</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">real(real64) </span><span class="keyword">function </span>extrapolate(class(nelder_mead) this, class(fcnnvar_helper) fcn, real(real64) y(:), real(real64) pcent(:), integer(int32) ihi, real(real64) fac, integer(int32) neval, real(real64) work(:))</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -230,7 +231,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ad09b33f9ff6f17e1cc0d56be
 </div><div class="memdoc">
 
 <p>Gets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">real(real64)</span> get_initial_size(<span class="keywordtype">class</span>(nelder_mead) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> real(real64) get_initial_size(<span class="keywordtype">class</span>(nelder_mead) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -259,7 +261,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#af262957b196243601501c854
 </div><div class="memdoc">
 
 <p>Gets an N-by-(N+1) matrix containing the current simplex. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keywordtype">real(real64)</span>(:,:) function get_simplex(<span class="keywordtype">class</span>(nelder_mead) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> real(real64)(:,:) <span class="keyword">function </span>get_simplex(class(nelder_mead) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -288,7 +291,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a7a7e271e79bbf0249dc2a64f
 </div><div class="memdoc">
 
 <p>Sets the size of the initial simplex that will be utilized by the Nelder-Mead algorithm in the event that the user does not supply a simplex geometry, or if the user supplies an invalid simplex geometry. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_initial_size(class(nelder_mead) this, real(real64) x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_initial_size(class(nelder_mead) this, real(real64) x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -318,7 +322,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#af135618858e807fc51ebd606
 </div><div class="memdoc">
 
 <p>Sets an N-by-(N+1) matrix as the current simplex. Notice, if this matrix is different in size from the problem dimensionallity, the Nelder-Mead routine will replace it with an appropriately sized matrix. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_simplex(class(nelder_mead) this, real(real64) x(:,:))</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_simplex(class(nelder_mead) this, real(real64) x(:,:))</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -348,7 +353,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1cc60f4f3daecc2f314fd02a
 </div><div class="memdoc">
 
 <p>Utilizes the Nelder-Mead simplex method for finding a minimum value of the specified function. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(nelder_mead) this, class(fcnnvar_helper) fcn, real(real64) x(:), real(real64) fout, optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(nelder_mead) this, class(fcnnvar_helper) fcn, real(real64) x(:), real(real64) fout, optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__optimize_1_1nelder__mead.html" title="Defines a solver based upon Nelder and Mead&#39;s simplex algorithm for minimization of functions of mult...">nelder_mead</a> object. </td></tr>
@@ -366,7 +372,46 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1cc60f4f3daecc2f314fd02a
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of Rosenbrock's function using this Nelder-Mead solver. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>, <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>, <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local Variables</span></div><div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div><div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), fout</div><div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: ib</div><div class="line"></div><div class="line">    <span class="comment">! Initialization</span></div><div class="line">    fcn =&gt; rosenbrock</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div><div class="line">    <span class="keyword">call </span>random_number(x)</div><div class="line"></div><div class="line">    <span class="comment">! Call the solver</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, fout, ib)</div><div class="line"></div><div class="line">    <span class="comment">! Display the output</span></div><div class="line">    print <span class="stringliteral">&#39;(AF8.5AF8.5A)&#39;</span>, <span class="stringliteral">&quot;Rosenbrock Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fout</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, ib%iter_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, ib%fcn_count</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div><div class="line"><span class="keyword">    function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end</span></div></div><!-- fragment --> The above program yields the following output. <div class="fragment"><div class="line">Rosenbrock Minimum: ( 1.00000,  1.00000)</div><div class="line">Function Value: 0.264E-12</div><div class="line">Iterations: 59</div><div class="line">Function Evaluations: 112</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following example illustrates how to find the minimum of Rosenbrock's function using this Nelder-Mead solver. <div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a>, <a class="code" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a>, <a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local Variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(nelder_mead) :: solver</div>
+<div class="line">    <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), fout</div>
+<div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: ib</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Initialization</span></div>
+<div class="line">    fcn =&gt; rosenbrock</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define an initial guess - the solution is (1, 1)</span></div>
+<div class="line">    <span class="keyword">call </span>random_number(x)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Call the solver</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, fout, ib)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Display the output</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF8.5AF8.5A)&#39;</span>, <span class="stringliteral">&quot;Rosenbrock Minimum: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;Function Value: &quot;</span>, fout</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, ib%iter_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, ib%fcn_count</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! Rosenbrock&#39;s Function</span></div>
+<div class="line">    <span class="keyword">function </span>rosenbrock(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = 1.0d2 * (x(2) - x(1)**2)**2 + (x(1) - 1.0d0)**2</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end</span></div>
+</div><!-- fragment --> The above program yields the following output. <div class="fragment"><div class="line">Rosenbrock Minimum: ( 1.00000,  1.00000)</div>
+<div class="line">Function Value: 0.264E-12</div>
+<div class="line">Iterations: 59</div>
+<div class="line">Function Evaluations: 112</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>Remarks</dt><dd>The implementation of the Nelder-Mead algorithm presented here is a slight modification of the original work of Nelder and Mead. The Numerical Recipes implementation is also quite similar. In fact, the Numerical Recipes section relating to reflection, contraction, etc. is leveraged for this implemetation.</dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li>Nelder, John A.; R. Mead (1965). "A simplex method for function
@@ -382,17 +427,23 @@ <h2 class="memtitle"><span class="permalink"><a href="#a1cc60f4f3daecc2f314fd02a
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__optimize_8f90_source.html">nonlin_optimize.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="astructnonlin__optimize_1_1nelder__mead_html"><div class="ttname"><a href="structnonlin__optimize_1_1nelder__mead.html">nonlin_optimize::nelder_mead</a></div><div class="ttdoc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of mult...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00033">nonlin_optimize.f90:33</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcnnvar__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcnnvar__helper.html">nonlin_core::fcnnvar_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00896">nonlin_core.f90:896</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1fcnnvar_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcnnvar.html">nonlin_core::fcnnvar</a></div><div class="ttdoc">Describes a function of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00230">nonlin_core.f90:230</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1iteration__behavior_html"><div class="ttname"><a href="structnonlin__core_1_1iteration__behavior.html">nonlin_core::iteration_behavior</a></div><div class="ttdoc">Defines a set of parameters that describe the behavior of the iteration process.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00254">nonlin_core.f90:254</a></div></div>
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a></li><li class="navelem"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__polynomials_1_1polynomial-members.html b/doc/html/structnonlin__polynomials_1_1polynomial-members.html
index a64ca0f..988a718 100644
--- a/doc/html/structnonlin__polynomials_1_1polynomial-members.html
+++ b/doc/html/structnonlin__polynomials_1_1polynomial-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -116,7 +116,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__polynomials_1_1polynomial.html b/doc/html/structnonlin__polynomials_1_1polynomial.html
index e7ce8dc..7e974a2 100644
--- a/doc/html/structnonlin__polynomials_1_1polynomial.html
+++ b/doc/html/structnonlin__polynomials_1_1polynomial.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_polynomials::polynomial Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -170,7 +170,7 @@
 
 <p class="definition">Definition at line <a class="el" href="nonlin__polynomials_8f90_source.html#l00060">60</a> of file <a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a>.</p>
 </div><hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__polynomials_8f90_source.html">nonlin_polynomials.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -180,7 +180,7 @@
     <li class="navelem"><a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></li><li class="navelem"><a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1brent__solver-members.html b/doc/html/structnonlin__solve_1_1brent__solver-members.html
index 1bed6a4..aa7beda 100644
--- a/doc/html/structnonlin__solve_1_1brent__solver-members.html
+++ b/doc/html/structnonlin__solve_1_1brent__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -99,12 +99,17 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">get_max_fcn_evals</a>=&gt; es1_get_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda">get_print_status</a>=&gt; es1_get_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89">get_var_tolerance</a>=&gt; es1_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">set_diff_tolerance</a>=&gt; es1_set_diff_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">set_fcn_tolerance</a>=&gt; es1_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">set_max_fcn_evals</a>=&gt; es1_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">set_print_status</a>=&gt; es1_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">set_var_tolerance</a>=&gt; es1_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">solve</a>=&gt; brent_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1brent__solver.html">nonlin_solve::brent_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4">m_difftol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">set_diff_tolerance</a>=&gt; es1_set_diff_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">set_fcn_tolerance</a>=&gt; es1_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">set_max_fcn_evals</a>=&gt; es1_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">set_print_status</a>=&gt; es1_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">set_var_tolerance</a>=&gt; es1_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">solve</a>=&gt; brent_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1brent__solver.html">nonlin_solve::brent_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -112,7 +117,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1brent__solver.html b/doc/html/structnonlin__solve_1_1brent__solver.html
index 30d2b84..5e043de 100644
--- a/doc/html/structnonlin__solve_1_1brent__solver.html
+++ b/doc/html/structnonlin__solve_1_1brent__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve::brent_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -103,14 +103,14 @@
  <div class="center">
   <img src="structnonlin__solve_1_1brent__solver.png" usemap="#nonlin_5Fsolve::brent_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fsolve::brent_5Fsolver_map" name="nonlin_5Fsolve::brent_5Fsolver_map">
-<area href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. " alt="nonlin_core::equation_solver_1var" shape="rect" coords="0,0,207,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable." alt="nonlin_core::equation_solver_1var" shape="rect" coords="0,0,207,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ae0b53fae4650d837a5c151f0f8f55277"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">solve</a> =&gt; brent_solve</td></tr>
-<tr class="memdesc:ae0b53fae4650d837a5c151f0f8f55277"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="#ae0b53fae4650d837a5c151f0f8f55277">More...</a><br /></td></tr>
+<tr class="memdesc:ae0b53fae4650d837a5c151f0f8f55277"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277">More...</a><br /></td></tr>
 <tr class="separator:ae0b53fae4650d837a5c151f0f8f55277"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__core_1_1equation__solver__1var"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__core_1_1equation__solver__1var')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td></tr>
 <tr class="memitem:a6ea37e230a439181905b883a3030709e inherit pub_methods_structnonlin__core_1_1equation__solver__1var"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">get_max_fcn_evals</a> =&gt; es1_get_max_eval</td></tr>
@@ -168,7 +168,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
 </div><div class="memdoc">
 
 <p>Solves the equation. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(brent_solver) this, class(fcn1var_helper) fcn, real(real64) x, type(value_pair) lim, optional real(real64) f, optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(brent_solver) this, class(fcn1var_helper) fcn, real(real64) x, type(value_pair) lim, optional real(real64) f, optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1brent__solver.html" title="Defines a solver based upon Brent&#39;s method for solving an equation of one variable without using deri...">brent_solver</a> object. </td></tr>
@@ -186,7 +187,41 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve an equation of one variable using Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>, <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>, <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></div><div class="line"></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line"></div><div class="line">    <span class="comment">! Define the solution limits</span></div><div class="line">    limits%x1 = 1.5d0</div><div class="line">    limits%x2 = 5.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Define the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual:</span></div><div class="line">    print <span class="stringliteral">&#39;(AF5.3)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! f(x) = sin(x) / x, SOLUTION: x = n * pi for n = 1, 2, 3, ...</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = sin(x) / x</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: 3.142</div><div class="line">The residual: -.751E-11</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve an equation of one variable using Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>, <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>, <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(brent_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the solution limits</span></div>
+<div class="line">    limits%x1 = 1.5d0</div>
+<div class="line">    limits%x2 = 5.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual:</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF5.3)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE9.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! f(x) = sin(x) / x, SOLUTION: x = n * pi for n = 1, 2, 3, ...</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = sin(x) / x</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: 3.142</div>
+<div class="line">The residual: -.751E-11</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li><a href="https://en.wikipedia.org/wiki/Brent%27s_method">Wikipedia</a></li>
 <li><a href="http://numerical.recipes/">Numerical Recipes</a></li>
@@ -199,17 +234,23 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1fcn1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcn1var.html">nonlin_core::fcn1var</a></div><div class="ttdoc">Describes a function of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00198">nonlin_core.f90:198</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1brent__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1brent__solver.html">nonlin_solve::brent_solver</a></div><div class="ttdoc">Defines a solver based upon Brent's method for solving an equation of one variable without using deri...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00398">nonlin_solve.f90:398</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li><li class="navelem"><a class="el" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1line__search__solver-members.html b/doc/html/structnonlin__solve_1_1line__search__solver-members.html
index f3babdf..38b5003 100644
--- a/doc/html/structnonlin__solve_1_1line__search__solver-members.html
+++ b/doc/html/structnonlin__solve_1_1line__search__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,17 +102,22 @@
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">get_use_line_search</a>=&gt; lss_get_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">get_var_tolerance</a>=&gt; es_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">is_line_search_defined</a>=&gt; lss_is_line_search_defined</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c">m_gtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882">m_linesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391">solve</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391">solve</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -120,7 +125,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1line__search__solver.html b/doc/html/structnonlin__solve_1_1line__search__solver.html
index f88ea24..17e017d 100644
--- a/doc/html/structnonlin__solve_1_1line__search__solver.html
+++ b/doc/html/structnonlin__solve_1_1line__search__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve::line_search_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,31 +104,31 @@
  <div class="center">
   <img src="structnonlin__solve_1_1line__search__solver.png" usemap="#nonlin_5Fsolve::line_5Fsearch_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fsolve::line_5Fsearch_5Fsolver_map" name="nonlin_5Fsolve::line_5Fsearch_5Fsolver_map">
-<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. " alt="nonlin_core::equation_solver" shape="rect" coords="108,0,315,24"/>
-<area href="structnonlin__solve_1_1newton__solver.html" title="Defines a Newton solver. " alt="nonlin_solve::newton_solver" shape="rect" coords="0,112,207,136"/>
-<area href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method. " alt="nonlin_solve::quasi_newton_solver" shape="rect" coords="217,112,424,136"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations." alt="nonlin_core::equation_solver" shape="rect" coords="108,0,315,24"/>
+<area href="structnonlin__solve_1_1newton__solver.html" title="Defines a Newton solver." alt="nonlin_solve::newton_solver" shape="rect" coords="0,112,207,136"/>
+<area href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method." alt="nonlin_solve::quasi_newton_solver" shape="rect" coords="217,112,424,136"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a678892aebd2d0546870f835543869e2a"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">get_line_search</a> =&gt; lss_get_line_search</td></tr>
-<tr class="memdesc:a678892aebd2d0546870f835543869e2a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the line search module.  <a href="#a678892aebd2d0546870f835543869e2a">More...</a><br /></td></tr>
+<tr class="memdesc:a678892aebd2d0546870f835543869e2a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the line search module.  <a href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">More...</a><br /></td></tr>
 <tr class="separator:a678892aebd2d0546870f835543869e2a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae4a930fc7a45357874c3914b29aed2e6"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a> =&gt; lss_set_line_search</td></tr>
-<tr class="memdesc:ae4a930fc7a45357874c3914b29aed2e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the line search module.  <a href="#ae4a930fc7a45357874c3914b29aed2e6">More...</a><br /></td></tr>
+<tr class="memdesc:ae4a930fc7a45357874c3914b29aed2e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the line search module.  <a href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">More...</a><br /></td></tr>
 <tr class="separator:ae4a930fc7a45357874c3914b29aed2e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae6bbc85235541c0424654666fed4e484"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a> =&gt; lss_set_default</td></tr>
-<tr class="memdesc:ae6bbc85235541c0424654666fed4e484"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a default line_search object for the line search module.  <a href="#ae6bbc85235541c0424654666fed4e484">More...</a><br /></td></tr>
+<tr class="memdesc:ae6bbc85235541c0424654666fed4e484"><td class="mdescLeft">&#160;</td><td class="mdescRight">Establishes a default line_search object for the line search module.  <a href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">More...</a><br /></td></tr>
 <tr class="separator:ae6bbc85235541c0424654666fed4e484"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac68b3490e95269ad587bbdc19f64e682"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">is_line_search_defined</a> =&gt; lss_is_line_search_defined</td></tr>
-<tr class="memdesc:ac68b3490e95269ad587bbdc19f64e682"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to see if a line search module is defined.  <a href="#ac68b3490e95269ad587bbdc19f64e682">More...</a><br /></td></tr>
+<tr class="memdesc:ac68b3490e95269ad587bbdc19f64e682"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to see if a line search module is defined.  <a href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">More...</a><br /></td></tr>
 <tr class="separator:ac68b3490e95269ad587bbdc19f64e682"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2cbc2bf7d5506d2b154bd88989a1f997"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">get_use_line_search</a> =&gt; lss_get_use_search</td></tr>
-<tr class="memdesc:a2cbc2bf7d5506d2b154bd88989a1f997"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a value determining if a line-search should be employed.  <a href="#a2cbc2bf7d5506d2b154bd88989a1f997">More...</a><br /></td></tr>
+<tr class="memdesc:a2cbc2bf7d5506d2b154bd88989a1f997"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a value determining if a line-search should be employed.  <a href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">More...</a><br /></td></tr>
 <tr class="separator:a2cbc2bf7d5506d2b154bd88989a1f997"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa763803528ad45d4ef3c8fd5f10b0285"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a> =&gt; lss_set_use_search</td></tr>
-<tr class="memdesc:aa763803528ad45d4ef3c8fd5f10b0285"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a value determining if a line-search should be employed.  <a href="#aa763803528ad45d4ef3c8fd5f10b0285">More...</a><br /></td></tr>
+<tr class="memdesc:aa763803528ad45d4ef3c8fd5f10b0285"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets a value determining if a line-search should be employed.  <a href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">More...</a><br /></td></tr>
 <tr class="separator:aa763803528ad45d4ef3c8fd5f10b0285"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__core_1_1equation__solver"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__core_1_1equation__solver')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td></tr>
 <tr class="memitem:a0670a9e7d0f8dc633526b1b97d7734c9 inherit pub_methods_structnonlin__core_1_1equation__solver"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9">get_max_fcn_evals</a> =&gt; es_get_max_eval</td></tr>
@@ -197,7 +197,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a678892aebd2d0546870f8355
 </div><div class="memdoc">
 
 <p>Gets the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>get_line_search(class(line_search_solver) this, class(line_search) ls)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>get_line_search(class(line_search_solver) this, class(line_search) ls)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -226,7 +227,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#a2cbc2bf7d5506d2b154bd889
 </div><div class="memdoc">
 
 <p>Gets a value determining if a line-search should be employed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>get_use_line_search(class(line_search_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>get_use_line_search(class(line_search_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -255,7 +257,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac68b3490e95269ad587bbdc1
 </div><div class="memdoc">
 
 <p>Tests to see if a line search module is defined. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure logical </span><span class="keyword">function </span>is_line_search_defined(class(line_search_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">logical </span><span class="keyword">function </span>is_line_search_defined(class(line_search_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -284,7 +287,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae6bbc85235541c0424654666
 </div><div class="memdoc">
 
 <p>Establishes a default line_search object for the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_default_line_search(class(line_search_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_default_line_search(class(line_search_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -312,7 +316,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae4a930fc7a45357874c3914b
 </div><div class="memdoc">
 
 <p>Sets the line search module. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_line_search(class(line_search_solver) this, class(line_search) ls)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_line_search(class(line_search_solver) this, class(line_search) ls)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -341,7 +346,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa763803528ad45d4ef3c8fd5
 </div><div class="memdoc">
 
 <p>Sets a value determining if a line-search should be employed. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_use_line_search(class(line_search_solver) this, logical x)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_use_line_search(class(line_search_solver) this, logical x)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior...">line_search_solver</a> object. </td></tr>
@@ -355,7 +361,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa763803528ad45d4ef3c8fd5
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
@@ -365,7 +371,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#aa763803528ad45d4ef3c8fd5
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li><li class="navelem"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1newton__1var__solver-members.html b/doc/html/structnonlin__solve_1_1newton__1var__solver-members.html
index 0f3a9ea..a01e6ee 100644
--- a/doc/html/structnonlin__solve_1_1newton__1var__solver-members.html
+++ b/doc/html/structnonlin__solve_1_1newton__1var__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -99,12 +99,17 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">get_max_fcn_evals</a>=&gt; es1_get_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda">get_print_status</a>=&gt; es1_get_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89">get_var_tolerance</a>=&gt; es1_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">set_diff_tolerance</a>=&gt; es1_set_diff_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">set_fcn_tolerance</a>=&gt; es1_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">set_max_fcn_evals</a>=&gt; es1_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">set_print_status</a>=&gt; es1_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">set_var_tolerance</a>=&gt; es1_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">solve</a>=&gt; newt1var_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">nonlin_solve::newton_1var_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4">m_difftol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20">set_diff_tolerance</a>=&gt; es1_set_diff_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2">set_fcn_tolerance</a>=&gt; es1_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240">set_max_fcn_evals</a>=&gt; es1_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0">set_print_status</a>=&gt; es1_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">set_var_tolerance</a>=&gt; es1_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">solve</a>=&gt; newt1var_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">nonlin_solve::newton_1var_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -112,7 +117,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1newton__1var__solver.html b/doc/html/structnonlin__solve_1_1newton__1var__solver.html
index 1d51ebb..3d25eff 100644
--- a/doc/html/structnonlin__solve_1_1newton__1var__solver.html
+++ b/doc/html/structnonlin__solve_1_1newton__1var__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve::newton_1var_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -103,14 +103,14 @@
  <div class="center">
   <img src="structnonlin__solve_1_1newton__1var__solver.png" usemap="#nonlin_5Fsolve::newton_5F1var_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fsolve::newton_5F1var_5Fsolver_map" name="nonlin_5Fsolve::newton_5F1var_5Fsolver_map">
-<area href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable. " alt="nonlin_core::equation_solver_1var" shape="rect" coords="0,0,207,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver__1var.html" title="A base class for various solvers of equations of one variable." alt="nonlin_core::equation_solver_1var" shape="rect" coords="0,0,207,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ae9b8ff1827b430a3cecc45a7fc539d95"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">solve</a> =&gt; newt1var_solve</td></tr>
-<tr class="memdesc:ae9b8ff1827b430a3cecc45a7fc539d95"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="#ae9b8ff1827b430a3cecc45a7fc539d95">More...</a><br /></td></tr>
+<tr class="memdesc:ae9b8ff1827b430a3cecc45a7fc539d95"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the equation.  <a href="structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95">More...</a><br /></td></tr>
 <tr class="separator:ae9b8ff1827b430a3cecc45a7fc539d95"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__core_1_1equation__solver__1var"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__core_1_1equation__solver__1var')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__core_1_1equation__solver__1var.html">nonlin_core::equation_solver_1var</a></td></tr>
 <tr class="memitem:a6ea37e230a439181905b883a3030709e inherit pub_methods_structnonlin__core_1_1equation__solver__1var"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e">get_max_fcn_evals</a> =&gt; es1_get_max_eval</td></tr>
@@ -168,7 +168,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae9b8ff1827b430a3cecc45a7
 </div><div class="memdoc">
 
 <p>Solves the equation. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(newton_1var_solver) this, class(fcn1var_helper) fcn, real(real64) x, type(value_pair) lim, optional real(real64) f, optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(newton_1var_solver) this, class(fcn1var_helper) fcn, real(real64) x, type(value_pair) lim, optional real(real64) f, optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1brent__solver.html" title="Defines a solver based upon Brent&#39;s method for solving an equation of one variable without using deri...">brent_solver</a> object. </td></tr>
@@ -186,24 +187,78 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae9b8ff1827b430a3cecc45a7
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd><div class="fragment"><div class="line"><span class="keyword">program</span> example</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="line">    <span class="keywordtype">implicit none</span></div><div class="line"></div><div class="line">    <span class="comment">! Local variables</span></div><div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_1var_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x, f</div><div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div><div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div><div class="line"></div><div class="line">    <span class="comment">! Define the search limits</span></div><div class="line">    limits%x1 = 1.5d0</div><div class="line">    limits%x2 = 5.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Establish the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the equation</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual</span></div><div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div><div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, tracking%iter_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div><div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Derivative Evaluations: &quot;</span>, tracking%jacobian_count</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div><div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Derivative: &quot;</span>, tracking%converge_on_zero_diff</div><div class="line"></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! The function:</span></div><div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = n * pi for n = 1, 2, 3, ...</span></div><div class="line"><span class="keyword">    function </span>fcn1(x) <span class="keyword">result</span>(f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span> :: f</div><div class="line">        f = sin(x) / x</div><div class="line"><span class="keyword">    end function</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div><div class="line">The residual:  0.314E-11</div><div class="line">Iterations: 3</div><div class="line">Function Evaluations: 7</div><div class="line">Derivative Evaluations: 4</div><div class="line">Converge on Function Value: T</div><div class="line">Converge on Change in Variable: F</div><div class="line">Converge on Derivative: F</div></div><!-- fragment --> </dd></dl>
+<dl class="section user"><dt>Example</dt><dd><div class="fragment"><div class="line"><span class="keyword">program</span> example</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line">    <span class="keywordtype">implicit none</span></div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Local variables</span></div>
+<div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_1var_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x, f</div>
+<div class="line">    <span class="keywordtype">type</span>(value_pair) :: limits</div>
+<div class="line">    <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the search limits</span></div>
+<div class="line">    limits%x1 = 1.5d0</div>
+<div class="line">    limits%x2 = 5.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Establish the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the equation</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF7.5)&#39;</span>, <span class="stringliteral">&quot;The solution: &quot;</span>, x</div>
+<div class="line">    print <span class="stringliteral">&#39;(AE10.3)&#39;</span>, <span class="stringliteral">&quot;The residual: &quot;</span>, f</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Iterations: &quot;</span>, tracking%iter_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Function Evaluations: &quot;</span>, tracking%fcn_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AI0)&#39;</span>, <span class="stringliteral">&quot;Derivative Evaluations: &quot;</span>, tracking%jacobian_count</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Function Value: &quot;</span>, tracking%converge_on_fcn</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Change in Variable: &quot;</span>, tracking%converge_on_chng</div>
+<div class="line">    print <span class="stringliteral">&#39;(AL1)&#39;</span>, <span class="stringliteral">&quot;Converge on Derivative: &quot;</span>, tracking%converge_on_zero_diff</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! The function:</span></div>
+<div class="line">    <span class="comment">! f(x) = sin(x) / x, solution: x = n * pi for n = 1, 2, 3, ...</span></div>
+<div class="line">    <span class="keyword">function </span>fcn1(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64) :: f</div>
+<div class="line">        f = sin(x) / x</div>
+<div class="line">    <span class="keyword">end function</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program produces the following output. <div class="fragment"><div class="line">The solution: 3.14159</div>
+<div class="line">The residual:  0.314E-11</div>
+<div class="line">Iterations: 3</div>
+<div class="line">Function Evaluations: 7</div>
+<div class="line">Derivative Evaluations: 4</div>
+<div class="line">Converge on Function Value: T</div>
+<div class="line">Converge on Change in Variable: F</div>
+<div class="line">Converge on Derivative: F</div>
+</div><!-- fragment --> </dd></dl>
 
 <p class="definition">Definition at line <a class="el" href="nonlin__solve_8f90_source.html#l00591">591</a> of file <a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li><li class="navelem"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1newton__solver-members.html b/doc/html/structnonlin__solve_1_1newton__solver-members.html
index 7ec3718..6f74ccf 100644
--- a/doc/html/structnonlin__solve_1_1newton__solver-members.html
+++ b/doc/html/structnonlin__solve_1_1newton__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -102,15 +102,22 @@
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">get_use_line_search</a>=&gt; lss_get_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">get_var_tolerance</a>=&gt; es_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">is_line_search_defined</a>=&gt; lss_is_line_search_defined</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">solve</a>=&gt; ns_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__solver.html">nonlin_solve::newton_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c">m_gtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882">m_linesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">solve</a>=&gt; ns_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1newton__solver.html">nonlin_solve::newton_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -118,7 +125,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1newton__solver.html b/doc/html/structnonlin__solve_1_1newton__solver.html
index 36db14f..5f08073 100644
--- a/doc/html/structnonlin__solve_1_1newton__solver.html
+++ b/doc/html/structnonlin__solve_1_1newton__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve::newton_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -104,14 +104,14 @@
   <img src="structnonlin__solve_1_1newton__solver.png" usemap="#nonlin_5Fsolve::newton_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fsolve::newton_5Fsolver_map" name="nonlin_5Fsolve::newton_5Fsolver_map">
 <area href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior..." alt="nonlin_solve::line_search_solver" shape="rect" coords="0,56,197,80"/>
-<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. " alt="nonlin_core::equation_solver" shape="rect" coords="0,0,197,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations." alt="nonlin_core::equation_solver" shape="rect" coords="0,0,197,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ac4d7e04ecc17efa5a899d1b4d526ae66"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">solve</a> =&gt; ns_solve</td></tr>
-<tr class="memdesc:ac4d7e04ecc17efa5a899d1b4d526ae66"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies Newton's method in conjunction with a backtracking type line search to solve N equations of N unknowns.  <a href="#ac4d7e04ecc17efa5a899d1b4d526ae66">More...</a><br /></td></tr>
+<tr class="memdesc:ac4d7e04ecc17efa5a899d1b4d526ae66"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies Newton's method in conjunction with a backtracking type line search to solve N equations of N unknowns.  <a href="structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66">More...</a><br /></td></tr>
 <tr class="separator:ac4d7e04ecc17efa5a899d1b4d526ae66"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__solve_1_1line__search__solver"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__solve_1_1line__search__solver')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td></tr>
 <tr class="memitem:a678892aebd2d0546870f835543869e2a inherit pub_methods_structnonlin__solve_1_1line__search__solver"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">get_line_search</a> =&gt; lss_get_line_search</td></tr>
@@ -188,7 +188,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac4d7e04ecc17efa5a899d1b4
 </div><div class="memdoc">
 
 <p>Applies Newton's method in conjunction with a backtracking type line search to solve N equations of N unknowns. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(newton_solver) this, class(vecfcn_helper) fcn, real(real64) x(:), real(real64) fvec(:), optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(newton_solver) this, class(vecfcn_helper) fcn, real(real64) x(:), real(real64) fvec(:), optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The equation_solver-based object. </td></tr>
@@ -209,7 +210,47 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac4d7e04ecc17efa5a899d1b4
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using Newton's method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a></div><div class="line"></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div><div class="line">    x = 1.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Define the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual:</span></div><div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! System of Equations:</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! Solution:</span></div><div class="line">    <span class="comment">! x = +/-5</span></div><div class="line">    <span class="comment">! y = +/-3</span></div><div class="line"><span class="keyword">    subroutine </span>fcn1(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div><div class="line">The residual: (.000E+00, .000E+00)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using Newton's method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div>
+<div class="line">    x = 1.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual:</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! System of Equations:</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! Solution:</span></div>
+<div class="line">    <span class="comment">! x = +/-5</span></div>
+<div class="line">    <span class="comment">! y = +/-3</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcn1(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div>
+<div class="line">The residual: (.000E+00, .000E+00)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li><a href="https://en.wikipedia.org/wiki/Newton%27s_method">Wikipedia</a> </li>
 </ul>
@@ -220,17 +261,22 @@ <h2 class="memtitle"><span class="permalink"><a href="#ac4d7e04ecc17efa5a899d1b4
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1newton__solver.html">nonlin_solve::newton_solver</a></div><div class="ttdoc">Defines a Newton solver.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00287">nonlin_solve.f90:287</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li><li class="navelem"><a class="el" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1quasi__newton__solver-members.html b/doc/html/structnonlin__solve_1_1quasi__newton__solver-members.html
index 5ec0bcd..14e2324 100644
--- a/doc/html/structnonlin__solve_1_1quasi__newton__solver-members.html
+++ b/doc/html/structnonlin__solve_1_1quasi__newton__solver-members.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: Member List</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -103,17 +103,24 @@
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997">get_use_line_search</a>=&gt; lss_get_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05">get_var_tolerance</a>=&gt; es_get_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682">is_line_search_defined</a>=&gt; lss_is_line_search_defined</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae">m_fcntol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c">m_gtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
   <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8">m_jdelta</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">set_jacobian_interval</a>=&gt; qns_set_jac_interval</td><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
-  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">solve</a>=&gt; qns_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882">m_linesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04">m_maxeval</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6">m_printstatus</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf">m_uselinesearch</a></td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2">m_xtol</a></td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484">set_default_line_search</a>=&gt; lss_set_default</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50">set_fcn_tolerance</a>=&gt; es_set_fcn_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797">set_gradient_tolerance</a>=&gt; es_set_grad_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">set_jacobian_interval</a>=&gt; qns_set_jac_interval</td><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6">set_line_search</a>=&gt; lss_set_line_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599">set_max_fcn_evals</a>=&gt; es_set_max_eval</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5">set_print_status</a>=&gt; es_set_print_status</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285">set_use_line_search</a>=&gt; lss_set_use_search</td><td class="entry"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d">set_var_tolerance</a>=&gt; es_set_var_tol</td><td class="entry"><a class="el" href="structnonlin__core_1_1equation__solver.html">nonlin_core::equation_solver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">solve</a>=&gt; qns_solve</td><td class="entry"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
@@ -121,7 +128,7 @@
   <ul>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/structnonlin__solve_1_1quasi__newton__solver.html b/doc/html/structnonlin__solve_1_1quasi__newton__solver.html
index 02b087c..04a2224 100644
--- a/doc/html/structnonlin__solve_1_1quasi__newton__solver.html
+++ b/doc/html/structnonlin__solve_1_1quasi__newton__solver.html
@@ -1,9 +1,9 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.14"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
 <title>nonlin: nonlin_solve::quasi_newton_solver Type Reference</title>
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,7 +30,7 @@
  <tr style="height: 56px;">
   <td id="projectalign" style="padding-left: 0.5em;">
    <div id="projectname">nonlin
-   &#160;<span id="projectnumber">1.3.0</span>
+   &#160;<span id="projectnumber">1.4.0</span>
    </div>
    <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
   </td>
@@ -39,7 +39,7 @@
 </table>
 </div>
 <!-- end header part -->
-<!-- Generated by Doxygen 1.8.14 -->
+<!-- Generated by Doxygen 1.8.16 -->
 <script type="text/javascript">
 /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
 var searchBox = new SearchBox("searchBox", "search",false,'Search');
@@ -105,20 +105,20 @@
   <img src="structnonlin__solve_1_1quasi__newton__solver.png" usemap="#nonlin_5Fsolve::quasi_5Fnewton_5Fsolver_map" alt=""/>
   <map id="nonlin_5Fsolve::quasi_5Fnewton_5Fsolver_map" name="nonlin_5Fsolve::quasi_5Fnewton_5Fsolver_map">
 <area href="structnonlin__solve_1_1line__search__solver.html" title="A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior..." alt="nonlin_solve::line_search_solver" shape="rect" coords="0,56,207,80"/>
-<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations. " alt="nonlin_core::equation_solver" shape="rect" coords="0,0,207,24"/>
-</map>
- </div></div>
+<area href="structnonlin__core_1_1equation__solver.html" title="A base class for various solvers of nonlinear systems of equations." alt="nonlin_core::equation_solver" shape="rect" coords="0,0,207,24"/>
+  </map>
+</div></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ae0ff1edb9fde695a5cd131d81206f5cf"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">solve</a> =&gt; qns_solve</td></tr>
-<tr class="memdesc:ae0ff1edb9fde695a5cd131d81206f5cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies the quasi-Newton's method developed by Broyden in conjunction with a backtracking type line search to solve N equations of N unknowns.  <a href="#ae0ff1edb9fde695a5cd131d81206f5cf">More...</a><br /></td></tr>
+<tr class="memdesc:ae0ff1edb9fde695a5cd131d81206f5cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Applies the quasi-Newton's method developed by Broyden in conjunction with a backtracking type line search to solve N equations of N unknowns.  <a href="structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf">More...</a><br /></td></tr>
 <tr class="separator:ae0ff1edb9fde695a5cd131d81206f5cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae0d32f09d93bfdad656b89c80c91e4d3"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3">get_jacobian_interval</a> =&gt; qns_get_jac_interval</td></tr>
-<tr class="memdesc:ae0d32f09d93bfdad656b89c80c91e4d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix.  <a href="#ae0d32f09d93bfdad656b89c80c91e4d3">More...</a><br /></td></tr>
+<tr class="memdesc:ae0d32f09d93bfdad656b89c80c91e4d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix.  <a href="structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3">More...</a><br /></td></tr>
 <tr class="separator:ae0d32f09d93bfdad656b89c80c91e4d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afd5db9ab1b89be832013b26ebf53abe7"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">set_jacobian_interval</a> =&gt; qns_set_jac_interval</td></tr>
-<tr class="memdesc:afd5db9ab1b89be832013b26ebf53abe7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix.  <a href="#afd5db9ab1b89be832013b26ebf53abe7">More...</a><br /></td></tr>
+<tr class="memdesc:afd5db9ab1b89be832013b26ebf53abe7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix.  <a href="structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7">More...</a><br /></td></tr>
 <tr class="separator:afd5db9ab1b89be832013b26ebf53abe7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_structnonlin__solve_1_1line__search__solver"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_structnonlin__solve_1_1line__search__solver')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="structnonlin__solve_1_1line__search__solver.html">nonlin_solve::line_search_solver</a></td></tr>
 <tr class="memitem:a678892aebd2d0546870f835543869e2a inherit pub_methods_structnonlin__solve_1_1line__search__solver"><td class="memItemLeft" align="right" valign="top">procedure, public&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a">get_line_search</a> =&gt; lss_get_line_search</td></tr>
@@ -202,10 +202,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0d32f09d93bfdad656b89c8
 </div><div class="memdoc">
 
 <p>Gets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">pure integer(int32) </span><span class="keyword">function </span>get_jacobian_interval(class(quasi_newton_solver) this)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keywordtype">pure</span> <span class="keyword">integer(int32) </span><span class="keyword">function </span>get_jacobian_interval(class(quasi_newton_solver) this)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method. ">quasi_newton_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method.">quasi_newton_solver</a> object. </td></tr>
   </table>
   </dd>
 </dl>
@@ -231,10 +232,11 @@ <h2 class="memtitle"><span class="permalink"><a href="#afd5db9ab1b89be832013b26e
 </div><div class="memdoc">
 
 <p>Sets the number of iterations that may pass before forcing a recalculation of the Jacobian matrix. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_jacobian_interval(class(quasi_newton_solver) this, integer(int32) n)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>set_jacobian_interval(class(quasi_newton_solver) this, integer(int32) n)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method. ">quasi_newton_solver</a> object. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" title="Defines a quasi-Newton type solver based upon Broyden&#39;s method.">quasi_newton_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of iterations. </td></tr>
   </table>
   </dd>
@@ -260,7 +262,8 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0ff1edb9fde695a5cd131d8
 </div><div class="memdoc">
 
 <p>Applies the quasi-Newton's method developed by Broyden in conjunction with a backtracking type line search to solve N equations of N unknowns. </p>
-<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(quasi_newton_solver) this, class(vecfcn_helper) fcn, real(real64) x(:), real(real64) fvec(:), optional type(iteration_behavior) ib, optional class(errors) err)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Syntax</dt><dd><div class="fragment"><div class="line"><span class="keyword">subroutine </span>solve(class(quasi_newton_solver) this, class(vecfcn_helper) fcn, real(real64) x(:), real(real64) fvec(:), optional type(iteration_behavior) ib, optional class(errors) err)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The equation_solver-based object. </td></tr>
@@ -281,7 +284,48 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0ff1edb9fde695a5cd131d8
   </table>
   </dd>
 </dl>
-<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using this Quasi-Newton method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div><div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div><div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a></div><div class="line"></div><div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div><div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div><div class="line">    <span class="keywordtype">type</span>(quasi_newton_solver) :: solver</div><div class="line">    <span class="keywordtype">real(real64)</span> :: x(2), f(2)</div><div class="line"></div><div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div><div class="line">    x = 1.0d0</div><div class="line"></div><div class="line">    <span class="comment">! Define the function</span></div><div class="line">    fcn =&gt; fcn1</div><div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div><div class="line"></div><div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div><div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div><div class="line"></div><div class="line">    <span class="comment">! Print the output and the residual:</span></div><div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div><div class="line"><span class="keyword">contains</span></div><div class="line">    <span class="comment">! System of Equations:</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div><div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div><div class="line">    <span class="comment">!</span></div><div class="line">    <span class="comment">! Solution:</span></div><div class="line">    <span class="comment">! x = +/-5</span></div><div class="line">    <span class="comment">! y = +/-3</span></div><div class="line"><span class="keyword">    subroutine </span>fcn1(x, f)</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div><div class="line">        <span class="keywordtype">real(real64)</span>, <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div><div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div><div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div><div class="line"><span class="keyword">    end subroutine</span></div><div class="line"><span class="keyword">end program</span></div></div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div><div class="line">The residual: (.604E-10, .121E-09)</div></div><!-- fragment --></dd></dl>
+<dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve a system of N equations of N unknonwns using this Quasi-Newton method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div>
+<div class="line">    <span class="keywordtype">use </span>iso_fortran_env</div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a>, <a class="code" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a></div>
+<div class="line"> </div>
+<div class="line">    <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line">    <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fcn</div>
+<div class="line">    <span class="keywordtype">type</span>(quasi_newton_solver) :: solver</div>
+<div class="line"><span class="keywordtype">    real</span>(real64) :: x(2), f(2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Set the initial conditions to [1, 1]</span></div>
+<div class="line">    x = 1.0d0</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Define the function</span></div>
+<div class="line">    fcn =&gt; fcn1</div>
+<div class="line">    <span class="keyword">call </span>obj%set_fcn(fcn, 2, 2)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Solve the system of equations.  The solution overwrites X</span></div>
+<div class="line">    <span class="keyword">call </span>solver%solve(obj, x, f)</div>
+<div class="line"> </div>
+<div class="line">    <span class="comment">! Print the output and the residual:</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AF5.3AF5.3A)&#39;</span>, <span class="stringliteral">&quot;The solution: (&quot;</span>, x(1), <span class="stringliteral">&quot;, &quot;</span>, x(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line">    print <span class="stringliteral">&#39;(AE8.3AE8.3A)&#39;</span>, <span class="stringliteral">&quot;The residual: (&quot;</span>, f(1), <span class="stringliteral">&quot;, &quot;</span>, f(2), <span class="stringliteral">&quot;)&quot;</span></div>
+<div class="line"><span class="keyword">contains</span></div>
+<div class="line">    <span class="comment">! System of Equations:</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! x**2 + y**2 = 34</span></div>
+<div class="line">    <span class="comment">! x**2 - 2 * y**2 = 7</span></div>
+<div class="line">    <span class="comment">!</span></div>
+<div class="line">    <span class="comment">! Solution:</span></div>
+<div class="line">    <span class="comment">! x = +/-5</span></div>
+<div class="line">    <span class="comment">! y = +/-3</span></div>
+<div class="line">    <span class="keyword">subroutine </span>fcn1(x, f)</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: x</div>
+<div class="line"><span class="keywordtype">        real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: f</div>
+<div class="line">        f(1) = x(1)**2 + x(2)**2 - 34.0d0</div>
+<div class="line">        f(2) = x(1)**2 - 2.0d0 * x(2)**2 - 7.0d0</div>
+<div class="line">    <span class="keyword">end subroutine</span></div>
+<div class="line"><span class="keyword">end program</span></div>
+</div><!-- fragment --> The above program returns the following results. <div class="fragment"><div class="line">The solution: (5.000, 3.000)</div>
+<div class="line">The residual: (.604E-10, .121E-09)</div>
+</div><!-- fragment --></dd></dl>
 <dl class="section user"><dt>See Also</dt><dd><ul>
 <li><a href="http://www.ams.org/journals/mcom/1965-19-092/S0025-5718-1965-0198670-6/S0025-5718-1965-0198670-6.pdf">Broyden's Paper</a></li>
 <li><a href="https://en.wikipedia.org/wiki/Broyden%27s_method">Wikipedia</a></li>
@@ -294,17 +338,22 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0ff1edb9fde695a5cd131d8
 </div>
 </div>
 <hr/>The documentation for this type was generated from the following file:<ul>
-<li>D:/Projects/Code/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__solve_8f90_source.html">nonlin_solve.f90</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="astructnonlin__solve_1_1quasi__newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></div><div class="ttdoc">Defines a quasi-Newton type solver based upon Broyden's method.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00139">nonlin_solve.f90:139</a></div></div>
+<div class="ttc" id="ainterfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
+<div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
+<div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
     <li class="navelem"><a class="el" href="namespacenonlin__solve.html">nonlin_solve</a></li><li class="navelem"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a></li>
     <li class="footer">Generated by
     <a href="http://www.doxygen.org/index.html">
-    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.14 </li>
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
   </ul>
 </div>
 </body>
diff --git a/doc/html/tabs.css b/doc/html/tabs.css
index a28614b..85a0cd5 100644
--- a/doc/html/tabs.css
+++ b/doc/html/tabs.css
@@ -1 +1 @@
-.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}#doc-content{overflow:auto;display:block;padding:0;margin:0;-webkit-overflow-scrolling:touch}.sm-dox{background-image:url("tab_b.png")}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:"Lucida Grande","Geneva","Helvetica",Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0 1px 1px rgba(255,255,255,0.9);color:#283a5d;outline:0}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace!important;text-align:center;text-shadow:none;background:rgba(255,255,255,0.5);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:rgba(162,162,162,0.1)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url("tab_b.png");line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283a5d transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:url("tab_s.png");background-repeat:no-repeat;background-position:right;-moz-border-radius:0!important;-webkit-border-radius:0;border-radius:0!important}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a:hover span.sub-arrow{border-color:white transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent #fff transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:#fff;-moz-border-radius:5px!important;-webkit-border-radius:5px;border-radius:5px!important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555;background-image:none;border:0!important;color:#555;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent white}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:#fff;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px!important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url("tab_b.png")}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:#fff}}
\ No newline at end of file
+.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.sm-dox{background-image:url("tab_b.png")}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:"Lucida Grande","Geneva","Helvetica",Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0 1px 1px rgba(255,255,255,0.9);color:#283a5d;outline:0}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace!important;text-align:center;text-shadow:none;background:rgba(255,255,255,0.5);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:rgba(162,162,162,0.1)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url("tab_b.png");line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283a5d transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:url("tab_s.png");background-repeat:no-repeat;background-position:right;-moz-border-radius:0!important;-webkit-border-radius:0;border-radius:0!important}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a:hover span.sub-arrow{border-color:white transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent #fff transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:#fff;-moz-border-radius:5px!important;-webkit-border-radius:5px;border-radius:5px!important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555;background-image:none;border:0!important;color:#555;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent white}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:#fff;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px!important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url("tab_b.png")}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:#fff}}
\ No newline at end of file

From 05e76caff1ff1ebecb20449846ee8cd10a15f670 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 05:15:38 -0500
Subject: [PATCH 11/23] Clean up

---
 .travis.yml | 64 -----------------------------------------------------
 1 file changed, 64 deletions(-)

diff --git a/.travis.yml b/.travis.yml
index 4c1e147..47fb41e 100644
--- a/.travis.yml
+++ b/.travis.yml
@@ -6,46 +6,6 @@ before_install:
   - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test
   - sudo apt-get update -qq
 
-# the install step will take care of deploying a newer cmake version
-# FROM: https://riptutorial.com/cmake/example/4723/configure-travis-ci-with-newest-cmake
-# install:    
-#   # first we create a directory for the CMake binaries
-#   - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
-#   - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
-#   # we use wget to fetch the cmake binaries
-#   - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.3.2-Linux-x86_64.tar.gz
-#   # this is optional, but useful:
-#   # do a quick md5 check to ensure that the archive we downloaded did not get compromised
-#   - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.3.2-Linux-x86_64.tar.gz" > cmake_md5.txt
-#   - md5sum -c cmake_md5.txt
-#   # extract the binaries; the output here is quite lengthy,
-#   # so we swallow it to not clutter up the travis console
-#   - tar -xvf cmake-3.3.2-Linux-x86_64.tar.gz > /dev/null
-#   - mv cmake-3.3.2-Linux-x86_64 cmake-install
-#   # add both the top-level directory and the bin directory from the archive
-#   # to the system PATH. By adding it to the front of the path we hide the
-#   # preinstalled CMake with our own.
-#   - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
-#   # don't forget to switch back to the main build directory once you are done
-#   - cd ${TRAVIS_BUILD_DIR}
-
-# before_script:
-#   # create a build folder for the out-of-source build
-#   - mkdir build
-#   # switch to build directory
-#   - cd build
-#   # run cmake; here we assume that the project's
-#   # top-level CMakeLists.txt is located at '..'
-#   - cmake ..
-
-# script:
-#   # once CMake has done its job we just build using make as usual
-#   - make
-#   # if the project uses ctest we can run the tests like this
-#   - make test
-
-# ALSO CHECK: https://github.com/gujans/travis-gtest-cmake-example/blob/master/.travis.yml
-
 install:
   # Install gfortran
   - sudo apt-get install -qq gfortran-7
@@ -69,30 +29,6 @@ install:
   - popd
   - popd
 
-# # CMAKE STUFF
-#   # first we create a directory for the CMake binaries
-#   - DEPS_DIR="${TRAVIS_BUILD_DIR}/deps"
-#   - mkdir ${DEPS_DIR} && cd ${DEPS_DIR}
-#   # we use wget to fetch the cmake binaries
-#   - travis_retry wget --no-check-certificate https://cmake.org/files/v3.3/cmake-3.7.0-Linux-x86_64.tar.gz
-#   # this is optional, but useful:
-#   # do a quick md5 check to ensure that the archive we downloaded did not get compromised
-#   - echo "f3546812c11ce7f5d64dc132a566b749 *cmake-3.7.0-Linux-x86_64.tar.gz" > cmake_md5.txt
-#   - md5sum -c cmake_md5.txt
-#   # extract the binaries; the output here is quite lengthy,
-#   # so we swallow it to not clutter up the travis console
-#   - tar -xvf cmake-3.7.0-Linux-x86_64.tar.gz > /dev/null
-#   - mv cmake-3.7.0-Linux-x86_64 cmake-install
-#   # add both the top-level directory and the bin directory from the archive
-#   # to the system PATH. By adding it to the front of the path we hide the
-#   # preinstalled CMake with our own.
-#   - PATH=${DEPS_DIR}/cmake-install:${DEPS_DIR}/cmake-install/bin:$PATH
-#   # don't forget to switch back to the main build directory once you are done
-#   - cd ${TRAVIS_BUILD_DIR}
-# # END CMAKE STUFF
-
-  # - sudo apt install cmake
-
   # Download and install LAPACK
   - sudo git clone https://github.com/Reference-LAPACK/lapack.git
   - pushd lapack

From 3a02014143af8f9501ec29bee0c7b512867ccb68 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 05:16:23 -0500
Subject: [PATCH 12/23] Clean up

---
 CMakeLists.txt | 13 -------------
 1 file changed, 13 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index c512fdb..9a9290b 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -84,19 +84,9 @@ else (Fortran_COMPILER_NAME MATCHES "gfortran.*")
 endif ()
 
 # Locate Dependencies
-# find_package(BLAS)
-# find_package(LAPACK)
 find_package(ferror 1.3.0)
 find_package(linalg 1.6.0)
 
-# if (BLAS_FOUND)
-#   message(STATUS "BLAS library found.")
-# endif()
-
-# if (LAPACK_FOUND)
-#   message(STATUS "LAPACK library found.")
-# endif()
-
 if (ferror_FOUND)
   message(STATUS "FERROR library found.")
   set(ferror_LIBRARIES ferror)
@@ -107,9 +97,6 @@ if (linalg_FOUND)
     set(linalg_LIBRARIES linalg)
 endif()
 
-# Include the dependency module files
-# include_directories(${linalg_INCLUDE_DIRS} ${ferror_INCLUDE_DIRS})
-
 # Locate the source directory
 add_subdirectory(src)
 

From 17585541453ff2724bc4b10ac069beb553de2267 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 06:12:56 -0500
Subject: [PATCH 13/23] Add C API

---
 include/nonlin.h         | 111 ++++++++++++++++++++++++++++++
 src/nonlin_c_api.f90     | 142 +++++++++++++++++++++++++++++++++++++++
 src/nonlin_constants.f90 |   2 +
 src/nonlin_core.f90      |   2 +-
 4 files changed, 256 insertions(+), 1 deletion(-)
 create mode 100644 include/nonlin.h

diff --git a/include/nonlin.h b/include/nonlin.h
new file mode 100644
index 0000000..53a3db9
--- /dev/null
+++ b/include/nonlin.h
@@ -0,0 +1,111 @@
+#ifndef NONLIN_H_
+#define NONLIN_H_
+
+#include <stdbool.h>
+
+/** A type for providing a set of iteration control parameters. */
+typedef struct {
+    /** Defines the maximum number of allowable function evaluations. */
+    int max_function_evals;
+    /** Defines convergence criteria based upon function value. */
+    double function_tolerance;
+    /** Defines convergence criteria based upon the solution value. */
+    double solution_tolerance;
+    /**
+     * Defines convergence criteria based upon the slope of the gradient 
+     * vector. 
+     * */
+    double gradient_tolerance;
+    /**
+     * Gets a logical value determining if iteration status should be printed.
+     */
+    bool print_status;
+} iteration_controls;
+
+/** A type providing information on the iteration process. */
+typedef struct {
+    /** The number of iteration performed. */
+    int iteration_count;
+    /**
+     * The number of function evaluations performed.  This typically
+     * does not include derivative evaulations.
+     */
+    int function_eval_count;
+    /** The number of Jacobian evaluations performed. */
+    int jacobian_eval_count;
+    /** The number of gradient vector evaluations performed. */
+    int gradient_eval_count;
+    /**
+     * True if the solution converged as a result of a zero-valued function;
+     * else, false.
+     */
+    bool converge_on_function;
+    /**
+     * True if the solution converged as a result of no appreciable
+     * change in the solution between iterations; else, false.
+     */
+    bool converge_on_solution_change;
+    /**
+     * True if the solution appears to have settled on a stationary
+     * point such that the gradient of the function is zero-valued; else,
+     * false.
+     */
+    bool converge_on_gradient;
+} iteration_process;
+
+/** Defines a pair of values. */
+typedef struct {
+    /** The first value. */
+    double x1;
+    /** The second value. */
+    double x2;
+} value_pair;
+
+/**
+ * Defines the signature of a function used for defining an equation of one
+ * variable.
+ * 
+ * @param x The value at which to evaluate the function.
+ * @return The value of the function.
+ */
+typedef double (*fcn1var)(double x);
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * Defines standard solver settings.
+ *
+ * @param x The iteration_controls item to populate.
+ */
+void c_set_default_solver_settings(iteration_controls *x);
+
+/**
+ * Utilizes Newton's method to sovle an equation of one variable.  
+ * The derivative calculation will be numerically estimated.
+ *
+ * @param fcn The function to solve.
+ * @param xi On input, the initial guess at the solution.  On
+ *  output, the solution.
+ * @param fo The value of the function at the solution.
+ * @param limits A set of limits on the solution bounding the solution
+ *  range thereby preventing the solver from wandering too far off course.
+ * @param cntrls The iteration controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ * - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
+ *      the allowed number of iterations.
+ */
+int c_solver_newton_1var(fcn1var fcn, double *xi, double *fo, 
+    const value_pair *limits, const iteration_controls *cntrls,
+    iteration_process *stats);
+
+
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index defd81a..b2ca59d 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -3,10 +3,152 @@
 !> @brief Defines a C-friendly API to the NONLIN library.
 module nonlin_c_api
     use iso_c_binding
+    use ferror
     use nonlin_constants
     use nonlin_core
     use nonlin_solve
     use nonlin_least_squares
     implicit none
+
+    !> @brief A type for providing a set of iteration control parameters.
+    type, bind(C) :: iteration_controls
+        !> @brief Defines the maximum number of allowable function evaluations.
+        integer(c_int) :: max_function_evals
+        !> @brief Defines convergence criteria based upon function value.
+        real(c_double) :: function_tolerance
+        !> @brief Defines convergence criteria based upon the solution value.
+        real(c_double) :: solution_tolerance
+        !> @brief Defines convergence criteria based upon the slope of the 
+        !! gradient vector.
+        real(c_double) :: gradient_tolerance
+        !> @brief Gets a logical value determining if iteration status should
+        !! be printed.
+        logical(c_bool) :: print_status
+    end type
+
+    !> @brief A type providing information on the iteration process.
+    type, bind(C) :: iteration_process
+        !> @brief The number of iteration performed.
+        integer(c_int) :: iteration_count
+        !> @brief The number of function evaluations performed.  This typically
+        !! does not include derivative evaulations.
+        integer(c_int) :: function_eval_count
+        !> @brief The number of Jacobian evaluations performed.
+        integer(c_int) :: jacobian_eval_count
+        !> @brief The number of gradient vector evaluations performed.
+        integer(c_int) :: gradient_eval_count
+        !> @brief True if the solution converged as a result of a zero-valued
+        !! function; else, false.
+        logical(c_bool) :: converge_on_function
+        !> @brief True if the solution converged as a result of no appreciable
+        !! change in the solution between iterations; else, false.
+        logical(c_bool) :: converge_on_solution_change
+        !> @brief True if the solution appears to have settled on a stationary
+        !! point such that the gradient of the function is zero-valued; else,
+        !! false.
+        logical(c_bool) :: converge_on_gradient
+    end type
 contains
+! ------------------------------------------------------------------------------
+    !> @brief Defines standard solver settings.
+    !!
+    !! @param[out] x The iteration_controls item to populate.
+    subroutine c_set_default_solver_settings(x) &
+            bind(C, name = "c_set_default_solver_settings")
+        ! Arguments
+        type(iteration_controls), intent(out) :: x
+
+        ! Process
+        x%max_function_evals = 100
+        x%function_tolerance = 1.0d-8
+        x%solution_tolerance = 1.0d-12
+        x%gradient_tolerance = 1.0d-12
+        x%print_status = logical(.false., c_bool)
+    end subroutine
+
+! ------------------------------------------------------------------------------
+    !> @brief Utilizes Newton's method to sovle an equation of one variable.  
+    !! The derivative calculation will be numerically estimated.
+    !!
+    !! @param[in] fcn The function to solve.
+    !! @param[in,out] xi On input, the initial guess at the solution.  On
+    !!  output, the solution.
+    !! @param[out] fo The value of the function at the solution.
+    !! @param[in] limits A set of limits on the solution bounding the solution
+    !!  range thereby preventing the solver from wandering too far off course.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
+    !!      the allowed number of iterations.
+    function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
+            bind(C, name = "c_solver_newton_1var") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn
+        real(c_double), intent(inout) :: xi
+        real(c_double), intent(out) :: fo
+        type(value_pair), intent(in) :: limits
+        type(iteration_controls), intent(in) :: cntrls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        type(fcn1var_helper) :: obj
+        procedure(fcn1var), pointer :: fptr
+        type(iteration_behavior) :: tracking
+        type(newton_1var_solver) :: solver
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, fptr)
+        call obj%set_fcn(fptr)
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_fcn_tolerance(cntrls%function_tolerance)
+        call solver%set_var_tolerance(cntrls%solution_tolerance)
+        call solver%set_diff_tolerance(cntrls%gradient_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Solve
+        call solver%solve(obj, xi, limits, fo, ib = tracking, err = err)
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+
+        ! Retrieve iteration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+    end function
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
+
+! ------------------------------------------------------------------------------
 end module
diff --git a/src/nonlin_constants.f90 b/src/nonlin_constants.f90
index 7f74df9..e4b1bfd 100644
--- a/src/nonlin_constants.f90
+++ b/src/nonlin_constants.f90
@@ -12,6 +12,8 @@ module nonlin_constants
 ! ******************************************************************************
 ! ERROR FLAGS
 ! ------------------------------------------------------------------------------
+    !> A flag denoting no error.
+    integer(int32), parameter :: NL_NO_ERROR = 0
     !> An error flag denoting an invalid input.
     integer(int32), parameter :: NL_INVALID_INPUT_ERROR = 201
     !> An error flag denoting an improperly sized array.
diff --git a/src/nonlin_core.f90 b/src/nonlin_core.f90
index bc4bc3f..512ecea 100644
--- a/src/nonlin_core.f90
+++ b/src/nonlin_core.f90
@@ -274,7 +274,7 @@ subroutine gradientfcn(x, g)
 
 ! ------------------------------------------------------------------------------
     !> @brief Defines a pair of numeric values.
-    type :: value_pair
+    type, bind(C) :: value_pair
         !> Value 1.
         real(real64) :: x1
         !> Value 2.

From e002db2ea2a7207d2a3be6bbc603c164a519f0a0 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 09:55:09 -0500
Subject: [PATCH 14/23] Add to the C API

---
 CMakeLists.txt                           |   2 +-
 examples/CMakeLists.txt                  |  33 +--
 examples/nonlin_c_brent_1d_example.c     |  53 ++++
 examples/nonlin_c_newton_1d_example.c    |  50 ++++
 examples/nonlin_c_quasi_newton_example.c |  71 +++++
 include/nonlin.h                         | 155 ++++++++++-
 src/nonlin_c_api.f90                     | 325 ++++++++++++++++++++++-
 7 files changed, 646 insertions(+), 43 deletions(-)
 create mode 100644 examples/nonlin_c_brent_1d_example.c
 create mode 100644 examples/nonlin_c_newton_1d_example.c
 create mode 100644 examples/nonlin_c_quasi_newton_example.c

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 9a9290b..8c6d658 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -1,6 +1,6 @@
 # Master CMAKE Build Script
 cmake_minimum_required(VERSION 3.7)
-project(nonlin Fortran)
+project(nonlin C CXX Fortran)
 
 # Define version information
 set(NONLIN_MAJOR_VERSION 1)
diff --git a/examples/CMakeLists.txt b/examples/CMakeLists.txt
index 31a04e4..42bdb4e 100644
--- a/examples/CMakeLists.txt
+++ b/examples/CMakeLists.txt
@@ -42,24 +42,15 @@ target_link_libraries(newton_example_2 nonlin)
 add_executable(polynomial_roots_example nonlin_poly_roots_example.f90)
 target_link_libraries(polynomial_roots_example nonlin)
 
-
-# Ensure LINALG, FERROR, and BLAS libraries are copied to the runtime directory
-if (WIN32)
-    get_target_property(ferror_LibLocation ferror LOCATION)
-    add_custom_command(TARGET quasi_newton_example POST_BUILD
-        COMMAND ${CMAKE_COMMAND} -E copy_if_different
-        ${ferror_LibLocation} $<TARGET_FILE_DIR:quasi_newton_example>
-    )
-
-    get_target_property(linalg_LibLocation linalg LOCATION)
-    add_custom_command(TARGET quasi_newton_example POST_BUILD
-        COMMAND ${CMAKE_COMMAND} -E copy_if_different
-        ${linalg_LibLocation} $<TARGET_FILE_DIR:quasi_newton_example>
-    )
-
-    get_target_property(blas_LibLocation blas LOCATION)
-    add_custom_command(TARGET quasi_newton_example POST_BUILD
-        COMMAND ${CMAKE_COMMAND} -E copy_if_different
-        ${blas_LibLocation} $<TARGET_FILE_DIR:quasi_newton_example>
-    )
-endif()
+# C API - 1D Newton Example
+include_directories(${PROJECT_SOURCE_DIR}/include)
+add_executable(c_newton_1d_example nonlin_c_newton_1d_example.c)
+target_link_libraries(c_newton_1d_example nonlin)
+
+# C API - 1D Brent Example
+add_executable(c_brent_1d_example nonlin_c_brent_1d_example.c)
+target_link_libraries(c_brent_1d_example nonlin)
+
+# C API - Quasi-Newton Example
+add_executable(c_quasi_newton_example nonlin_c_quasi_newton_example.c)
+target_link_libraries(c_quasi_newton_example nonlin)
diff --git a/examples/nonlin_c_brent_1d_example.c b/examples/nonlin_c_brent_1d_example.c
new file mode 100644
index 0000000..2f43e8c
--- /dev/null
+++ b/examples/nonlin_c_brent_1d_example.c
@@ -0,0 +1,53 @@
+// nonlin_c_brent_1d_example.c
+
+#include <stdio.h>
+#include "nonlin.h"
+
+double eqn(double x);
+
+int main() {
+    // Local Variables
+    int flag;
+    double xo, fo;
+    value_pair limits;
+    iteration_controls cntrls;
+    iteration_process stats;
+
+    // Define the allowable solution domain
+    limits.x1 = -2.0;
+    limits.x2 = 2.0;
+
+    // Define an initial guess
+    xo = 0.0;
+
+    // Define the iteration controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+
+    // Compute the solution
+    flag = c_solver_brent_1var(eqn, &xo, &fo, limits, &cntrls, &stats);
+
+    // Print the solution
+    printf("Solution: %f\nFunction Value: %f\n", xo, fo);
+
+    // Print the iteration information
+    printf("Iteration Count: %i\n", stats.iteration_count);
+    printf("Function Evaluation Count: %i\n", stats.function_eval_count);
+    printf("Converge on Function Value: %s\n", 
+        stats.converge_on_function ? "true" : "false");
+    printf("Converge on Change in Varible: %s\n",
+        stats.converge_on_solution_change ? "true" : "false");
+    printf("Converge on Derivative: %s\n",
+        stats.converge_on_gradient ? "true" : "false");
+
+    // End
+    return 0;
+}
+
+// The equation to solve:
+// f(x) = x^3 - 2 * x - 1
+//
+// Solution:
+// x = -1, -0.618034, 1.618034
+double eqn(double x) {
+    return (x * x * x) - 2.0 * x - 1.0;
+}
diff --git a/examples/nonlin_c_newton_1d_example.c b/examples/nonlin_c_newton_1d_example.c
new file mode 100644
index 0000000..fe976df
--- /dev/null
+++ b/examples/nonlin_c_newton_1d_example.c
@@ -0,0 +1,50 @@
+// nonlin_c_newton_1d_example.c
+
+#include <stdio.h>
+#include "nonlin.h"
+
+double eqn(double x);
+
+int main() {
+    // Local Variables
+    int flag;
+    double xo, fo;
+    value_pair limits;
+    iteration_controls cntrls;
+    iteration_process stats;
+
+    // Define the allowable solution domain
+    limits.x1 = -2.0;
+    limits.x2 = 2.0;
+
+    // Define the iteration controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+
+    // Compute the solution
+    flag = c_solver_newton_1var(eqn, limits, &xo, &fo, &cntrls, &stats);
+
+    // Print the solution
+    printf("Solution: %f\nFunction Value: %f\n", xo, fo);
+
+    // Print the iteration information
+    printf("Iteration Count: %i\n", stats.iteration_count);
+    printf("Function Evaluation Count: %i\n", stats.function_eval_count);
+    printf("Converge on Function Value: %s\n", 
+        stats.converge_on_function ? "true" : "false");
+    printf("Converge on Change in Varible: %s\n",
+        stats.converge_on_solution_change ? "true" : "false");
+    printf("Converge on Derivative: %s\n",
+        stats.converge_on_gradient ? "true" : "false");
+
+    // End
+    return 0;
+}
+
+// The equation to solve:
+// f(x) = x^3 - 2 * x - 1
+//
+// Solution:
+// x = -1, -0.618034, 1.618034
+double eqn(double x) {
+    return (x * x * x) - 2.0 * x - 1.0;
+}
diff --git a/examples/nonlin_c_quasi_newton_example.c b/examples/nonlin_c_quasi_newton_example.c
new file mode 100644
index 0000000..78de75a
--- /dev/null
+++ b/examples/nonlin_c_quasi_newton_example.c
@@ -0,0 +1,71 @@
+// nonlin_c_quasi_newton_example.c
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "nonlin.h"
+
+#define SQR(x) ((x) * (x))
+#define INDEX(i, j, m) ((m) * (j) + (i))
+
+void eqns(int neqn, int nvar, const double *x, double *f);
+void jacobian(int neqn, int nvar, const double *x, double *jac);
+
+int main() {
+    // Local Variables
+    const int n = 2;
+    int flag;
+    double x[2], f[2];
+    iteration_controls cntrls;
+    line_search_controls linesearch;
+    iteration_process stats;
+
+    // Defin the iteration and line search controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+    c_set_default_line_search_settings(&linesearch);
+
+    // Define initial conditions
+    x[0] = 1.0;
+    x[1] = 1.0;
+
+    // Compute the solution - analytical Jacobian
+    flag = c_solver_quasi_newton(eqns, jacobian, n, x, f, &cntrls, 
+        &linesearch, &stats);
+    printf("Analytical Jacobian Results:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Residual: (%e, %e)\n", f[0], f[1]);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Jacobian Evaluations: %i\n", stats.jacobian_eval_count);
+
+    // Reset the initial conditions
+    x[0] = 1.0;
+    x[1] = 1.0;
+
+    // Compute the solution - numerical Jacobian
+    flag = c_solver_quasi_newton(eqns, NULL, n, x, f, &cntrls, 
+        &linesearch, &stats);
+    printf("\nNumerical Jacobian Results:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Residual: (%e, %e)\n", f[0], f[1]);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Jacobian Evaluations: %i\n", stats.jacobian_eval_count);
+
+    // End
+    return 0;
+}
+
+// Equations:
+// x^2 + y^2 = 34
+// x^2 - 2 * y^2 = 7
+void eqns(int neqn, int nvar, const double *x, double *f) {
+    f[0] = SQR(x[0]) + SQR(x[1]) - 34.0;
+    f[1] = SQR(x[0]) - 2.0 * SQR(x[1]) - 7.0;
+}
+
+// Jacobian:
+// | df1/dx  df1/dy |   | 2*x   2*y |
+// |                | = |           |
+// | df2/dx  df2/dy |   | 2*x  -4*y |
+void jacobian(int neqn, int nvar, const double *x, double *jac) {
+    jac[INDEX(0,0,neqn)] = 2.0 * x[0];      jac[INDEX(0,1,neqn)] = 2.0 * x[1];
+    jac[INDEX(1,0,neqn)] = 2.0 * x[0];      jac[INDEX(1,1,neqn)] = -4.0 * x[1];
+}
diff --git a/include/nonlin.h b/include/nonlin.h
index 53a3db9..55dff2e 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -53,6 +53,36 @@ typedef struct {
     bool converge_on_gradient;
 } iteration_process;
 
+/** A type for providing controls on line search parameters. */
+typedef struct {
+    /** Defines whether line-searching should be employed. */
+    bool enable;
+    /**
+     * Defines the maximum number of allowable function evaluations
+     * during a single line search.
+     */
+    int max_function_evals;
+    /**
+     * Defines the scaling of the product of the gradient and 
+     * direction vectors such that F(X + LAMBDA * P) <=
+     * F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction
+     * vector, G is the gradient vector, and LAMBDA is the scaling factor.
+     * The parameter must exist on the set (0, 1).  A value of 1e-4 is
+     * typically a good starting point.
+     */
+    double alpha;
+    /**
+     * Defines a minimum factor X used to determine a minimum value 
+     * LAMBDA such that MIN(LAMBDA) = X * LAMBDA, where LAMBDA defines the 
+     * distance along the line search direction assuming a value of one 
+     * means the full length of the direction vector is traversed.  As such,
+     * the value must exist on the set (0, 1); however, for practical 
+     * considerations, the minimum value should be limited to 0.1 such that 
+     * the value must exist on the set [0.1, 1).
+     */
+    double factor;
+} line_search_controls;
+
 /** Defines a pair of values. */
 typedef struct {
     /** The first value. */
@@ -62,14 +92,58 @@ typedef struct {
 } value_pair;
 
 /**
- * Defines the signature of a function used for defining an equation of one
- * variable.
+ * Describes a function of one variable.
  * 
- * @param x The value at which to evaluate the function.
- * @return The value of the function.
+ * @param x The independent variable.
+ * @return The value of the function at @p x.
  */
 typedef double (*fcn1var)(double x);
 
+/*
+ * Describes a function of N variables.
+ * 
+ * @param n The number of independent variables.
+ * @param x An N-element array containing the independent variables.
+ * @return The value of the function at @p x.
+ */
+typedef double (*fcnnvar)(int n, const double *x);
+
+/**
+ * Describes a vector-valued function.
+ *
+ * @param neqn The number of equations.
+ * @param nvar The number of independent variables.
+ * @param x An NVAR-element array containing the independent
+ *  variables.
+ * @param f An NEQN-element array containing the values of the
+ *  function at @p x.
+ */
+typedef void (*vecfcn)(int neqn, int nvar, const double *x, double *f);
+
+/*
+ * Describes a routin capable of computing the gradient vector
+ * of an equation of N variables.
+ *
+ * @param n The number of independent variables.
+ * @param x An N-element array containing the independent variables.
+ * @param g An N-element array where the gradient vector will be
+ *  written as output.
+ */
+typedef void (*gradientfcn)(int n, const double *x, double *g);
+
+/*
+ * Describes a routine capable of computing the Jacobian matrix
+ * of a system of equations.
+ *
+ * @param neqn The number of equations.
+ * @param nvar The number of independent variables.
+ * @param x An NVAR-element array containing the independent 
+ *  variables.
+ * @param jac An NEQN-by-NVAR matrix where the Jacobian will be
+ *  written.
+ */
+typedef void (*jacobianfcn)(int neqn, int nvar, const double *x, double *jac);
+
 #ifdef __cplusplus
 extern "C" {
 #endif
@@ -81,16 +155,23 @@ extern "C" {
  */
 void c_set_default_solver_settings(iteration_controls *x);
 
+/**
+ * Defines standard line search settings.
+ *
+ * @param x The line_search_controls item to populate.
+ */
+void c_set_default_line_search_settings(line_search_controls *x);
+
 /**
  * Utilizes Newton's method to sovle an equation of one variable.  
  * The derivative calculation will be numerically estimated.
  *
  * @param fcn The function to solve.
- * @param xi On input, the initial guess at the solution.  On
- *  output, the solution.
- * @param fo The value of the function at the solution.
  * @param limits A set of limits on the solution bounding the solution
  *  range thereby preventing the solver from wandering too far off course.
+ * @param x On output, the solution.
+ * @param f The value of the function at the solution.
+ 
  * @param cntrls The iteration controls.
  * @param stats The iteration status.
  *
@@ -100,10 +181,64 @@ void c_set_default_solver_settings(iteration_controls *x);
  * - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
  *      the allowed number of iterations.
  */
-int c_solver_newton_1var(fcn1var fcn, double *xi, double *fo, 
-    const value_pair *limits, const iteration_controls *cntrls,
-    iteration_process *stats);
+int c_solver_newton_1var(fcn1var fcn, value_pair limits, double *x, 
+    double* f, const iteration_controls *cntrls, iteration_process *stats);
 
+/**
+ * Utilizes Brent's method to solve an equation of one variable.
+ *
+ * @param fcn The function to solve.
+ * @param x On input, the initial guess.  On output, the solution.
+ * @param f The value of the function at the solution.
+ * @param limits A set of limits on the solution bounding the solution
+ *  range thereby preventing the solver from wandering too far off course.
+ * @param cntrls The iteration controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ * - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
+ *      the allowed number of iterations.
+ */
+int c_solver_brent_1var(fcn1var fcn, double *x, double *f, value_pair limits,
+    const iteration_controls *cntrls, iteration_process *stats);
+
+/**
+ * Utilizes Broyden's Quasi-Newton method to solve a system of N
+ * equations of N unknowns.  A backtracking type line search is also 
+ * employed.
+ *
+ * @param fcn The function to solve.
+ * @param jac A function for evaluating the Jacobian.  If null, the
+ *  Jacobian is estimated numerically.
+ * @param n The number of equations.
+ * @param x On input, an N-element array containing an initial
+ *  estimate to the solution.  On output, the updated solution estimate.
+ * @param f An N-element array that, on output, will contain
+ *  the values of each equation as evaluated at the variable values
+ *  given in @p x.
+ * @param cntrls The iteration controls.
+ * @param ls The line search controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ *  - NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized
+ *      correctly.
+ * - NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is
+ *      pointing in an apparent uphill direction.
+ * - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+ *      the allowed number of iterations.
+ * - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+ *      available.
+ * - NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the
+ *      gradient vector becomes sufficiently close to zero.
+ */
+int c_solver_quasi_newton(vecfcn fcn, jacobianfcn jac, int n, double *x,
+    double *f, const iteration_controls *cntrls, const line_search_controls *ls,
+    iteration_process *stats);
 
 #ifdef __cplusplus
 }
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index b2ca59d..f91b043 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -2,14 +2,85 @@
 
 !> @brief Defines a C-friendly API to the NONLIN library.
 module nonlin_c_api
-    use iso_c_binding
+    use, intrinsic :: iso_c_binding
+    use, intrinsic :: iso_fortran_env
     use ferror
     use nonlin_constants
     use nonlin_core
     use nonlin_solve
     use nonlin_least_squares
+    use nonlin_linesearch
     implicit none
 
+    interface
+        !> @brief Describes a function of one variable.
+        !!
+        !! @param[in] x The independent variable.
+        !! @return The value of the function at @p x.
+        function c_fcn1var(x) result(f)
+            use, intrinsic :: iso_c_binding
+            real(c_double), intent(in), value :: x
+            real(c_double) :: f
+        end function
+
+        !> @brief Describes a function of N variables.
+        !!
+        !! @param[in] n The number of independent variables.
+        !! @param[in] x An N-element array containing the independent variables.
+        !! @return The value of the function at @p x.
+        function c_fcnnvar(n, x) result(f)
+            use, intrinsic :: iso_c_binding
+            integer(c_int), intent(in), value :: n
+            real(c_double), intent(in) :: x(n)
+            real(c_double) :: f
+        end function
+
+        !> @brief Describes a vector-valued function.
+        !!
+        !! @param[in] neqn The number of equations.
+        !! @param[in] nvar The number of independent variables.
+        !! @param[in] x An NVAR-element array containing the independent
+        !!  variables.
+        !! @param[out] f An NEQN-element array containing the values of the
+        !!  function at @p x.
+        subroutine c_vecfcn(neqn, nvar, x, f)
+            use, intrinsic :: iso_c_binding
+            integer(c_int), intent(in), value :: neqn, nvar
+            real(c_double), intent(in) :: x(nvar)
+            real(c_double), intent(out) :: f(neqn)
+        end subroutine
+
+        !> @brief Describes a routin capable of computing the gradient vector
+        !! of an equation of N variables.
+        !!
+        !! @param[in] n The number of independent variables.
+        !! @param[in] x An N-element array containing the independent variables.
+        !! @param[out] g An N-element array where the gradient vector will be
+        !!  written as output.
+        subroutine c_gradientfcn(n, x, g)
+            use, intrinsic :: iso_c_binding
+            integer(c_int), intent(in), value :: n
+            real(c_double), intent(in) :: x(n)
+            real(c_double), intent(out) :: g(n)
+        end subroutine
+
+        !> @brief Describes a routine capable of computing the Jacobian matrix
+        !! of a system of equations.
+        !!
+        !! @param[in] neqn The number of equations.
+        !! @param[in] nvar The number of independent variables.
+        !! @param[in] x An NVAR-element array containing the independent 
+        !!  variables.
+        !! @param[out] jac An NEQN-by-NVAR matrix where the Jacobian will be
+        !!  written.
+        subroutine c_jacobianfcn(neqn, nvar, x, jac)
+            use, intrinsic :: iso_c_binding
+            integer(c_int), intent(in), value :: neqn, nvar
+            real(c_double), intent(in) :: x(nvar)
+            real(c_double), intent(out) :: jac(neqn, nvar)
+        end subroutine
+    end interface
+
     !> @brief A type for providing a set of iteration control parameters.
     type, bind(C) :: iteration_controls
         !> @brief Defines the maximum number of allowable function evaluations.
@@ -48,6 +119,31 @@ module nonlin_c_api
         !! false.
         logical(c_bool) :: converge_on_gradient
     end type
+
+    !> @brief A type for providing controls on line search parameters.
+    type, bind(C) :: line_search_controls
+        !> @brief Defines whether line-searching should be employed.
+        logical(c_bool) :: enable
+        !> @brief Defines the maximum number of allowable function evaluations
+        !! during a single line search.
+        integer(c_int) :: max_function_evals
+        !> @brief Defines the scaling of the product of the gradient and 
+        !! direction vectors such that F(X + LAMBDA * P) <=
+        !! F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction
+        !! vector, G is the gradient vector, and LAMBDA is the scaling factor.
+        !! The parameter must exist on the set (0, 1).  A value of 1e-4 is
+        !! typically a good starting point.
+        real(c_double) :: alpha
+        !> @brief Defines a minimum factor X used to determine a minimum value 
+        !! LAMBDA such that MIN(LAMBDA) = X * LAMBDA, where LAMBDA defines the 
+        !! distance along the line search direction assuming a value of one 
+        !! means the full length of the direction vector is traversed.  As such,
+        !! the value must exist on the set (0, 1); however, for practical 
+        !! considerations, the minimum value should be limited to 0.1 such that 
+        !! the value must exist on the set [0.1, 1).
+        real(c_double) :: factor
+    end type
+
 contains
 ! ------------------------------------------------------------------------------
     !> @brief Defines standard solver settings.
@@ -66,16 +162,31 @@ subroutine c_set_default_solver_settings(x) &
         x%print_status = logical(.false., c_bool)
     end subroutine
 
+! ------------------------------------------------------------------------------
+    !> @brief Defines standard line search settings.
+    !!
+    !! @param[out] x The line_search_controls item to populate.
+    subroutine c_set_default_line_search_settings(x) &
+            bind(C, name = "c_set_default_line_search_settings")
+        ! Arguments
+        type(line_search_controls), intent(out) :: x
+
+        ! Process
+        x%enable = logical(.false., c_bool)
+        x%alpha = 1.0d-4
+        x%factor = 1.0d-1
+        x%max_function_evals = 100
+    end subroutine
+
 ! ------------------------------------------------------------------------------
     !> @brief Utilizes Newton's method to sovle an equation of one variable.  
     !! The derivative calculation will be numerically estimated.
     !!
     !! @param[in] fcn The function to solve.
-    !! @param[in,out] xi On input, the initial guess at the solution.  On
-    !!  output, the solution.
-    !! @param[out] fo The value of the function at the solution.
     !! @param[in] limits A set of limits on the solution bounding the solution
     !!  range thereby preventing the solver from wandering too far off course.
+    !! @param[out] x The solution.
+    !! @param[out] f The value of the function at the solution.
     !! @param[in] cntrls The iteration controls.
     !! @param[out] stats The iteration status.
     !!
@@ -84,13 +195,12 @@ subroutine c_set_default_solver_settings(x) &
     !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
     !! - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
     !!      the allowed number of iterations.
-    function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
+    function c_solver_newton_1var(fcn, limits, x, f, cntrls, stats) &
             bind(C, name = "c_solver_newton_1var") result(flag)
         ! Arguments
         type(c_funptr), intent(in), value :: fcn
-        real(c_double), intent(inout) :: xi
-        real(c_double), intent(out) :: fo
-        type(value_pair), intent(in) :: limits
+        type(value_pair), intent(in), value :: limits
+        real(c_double), intent(out) :: x, f
         type(iteration_controls), intent(in) :: cntrls
         type(iteration_process), intent(out) :: stats
         integer(c_int) :: flag
@@ -98,6 +208,7 @@ function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
         ! Local Variables
         type(errors) :: err
         type(fcn1var_helper) :: obj
+        procedure(c_fcn1var), pointer :: cfptr
         procedure(fcn1var), pointer :: fptr
         type(iteration_behavior) :: tracking
         type(newton_1var_solver) :: solver
@@ -105,7 +216,8 @@ function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
         ! Initialization
         flag = NL_NO_ERROR
         call err%set_exit_on_error(.false.)
-        call c_f_procpointer(fcn, fptr)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
         call obj%set_fcn(fptr)
 
         ! Set the solver parameters
@@ -116,11 +228,80 @@ function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
         call solver%set_print_status(logical(cntrls%print_status))
 
         ! Solve
-        call solver%solve(obj, xi, limits, fo, ib = tracking, err = err)
+        call solver%solve(obj, x, limits, f, ib = tracking, err = err)
+
+        ! Retrieve iteration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
         if (err%has_error_occurred()) then
             flag = err%get_error_flag()
             return
         end if
+    contains
+        function fun(xi) result(fx)
+            real(real64), intent(in) :: xi
+            real(real64) :: fx
+            fx = cfptr(xi)
+        end function
+    end function
+
+! ------------------------------------------------------------------------------
+    !> @brief Utilizes Brent's method to solve an equation of one variable.
+    !!
+    !! @param[in] fcn The function to solve.
+    !! @param[in,out] x On input, the initial guess.  On output, the solution.
+    !! @param[out] f The value of the function at the solution.
+    !! @param[in] limits A set of limits on the solution bounding the solution
+    !!  range thereby preventing the solver from wandering too far off course.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within 
+    !!      the allowed number of iterations.
+    function c_solver_brent_1var(fcn, x, f, limits, cntrls, stats) &
+            bind(C, name = "c_solver_brent_1var") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn
+        real(c_double), intent(inout) :: x
+        real(c_double), intent(out) :: f
+        type(value_pair), intent(in), value :: limits
+        type(iteration_controls), intent(in) :: cntrls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        type(errors) :: err
+        type(fcn1var_helper) :: obj
+        procedure(c_fcn1var), pointer :: cfptr
+        procedure(fcn1var), pointer :: fptr
+        type(iteration_behavior) :: tracking
+        type(brent_solver) :: solver
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr)
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_fcn_tolerance(cntrls%function_tolerance)
+        call solver%set_var_tolerance(cntrls%solution_tolerance)
+        call solver%set_diff_tolerance(cntrls%gradient_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Solve
+        call solver%solve(obj, x, limits, f, ib = tracking, err = err)
 
         ! Retrieve iteration status
         stats%iteration_count = tracking%iter_count
@@ -130,11 +311,133 @@ function c_solver_newton_1var(fcn, xi, fo, limits, cntrls, stats) &
         stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
         stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
         stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+
+    contains
+        function fun(xi) result(fx)
+            real(real64), intent(in) :: xi
+            real(real64) :: fx
+            fx = cfptr(xi)
+        end function
     end function
 
 ! ------------------------------------------------------------------------------
+    !> @brief Utilizes Broyden's Quasi-Newton method to solve a system of N
+    !! equations of N unknowns.  A backtracking type line search is also 
+    !! employed.
+    !!
+    !! @param[in] fcn The function to solve.
+    !! @param[in] jac A function for evaluating the Jacobian.  If null, the
+    !!  Jacobian is estimated numerically.
+    !! @param[in] n The number of equations.
+    !! @param[in,out] x On input, an N-element array containing an initial
+    !!  estimate to the solution.  On output, the updated solution estimate.
+    !! @param[out] f An N-element array that, on output, will contain
+    !!  the values of each equation as evaluated at the variable values
+    !!  given in @p x.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[in] ls The line search controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !!  - NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized
+    !!      correctly.
+    !! - NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is
+    !!      pointing in an apparent uphill direction.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+    !!      the allowed number of iterations.
+    !! - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+    !!      available.
+    !! - NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the
+    !!      gradient vector becomes sufficiently close to zero.
+    function c_solver_quasi_newton(fcn, jac, n, x, f, cntrls, ls, stats) &
+            bind(C, name = "c_solver_quasi_newton") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn, jac
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(inout) :: x(n)
+        real(c_double), intent(out) :: f(n)
+        type(iteration_controls), intent(in) :: cntrls
+        type(line_search_controls), intent(in) :: ls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
 
-! ------------------------------------------------------------------------------
+        ! Local Variables
+        type(errors) :: err
+        type(vecfcn_helper) :: obj
+        procedure(c_vecfcn), pointer :: cfptr
+        procedure(vecfcn), pointer :: fptr
+        procedure(c_jacobianfcn), pointer :: cjptr
+        procedure(jacobianfcn), pointer :: jptr
+        type(iteration_behavior) :: tracking
+        type(quasi_newton_solver) :: solver
+        type(line_search) :: search
+        
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr, 2, 2)
+        if (c_associated(jac)) then
+            call c_f_procpointer(jac, cjptr)
+            jptr => jacfun
+            call obj%set_jacobian(jptr)
+        end if
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_fcn_tolerance(cntrls%function_tolerance)
+        call solver%set_var_tolerance(cntrls%solution_tolerance)
+        call solver%set_gradient_tolerance(cntrls%gradient_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Set line search parameters
+        call solver%set_use_line_search(logical(ls%enable))
+        if (ls%enable) then
+            call search%set_max_fcn_evals(ls%max_function_evals)
+            call search%set_scaling_factor(ls%alpha)
+            call search%set_distance_factor(ls%factor)
+            call solver%set_line_search(search)
+        end if
+
+        ! Solve
+        call solver%solve(obj, x, f, ib = tracking, err = err)
+
+        ! Retrieve the ieration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    contains
+        subroutine fun(xx, fx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:) :: fx
+            call cfptr(n, n, xx, fx)
+        end subroutine
+
+        subroutine jacfun(xx, jx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:,:) :: jx
+            call cjptr(n, n, xx, jx)
+        end subroutine
+    end function
 
 ! ------------------------------------------------------------------------------
 

From dbf59c21cb1cc3ed6d1a5775cea64fb0742a0e93 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 11:32:12 -0500
Subject: [PATCH 15/23] Add to the C API

---
 examples/CMakeLists.txt                   |   8 +
 examples/nonlin_c_least_squares_example.c |  65 +++++++
 examples/nonlin_c_newton_example.c        |  71 ++++++++
 examples/nonlin_c_quasi_newton_example.c  |   2 +-
 include/nonlin.h                          |  69 +++++++
 src/nonlin_c_api.f90                      | 210 +++++++++++++++++++++-
 6 files changed, 423 insertions(+), 2 deletions(-)
 create mode 100644 examples/nonlin_c_least_squares_example.c
 create mode 100644 examples/nonlin_c_newton_example.c

diff --git a/examples/CMakeLists.txt b/examples/CMakeLists.txt
index 42bdb4e..3bcac26 100644
--- a/examples/CMakeLists.txt
+++ b/examples/CMakeLists.txt
@@ -54,3 +54,11 @@ target_link_libraries(c_brent_1d_example nonlin)
 # C API - Quasi-Newton Example
 add_executable(c_quasi_newton_example nonlin_c_quasi_newton_example.c)
 target_link_libraries(c_quasi_newton_example nonlin)
+
+# C API - Newton Example
+add_executable(c_newton_example nonlin_c_newton_example.c)
+target_link_libraries(c_newton_example nonlin)
+
+# C API - Least Squares Example
+add_executable(c_least_squares_example nonlin_c_least_squares_example.c)
+target_link_libraries(c_least_squares_example nonlin)
diff --git a/examples/nonlin_c_least_squares_example.c b/examples/nonlin_c_least_squares_example.c
new file mode 100644
index 0000000..b9cdb6f
--- /dev/null
+++ b/examples/nonlin_c_least_squares_example.c
@@ -0,0 +1,65 @@
+// nonlin_c_least_squares_example.c
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "nonlin.h"
+
+#define SQR(x) ((x) * (x))
+#define CUBE(x) ((x) * (x) * (x))
+
+void fun(int neqn, int nvar, const double *x, double *f);
+
+int main() {
+    // Local Variables
+    const int neqn = 21;
+    const int nvar = 4;
+    int flag;
+    double x[4], f[21];
+    iteration_controls cntrls;
+    iteration_process stats;
+
+    // Defin the iteration controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+
+    // Define an initial guess
+    x[0] = x[1] = x[2] = x[3] = 1.0;
+
+    // Compute the solution
+    flag = c_solver_least_squares(fun, NULL, neqn, nvar, x, f, &cntrls, &stats);
+
+    // Print out the solution
+    printf("Solution: (%f, %f, %f, %f)\n", x[0], x[1], x[2], x[3]);
+    printf("Residual: (%f, %f, %f, %f)\n", f[0], f[1], f[2], f[3]);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Function Evaluations: %i\n", stats.function_eval_count);
+    printf("Jacobian Evaluations: %i\n", stats.jacobian_eval_count);
+
+    // End
+    return 0;
+}
+
+void fun(int neqn, int nvar, const double *x, double *f) {
+    // Solution Points
+    double xp[] = {
+        0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 
+        0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 
+        1.8, 1.9, 2.0
+    };
+    double yp[] = {
+        1.216737514, 1.250032542, 1.305579195, 1.040182335, 
+        1.751867738, 1.109716707, 2.018141531, 1.992418729, 
+        1.807916923, 2.078806005, 2.698801324, 2.644662712, 
+        3.412756702, 4.406137221, 4.567156645, 4.999550779, 
+        5.652854194, 6.784320119, 8.307936836, 8.395126494, 
+        10.30252404
+    };
+    int i;
+
+    // Apply the cubic polynomial to each equation
+    for (i = 0; i < neqn; ++i) {
+        f[i] = x[0] * CUBE(xp[i]) + 
+            x[1] * SQR(xp[i]) + 
+            x[2] * xp[i] + 
+            x[3] - yp[i];
+    }
+}
diff --git a/examples/nonlin_c_newton_example.c b/examples/nonlin_c_newton_example.c
new file mode 100644
index 0000000..0f528c6
--- /dev/null
+++ b/examples/nonlin_c_newton_example.c
@@ -0,0 +1,71 @@
+// nonlin_c_newton_example.c
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "nonlin.h"
+
+#define SQR(x) ((x) * (x))
+#define INDEX(i, j, m) ((m) * (j) + (i))
+
+void eqns(int neqn, int nvar, const double *x, double *f);
+void jacobian(int neqn, int nvar, const double *x, double *jac);
+
+int main() {
+    // Local Variables
+    const int n = 2;
+    int flag;
+    double x[2], f[2];
+    iteration_controls cntrls;
+    line_search_controls linesearch;
+    iteration_process stats;
+
+    // Defin the iteration and line search controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+    c_set_default_line_search_settings(&linesearch);
+
+    // Define initial conditions
+    x[0] = 1.0;
+    x[1] = 1.0;
+
+    // Compute the solution - analytical Jacobian
+    flag = c_solver_newton(eqns, jacobian, n, x, f, &cntrls, 
+        &linesearch, &stats);
+    printf("Analytical Jacobian Results:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Residual: (%e, %e)\n", f[0], f[1]);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Jacobian Evaluations: %i\n", stats.jacobian_eval_count);
+
+    // Reset the initial conditions
+    x[0] = 1.0;
+    x[1] = 1.0;
+
+    // Compute the solution - numerical Jacobian
+    flag = c_solver_newton(eqns, NULL, n, x, f, &cntrls, 
+        &linesearch, &stats);
+    printf("\nNumerical Jacobian Results:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Residual: (%e, %e)\n", f[0], f[1]);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Jacobian Evaluations: %i\n", stats.jacobian_eval_count);
+
+    // End
+    return 0;
+}
+
+// Equations:
+// x^2 + y^2 = 34
+// x^2 - 2 * y^2 = 7
+void eqns(int neqn, int nvar, const double *x, double *f) {
+    f[0] = SQR(x[0]) + SQR(x[1]) - 34.0;
+    f[1] = SQR(x[0]) - 2.0 * SQR(x[1]) - 7.0;
+}
+
+// Jacobian:
+// | df1/dx  df1/dy |   | 2*x   2*y |
+// |                | = |           |
+// | df2/dx  df2/dy |   | 2*x  -4*y |
+void jacobian(int neqn, int nvar, const double *x, double *jac) {
+    jac[INDEX(0,0,neqn)] = 2.0 * x[0];      jac[INDEX(0,1,neqn)] = 2.0 * x[1];
+    jac[INDEX(1,0,neqn)] = 2.0 * x[0];      jac[INDEX(1,1,neqn)] = -4.0 * x[1];
+}
diff --git a/examples/nonlin_c_quasi_newton_example.c b/examples/nonlin_c_quasi_newton_example.c
index 78de75a..5b93922 100644
--- a/examples/nonlin_c_quasi_newton_example.c
+++ b/examples/nonlin_c_quasi_newton_example.c
@@ -19,7 +19,7 @@ int main() {
     line_search_controls linesearch;
     iteration_process stats;
 
-    // Defin the iteration and line search controls - use defaults
+    // Define the iteration and line search controls - use defaults
     c_set_default_solver_settings(&cntrls);
     c_set_default_line_search_settings(&linesearch);
 
diff --git a/include/nonlin.h b/include/nonlin.h
index 55dff2e..1c7f3fa 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -240,6 +240,75 @@ int c_solver_quasi_newton(vecfcn fcn, jacobianfcn jac, int n, double *x,
     double *f, const iteration_controls *cntrls, const line_search_controls *ls,
     iteration_process *stats);
 
+/**
+ * Utilizes Newton's method to solve a system of N equations of N 
+ * unknowns in conjuction with a backtracking type line search.
+ *
+ * @param fcn The function to solve.
+ * @param jac A function for evaluating the Jacobian.  If null, the
+ *  Jacobian is estimated numerically.
+ * @param n The number of equations.
+ * @param x On input, an N-element array containing an initial
+ *  estimate to the solution.  On output, the updated solution estimate.
+ * @param f An N-element array that, on output, will contain
+ *  the values of each equation as evaluated at the variable values
+ *  given in @p x.
+ * @param cntrls The iteration controls.
+ * @param ls The line search controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ *  - NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized
+ *      correctly.
+ * - NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is
+ *      pointing in an apparent uphill direction.
+ * - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+ *      the allowed number of iterations.
+ * - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+ *      available.
+ * - NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the
+ *      gradient vector becomes sufficiently close to zero.
+ */
+int c_solver_newton(vecfcn fcn, jacobianfcn jac, int n, double *x, double *f, 
+    const iteration_controls *cntrls, const line_search_controls *ls,
+    iteration_process *stats);
+
+/**
+ * Utilizes the Levenberg-Marquardt method to solve a least-squares
+ * problem of M equations of N unknowns.  There must be at least as many
+ * equations as unknowns for this solver.
+ *
+ * @param fcn The function to solve.
+ * @param jac A function for evaluating the Jacobian.  If null, the
+ *  Jacobian is estimated numerically.
+ * @param neqn The number of equations.
+ * @param nvar The number of variables.
+ * @param x On input, an NVAR element array containing the initial 
+ *  estimate to the solution.  On output, the solution.
+ * @param f An NEQN-element array that, on output, will contain the
+ *  values of each equation as evaluated at the output solution given in
+ *  @p x.
+ * @param cntrls The iteration controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ * - NL_INVALID_INPUT_ERROR: Occurs if the number of equations is less than
+ *      than the number of variables.
+ * - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+ *      the allowed number of iterations.
+ * - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+ *      available.
+ * - NL_TOLERANCE_TOO_SMALL_ERROR: Occurs if the requested tolerance is
+ *      to small to be practical for the problem at hand.
+ */
+int c_solver_least_squares(vecfcn fcn, jacobianfcn jac, int neqn, int nvar,
+    double *x, double *f, const iteration_controls *cntrls, 
+    iteration_process *stats);
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index f91b043..37c73ee 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -385,7 +385,7 @@ function c_solver_quasi_newton(fcn, jac, n, x, f, cntrls, ls, stats) &
         call err%set_exit_on_error(.false.)
         call c_f_procpointer(fcn, cfptr)
         fptr => fun
-        call obj%set_fcn(fptr, 2, 2)
+        call obj%set_fcn(fptr, n, n)
         if (c_associated(jac)) then
             call c_f_procpointer(jac, cjptr)
             jptr => jacfun
@@ -440,8 +440,216 @@ subroutine jacfun(xx, jx)
     end function
 
 ! ------------------------------------------------------------------------------
+    !> @brief Utilizes Newton's method to solve a system of N equations of N 
+    !! unknowns in conjuction with a backtracking type line search.
+    !!
+    !! @param[in] fcn The function to solve.
+    !! @param[in] jac A function for evaluating the Jacobian.  If null, the
+    !!  Jacobian is estimated numerically.
+    !! @param[in] n The number of equations.
+    !! @param[in,out] x On input, an N-element array containing an initial
+    !!  estimate to the solution.  On output, the updated solution estimate.
+    !! @param[out] f An N-element array that, on output, will contain
+    !!  the values of each equation as evaluated at the variable values
+    !!  given in @p x.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[in] ls The line search controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !!  - NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized
+    !!      correctly.
+    !! - NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is
+    !!      pointing in an apparent uphill direction.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+    !!      the allowed number of iterations.
+    !! - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+    !!      available.
+    !! - NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the
+    !!      gradient vector becomes sufficiently close to zero.
+    function c_solver_newton(fcn, jac, n, x, f, cntrls, ls, stats) &
+            bind(C, name = "c_solver_newton") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn, jac
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(inout) :: x(n)
+        real(c_double), intent(out) :: f(n)
+        type(iteration_controls), intent(in) :: cntrls
+        type(line_search_controls), intent(in) :: ls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        type(vecfcn_helper) :: obj
+        procedure(c_vecfcn), pointer :: cfptr
+        procedure(vecfcn), pointer :: fptr
+        procedure(c_jacobianfcn), pointer :: cjptr
+        procedure(jacobianfcn), pointer :: jptr
+        type(iteration_behavior) :: tracking
+        type(newton_solver) :: solver
+        type(line_search) :: search
+        
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr, n, n)
+        if (c_associated(jac)) then
+            call c_f_procpointer(jac, cjptr)
+            jptr => jacfun
+            call obj%set_jacobian(jptr)
+        end if
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_fcn_tolerance(cntrls%function_tolerance)
+        call solver%set_var_tolerance(cntrls%solution_tolerance)
+        call solver%set_gradient_tolerance(cntrls%gradient_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Set line search parameters
+        call solver%set_use_line_search(logical(ls%enable))
+        if (ls%enable) then
+            call search%set_max_fcn_evals(ls%max_function_evals)
+            call search%set_scaling_factor(ls%alpha)
+            call search%set_distance_factor(ls%factor)
+            call solver%set_line_search(search)
+        end if
+
+        ! Solve
+        call solver%solve(obj, x, f, ib = tracking, err = err)
+
+        ! Retrieve the ieration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    contains
+        subroutine fun(xx, fx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:) :: fx
+            call cfptr(n, n, xx, fx)
+        end subroutine
+
+        subroutine jacfun(xx, jx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:,:) :: jx
+            call cjptr(n, n, xx, jx)
+        end subroutine
+    end function
 
 ! ------------------------------------------------------------------------------
+    !> @brief Utilizes the Levenberg-Marquardt method to solve a least-squares
+    !! problem of M equations of N unknowns.  There must be at least as many
+    !! equations as unknowns for this solver.
+    !!
+    !! @param[in] fcn The function to solve.
+    !! @param[in] jac A function for evaluating the Jacobian.  If null, the
+    !!  Jacobian is estimated numerically.
+    !! @param[in] neqn The number of equations.
+    !! @param[in] nvar The number of variables.
+    !! @param[in,out] x On input, an NVAR element array containing the initial 
+    !!  estimate to the solution.  On output, the solution.
+    !! @param[out] f An NEQN-element array that, on output, will contain the
+    !!  values of each equation as evaluated at the output solution given in
+    !!  @p x.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if the number of equations is less than
+    !!      than the number of variables.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within
+    !!      the allowed number of iterations.
+    !! - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+    !!      available.
+    !! - NL_TOLERANCE_TOO_SMALL_ERROR: Occurs if the requested tolerance is
+    !!      to small to be practical for the problem at hand.
+    function c_solver_least_squares(fcn, jac, neqn, nvar, x, f, cntrls, stats) &
+            bind(C, name = "c_solver_least_squares") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn, jac
+        integer(c_int), intent(in), value :: neqn, nvar
+        real(c_double), intent(inout) :: x(nvar)
+        real(c_double), intent(out) :: f(neqn)
+        type(iteration_controls), intent(in) :: cntrls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        type(vecfcn_helper) :: obj
+        procedure(c_vecfcn), pointer :: cfptr
+        procedure(vecfcn), pointer :: fptr
+        procedure(c_jacobianfcn), pointer :: cjptr
+        procedure(jacobianfcn), pointer :: jptr
+        type(iteration_behavior) :: tracking
+        type(least_squares_solver) :: solver
+        
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr, neqn, nvar)
+        if (c_associated(jac)) then
+            call c_f_procpointer(jac, cjptr)
+            jptr => jacfun
+            call obj%set_jacobian(jptr)
+        end if
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_fcn_tolerance(cntrls%function_tolerance)
+        call solver%set_var_tolerance(cntrls%solution_tolerance)
+        call solver%set_gradient_tolerance(cntrls%gradient_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Solve
+        call solver%solve(obj, x, f, ib = tracking, err = err)
+
+        ! Retrieve the ieration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    contains
+        subroutine fun(xx, fx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:) :: fx
+            call cfptr(neqn, nvar, xx, fx)
+        end subroutine
+
+        subroutine jacfun(xx, jx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:,:) :: jx
+            call cjptr(neqn, nvar, xx, jx)
+        end subroutine
+    end function
 
 ! ------------------------------------------------------------------------------
 

From f40bc5d4dbccf6fa8d4317cd9bd645f71c1ee637 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 11:33:40 -0500
Subject: [PATCH 16/23] Update example

---
 examples/nonlin_c_least_squares_example.c | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/examples/nonlin_c_least_squares_example.c b/examples/nonlin_c_least_squares_example.c
index b9cdb6f..9a8a6f1 100644
--- a/examples/nonlin_c_least_squares_example.c
+++ b/examples/nonlin_c_least_squares_example.c
@@ -9,6 +9,7 @@
 
 void fun(int neqn, int nvar, const double *x, double *f);
 
+// This example fits data to an equation.
 int main() {
     // Local Variables
     const int neqn = 21;
@@ -56,6 +57,7 @@ void fun(int neqn, int nvar, const double *x, double *f) {
     int i;
 
     // Apply the cubic polynomial to each equation
+    // f(x) = c0 * x^3 + c1 * x^2 + c2 * x + c3
     for (i = 0; i < neqn; ++i) {
         f[i] = x[0] * CUBE(xp[i]) + 
             x[1] * SQR(xp[i]) + 

From b88f33e07fb83050f47ac1a81781df6616e94ced Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 13:34:48 -0500
Subject: [PATCH 17/23] Fix comment

---
 src/nonlin_linesearch.f90 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/nonlin_linesearch.f90 b/src/nonlin_linesearch.f90
index 953eefb..18027ee 100644
--- a/src/nonlin_linesearch.f90
+++ b/src/nonlin_linesearch.f90
@@ -400,7 +400,7 @@ subroutine ls_search_mimo(this, fcn, xold, grad, dir, x, fvec, fold, fx, &
     !! minimization problems.
     !!
     !! @param[in] this The line_search object.
-    !! @param[in] fcn A vecfcn_helper object containing the system of equations.
+    !! @param[in] fcn A fcnnvar_helper object containing the system of equations.
     !! @param[in] xold An N-element array defining the initial point, where N
     !!  is the number of variables.
     !! @param[in] grad An N-element array defining the gradient of @p fcn

From a852141092d5eaf7f450c247fd824660907b1ad0 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Mon, 23 Mar 2020 14:04:09 -0500
Subject: [PATCH 18/23] Add to the C API

---
 examples/CMakeLists.txt                   |   8 +
 examples/nonlin_c_bfgs_example.c          |  65 ++++++++
 examples/nonlin_c_least_squares_example.c |   2 +-
 examples/nonlin_c_nelder_mead_example.c   |  41 +++++
 include/nonlin.h                          |  54 +++++++
 src/nonlin_c_api.f90                      | 180 +++++++++++++++++++++-
 6 files changed, 348 insertions(+), 2 deletions(-)
 create mode 100644 examples/nonlin_c_bfgs_example.c
 create mode 100644 examples/nonlin_c_nelder_mead_example.c

diff --git a/examples/CMakeLists.txt b/examples/CMakeLists.txt
index 3bcac26..53c512b 100644
--- a/examples/CMakeLists.txt
+++ b/examples/CMakeLists.txt
@@ -62,3 +62,11 @@ target_link_libraries(c_newton_example nonlin)
 # C API - Least Squares Example
 add_executable(c_least_squares_example nonlin_c_least_squares_example.c)
 target_link_libraries(c_least_squares_example nonlin)
+
+# C API - Nelder-Mead Example
+add_executable(c_nelder_mead_example nonlin_c_nelder_mead_example.c)
+target_link_libraries(c_nelder_mead_example nonlin)
+
+# C API - BFGS Example
+add_executable(c_bfgs_example nonlin_c_bfgs_example.c)
+target_link_libraries(c_bfgs_example nonlin)
diff --git a/examples/nonlin_c_bfgs_example.c b/examples/nonlin_c_bfgs_example.c
new file mode 100644
index 0000000..3047d0a
--- /dev/null
+++ b/examples/nonlin_c_bfgs_example.c
@@ -0,0 +1,65 @@
+// nonlin_c_bfgs_example.c
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "nonlin.h"
+
+#define SQR(x) ((x) * (x))
+
+double fun(int n, const double *x);
+void grad(int n, const double *x, double *g);
+
+int main() {
+    // Local Variables
+    const int nvar = 2;
+    int flag;
+    double x[2], f;
+    iteration_controls cntrls;
+    line_search_controls linesearch;
+    iteration_process stats;
+
+    // Define the iteration controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+    c_set_default_line_search_settings(&linesearch);
+
+    // Define an initial guess
+    x[0] = x[1] = 0.0;
+
+    // Compute the solution - analytical gradient
+    flag = c_solver_bfgs(fun, grad, nvar, x, &f, &cntrls, &linesearch, &stats);
+
+    // Print the solution
+    printf("\nAnalytical Gradient:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Function Value: %e\n", f);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Function Evaluations: %i\n", stats.function_eval_count);
+
+    // Reset the initial conditions
+    x[0] = x[1] = 0.0;
+
+    // Compute the solution - numerical gradient
+    flag = c_solver_bfgs(fun, NULL, nvar, x, &f, &cntrls, &linesearch, &stats);
+
+    // Print the solution
+    printf("\nNumerical Gradient:\n");
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Function Value: %e\n", f);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Function Evaluations: %i\n", stats.function_eval_count);
+
+    // End
+    return 0;
+}
+
+// Rosenbrock's Function
+// f(x) = 1e2 * (x2 - x1^2)^2 + (x1 - 1)^2
+double fun(int n, const double *x) {
+    return 1.0e2 * SQR(x[1] - SQR(x[0])) + SQR(x[0] - 1.0);
+}
+
+// Gradient Vector
+void grad(int n, const double *x, double *g) {
+    g[0] = 2.0 * (x[0] - 1.0) - 4.0e2 * x[0] * (x[1] - SQR(x[0]));
+    g[1] = 2.0e2 * (x[1] - SQR(x[0]));
+}
diff --git a/examples/nonlin_c_least_squares_example.c b/examples/nonlin_c_least_squares_example.c
index 9a8a6f1..4105dc4 100644
--- a/examples/nonlin_c_least_squares_example.c
+++ b/examples/nonlin_c_least_squares_example.c
@@ -19,7 +19,7 @@ int main() {
     iteration_controls cntrls;
     iteration_process stats;
 
-    // Defin the iteration controls - use defaults
+    // Define the iteration controls - use defaults
     c_set_default_solver_settings(&cntrls);
 
     // Define an initial guess
diff --git a/examples/nonlin_c_nelder_mead_example.c b/examples/nonlin_c_nelder_mead_example.c
new file mode 100644
index 0000000..e0f5e1e
--- /dev/null
+++ b/examples/nonlin_c_nelder_mead_example.c
@@ -0,0 +1,41 @@
+// nonlin_c_nelder_mead_example.c
+
+#include <stdio.h>
+#include "nonlin.h"
+
+#define SQR(x) ((x) * (x))
+
+double fun(int n, const double *x);
+
+int main() {
+    // Local Variables
+    const int nvar = 2;
+    int flag;
+    double x[2], f;
+    iteration_controls cntrls;
+    iteration_process stats;
+
+    // Define the iteration controls - use defaults
+    c_set_default_solver_settings(&cntrls);
+
+    // Define an initial guess
+    x[0] = x[1] = 0.0;
+
+    // Compute the solution
+    flag = c_solver_nelder_mead(fun, nvar, x, &f, &cntrls, &stats);
+
+    // Print the solution
+    printf("Solution: (%f, %f)\n", x[0], x[1]);
+    printf("Function Value: %e\n", f);
+    printf("Iterations: %i\n", stats.iteration_count);
+    printf("Function Evaluations: %i\n", stats.function_eval_count);
+
+    // End
+    return 0;
+}
+
+// Rosenbrock's Function
+// f(x) = 1e2 * (x2 - x1^2)^2 + (x1 - 1)^2
+double fun(int n, const double *x) {
+    return 1.0e2 * SQR(x[1] - SQR(x[0])) + SQR(x[0] - 1.0);
+}
diff --git a/include/nonlin.h b/include/nonlin.h
index 1c7f3fa..e13ed48 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -309,6 +309,60 @@ int c_solver_least_squares(vecfcn fcn, jacobianfcn jac, int neqn, int nvar,
     double *x, double *f, const iteration_controls *cntrls, 
     iteration_process *stats);
 
+/**
+ * Utilizes Nelder and Mead's simplex algorithm to minimize a
+ * function of N variables.
+ *
+ * @param fcn The function to minimize.
+ * @param n The number of variables.
+ * @param x On input, an N-element array containing an initial
+ *  estimate to the solution.  On output, the updated solution estimate.
+ * @param f On output, the value of the function at @p x.
+ * @param cntrls The iteration controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ * - NL_INVALID_INPUT_ERROR: Occurs if @p x is not appropriately sized for
+ *      the problem as defined in @p fcn.
+ * - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+ *      available.
+ * - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within
+ *      the allowed number of iterations.
+ */
+int c_solver_nelder_mead(fcnnvar fcn, int n, double *x, double *f, 
+    const iteration_controls *cntrls, iteration_process *stats);
+
+/**
+ * Utilizes a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to 
+ * minimize a function of N variables.
+ *
+ * @param fcn The function to minimize.
+ * @param grad A function for evaluating the gradiant.  If null, the
+ *  gradient is estimated numerically.
+ * @param n The number of variables.
+ * @param x On input, an N-element array containing an initial
+ *  estimate to the solution.  On output, the updated solution estimate.
+ * @param f On output, the value of the function at @p x.
+ * @param cntrls The iteration controls.
+ * @param ls The line search controls.
+ * @param stats The iteration status.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+ * - NL_INVALID_INPUT_ERROR: Occurs if @p x is not appropriately sized for
+ *      the problem as defined in @p fcn.
+ * - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+ *      available.
+ * - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within
+ *      the allowed number of iterations.
+ */
+int c_solver_bfgs(fcnnvar fcn, gradientfcn grad, int n, double *x, double *f,
+    const iteration_controls *cntrls, const line_search_controls *ls,
+    iteration_process *stats);
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index 37c73ee..82f2353 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -10,6 +10,7 @@ module nonlin_c_api
     use nonlin_solve
     use nonlin_least_squares
     use nonlin_linesearch
+    use nonlin_optimize
     implicit none
 
     interface
@@ -155,7 +156,7 @@ subroutine c_set_default_solver_settings(x) &
         type(iteration_controls), intent(out) :: x
 
         ! Process
-        x%max_function_evals = 100
+        x%max_function_evals = 500
         x%function_tolerance = 1.0d-8
         x%solution_tolerance = 1.0d-12
         x%gradient_tolerance = 1.0d-12
@@ -652,8 +653,185 @@ subroutine jacfun(xx, jx)
     end function
 
 ! ------------------------------------------------------------------------------
+    !> @brief Utilizes Nelder and Mead's simplex algorithm to minimize a
+    !! function of N variables.
+    !!
+    !! @param[in] fcn The function to minimize.
+    !! @param[in] n The number of variables.
+    !! @param[in,out] x On input, an N-element array containing an initial
+    !!  estimate to the solution.  On output, the updated solution estimate.
+    !! @param[out] f On output, the value of the function at @p x.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if @p x is not appropriately sized for
+    !!      the problem as defined in @p fcn.
+    !! - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+    !!      available.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within
+    !!      the allowed number of iterations.
+    function c_solver_nelder_mead(fcn, n, x, f, cntrls, stats) &
+            bind(C, name = "c_solver_nelder_mead") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(inout) :: x(n)
+        real(c_double), intent(out) :: f
+        type(iteration_controls), intent(in) :: cntrls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        type(fcnnvar_helper) :: obj
+        procedure(c_fcnnvar), pointer :: cfptr
+        procedure(fcnnvar), pointer :: fptr
+        type(iteration_behavior) :: tracking
+        type(nelder_mead) :: solver
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr, n)
+
+        ! Set solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_tolerance(cntrls%function_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Solve
+        call solver%solve(obj, x, f, tracking, err)
+
+        ! Retrieve the ieration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    contains
+        function fun(xx) result(fx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64) :: fx
+            fx = cfptr(n, xx)
+        end function
+    end function
 
 ! ------------------------------------------------------------------------------
+    !> @brief Utilizes a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to 
+    !! minimize a function of N variables.
+    !!
+    !! @param[in] fcn The function to minimize.
+    !! @param[in] grad A function for evaluating the gradiant.  If null, the
+    !!  gradient is estimated numerically.
+    !! @param[in] n The number of variables.
+    !! @param[in,out] x On input, an N-element array containing an initial
+    !!  estimate to the solution.  On output, the updated solution estimate.
+    !! @param[out] f On output, the value of the function at @p x.
+    !! @param[in] cntrls The iteration controls.
+    !! @param[in] ls The line search controls.
+    !! @param[out] stats The iteration status.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if @p x is not appropriately sized for
+    !!      the problem as defined in @p fcn.
+    !! - NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory
+    !!      available.
+    !! - NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within
+    !!      the allowed number of iterations.
+    function c_solver_bfgs(fcn, grad, n, x, f, cntrls, ls, stats) &
+            bind(C, name = "c_solver_bfgs") result(flag)
+        ! Arguments
+        type(c_funptr), intent(in), value :: fcn, grad
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(inout) :: x(n)
+        real(c_double), intent(out) :: f
+        type(iteration_controls), intent(in) :: cntrls
+        type(line_search_controls), intent(in) :: ls
+        type(iteration_process), intent(out) :: stats
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        type(fcnnvar_helper) :: obj
+        procedure(c_fcnnvar), pointer :: cfptr
+        procedure(fcnnvar), pointer :: fptr
+        procedure(c_gradientfcn), pointer :: cgptr
+        procedure(gradientfcn), pointer :: gptr
+        type(iteration_behavior) :: tracking
+        type(bfgs) :: solver
+        type(line_search) :: search
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+        call c_f_procpointer(fcn, cfptr)
+        fptr => fun
+        call obj%set_fcn(fptr, n)
+        if (c_associated(grad)) then
+            call c_f_procpointer(grad, cgptr)
+            gptr => grd
+            call obj%set_gradient_fcn(gptr)
+        end if
+
+        ! Set the solver parameters
+        call solver%set_max_fcn_evals(cntrls%max_function_evals)
+        call solver%set_tolerance(cntrls%function_tolerance)
+        call solver%set_print_status(logical(cntrls%print_status))
+
+        ! Set line search parameters
+        call solver%set_use_line_search(logical(ls%enable))
+        if (ls%enable) then
+            call search%set_max_fcn_evals(ls%max_function_evals)
+            call search%set_scaling_factor(ls%alpha)
+            call search%set_distance_factor(ls%factor)
+            call solver%set_line_search(search)
+        end if
+
+        ! Solve
+        call solver%solve(obj, x, f, tracking, err)
+
+        ! Retrieve the ieration status
+        stats%iteration_count = tracking%iter_count
+        stats%function_eval_count = tracking%fcn_count
+        stats%jacobian_eval_count = tracking%jacobian_count
+        stats%gradient_eval_count = tracking%gradient_count
+        stats%converge_on_function = logical(tracking%converge_on_fcn, c_bool)
+        stats%converge_on_solution_change = logical(tracking%converge_on_chng, c_bool)
+        stats%converge_on_gradient = logical(tracking%converge_on_zero_diff, c_bool)
+
+        ! Check for errors
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    contains
+        function fun(xx) result(fx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64) :: fx
+            fx = cfptr(n, xx)
+        end function
+
+        subroutine grd(xx, gx)
+            real(real64), intent(in), dimension(:) :: xx
+            real(real64), intent(out), dimension(:) :: gx
+            call cgptr(n, xx, gx)
+        end subroutine
+    end function
 
 ! ------------------------------------------------------------------------------
 

From d68342a67df55fba58047e13204d799f47f65a86 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Tue, 31 Mar 2020 08:08:13 -0500
Subject: [PATCH 19/23] Include error constants

---
 include/nonlin.h | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/include/nonlin.h b/include/nonlin.h
index e13ed48..10db232 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -3,6 +3,16 @@
 
 #include <stdbool.h>
 
+#define NL_NO_ERROR                     0
+#define NL_INVALID_INPUT_ERROR          201
+#define NL_ARRAY_SIZE_ERROR             202
+#define NL_OUT_OF_MEMORY_ERROR          105
+#define NL_INVALID_OPERATION_ERROR      107
+#define NL_CONVERGENCE_ERROR            106
+#define NL_DIVERGENT_BEHAVIOR_ERROR     206
+#define NL_SPURIOUS_CONVERGENCE_ERROR   207
+#define NL_TOLERANCE_TOO_SMALL_ERROR    208
+
 /** A type for providing a set of iteration control parameters. */
 typedef struct {
     /** Defines the maximum number of allowable function evaluations. */

From afa2815d00b7d53a13d30a8ee77b3e063a2c331f Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Tue, 31 Mar 2020 10:55:58 -0500
Subject: [PATCH 20/23] Add to C API

---
 examples/CMakeLists.txt                |   4 +
 examples/nonlin_c_polynomial_example.c |  41 +++++
 include/nonlin.h                       |  56 +++++++
 src/nonlin_c_api.f90                   | 214 +++++++++++++++++++++++++
 4 files changed, 315 insertions(+)
 create mode 100644 examples/nonlin_c_polynomial_example.c

diff --git a/examples/CMakeLists.txt b/examples/CMakeLists.txt
index 53c512b..7c5ab38 100644
--- a/examples/CMakeLists.txt
+++ b/examples/CMakeLists.txt
@@ -70,3 +70,7 @@ target_link_libraries(c_nelder_mead_example nonlin)
 # C API - BFGS Example
 add_executable(c_bfgs_example nonlin_c_bfgs_example.c)
 target_link_libraries(c_bfgs_example nonlin)
+
+# C API - POLYNOMIAL Example
+add_executable(c_polynomial_example nonlin_c_polynomial_example.c)
+target_link_libraries(c_polynomial_example nonlin)
diff --git a/examples/nonlin_c_polynomial_example.c b/examples/nonlin_c_polynomial_example.c
new file mode 100644
index 0000000..450c073
--- /dev/null
+++ b/examples/nonlin_c_polynomial_example.c
@@ -0,0 +1,41 @@
+// nonlin_c_polynomial_example.c
+
+#include <stdio.h>
+#include "nonlin.h"
+
+int main() {
+    // Local Variables
+    const int neqn = 21;
+    c_polynomial poly;
+    int flag;
+    double xp[] = {
+        0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 
+        0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 
+        1.8, 1.9, 2.0
+    };
+    double yp[] = {
+        1.216737514, 1.250032542, 1.305579195, 1.040182335, 
+        1.751867738, 1.109716707, 2.018141531, 1.992418729, 
+        1.807916923, 2.078806005, 2.698801324, 2.644662712, 
+        3.412756702, 4.406137221, 4.567156645, 4.999550779, 
+        5.652854194, 6.784320119, 8.307936836, 8.395126494, 
+        10.30252404
+    };
+
+    // Create a new third order polynomial
+    flag = c_init_polynomial(3, &poly);
+    if (flag != NL_NO_ERROR) printf("Error Code: %i\n", flag);
+
+    // Check the polynomial order
+    flag = c_get_polynomial_order(&poly);
+    printf("Polynomial Order: %i\n", flag);
+
+    // Fit data to the polynomial
+    flag = c_fit_polynomial(&poly, neqn, xp, yp, false);
+
+    // Print out the coefficients
+
+    // End
+    c_free_polynomial(&poly);
+    return 0;
+}
\ No newline at end of file
diff --git a/include/nonlin.h b/include/nonlin.h
index 10db232..9223c3e 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -154,6 +154,14 @@ typedef void (*gradientfcn)(int n, const double *x, double *g);
  */
 typedef void (*jacobianfcn)(int neqn, int nvar, const double *x, double *jac);
 
+/** Provides a container for the underlying Fortran polynomial type. */
+typedef struct {
+    /** The size of the underlying Fortran polynomial object in bytes. */
+    int size_in_bytes;
+    /** A pointer to the underlying Fortran polynomial object. */
+    void* ptr;
+} c_polynomial;
+
 #ifdef __cplusplus
 extern "C" {
 #endif
@@ -373,6 +381,54 @@ int c_solver_bfgs(fcnnvar fcn, gradientfcn grad, int n, double *x, double *f,
     const iteration_controls *cntrls, const line_search_controls *ls,
     iteration_process *stats);
 
+/**
+ * Initializes a new C-compatible polynomial object.
+ *
+ * @param order The order of the polynomial.  This must be at least 1.
+ * @param poly A pointer to the polynomial object.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ *  - NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order
+ *      was specified.
+ *  - NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available.
+ */
+int c_init_polynomial(int order, c_polynomial *poly);
+
+/**
+ * Frees memory allocated for the polynomial object.
+ *
+ * @param poly The polynomial object to free.
+ */
+void c_free_polynomial(c_polynomial *poly);
+
+/**
+ * Gets the order of the polynomial.
+ *
+ * @param poly The polynomial object.
+ * @return The order of the polynomial.
+ */
+int c_get_polynomial_order(const c_polynomial *poly);
+
+/**
+ * Fits a data set to the polynomial.
+ *
+ * @param poly The polynomial object.
+ * @param n The number of data points to fit.
+ * @param x An N-element array of the independent variable data points.
+ * @param y An N-element array of the dependent variable data points.
+ * @param zero Set to true to force the fit thru zero; else, set to
+ *  false.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ *  - NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order
+ *      was specified, or if order is too large for the data set.
+ *  - NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available.
+ */
+int c_fit_polynomial(c_polynomial *poly, int n, const double *x, 
+    const double *y, bool zero);
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index 82f2353..02345e5 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -11,6 +11,7 @@ module nonlin_c_api
     use nonlin_least_squares
     use nonlin_linesearch
     use nonlin_optimize
+    use nonlin_polynomials
     implicit none
 
     interface
@@ -145,6 +146,15 @@ subroutine c_jacobianfcn(neqn, nvar, x, jac)
         real(c_double) :: factor
     end type
 
+    !> @brief A type for representing a polynomial in C that is compatible with
+    !! the polynomial type in this library.
+    type, bind(C) :: c_polynomial
+        !> @brief The size of the polynomial object, in bytes.
+        integer(c_int) :: size_in_bytes
+        !> @brief A pointer to the underlying Fortran polynomial object.
+        type(c_ptr) :: ptr
+    end type
+
 contains
 ! ------------------------------------------------------------------------------
     !> @brief Defines standard solver settings.
@@ -833,6 +843,210 @@ subroutine grd(xx, gx)
         end subroutine
     end function
 
+! ******************************************************************************
+! POLYNOMIAL SUPPORT
+! ------------------------------------------------------------------------------
+    !> @brief Initializes a new C-compatible polynomial object.
+    !!
+    !! @param[in] order The order of the polynomial.  This must be at least 1.
+    !! @param[out] poly A pointer to the polynomial object.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !!  - NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order
+    !!      was specified.
+    !!  - NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available.
+    function c_init_polynomial(order, poly) &
+            bind(C, name = "c_init_polynomial") result(flag)
+        ! Arguments
+        integer(c_int), intent(in), value :: order
+        type(c_polynomial), intent(out) :: poly
+        integer(c_int) :: flag
+
+        ! Local Variables
+        integer(int32) :: i
+        type(errors) :: err
+        type(polynomial) :: fpoly
+        integer(int8), pointer, dimension(:) :: map
+        integer(int8), allocatable, dimension(:) :: buffer
+
+        ! Initialization
+        call err%set_exit_on_error(.false.)
+        flag = NL_NO_ERROR
+
+        ! Initialize the Fortran polynomial
+        call fpoly%initialize(order, err = err)
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+
+        ! Initialize the pointer
+        buffer = transfer(fpoly, buffer)
+        allocate(map(size(buffer)))
+        do i = 1, size(buffer)
+            map(i) = buffer(i)
+        end do
+
+        ! Store the results
+        poly%size_in_bytes = size(map)
+        poly%ptr = c_loc(map)
+    end function
+
+! ------------------------------------------------------------------------------
+    !> @brief Frees memory allocated for the polynomial object.
+    !!
+    !! @param[in,out] poly The polynomial object to free.
+    subroutine c_free_polynomial(poly) bind(C, name = "c_free_polynomial")
+        ! Arguments
+        type(c_polynomial), intent(inout) :: poly
+
+        ! Local Variables
+        integer(int8), pointer, dimension(:) :: map
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Free memory
+        deallocate(map)
+
+        ! Make the C pointer NULL
+        poly%ptr = c_null_ptr
+        poly%size_in_bytes = 0
+    end subroutine
+
+! ------------------------------------------------------------------------------
+    !> @brief Gets the order of the polynomial.
+    !!
+    !! @param[in] poly The polynomial object.
+    !! @return The order of the polynomial.
+    function c_get_polynomial_order(poly) &
+            bind(C, name = "c_get_polynomial_order") result(n)
+        ! Arguments
+        type(c_polynomial), intent(in) :: poly
+        integer(c_int) :: n
+
+        ! Local Variables
+        integer(int8), pointer, dimension(:) :: map
+        type(polynomial) :: fpoly
+
+        ! Initialization
+        n = 0
+        
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Obtain the polynomial order
+        n = fpoly%order()
+    end function
+
+! ------------------------------------------------------------------------------
+    !> @brief Fits a data set to the polynomial.
+    !!
+    !! @param[in,out] poly The polynomial object.
+    !! @param[in] n The number of data points to fit.
+    !! @param[in] x An N-element array of the independent variable data points.
+    !! @param[in] y An N-element array of the dependent variable data points.
+    !! @param[in] zero Set to true to force the fit thru zero; else, set to
+    !!  false.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !!  - NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order
+    !!      was specified, or if order is too large for the data set.
+    !!  - NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available.
+    function c_fit_polynomial(poly, n, x, y, zero) &
+            bind(C, name = "c_fit_polynomial") result(flag)
+        ! Arguments
+        type(c_polynomial), intent(inout) :: poly
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(in) :: x(n), y(n)
+        logical(c_bool), intent(in), value :: zero
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        integer(int32) :: i, order
+        integer(int8), pointer, dimension(:) :: map
+        integer(int8), allocatable, dimension(:) :: buffer
+        type(polynomial) :: fpoly
+        real(real64), allocatable, dimension(:) :: ycopy
+
+        ! Initialization
+        call err%set_exit_on_error(.false.)
+        ycopy = y   ! Prevents overwritting of y
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Fit the data
+        order = fpoly%order()
+        if (zero) then
+            call fpoly%fit_thru_zero(x, ycopy, order, err)
+        else
+            call fpoly%fit(x, ycopy, order, err)
+        end if
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+
+        ! Reconstruct the C polynomial type
+        deallocate(map)
+        buffer = transfer(fpoly, buffer)
+        allocate(map(size(buffer)))
+        do i = 1, size(buffer)
+            map(i) = buffer(i)
+        end do
+
+        ! Store the results
+        poly%size_in_bytes = size(map)
+        poly%ptr = c_loc(map)
+    end function
+
+! ------------------------------------------------------------------------------
+    ! get coefficients array
+    function c_get_polynomial_coefficients(poly, nc, c) &
+            bind(C, name = "") result(flag)
+        ! Arguments
+        type(c_polynomial), intent(in) :: poly
+        integer(c_int), intent(in), value :: nc
+        real(c_double), intent(out) :: c(nc)
+        integer(c_int) :: flag
+
+        ! Local Variables
+    end function
+
+! ------------------------------------------------------------------------------
+    ! set coefficients array
+
+! ------------------------------------------------------------------------------
+    ! evaluate - real valued
+
+! ------------------------------------------------------------------------------
+    ! evaluate - complex-valued
+
+! ------------------------------------------------------------------------------
+    ! roots
+
 ! ------------------------------------------------------------------------------
 
 ! ------------------------------------------------------------------------------

From dd05044603244c98d0660be6b435e40989af8da5 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Tue, 31 Mar 2020 14:42:31 -0500
Subject: [PATCH 21/23] Add to the C API

---
 examples/nonlin_c_polynomial_example.c |  14 +-
 include/nonlin.h                       |  61 +++++++++
 src/nonlin_c_api.f90                   | 183 ++++++++++++++++++++++++-
 3 files changed, 251 insertions(+), 7 deletions(-)

diff --git a/examples/nonlin_c_polynomial_example.c b/examples/nonlin_c_polynomial_example.c
index 450c073..a09e139 100644
--- a/examples/nonlin_c_polynomial_example.c
+++ b/examples/nonlin_c_polynomial_example.c
@@ -6,8 +6,10 @@
 int main() {
     // Local Variables
     const int neqn = 21;
+    const int norder = 3;
     c_polynomial poly;
-    int flag;
+    int i, flag;
+    double coeffs[4], y[21];
     double xp[] = {
         0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 
         0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 
@@ -23,7 +25,7 @@ int main() {
     };
 
     // Create a new third order polynomial
-    flag = c_init_polynomial(3, &poly);
+    flag = c_init_polynomial(norder, &poly);
     if (flag != NL_NO_ERROR) printf("Error Code: %i\n", flag);
 
     // Check the polynomial order
@@ -34,6 +36,14 @@ int main() {
     flag = c_fit_polynomial(&poly, neqn, xp, yp, false);
 
     // Print out the coefficients
+    flag = c_get_polynomial_coefficients(&poly, norder + 1, coeffs);
+    for (i = 0; i <= norder; ++i) printf("c[%i] = %f\n", i, coeffs[i]);
+
+    // Evaluate the fitted polynomial and compare to the actual values
+    c_evaluate_polynomial_real(&poly, neqn, xp, y);
+    printf("\n");
+    for (i = 0; i < neqn; ++i) 
+    printf("Actual: %f\tFitted: %f\n", yp[i], y[i]);
 
     // End
     c_free_polynomial(&poly);
diff --git a/include/nonlin.h b/include/nonlin.h
index 9223c3e..c5753a9 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -2,6 +2,7 @@
 #define NONLIN_H_
 
 #include <stdbool.h>
+#include <complex.h>
 
 #define NL_NO_ERROR                     0
 #define NL_INVALID_INPUT_ERROR          201
@@ -429,6 +430,66 @@ int c_get_polynomial_order(const c_polynomial *poly);
 int c_fit_polynomial(c_polynomial *poly, int n, const double *x, 
     const double *y, bool zero);
 
+/**
+ * Gets an array containing the polynomial coefficients in ascending
+ * order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.
+ *
+ * @param poly The polynomial object.
+ * @param nc The number of elements in @p c.  Ideally, this value is
+ *  one greater than the order of the polynomial.
+ * @param c An NC-element array where the coefficients will be written.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_INPUT_ERROR: Occurs if @p nc is smaller than one greater 
+ *      than the order of the polynomial.
+ */
+int c_get_polynomial_coefficients(const c_polynomial *poly, int nc, double *c);
+
+/**
+ * Sets the coefficients of the polynomial by using an array 
+ * containing the polynomial coefficients in ascending order such that
+ * f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.
+ *
+ * @param poly The polynomial object.
+ * @param nc The number of elements in @P c.  This value must be 
+ *  one greater than the order of the polynomial.
+ * @param c The NC-element array containing the new polynomial 
+ *  coefficients in ascending order.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_INPUT_ERROR: Occurs if @p nc is not equal to than one
+ *      greater than the order of the polynomial.
+ */
+int c_set_polynomial_coefficients(c_polynomial *poly, int nc, const double *c);
+
+/**
+ * Evaluates the polynomial at the specified values.
+!!
+!! @param poly The polynomial object.
+!! @param n The number of points at which to evaluate the polynomial.
+!! @param x An N-element array containing the values at which to
+!!  evaluate the polynomial.
+!! @param y An N-element array where the results of the polynomial
+!!  evaluation will be written.
+ */
+void c_evaluate_polynomial_real(const c_polynomial *poly, int n, 
+    const double *x, double *y);
+
+/**
+ * Evaluates the polynomial at the specified values.
+!!
+!! @param poly The polynomial object.
+!! @param n The number of points at which to evaluate the polynomial.
+!! @param x An N-element array containing the values at which to
+!!  evaluate the polynomial.
+!! @param y An N-element array where the results of the polynomial
+!!  evaluation will be written.
+ */
+void c_evaluate_polynomial_complex(const c_polynomial *poly, int n, 
+    const double complex *x, double complex *y);
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index 02345e5..7742ac8 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -984,6 +984,7 @@ function c_fit_polynomial(poly, n, x, y, zero) &
         real(real64), allocatable, dimension(:) :: ycopy
 
         ! Initialization
+        flag = NL_NO_ERROR
         call err%set_exit_on_error(.false.)
         ycopy = y   ! Prevents overwritting of y
 
@@ -1023,9 +1024,20 @@ function c_fit_polynomial(poly, n, x, y, zero) &
     end function
 
 ! ------------------------------------------------------------------------------
-    ! get coefficients array
+    !> @brief Gets an array containing the polynomial coefficients in ascending
+    !! order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.
+    !!
+    !! @param[in] poly The polynomial object.
+    !! @param[in] nc The number of elements in @p c.  Ideally, this value is
+    !!  one greater than the order of the polynomial.
+    !! @param[out] c An NC-element array where the coefficients will be written.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if @p nc is smaller than one greater 
+    !!      than the order of the polynomial.
     function c_get_polynomial_coefficients(poly, nc, c) &
-            bind(C, name = "") result(flag)
+            bind(C, name = "c_get_polynomial_coefficients") result(flag)
         ! Arguments
         type(c_polynomial), intent(in) :: poly
         integer(c_int), intent(in), value :: nc
@@ -1033,25 +1045,186 @@ function c_get_polynomial_coefficients(poly, nc, c) &
         integer(c_int) :: flag
 
         ! Local Variables
+        type(errors) :: err
+        integer(int32) :: i, order, n
+        integer(int8), pointer, dimension(:) :: map
+        type(polynomial) :: fpoly
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Get the order of the polynomial, and then copy over the coefficients
+        order = fpoly%order()
+        n = order + 1
+        if (nc < n) then
+            flag = NL_INVALID_INPUT_ERROR
+            return
+        end if
+        do i = 1, n
+            c(i) = fpoly%get(i)
+        end do
     end function
 
 ! ------------------------------------------------------------------------------
-    ! set coefficients array
+    !> @brief Sets the coefficients of the polynomial by using an array 
+    !! containing the polynomial coefficients in ascending order such that
+    !! f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.
+    !!
+    !! @param[in,out] poly The polynomial object.
+    !! @param[in] nc The number of elements in @P c.  This value must be 
+    !!  one greater than the order of the polynomial.
+    !! @param[in] c The NC-element array containing the new polynomial 
+    !!  coefficients in ascending order.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if @p nc is not equal to than one
+    !!      greater than the order of the polynomial.
+    function c_set_polynomial_coefficients(poly, nc, c) &
+            bind(C, name = "c_set_polynomial_coefficients") result(flag)
+        ! Arguments
+        type(c_polynomial), intent(inout) :: poly
+        integer(c_int), intent(in), value :: nc
+        real(c_double) :: c(nc)
+        integer(c_int) :: flag
+
+        ! Local Variables
+        type(errors) :: err
+        integer(int32) :: i, order, n
+        integer(int8), pointer, dimension(:) :: map
+        integer(int8), allocatable, dimension(:) :: buffer
+        type(polynomial) :: fpoly
+
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Get the order of the polynomial, and then copy over the coefficients
+        order = fpoly%order()
+        n = order + 1
+        if (nc /= n) then
+            flag = NL_INVALID_INPUT_ERROR
+            return
+        end if
+        do i = 1, n
+            call fpoly%set(i, c(i))
+        end do
+
+        ! Reconstruct the C polynomial type
+        deallocate(map)
+        buffer = transfer(fpoly, buffer)
+        allocate(map(size(buffer)))
+        do i = 1, size(buffer)
+            map(i) = buffer(i)
+        end do
+
+        ! Store the results
+        poly%size_in_bytes = size(map)
+        poly%ptr = c_loc(map)
+    end function
 
 ! ------------------------------------------------------------------------------
-    ! evaluate - real valued
+    !> @brief Evaluates the polynomial at the specified values.
+    !!
+    !! @param[in] poly The polynomial object.
+    !! @param[in] n The number of points at which to evaluate the polynomial.
+    !! @param[in] x An N-element array containing the values at which to
+    !!  evaluate the polynomial.
+    !! @param[out] y An N-element array where the results of the polynomial
+    !!  evaluation will be written.
+    subroutine c_evaluate_polynomial_real(poly, n, x, y) &
+            bind(C, name = "c_evaluate_polynomial_real")
+        ! Arguments
+        type(c_polynomial), intent(in) :: poly
+        integer(c_int), intent(in), value :: n
+        real(c_double), intent(in) :: x(n)
+        real(c_double), intent(out) :: y(n)
+
+        ! Local Variables
+        integer(int8), pointer, dimension(:) :: map
+        type(polynomial) :: fpoly
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Evaluate the polynomial at X
+        y = fpoly%evaluate(x)
+    end subroutine
 
 ! ------------------------------------------------------------------------------
-    ! evaluate - complex-valued
+    !> @brief Evaluates the polynomial at the specified values.
+    !!
+    !! @param[in] poly The polynomial object.
+    !! @param[in] n The number of points at which to evaluate the polynomial.
+    !! @param[in] x An N-element array containing the values at which to
+    !!  evaluate the polynomial.
+    !! @param[out] y An N-element array where the results of the polynomial
+    !!  evaluation will be written.
+    subroutine c_evaluate_polynomial_complex(poly, n, x, y) &
+            bind(C, name = "c_evaluate_polynomial_complex")
+        ! Arguments
+        type(c_polynomial), intent(in) :: poly
+        integer(c_int), intent(in), value :: n
+        complex(c_double), intent(in) :: x(n)
+        complex(c_double), intent(out) :: y(n)
+
+        ! Local Variables
+        integer(int8), pointer, dimension(:) :: map
+        type(polynomial) :: fpoly
+
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Evaluate the polynomial at X
+        y = fpoly%evaluate(x)
+    end subroutine
 
 ! ------------------------------------------------------------------------------
     ! roots
 
 ! ------------------------------------------------------------------------------
+    ! addition
 
 ! ------------------------------------------------------------------------------
+    ! subtraction
 
 ! ------------------------------------------------------------------------------
+    ! multiplication
 
 ! ------------------------------------------------------------------------------
 end module

From 88b340b46d514816d82979716064160887d4a5f4 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Wed, 1 Apr 2020 06:51:23 -0500
Subject: [PATCH 22/23] Add to the C API

---
 examples/nonlin_c_polynomial_example.c |  9 +++-
 include/nonlin.h                       | 47 ++++++++++++++------
 src/nonlin_c_api.f90                   | 61 +++++++++++++++++++++++---
 3 files changed, 95 insertions(+), 22 deletions(-)

diff --git a/examples/nonlin_c_polynomial_example.c b/examples/nonlin_c_polynomial_example.c
index a09e139..d02e991 100644
--- a/examples/nonlin_c_polynomial_example.c
+++ b/examples/nonlin_c_polynomial_example.c
@@ -10,6 +10,7 @@ int main() {
     c_polynomial poly;
     int i, flag;
     double coeffs[4], y[21];
+    double complex rts[3];
     double xp[] = {
         0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 
         0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 
@@ -41,10 +42,16 @@ int main() {
 
     // Evaluate the fitted polynomial and compare to the actual values
     c_evaluate_polynomial_real(&poly, neqn, xp, y);
-    printf("\n");
+    printf("\nEvaluation Test:\n");
     for (i = 0; i < neqn; ++i) 
     printf("Actual: %f\tFitted: %f\n", yp[i], y[i]);
 
+    // Compute the roots of the polynomial
+    printf("\nRoots:\n");
+    flag = c_polynomial_roots(&poly, norder, rts);
+    for (i = 0; i < norder; ++i)
+        printf("Root %i: (%f, %f)\n", i + 1, creal(rts[i]), cimag(rts[i]));
+
     // End
     c_free_polynomial(&poly);
     return 0;
diff --git a/include/nonlin.h b/include/nonlin.h
index c5753a9..c8240aa 100644
--- a/include/nonlin.h
+++ b/include/nonlin.h
@@ -466,30 +466,49 @@ int c_set_polynomial_coefficients(c_polynomial *poly, int nc, const double *c);
 
 /**
  * Evaluates the polynomial at the specified values.
-!!
-!! @param poly The polynomial object.
-!! @param n The number of points at which to evaluate the polynomial.
-!! @param x An N-element array containing the values at which to
-!!  evaluate the polynomial.
-!! @param y An N-element array where the results of the polynomial
-!!  evaluation will be written.
+ *
+ * @param poly The polynomial object.
+ * @param n The number of points at which to evaluate the polynomial.
+ * @param x An N-element array containing the values at which to
+ *  evaluate the polynomial.
+ * @param y An N-element array where the results of the polynomial
+ *  evaluation will be written.
  */
 void c_evaluate_polynomial_real(const c_polynomial *poly, int n, 
     const double *x, double *y);
 
 /**
  * Evaluates the polynomial at the specified values.
-!!
-!! @param poly The polynomial object.
-!! @param n The number of points at which to evaluate the polynomial.
-!! @param x An N-element array containing the values at which to
-!!  evaluate the polynomial.
-!! @param y An N-element array where the results of the polynomial
-!!  evaluation will be written.
+ *
+ * @param poly The polynomial object.
+ * @param n The number of points at which to evaluate the polynomial.
+ * @param x An N-element array containing the values at which to
+ *  evaluate the polynomial.
+ * @param y An N-element array where the results of the polynomial
+ *  evaluation will be written.
  */
 void c_evaluate_polynomial_complex(const c_polynomial *poly, int n, 
     const double complex *x, double complex *y);
 
+/**
+ * Computes the roots of the polynomial.
+ *
+ * @param poly The polynomial object.
+ * @param n THe size of @p rts.  This must be equal to the order of the
+ *  polynomial.
+ * @param rts An N-element array where the roots of the polynomial will
+ *  be written.
+ *
+ * @return An error flag with the following possible values.
+ * - NL_NO_ERROR: No error has occurred - successful execution.
+ * - NL_INVALID_INPUT_ERROR: Occurs if @p n is not equal to the order of
+ *      the polynomial.
+ *  - NL_OUT_OF_MEMORY_ERROR: Occurs if local memory must be allocated, and
+ *      there is insufficient memory available.
+ *  - NL_CONVERGENCE_ERROR: Occurs if the algorithm failed to converge.
+ */
+int c_polynomial_roots(const c_polynomial *poly, int n, double complex *rts);
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/nonlin_c_api.f90 b/src/nonlin_c_api.f90
index 7742ac8..5f8f85c 100644
--- a/src/nonlin_c_api.f90
+++ b/src/nonlin_c_api.f90
@@ -1215,16 +1215,63 @@ subroutine c_evaluate_polynomial_complex(poly, n, x, y) &
     end subroutine
 
 ! ------------------------------------------------------------------------------
-    ! roots
+    !> @brief Computes the roots of the polynomial.
+    !!
+    !! @param[in] poly The polynomial object.
+    !! @param[in] n THe size of @p rts.  This must be equal to the order of the
+    !!  polynomial.
+    !! @param[out] rts An N-element array where the roots of the polynomial will
+    !!  be written.
+    !!
+    !! @return An error flag with the following possible values.
+    !! - NL_NO_ERROR: No error has occurred - successful execution.
+    !! - NL_INVALID_INPUT_ERROR: Occurs if @p n is not equal to the order of
+    !!      the polynomial.
+    !!  - NL_OUT_OF_MEMORY_ERROR: Occurs if local memory must be allocated, and
+    !!      there is insufficient memory available.
+    !!  - NL_CONVERGENCE_ERROR: Occurs if the algorithm failed to converge.
+    function c_polynomial_roots(poly, n, rts) &
+            bind(C, name = "c_polynomial_roots") result(flag)
+        ! Arguments
+        type(c_polynomial), intent(in) :: poly
+        integer(c_int), intent(in), value :: n
+        complex(c_double), intent(out) :: rts(n)
+        integer(c_int) :: flag
 
-! ------------------------------------------------------------------------------
-    ! addition
+        ! Local Variables
+        type(errors) :: err
+        integer(int8), pointer, dimension(:) :: map
+        type(polynomial) :: fpoly
+        integer(int32) :: order
 
-! ------------------------------------------------------------------------------
-    ! subtraction
+        ! Initialization
+        flag = NL_NO_ERROR
+        call err%set_exit_on_error(.false.)
 
-! ------------------------------------------------------------------------------
-    ! multiplication
+        ! Ensure there's something to work with
+        if (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) return
+
+        ! Obtain the pointer
+        call c_f_pointer(poly%ptr, map, [poly%size_in_bytes])
+        if (.not.associated(map)) return
+
+        ! Reconstruct the Fortran polynomial object
+        fpoly = transfer(map, fpoly)
+
+        ! Ensure the output array is properly sized
+        order = fpoly%order()
+        if (n /= order) then
+            flag = NL_INVALID_INPUT_ERROR
+            return
+        end if
+
+        ! Compute the polynomial roots
+        rts = fpoly%roots(err)
+        if (err%has_error_occurred()) then
+            flag = err%get_error_flag()
+            return
+        end if
+    end function
 
 ! ------------------------------------------------------------------------------
 end module

From 1e826f81e589396224cd6508b5506b38f2b25ed8 Mon Sep 17 00:00:00 2001
From: Jason Christopherson <jchristopherson@hotmail.com>
Date: Wed, 1 Apr 2020 07:08:11 -0500
Subject: [PATCH 23/23] Update documentation

---
 doc/Doxyfile                                  |    3 +-
 doc/html/annotated.html                       |   89 +-
 doc/html/annotated_dup.js                     |    8 +-
 doc/html/classes.html                         |  108 +-
 .../dir_d44c64559bbebec7f509842c48db8b23.html |  106 ++
 .../dir_d44c64559bbebec7f509842c48db8b23.js   |    4 +
 doc/html/files.html                           |   48 +-
 doc/html/files_dup.js                         |    1 +
 doc/html/functions.html                       |   76 ++
 doc/html/functions_vars.html                  |   88 ++
 doc/html/hierarchy.html                       |   74 +-
 doc/html/hierarchy.js                         |   14 +
 ...enonlin__c__api_1_1c__fcn1var-members.html |  109 ++
 ...interfacenonlin__c__api_1_1c__fcn1var.html |  133 ++
 .../interfacenonlin__c__api_1_1c__fcn1var.js  |    4 +
 ...enonlin__c__api_1_1c__fcnnvar-members.html |  109 ++
 ...interfacenonlin__c__api_1_1c__fcnnvar.html |  134 ++
 .../interfacenonlin__c__api_1_1c__fcnnvar.js  |    4 +
 ...lin__c__api_1_1c__gradientfcn-members.html |  109 ++
 ...rfacenonlin__c__api_1_1c__gradientfcn.html |  134 ++
 ...terfacenonlin__c__api_1_1c__gradientfcn.js |    4 +
 ...lin__c__api_1_1c__jacobianfcn-members.html |  109 ++
 ...rfacenonlin__c__api_1_1c__jacobianfcn.html |  135 ++
 ...terfacenonlin__c__api_1_1c__jacobianfcn.js |    4 +
 ...cenonlin__c__api_1_1c__vecfcn-members.html |  109 ++
 .../interfacenonlin__c__api_1_1c__vecfcn.html |  135 ++
 .../interfacenonlin__c__api_1_1c__vecfcn.js   |    4 +
 doc/html/menudata.js                          |    7 +
 doc/html/namespacemembers.html                |   61 +
 doc/html/namespacemembers_func.html           |   58 +
 doc/html/namespacemembers_vars.html           |    3 +
 doc/html/namespacenonlin__c__api.html         | 1173 ++++++++++++++++-
 doc/html/namespacenonlin__c__api.js           |   12 +
 doc/html/namespacenonlin__constants.html      |    4 +
 doc/html/namespacenonlin__linesearch.html     |    2 +-
 doc/html/navtreedata.js                       |    3 +-
 doc/html/navtreeindex0.js                     |  451 +++----
 doc/html/navtreeindex1.js                     |   58 +
 doc/html/nonlin_8h_source.html                |  277 ++++
 doc/html/nonlin__c__api_8f90_source.html      |  965 +++++++++++++-
 doc/html/nonlin__constants_8f90_source.html   |   21 +-
 doc/html/nonlin__core_8f90_source.html        |    8 +-
 doc/html/nonlin__solve_8f90_source.html       |    6 +-
 doc/html/search/all_0.js                      |    3 +-
 doc/html/search/all_1.js                      |    4 +-
 doc/html/search/all_10.js                     |   48 +-
 doc/html/search/all_11.js                     |    2 +-
 doc/html/search/all_12.js                     |    6 +-
 doc/html/search/all_13.js                     |    4 +-
 doc/html/search/all_2.js                      |   35 +-
 doc/html/search/all_3.js                      |    4 +-
 doc/html/search/all_4.js                      |   11 +-
 doc/html/search/all_5.js                      |   19 +-
 doc/html/search/all_6.js                      |   52 +-
 doc/html/search/all_7.js                      |   23 +-
 doc/html/search/all_8.js                      |    7 +-
 doc/html/search/all_9.js                      |   39 +-
 doc/html/search/all_a.js                      |   45 +-
 doc/html/search/all_b.js                      |   45 +-
 doc/html/search/all_c.js                      |    8 +-
 doc/html/search/all_d.js                      |   31 +-
 doc/html/search/all_e.js                      |    2 +-
 doc/html/search/all_f.js                      |    2 +-
 doc/html/search/classes_0.js                  |    2 +-
 doc/html/search/classes_1.js                  |    4 +-
 doc/html/search/classes_2.js                  |    9 +-
 doc/html/search/classes_3.js                  |    7 +-
 doc/html/search/classes_4.js                  |    5 +-
 doc/html/search/classes_5.js                  |    2 +-
 doc/html/search/classes_6.js                  |    4 +-
 doc/html/search/classes_7.js                  |    5 +-
 doc/html/search/classes_8.js                  |   11 +-
 doc/html/search/classes_9.js                  |    9 +-
 doc/html/search/classes_a.js                  |    4 +-
 doc/html/search/classes_b.js                  |    2 +-
 doc/html/search/classes_c.js                  |    4 +-
 doc/html/search/classes_d.html                |   30 +
 doc/html/search/classes_d.js                  |    6 +
 doc/html/search/functions_0.js                |   20 +-
 doc/html/search/functions_1.js                |    4 +-
 doc/html/search/functions_2.js                |    4 +-
 doc/html/search/functions_3.js                |    6 +-
 doc/html/search/functions_4.js                |   46 +-
 doc/html/search/functions_5.js                |   16 +-
 doc/html/search/functions_6.js                |    2 +-
 doc/html/search/functions_7.js                |   30 +-
 doc/html/search/functions_8.js                |    2 +-
 doc/html/search/functions_9.js                |    2 +-
 doc/html/search/functions_a.js                |   28 +-
 doc/html/search/functions_b.js                |    2 +-
 doc/html/search/functions_c.js                |   46 +-
 doc/html/search/functions_d.js                |    2 +-
 doc/html/search/namespaces_0.js               |   16 +-
 doc/html/search/searchdata.js                 |    4 +-
 doc/html/search/variables_0.js                |    4 +-
 doc/html/search/variables_1.js                |    7 +-
 doc/html/search/variables_2.js                |    2 +-
 doc/html/search/variables_3.js                |    5 +-
 doc/html/search/variables_4.js                |    4 +-
 doc/html/search/variables_5.js                |   23 +-
 doc/html/search/variables_6.js                |   10 +-
 doc/html/search/variables_7.js                |   24 +-
 doc/html/search/variables_8.html              |   30 +
 doc/html/search/variables_8.js                |   12 +
 doc/html/search/variables_9.html              |   30 +
 doc/html/search/variables_9.js                |    5 +
 doc/html/search/variables_a.html              |   30 +
 doc/html/search/variables_a.js                |    5 +
 doc/html/search/variables_b.html              |   30 +
 doc/html/search/variables_b.js                |    5 +
 doc/html/structc__polynomial-members.html     |  110 ++
 doc/html/structc__polynomial.html             |  161 +++
 doc/html/structc__polynomial.js               |    5 +
 .../structiteration__controls-members.html    |  113 ++
 doc/html/structiteration__controls.html       |  218 +++
 doc/html/structiteration__controls.js         |    8 +
 .../structiteration__process-members.html     |  115 ++
 doc/html/structiteration__process.html        |  256 ++++
 doc/html/structiteration__process.js          |   10 +
 .../structline__search__controls-members.html |  112 ++
 doc/html/structline__search__controls.html    |  199 +++
 doc/html/structline__search__controls.js      |    7 +
 ...nlin__c__api_1_1c__polynomial-members.html |  110 ++
 ...structnonlin__c__api_1_1c__polynomial.html |  131 ++
 .../structnonlin__c__api_1_1c__polynomial.js  |    5 +
 ...c__api_1_1iteration__controls-members.html |  113 ++
 ...nonlin__c__api_1_1iteration__controls.html |  143 ++
 ...ctnonlin__c__api_1_1iteration__controls.js |    8 +
 ..._c__api_1_1iteration__process-members.html |  115 ++
 ...tnonlin__c__api_1_1iteration__process.html |  151 +++
 ...uctnonlin__c__api_1_1iteration__process.js |   10 +
 ...api_1_1line__search__controls-members.html |  112 ++
 ...lin__c__api_1_1line__search__controls.html |  139 ++
 ...onlin__c__api_1_1line__search__controls.js |    7 +
 .../structnonlin__solve_1_1brent__solver.html |    6 +-
 ...nonlin__solve_1_1newton__1var__solver.html |    2 +-
 doc/html/structvalue__pair-members.html       |  110 ++
 doc/html/structvalue__pair.html               |  161 +++
 doc/html/structvalue__pair.js                 |    5 +
 139 files changed, 7816 insertions(+), 740 deletions(-)
 create mode 100644 doc/html/dir_d44c64559bbebec7f509842c48db8b23.html
 create mode 100644 doc/html/dir_d44c64559bbebec7f509842c48db8b23.js
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcn1var-members.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcn1var.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcn1var.js
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcnnvar-members.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcnnvar.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__fcnnvar.js
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__gradientfcn-members.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__gradientfcn.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__gradientfcn.js
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__jacobianfcn-members.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.js
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__vecfcn-members.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__vecfcn.html
 create mode 100644 doc/html/interfacenonlin__c__api_1_1c__vecfcn.js
 create mode 100644 doc/html/namespacenonlin__c__api.js
 create mode 100644 doc/html/navtreeindex1.js
 create mode 100644 doc/html/nonlin_8h_source.html
 create mode 100644 doc/html/search/classes_d.html
 create mode 100644 doc/html/search/classes_d.js
 create mode 100644 doc/html/search/variables_8.html
 create mode 100644 doc/html/search/variables_8.js
 create mode 100644 doc/html/search/variables_9.html
 create mode 100644 doc/html/search/variables_9.js
 create mode 100644 doc/html/search/variables_a.html
 create mode 100644 doc/html/search/variables_a.js
 create mode 100644 doc/html/search/variables_b.html
 create mode 100644 doc/html/search/variables_b.js
 create mode 100644 doc/html/structc__polynomial-members.html
 create mode 100644 doc/html/structc__polynomial.html
 create mode 100644 doc/html/structc__polynomial.js
 create mode 100644 doc/html/structiteration__controls-members.html
 create mode 100644 doc/html/structiteration__controls.html
 create mode 100644 doc/html/structiteration__controls.js
 create mode 100644 doc/html/structiteration__process-members.html
 create mode 100644 doc/html/structiteration__process.html
 create mode 100644 doc/html/structiteration__process.js
 create mode 100644 doc/html/structline__search__controls-members.html
 create mode 100644 doc/html/structline__search__controls.html
 create mode 100644 doc/html/structline__search__controls.js
 create mode 100644 doc/html/structnonlin__c__api_1_1c__polynomial-members.html
 create mode 100644 doc/html/structnonlin__c__api_1_1c__polynomial.html
 create mode 100644 doc/html/structnonlin__c__api_1_1c__polynomial.js
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__controls-members.html
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__controls.html
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__controls.js
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__process-members.html
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__process.html
 create mode 100644 doc/html/structnonlin__c__api_1_1iteration__process.js
 create mode 100644 doc/html/structnonlin__c__api_1_1line__search__controls-members.html
 create mode 100644 doc/html/structnonlin__c__api_1_1line__search__controls.html
 create mode 100644 doc/html/structnonlin__c__api_1_1line__search__controls.js
 create mode 100644 doc/html/structvalue__pair-members.html
 create mode 100644 doc/html/structvalue__pair.html
 create mode 100644 doc/html/structvalue__pair.js

diff --git a/doc/Doxyfile b/doc/Doxyfile
index 4098ba7..bd89e0b 100644
--- a/doc/Doxyfile
+++ b/doc/Doxyfile
@@ -829,7 +829,8 @@ WARN_LOGFILE           =
 # spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
 # Note: If this tag is empty the current directory is searched.
 
-INPUT                  = ../src
+INPUT                  = ../src \
+                         ../include/nonlin.h
 
 # This tag can be used to specify the character encoding of the source files
 # that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
diff --git a/doc/html/annotated.html b/doc/html/annotated.html
index ae5fcab..6ef9c03 100644
--- a/doc/html/annotated.html
+++ b/doc/html/annotated.html
@@ -93,43 +93,58 @@
 <div class="contents">
 <div class="textblock">Here are the data types with brief descriptions:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
-<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b> </td></tr>
-<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
-<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver.html" target="_self">equation_solver</a></td><td class="desc">A base class for various solvers of nonlinear systems of equations </td></tr>
-<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver__1var.html" target="_self">equation_solver_1var</a></td><td class="desc">A base class for various solvers of equations of one variable </td></tr>
-<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcn1var.html" target="_self">fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
-<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcn1var__helper.html" target="_self">fcn1var_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0 </td></tr>
-<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcnnvar.html" target="_self">fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
-<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" target="_self">fcnnvar_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of N variables </td></tr>
-<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1gradientfcn.html" target="_self">gradientfcn</a></td><td class="desc">Describes a routine capable of computing the gradient vector of an equation of N variables </td></tr>
-<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1iteration__behavior.html" target="_self">iteration_behavior</a></td><td class="desc">Defines a set of parameters that describe the behavior of the iteration process </td></tr>
-<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html" target="_self">jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns </td></tr>
-<tr id="row_0_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html" target="_self">nonlin_optimize_fcn</a></td><td class="desc">Describes the interface of a routine for optimizing an equation of N variables </td></tr>
-<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html" target="_self">nonlin_solver</a></td><td class="desc">Describes the interface of a nonlinear equation solver </td></tr>
-<tr id="row_0_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html" target="_self">nonlin_solver_1var</a></td><td class="desc">Describes the interface of a solver for an equation of one variable </td></tr>
-<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1value__pair.html" target="_self">value_pair</a></td><td class="desc">Defines a pair of numeric values </td></tr>
-<tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1vecfcn.html" target="_self">vecfcn</a></td><td class="desc">Describes an M-element vector-valued function of N-variables </td></tr>
-<tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1vecfcn__helper.html" target="_self">vecfcn_helper</a></td><td class="desc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver </td></tr>
-<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b> </td></tr>
-<tr id="row_1_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" target="_self">least_squares_solver</a></td><td class="desc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems </td></tr>
-<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b> </td></tr>
-<tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__linesearch_1_1line__search.html" target="_self">line_search</a></td><td class="desc">Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems </td></tr>
-<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b> </td></tr>
-<tr id="row_3_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
-<tr id="row_3_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
-<tr id="row_3_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1nelder__mead.html" target="_self">nelder_mead</a></td><td class="desc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables </td></tr>
-<tr id="row_4_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__polynomials.html" target="_self">nonlin_polynomials</a></td><td class="desc"><b>polynomials</b> </td></tr>
-<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html" target="_self">assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
-<tr id="row_4_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html" target="_self">operator(*)</a></td><td class="desc">Defines polynomial multiplication </td></tr>
-<tr id="row_4_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html" target="_self">operator(+)</a></td><td class="desc">Defines polynomial addition </td></tr>
-<tr id="row_4_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html" target="_self">operator(-)</a></td><td class="desc">Defines polynomial subtraction </td></tr>
-<tr id="row_4_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__polynomials_1_1polynomial.html" target="_self">polynomial</a></td><td class="desc">Defines a polynomial, and associated routines for performing polynomial operations </td></tr>
-<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b> </td></tr>
-<tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1brent__solver.html" target="_self">brent_solver</a></td><td class="desc">Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives </td></tr>
-<tr id="row_5_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1line__search__solver.html" target="_self">line_search_solver</a></td><td class="desc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior </td></tr>
-<tr id="row_5_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html" target="_self">newton_1var_solver</a></td><td class="desc">Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations </td></tr>
-<tr id="row_5_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__solver.html" target="_self">newton_solver</a></td><td class="desc">Defines a Newton solver </td></tr>
-<tr id="row_5_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" target="_self">quasi_newton_solver</a></td><td class="desc">Defines a quasi-Newton type solver based upon Broyden's method </td></tr>
+<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__c__api.html" target="_self">nonlin_c_api</a></td><td class="desc">Defines a C-friendly API to the NONLIN library </td></tr>
+<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html" target="_self">c_fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
+<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html" target="_self">c_fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
+<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html" target="_self">c_gradientfcn</a></td><td class="desc">Describes a routin capable of computing the gradient vector of an equation of N variables </td></tr>
+<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html" target="_self">c_jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of a system of equations </td></tr>
+<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1c__polynomial.html" target="_self">c_polynomial</a></td><td class="desc">A type for representing a polynomial in C that is compatible with the polynomial type in this library </td></tr>
+<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html" target="_self">c_vecfcn</a></td><td class="desc">Describes a vector-valued function </td></tr>
+<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1iteration__controls.html" target="_self">iteration_controls</a></td><td class="desc">A type for providing a set of iteration control parameters </td></tr>
+<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1iteration__process.html" target="_self">iteration_process</a></td><td class="desc">A type providing information on the iteration process </td></tr>
+<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1line__search__controls.html" target="_self">line_search_controls</a></td><td class="desc">A type for providing controls on line search parameters </td></tr>
+<tr id="row_1_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__core.html" target="_self">nonlin_core</a></td><td class="desc"><b><a class="el" href="namespacenonlin__core.html" title="nonlin_core">nonlin_core</a></b> </td></tr>
+<tr id="row_1_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
+<tr id="row_1_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver.html" target="_self">equation_solver</a></td><td class="desc">A base class for various solvers of nonlinear systems of equations </td></tr>
+<tr id="row_1_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver__1var.html" target="_self">equation_solver_1var</a></td><td class="desc">A base class for various solvers of equations of one variable </td></tr>
+<tr id="row_1_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcn1var.html" target="_self">fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
+<tr id="row_1_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcn1var__helper.html" target="_self">fcn1var_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0 </td></tr>
+<tr id="row_1_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcnnvar.html" target="_self">fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
+<tr id="row_1_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" target="_self">fcnnvar_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of N variables </td></tr>
+<tr id="row_1_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1gradientfcn.html" target="_self">gradientfcn</a></td><td class="desc">Describes a routine capable of computing the gradient vector of an equation of N variables </td></tr>
+<tr id="row_1_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1iteration__behavior.html" target="_self">iteration_behavior</a></td><td class="desc">Defines a set of parameters that describe the behavior of the iteration process </td></tr>
+<tr id="row_1_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html" target="_self">jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns </td></tr>
+<tr id="row_1_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html" target="_self">nonlin_optimize_fcn</a></td><td class="desc">Describes the interface of a routine for optimizing an equation of N variables </td></tr>
+<tr id="row_1_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html" target="_self">nonlin_solver</a></td><td class="desc">Describes the interface of a nonlinear equation solver </td></tr>
+<tr id="row_1_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html" target="_self">nonlin_solver_1var</a></td><td class="desc">Describes the interface of a solver for an equation of one variable </td></tr>
+<tr id="row_1_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1value__pair.html" target="_self">value_pair</a></td><td class="desc">Defines a pair of numeric values </td></tr>
+<tr id="row_1_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1vecfcn.html" target="_self">vecfcn</a></td><td class="desc">Describes an M-element vector-valued function of N-variables </td></tr>
+<tr id="row_1_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1vecfcn__helper.html" target="_self">vecfcn_helper</a></td><td class="desc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver </td></tr>
+<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__least__squares.html" target="_self">nonlin_least_squares</a></td><td class="desc"><b><a class="el" href="namespacenonlin__least__squares.html" title="nonlin_least_squares">nonlin_least_squares</a></b> </td></tr>
+<tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" target="_self">least_squares_solver</a></td><td class="desc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems </td></tr>
+<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__linesearch.html" target="_self">nonlin_linesearch</a></td><td class="desc"><b><a class="el" href="namespacenonlin__linesearch.html" title="nonlin_linesearch">nonlin_linesearch</a></b> </td></tr>
+<tr id="row_3_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__linesearch_1_1line__search.html" target="_self">line_search</a></td><td class="desc">Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems </td></tr>
+<tr id="row_4_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__optimize.html" target="_self">nonlin_optimize</a></td><td class="desc"><b><a class="el" href="namespacenonlin__optimize.html" title="nonlin_optimize">nonlin_optimize</a></b> </td></tr>
+<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
+<tr id="row_4_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
+<tr id="row_4_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1nelder__mead.html" target="_self">nelder_mead</a></td><td class="desc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables </td></tr>
+<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__polynomials.html" target="_self">nonlin_polynomials</a></td><td class="desc"><b>polynomials</b> </td></tr>
+<tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html" target="_self">assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
+<tr id="row_5_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html" target="_self">operator(*)</a></td><td class="desc">Defines polynomial multiplication </td></tr>
+<tr id="row_5_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html" target="_self">operator(+)</a></td><td class="desc">Defines polynomial addition </td></tr>
+<tr id="row_5_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html" target="_self">operator(-)</a></td><td class="desc">Defines polynomial subtraction </td></tr>
+<tr id="row_5_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__polynomials_1_1polynomial.html" target="_self">polynomial</a></td><td class="desc">Defines a polynomial, and associated routines for performing polynomial operations </td></tr>
+<tr id="row_6_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacenonlin__solve.html" target="_self">nonlin_solve</a></td><td class="desc"><b><a class="el" href="namespacenonlin__solve.html" title="nonlin_solve">nonlin_solve</a></b> </td></tr>
+<tr id="row_6_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1brent__solver.html" target="_self">brent_solver</a></td><td class="desc">Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives </td></tr>
+<tr id="row_6_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1line__search__solver.html" target="_self">line_search_solver</a></td><td class="desc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior </td></tr>
+<tr id="row_6_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html" target="_self">newton_1var_solver</a></td><td class="desc">Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations </td></tr>
+<tr id="row_6_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__solver.html" target="_self">newton_solver</a></td><td class="desc">Defines a Newton solver </td></tr>
+<tr id="row_6_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" target="_self">quasi_newton_solver</a></td><td class="desc">Defines a quasi-Newton type solver based upon Broyden's method </td></tr>
+<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structc__polynomial.html" target="_self">c_polynomial</a></td><td class="desc"></td></tr>
+<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structiteration__controls.html" target="_self">iteration_controls</a></td><td class="desc"></td></tr>
+<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structiteration__process.html" target="_self">iteration_process</a></td><td class="desc"></td></tr>
+<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structline__search__controls.html" target="_self">line_search_controls</a></td><td class="desc"></td></tr>
+<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structvalue__pair.html" target="_self">value_pair</a></td><td class="desc"></td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
diff --git a/doc/html/annotated_dup.js b/doc/html/annotated_dup.js
index 4709796..0682004 100644
--- a/doc/html/annotated_dup.js
+++ b/doc/html/annotated_dup.js
@@ -1,9 +1,15 @@
 var annotated_dup =
 [
+    [ "nonlin_c_api", "namespacenonlin__c__api.html", "namespacenonlin__c__api" ],
     [ "nonlin_core", "namespacenonlin__core.html", "namespacenonlin__core" ],
     [ "nonlin_least_squares", "namespacenonlin__least__squares.html", "namespacenonlin__least__squares" ],
     [ "nonlin_linesearch", "namespacenonlin__linesearch.html", "namespacenonlin__linesearch" ],
     [ "nonlin_optimize", "namespacenonlin__optimize.html", "namespacenonlin__optimize" ],
     [ "nonlin_polynomials", "namespacenonlin__polynomials.html", "namespacenonlin__polynomials" ],
-    [ "nonlin_solve", "namespacenonlin__solve.html", "namespacenonlin__solve" ]
+    [ "nonlin_solve", "namespacenonlin__solve.html", "namespacenonlin__solve" ],
+    [ "c_polynomial", "structc__polynomial.html", "structc__polynomial" ],
+    [ "iteration_controls", "structiteration__controls.html", "structiteration__controls" ],
+    [ "iteration_process", "structiteration__process.html", "structiteration__process" ],
+    [ "line_search_controls", "structline__search__controls.html", "structline__search__controls" ],
+    [ "value_pair", "structvalue__pair.html", "structvalue__pair" ]
 ];
\ No newline at end of file
diff --git a/doc/html/classes.html b/doc/html/classes.html
index 8d8fc1b..c085c39 100644
--- a/doc/html/classes.html
+++ b/doc/html/classes.html
@@ -91,81 +91,99 @@
 <div class="title">Data Types</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
+<div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_c">c</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
 <table class="classindex">
 <tr><td rowspan="2" valign="bottom"><a name="letter_a"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;a&#160;&#160;</div></td></tr></table>
 </td>
-<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table>
+<td valign="top"><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table>
 </td>
-<td rowspan="2" valign="bottom"><a name="letter_j"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;j&#160;&#160;</div></td></tr></table>
+<td valign="top"><a class="el" href="structline__search__controls.html">line_search_controls</a>&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html">operator(-)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;e&#160;&#160;</div></td></tr></table>
 </td>
-<td valign="top"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
+</td>
+</tr>
+<tr><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">assignment(=)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;b&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structiteration__controls.html">iteration_controls</a>&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver.html">equation_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
 <td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;q&#160;&#160;</div></td></tr></table>
 </td>
 </tr>
-<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<tr><td valign="top"><a class="el" href="structnonlin__optimize_1_1bfgs.html">bfgs</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structiteration__process.html">iteration_process</a>&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html">assignment(=)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table>
+</td>
+<td valign="top"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html">newton_1var_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
 <td valign="top"><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html">quasi_newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;b&#160;&#160;</div></td></tr></table>
+<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;c&#160;&#160;</div></td></tr></table>
 </td>
-<td valign="top"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table>
+<td rowspan="2" valign="bottom"><a name="letter_j"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;j&#160;&#160;</div></td></tr></table>
 </td>
-<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__solve_1_1newton__solver.html">newton_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
 <td rowspan="2" valign="bottom"><a name="letter_v"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;v&#160;&#160;</div></td></tr></table>
 </td>
 </tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td valign="top"><a class="el" href="structnonlin__optimize_1_1bfgs.html">bfgs</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a> (<a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>)&#160;&#160;&#160;</td>
-<td rowspan="2" valign="bottom"><a name="letter_o"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;o&#160;&#160;</div></td></tr></table>
+<tr><td valign="top"><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html">jacobianfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structvalue__pair.html">value_pair</a>&#160;&#160;&#160;</td>
+</tr>
+<tr><td valign="top"><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1fcnnvar.html">fcnnvar</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table>
 </td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
 <td valign="top"><a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td valign="top"><a class="el" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
-<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
+<tr><td valign="top"><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">c_gradientfcn</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html">fcnnvar_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_o"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;o&#160;&#160;</div></td></tr></table>
 </td>
-<td valign="top"><a class="el" href="structnonlin__linesearch_1_1line__search.html">line_search</a> (<a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>)&#160;&#160;&#160;</td>
 <td valign="top"><a class="el" href="interfacenonlin__core_1_1vecfcn.html">vecfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;e&#160;&#160;</div></td></tr></table>
+<tr><td valign="top"><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
 </td>
-<td valign="top"><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html">line_search_optimizer</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html">least_squares_solver</a> (<a class="el" href="namespacenonlin__least__squares.html">nonlin_least_squares</a>)&#160;&#160;&#160;</td>
 <td valign="top"><a class="el" href="structnonlin__core_1_1vecfcn__helper.html">vecfcn_helper</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
 </tr>
-<tr><td valign="top"><a class="el" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="structnonlin__solve_1_1line__search__solver.html">line_search_solver</a> (<a class="el" href="namespacenonlin__solve.html">nonlin_solve</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">operator(+)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
-<td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table>
-</td>
-<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
-</td>
-<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html">operator(-)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
-<td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver.html">equation_solver</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
-</td>
-<td></td></tr>
-<tr><td valign="top"><a class="el" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
-<td valign="top"><a class="el" href="structnonlin__optimize_1_1nelder__mead.html">nelder_mead</a> (<a class="el" href="namespacenonlin__optimize.html">nonlin_optimize</a>)&#160;&#160;&#160;</td>
+<tr><td valign="top"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__linesearch_1_1line__search.html">line_search</a> (<a class="el" href="namespacenonlin__linesearch.html">nonlin_linesearch</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html">operator(*)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
 <td></td></tr>
-<tr><td></td><td></td><td></td><td valign="top"><a class="el" href="structnonlin__polynomials_1_1polynomial.html">polynomial</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
+<tr><td valign="top"><a class="el" href="structc__polynomial.html">c_polynomial</a>&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__core_1_1gradientfcn.html">gradientfcn</a> (<a class="el" href="namespacenonlin__core.html">nonlin_core</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a> (<a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a>)&#160;&#160;&#160;</td>
+<td valign="top"><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html">operator(+)</a> (<a class="el" href="namespacenonlin__polynomials.html">nonlin_polynomials</a>)&#160;&#160;&#160;</td>
 <td></td></tr>
 <tr><td></td><td></td><td></td><td></td><td></td></tr>
 </table>
-<div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
+<div class="qindex"><a class="qindex" href="#letter_a">a</a>&#160;|&#160;<a class="qindex" href="#letter_b">b</a>&#160;|&#160;<a class="qindex" href="#letter_c">c</a>&#160;|&#160;<a class="qindex" href="#letter_e">e</a>&#160;|&#160;<a class="qindex" href="#letter_f">f</a>&#160;|&#160;<a class="qindex" href="#letter_g">g</a>&#160;|&#160;<a class="qindex" href="#letter_i">i</a>&#160;|&#160;<a class="qindex" href="#letter_j">j</a>&#160;|&#160;<a class="qindex" href="#letter_l">l</a>&#160;|&#160;<a class="qindex" href="#letter_n">n</a>&#160;|&#160;<a class="qindex" href="#letter_o">o</a>&#160;|&#160;<a class="qindex" href="#letter_p">p</a>&#160;|&#160;<a class="qindex" href="#letter_q">q</a>&#160;|&#160;<a class="qindex" href="#letter_v">v</a></div>
 </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/doc/html/dir_d44c64559bbebec7f509842c48db8b23.html b/doc/html/dir_d44c64559bbebec7f509842c48db8b23.html
new file mode 100644
index 0000000..0a81bf5
--- /dev/null
+++ b/doc/html/dir_d44c64559bbebec7f509842c48db8b23.html
@@ -0,0 +1,106 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/include Directory Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('dir_d44c64559bbebec7f509842c48db8b23.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">include Directory Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/dir_d44c64559bbebec7f509842c48db8b23.js b/doc/html/dir_d44c64559bbebec7f509842c48db8b23.js
new file mode 100644
index 0000000..f4710b9
--- /dev/null
+++ b/doc/html/dir_d44c64559bbebec7f509842c48db8b23.js
@@ -0,0 +1,4 @@
+var dir_d44c64559bbebec7f509842c48db8b23 =
+[
+    [ "nonlin.h", "nonlin_8h_source.html", null ]
+];
\ No newline at end of file
diff --git a/doc/html/files.html b/doc/html/files.html
index 81d29a0..b715518 100644
--- a/doc/html/files.html
+++ b/doc/html/files.html
@@ -93,29 +93,31 @@
 <div class="contents">
 <div class="textblock">Here is a list of all documented files with brief descriptions:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span>]</div><table class="directory">
-<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span id="img_0_" class="iconfopen" onclick="toggleFolder('0_')">&#160;</span><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html" target="_self">src</a></td><td class="desc"></td></tr>
-<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__c__api_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_c_api.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__constants_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_constants.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__core_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_core.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__optimizer_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_optimizer.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver__1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver_1var.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcn1var__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcn1var_helper.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcnnvar__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcnnvar_helper.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__least__squares_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_least_squares.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__linesearch_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_linesearch.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__bfgs_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_bfgs.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_line_search.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__nelder__mead_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_nelder_mead.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__polynomials_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_polynomials.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_16_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__brent_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_brent.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_17_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_line_search.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_18_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_19_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton1var.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_20_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__quasi__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_quasi_newton.f90</b></td><td class="desc"></td></tr>
-<tr id="row_0_21_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__vecfcn__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_vecfcn_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">&#9660;</span><span id="img_0_" class="iconfopen" onclick="toggleFolder('0_')">&#160;</span><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html" target="_self">include</a></td><td class="desc"></td></tr>
+<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin_8h_source.html"><span class="icondoc"></span></a><b>nonlin.h</b></td><td class="desc"></td></tr>
+<tr id="row_1_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span id="img_1_" class="iconfopen" onclick="toggleFolder('1_')">&#160;</span><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html" target="_self">src</a></td><td class="desc"></td></tr>
+<tr id="row_1_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__c__api_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_c_api.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__constants_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_constants.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__core_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_core.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__optimizer_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_optimizer.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__equation__solver__1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_equation_solver_1var.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_6_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcn1var__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcn1var_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_7_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__fcnnvar__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_fcnnvar_helper.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_8_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__least__squares_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_least_squares.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_9_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__linesearch_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_linesearch.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_10_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_11_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__bfgs_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_bfgs.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_12_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_line_search.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_13_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__optimize__nelder__mead_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_optimize_nelder_mead.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_14_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__polynomials_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_polynomials.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_15_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_16_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__brent_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_brent.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_17_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__line__search_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_line_search.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_18_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_19_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__newton1var_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_newton1var.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_20_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__solve__quasi__newton_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_solve_quasi_newton.f90</b></td><td class="desc"></td></tr>
+<tr id="row_1_21_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="nonlin__vecfcn__helper_8f90_source.html"><span class="icondoc"></span></a><b>nonlin_vecfcn_helper.f90</b></td><td class="desc"></td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
diff --git a/doc/html/files_dup.js b/doc/html/files_dup.js
index c3b39c4..89e9042 100644
--- a/doc/html/files_dup.js
+++ b/doc/html/files_dup.js
@@ -1,4 +1,5 @@
 var files_dup =
 [
+    [ "include", "dir_d44c64559bbebec7f509842c48db8b23.html", "dir_d44c64559bbebec7f509842c48db8b23" ],
     [ "src", "dir_68267d1309a1af8e8297ef4c3efbcdba.html", "dir_68267d1309a1af8e8297ef4c3efbcdba" ]
 ];
\ No newline at end of file
diff --git a/doc/html/functions.html b/doc/html/functions.html
index 1d08553..48472e9 100644
--- a/doc/html/functions.html
+++ b/doc/html/functions.html
@@ -89,6 +89,14 @@
 <div class="contents">
 <div class="textblock">Here is a list of all documented data types members with links to the data structure documentation for each member</div>
 
+<h3><a id="index_a"></a>- a -</h3><ul>
+<li>alpha
+: <a class="el" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de">nonlin_c_api::line_search_controls</a>
+</li>
+</ul>
+
+
 <h3><a id="index_c"></a>- c -</h3><ul>
 <li>companion_mtx()
 : <a class="el" href="structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd">nonlin_polynomials::polynomial</a>
@@ -99,6 +107,18 @@ <h3><a id="index_c"></a>- c -</h3><ul>
 <li>converge_on_fcn
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8">nonlin_core::iteration_behavior</a>
 </li>
+<li>converge_on_function
+: <a class="el" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9">nonlin_c_api::iteration_process</a>
+</li>
+<li>converge_on_gradient
+: <a class="el" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18">nonlin_c_api::iteration_process</a>
+</li>
+<li>converge_on_solution_change
+: <a class="el" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56">nonlin_c_api::iteration_process</a>
+</li>
 <li>converge_on_zero_diff
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1">nonlin_core::iteration_behavior</a>
 </li>
@@ -116,6 +136,10 @@ <h3><a id="index_d"></a>- d -</h3><ul>
 
 
 <h3><a id="index_e"></a>- e -</h3><ul>
+<li>enable
+: <a class="el" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b">nonlin_c_api::line_search_controls</a>
+</li>
 <li>evaluate()
 : <a class="el" href="structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980">nonlin_polynomials::polynomial</a>
 </li>
@@ -126,6 +150,10 @@ <h3><a id="index_e"></a>- e -</h3><ul>
 
 
 <h3><a id="index_f"></a>- f -</h3><ul>
+<li>factor
+: <a class="el" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1">nonlin_c_api::line_search_controls</a>
+</li>
 <li>fcn()
 : <a class="el" href="structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93">nonlin_core::fcn1var_helper</a>
 , <a class="el" href="structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404">nonlin_core::fcnnvar_helper</a>
@@ -140,6 +168,14 @@ <h3><a id="index_f"></a>- f -</h3><ul>
 <li>fit_thru_zero()
 : <a class="el" href="structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912">nonlin_polynomials::polynomial</a>
 </li>
+<li>function_eval_count
+: <a class="el" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92">nonlin_c_api::iteration_process</a>
+</li>
+<li>function_tolerance
+: <a class="el" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d">nonlin_c_api::iteration_controls</a>
+</li>
 </ul>
 
 
@@ -218,6 +254,14 @@ <h3><a id="index_g"></a>- g -</h3><ul>
 <li>gradient_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105">nonlin_core::iteration_behavior</a>
 </li>
+<li>gradient_eval_count
+: <a class="el" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187">nonlin_c_api::iteration_process</a>
+</li>
+<li>gradient_tolerance
+: <a class="el" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e">nonlin_c_api::iteration_controls</a>
+</li>
 </ul>
 
 
@@ -246,6 +290,10 @@ <h3><a id="index_i"></a>- i -</h3><ul>
 <li>iter_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52">nonlin_core::iteration_behavior</a>
 </li>
+<li>iteration_count
+: <a class="el" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732">nonlin_c_api::iteration_process</a>
+</li>
 </ul>
 
 
@@ -256,6 +304,10 @@ <h3><a id="index_j"></a>- j -</h3><ul>
 <li>jacobian_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2">nonlin_core::iteration_behavior</a>
 </li>
+<li>jacobian_eval_count
+: <a class="el" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf">nonlin_c_api::iteration_process</a>
+</li>
 </ul>
 
 
@@ -337,6 +389,12 @@ <h3><a id="index_m"></a>- m -</h3><ul>
 , <a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a">nonlin_core::equation_solver_1var</a>
 , <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">nonlin_optimize::line_search_optimizer</a>
 </li>
+<li>max_function_evals
+: <a class="el" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">iteration_controls</a>
+, <a class="el" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089">nonlin_c_api::iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35">nonlin_c_api::line_search_controls</a>
+</li>
 </ul>
 
 
@@ -369,6 +427,14 @@ <h3><a id="index_p"></a>- p -</h3><ul>
 <li>poly_poly_subtract()
 : <a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3">nonlin_polynomials::operator(-)</a>
 </li>
+<li>print_status
+: <a class="el" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3">nonlin_c_api::iteration_controls</a>
+</li>
+<li>ptr
+: <a class="el" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">c_polynomial</a>
+, <a class="el" href="structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4">nonlin_c_api::c_polynomial</a>
+</li>
 </ul>
 
 
@@ -456,6 +522,14 @@ <h3><a id="index_s"></a>- s -</h3><ul>
 , <a class="el" href="structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95">nonlin_core::equation_solver_1var</a>
 , <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45">nonlin_optimize::line_search_optimizer</a>
 </li>
+<li>size_in_bytes
+: <a class="el" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">c_polynomial</a>
+, <a class="el" href="structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e">nonlin_c_api::c_polynomial</a>
+</li>
+<li>solution_tolerance
+: <a class="el" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4">nonlin_c_api::iteration_controls</a>
+</li>
 <li>solve()
 : <a class="el" href="structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917">nonlin_core::equation_optimizer</a>
 , <a class="el" href="structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391">nonlin_core::equation_solver</a>
@@ -474,9 +548,11 @@ <h3><a id="index_s"></a>- s -</h3><ul>
 <h3><a id="index_x"></a>- x -</h3><ul>
 <li>x1
 : <a class="el" href="structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87">nonlin_core::value_pair</a>
+, <a class="el" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">value_pair</a>
 </li>
 <li>x2
 : <a class="el" href="structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73">nonlin_core::value_pair</a>
+, <a class="el" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">value_pair</a>
 </li>
 </ul>
 </div><!-- contents -->
diff --git a/doc/html/functions_vars.html b/doc/html/functions_vars.html
index a816922..9d21e3d 100644
--- a/doc/html/functions_vars.html
+++ b/doc/html/functions_vars.html
@@ -89,6 +89,14 @@
 <div class="contents">
 &#160;
 
+<h3><a id="index_a"></a>- a -</h3><ul>
+<li>alpha
+: <a class="el" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de">nonlin_c_api::line_search_controls</a>
+</li>
+</ul>
+
+
 <h3><a id="index_c"></a>- c -</h3><ul>
 <li>converge_on_chng
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec">nonlin_core::iteration_behavior</a>
@@ -96,16 +104,48 @@ <h3><a id="index_c"></a>- c -</h3><ul>
 <li>converge_on_fcn
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8">nonlin_core::iteration_behavior</a>
 </li>
+<li>converge_on_function
+: <a class="el" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9">nonlin_c_api::iteration_process</a>
+</li>
+<li>converge_on_gradient
+: <a class="el" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18">nonlin_c_api::iteration_process</a>
+</li>
+<li>converge_on_solution_change
+: <a class="el" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56">nonlin_c_api::iteration_process</a>
+</li>
 <li>converge_on_zero_diff
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1">nonlin_core::iteration_behavior</a>
 </li>
 </ul>
 
 
+<h3><a id="index_e"></a>- e -</h3><ul>
+<li>enable
+: <a class="el" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b">nonlin_c_api::line_search_controls</a>
+</li>
+</ul>
+
+
 <h3><a id="index_f"></a>- f -</h3><ul>
+<li>factor
+: <a class="el" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1">nonlin_c_api::line_search_controls</a>
+</li>
 <li>fcn_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4">nonlin_core::iteration_behavior</a>
 </li>
+<li>function_eval_count
+: <a class="el" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92">nonlin_c_api::iteration_process</a>
+</li>
+<li>function_tolerance
+: <a class="el" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d">nonlin_c_api::iteration_controls</a>
+</li>
 </ul>
 
 
@@ -113,6 +153,14 @@ <h3><a id="index_g"></a>- g -</h3><ul>
 <li>gradient_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105">nonlin_core::iteration_behavior</a>
 </li>
+<li>gradient_eval_count
+: <a class="el" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187">nonlin_c_api::iteration_process</a>
+</li>
+<li>gradient_tolerance
+: <a class="el" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e">nonlin_c_api::iteration_controls</a>
+</li>
 </ul>
 
 
@@ -120,6 +168,10 @@ <h3><a id="index_i"></a>- i -</h3><ul>
 <li>iter_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52">nonlin_core::iteration_behavior</a>
 </li>
+<li>iteration_count
+: <a class="el" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732">nonlin_c_api::iteration_process</a>
+</li>
 </ul>
 
 
@@ -127,6 +179,10 @@ <h3><a id="index_j"></a>- j -</h3><ul>
 <li>jacobian_count
 : <a class="el" href="structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2">nonlin_core::iteration_behavior</a>
 </li>
+<li>jacobian_eval_count
+: <a class="el" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">iteration_process</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf">nonlin_c_api::iteration_process</a>
+</li>
 </ul>
 
 
@@ -208,15 +264,47 @@ <h3><a id="index_m"></a>- m -</h3><ul>
 , <a class="el" href="structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a">nonlin_core::equation_solver_1var</a>
 , <a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc">nonlin_optimize::line_search_optimizer</a>
 </li>
+<li>max_function_evals
+: <a class="el" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">iteration_controls</a>
+, <a class="el" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">line_search_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089">nonlin_c_api::iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35">nonlin_c_api::line_search_controls</a>
+</li>
+</ul>
+
+
+<h3><a id="index_p"></a>- p -</h3><ul>
+<li>print_status
+: <a class="el" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3">nonlin_c_api::iteration_controls</a>
+</li>
+<li>ptr
+: <a class="el" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">c_polynomial</a>
+, <a class="el" href="structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4">nonlin_c_api::c_polynomial</a>
+</li>
+</ul>
+
+
+<h3><a id="index_s"></a>- s -</h3><ul>
+<li>size_in_bytes
+: <a class="el" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">c_polynomial</a>
+, <a class="el" href="structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e">nonlin_c_api::c_polynomial</a>
+</li>
+<li>solution_tolerance
+: <a class="el" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">iteration_controls</a>
+, <a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4">nonlin_c_api::iteration_controls</a>
+</li>
 </ul>
 
 
 <h3><a id="index_x"></a>- x -</h3><ul>
 <li>x1
 : <a class="el" href="structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87">nonlin_core::value_pair</a>
+, <a class="el" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">value_pair</a>
 </li>
 <li>x2
 : <a class="el" href="structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73">nonlin_core::value_pair</a>
+, <a class="el" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">value_pair</a>
 </li>
 </ul>
 </div><!-- contents -->
diff --git a/doc/html/hierarchy.html b/doc/html/hierarchy.html
index 1851427..990d106 100644
--- a/doc/html/hierarchy.html
+++ b/doc/html/hierarchy.html
@@ -94,36 +94,50 @@
 <div class="textblock">This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span>]</div><table class="directory">
 <tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1assignment_07_0a_08.html" target="_self">nonlin_polynomials::assignment(=)</a></td><td class="desc">Defines polynomial assignment </td></tr>
-<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">nonlin_core::equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
-<tr id="row_1_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">nonlin_optimize::line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
-<tr id="row_1_0_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">nonlin_optimize::bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
-<tr id="row_1_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1nelder__mead.html" target="_self">nonlin_optimize::nelder_mead</a></td><td class="desc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables </td></tr>
-<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver.html" target="_self">nonlin_core::equation_solver</a></td><td class="desc">A base class for various solvers of nonlinear systems of equations </td></tr>
-<tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" target="_self">nonlin_least_squares::least_squares_solver</a></td><td class="desc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems </td></tr>
-<tr id="row_2_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_2_1_" class="arrow" onclick="toggleFolder('2_1_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1line__search__solver.html" target="_self">nonlin_solve::line_search_solver</a></td><td class="desc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior </td></tr>
-<tr id="row_2_1_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__solver.html" target="_self">nonlin_solve::newton_solver</a></td><td class="desc">Defines a Newton solver </td></tr>
-<tr id="row_2_1_1_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" target="_self">nonlin_solve::quasi_newton_solver</a></td><td class="desc">Defines a quasi-Newton type solver based upon Broyden's method </td></tr>
-<tr id="row_3_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver__1var.html" target="_self">nonlin_core::equation_solver_1var</a></td><td class="desc">A base class for various solvers of equations of one variable </td></tr>
-<tr id="row_3_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1brent__solver.html" target="_self">nonlin_solve::brent_solver</a></td><td class="desc">Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives </td></tr>
-<tr id="row_3_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html" target="_self">nonlin_solve::newton_1var_solver</a></td><td class="desc">Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations </td></tr>
-<tr id="row_4_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcn1var.html" target="_self">nonlin_core::fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
-<tr id="row_5_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcn1var__helper.html" target="_self">nonlin_core::fcn1var_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0 </td></tr>
-<tr id="row_6_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcnnvar.html" target="_self">nonlin_core::fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
-<tr id="row_7_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" target="_self">nonlin_core::fcnnvar_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of N variables </td></tr>
-<tr id="row_8_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1gradientfcn.html" target="_self">nonlin_core::gradientfcn</a></td><td class="desc">Describes a routine capable of computing the gradient vector of an equation of N variables </td></tr>
-<tr id="row_9_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1iteration__behavior.html" target="_self">nonlin_core::iteration_behavior</a></td><td class="desc">Defines a set of parameters that describe the behavior of the iteration process </td></tr>
-<tr id="row_10_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html" target="_self">nonlin_core::jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns </td></tr>
-<tr id="row_11_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__linesearch_1_1line__search.html" target="_self">nonlin_linesearch::line_search</a></td><td class="desc">Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems </td></tr>
-<tr id="row_12_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html" target="_self">nonlin_core::nonlin_optimize_fcn</a></td><td class="desc">Describes the interface of a routine for optimizing an equation of N variables </td></tr>
-<tr id="row_13_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html" target="_self">nonlin_core::nonlin_solver</a></td><td class="desc">Describes the interface of a nonlinear equation solver </td></tr>
-<tr id="row_14_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html" target="_self">nonlin_core::nonlin_solver_1var</a></td><td class="desc">Describes the interface of a solver for an equation of one variable </td></tr>
-<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html" target="_self">nonlin_polynomials::operator(*)</a></td><td class="desc">Defines polynomial multiplication </td></tr>
-<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html" target="_self">nonlin_polynomials::operator(+)</a></td><td class="desc">Defines polynomial addition </td></tr>
-<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html" target="_self">nonlin_polynomials::operator(-)</a></td><td class="desc">Defines polynomial subtraction </td></tr>
-<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__polynomials_1_1polynomial.html" target="_self">nonlin_polynomials::polynomial</a></td><td class="desc">Defines a polynomial, and associated routines for performing polynomial operations </td></tr>
-<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1value__pair.html" target="_self">nonlin_core::value_pair</a></td><td class="desc">Defines a pair of numeric values </td></tr>
-<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1vecfcn.html" target="_self">nonlin_core::vecfcn</a></td><td class="desc">Describes an M-element vector-valued function of N-variables </td></tr>
-<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1vecfcn__helper.html" target="_self">nonlin_core::vecfcn_helper</a></td><td class="desc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver </td></tr>
+<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html" target="_self">nonlin_c_api::c_fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
+<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html" target="_self">nonlin_c_api::c_fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
+<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html" target="_self">nonlin_c_api::c_gradientfcn</a></td><td class="desc">Describes a routin capable of computing the gradient vector of an equation of N variables </td></tr>
+<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html" target="_self">nonlin_c_api::c_jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of a system of equations </td></tr>
+<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1c__polynomial.html" target="_self">nonlin_c_api::c_polynomial</a></td><td class="desc">A type for representing a polynomial in C that is compatible with the polynomial type in this library </td></tr>
+<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structc__polynomial.html" target="_self">c_polynomial</a></td><td class="desc"></td></tr>
+<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html" target="_self">nonlin_c_api::c_vecfcn</a></td><td class="desc">Describes a vector-valued function </td></tr>
+<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__optimizer.html" target="_self">nonlin_core::equation_optimizer</a></td><td class="desc">A base class for optimization of an equation of multiple variables </td></tr>
+<tr id="row_8_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1line__search__optimizer.html" target="_self">nonlin_optimize::line_search_optimizer</a></td><td class="desc">A class describing equation optimizers that use a line search algorithm to improve convergence behavior </td></tr>
+<tr id="row_8_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1bfgs.html" target="_self">nonlin_optimize::bfgs</a></td><td class="desc">Defines a Broyden–Fletcher–Goldfarb–Shanno (BFGS) solver for minimization of functions of multiple variables </td></tr>
+<tr id="row_8_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__optimize_1_1nelder__mead.html" target="_self">nonlin_optimize::nelder_mead</a></td><td class="desc">Defines a solver based upon Nelder and Mead's simplex algorithm for minimization of functions of multiple variables </td></tr>
+<tr id="row_9_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver.html" target="_self">nonlin_core::equation_solver</a></td><td class="desc">A base class for various solvers of nonlinear systems of equations </td></tr>
+<tr id="row_9_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__least__squares_1_1least__squares__solver.html" target="_self">nonlin_least_squares::least_squares_solver</a></td><td class="desc">Defines a Levenberg-Marquardt based solver for unconstrained least-squares problems </td></tr>
+<tr id="row_9_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_1_" class="arrow" onclick="toggleFolder('9_1_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1line__search__solver.html" target="_self">nonlin_solve::line_search_solver</a></td><td class="desc">A class describing nonlinear solvers that use a line search algorithm to improve convergence behavior </td></tr>
+<tr id="row_9_1_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__solver.html" target="_self">nonlin_solve::newton_solver</a></td><td class="desc">Defines a Newton solver </td></tr>
+<tr id="row_9_1_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1quasi__newton__solver.html" target="_self">nonlin_solve::quasi_newton_solver</a></td><td class="desc">Defines a quasi-Newton type solver based upon Broyden's method </td></tr>
+<tr id="row_10_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1equation__solver__1var.html" target="_self">nonlin_core::equation_solver_1var</a></td><td class="desc">A base class for various solvers of equations of one variable </td></tr>
+<tr id="row_10_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1brent__solver.html" target="_self">nonlin_solve::brent_solver</a></td><td class="desc">Defines a solver based upon Brent's method for solving an equation of one variable without using derivatives </td></tr>
+<tr id="row_10_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__solve_1_1newton__1var__solver.html" target="_self">nonlin_solve::newton_1var_solver</a></td><td class="desc">Defines a solver based upon Newtons's method for solving an equation of one variable. The algorithm uses a bisection method in conjunction with Newton's method in order to keep bounds upon the Newton iterations </td></tr>
+<tr id="row_11_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcn1var.html" target="_self">nonlin_core::fcn1var</a></td><td class="desc">Describes a function of one variable </td></tr>
+<tr id="row_12_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcn1var__helper.html" target="_self">nonlin_core::fcn1var_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0 </td></tr>
+<tr id="row_13_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1fcnnvar.html" target="_self">nonlin_core::fcnnvar</a></td><td class="desc">Describes a function of N variables </td></tr>
+<tr id="row_14_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1fcnnvar__helper.html" target="_self">nonlin_core::fcnnvar_helper</a></td><td class="desc">Defines a type capable of encapsulating an equation of N variables </td></tr>
+<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1gradientfcn.html" target="_self">nonlin_core::gradientfcn</a></td><td class="desc">Describes a routine capable of computing the gradient vector of an equation of N variables </td></tr>
+<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1iteration__behavior.html" target="_self">nonlin_core::iteration_behavior</a></td><td class="desc">Defines a set of parameters that describe the behavior of the iteration process </td></tr>
+<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structiteration__controls.html" target="_self">iteration_controls</a></td><td class="desc"></td></tr>
+<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1iteration__controls.html" target="_self">nonlin_c_api::iteration_controls</a></td><td class="desc">A type for providing a set of iteration control parameters </td></tr>
+<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structiteration__process.html" target="_self">iteration_process</a></td><td class="desc"></td></tr>
+<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1iteration__process.html" target="_self">nonlin_c_api::iteration_process</a></td><td class="desc">A type providing information on the iteration process </td></tr>
+<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1jacobianfcn.html" target="_self">nonlin_core::jacobianfcn</a></td><td class="desc">Describes a routine capable of computing the Jacobian matrix of M functions of N unknowns </td></tr>
+<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__linesearch_1_1line__search.html" target="_self">nonlin_linesearch::line_search</a></td><td class="desc">Defines a type capable of performing an inexact, backtracking line search to find a point as far along the specified direction vector that is usable for unconstrained minimization problems </td></tr>
+<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__c__api_1_1line__search__controls.html" target="_self">nonlin_c_api::line_search_controls</a></td><td class="desc">A type for providing controls on line search parameters </td></tr>
+<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structline__search__controls.html" target="_self">line_search_controls</a></td><td class="desc"></td></tr>
+<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html" target="_self">nonlin_core::nonlin_optimize_fcn</a></td><td class="desc">Describes the interface of a routine for optimizing an equation of N variables </td></tr>
+<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver.html" target="_self">nonlin_core::nonlin_solver</a></td><td class="desc">Describes the interface of a nonlinear equation solver </td></tr>
+<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1nonlin__solver__1var.html" target="_self">nonlin_core::nonlin_solver_1var</a></td><td class="desc">Describes the interface of a solver for an equation of one variable </td></tr>
+<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_5_08.html" target="_self">nonlin_polynomials::operator(*)</a></td><td class="desc">Defines polynomial multiplication </td></tr>
+<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07_09_08.html" target="_self">nonlin_polynomials::operator(+)</a></td><td class="desc">Defines polynomial addition </td></tr>
+<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__polynomials_1_1operator_07-_08.html" target="_self">nonlin_polynomials::operator(-)</a></td><td class="desc">Defines polynomial subtraction </td></tr>
+<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__polynomials_1_1polynomial.html" target="_self">nonlin_polynomials::polynomial</a></td><td class="desc">Defines a polynomial, and associated routines for performing polynomial operations </td></tr>
+<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structvalue__pair.html" target="_self">value_pair</a></td><td class="desc"></td></tr>
+<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1value__pair.html" target="_self">nonlin_core::value_pair</a></td><td class="desc">Defines a pair of numeric values </td></tr>
+<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="interfacenonlin__core_1_1vecfcn.html" target="_self">nonlin_core::vecfcn</a></td><td class="desc">Describes an M-element vector-valued function of N-variables </td></tr>
+<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="structnonlin__core_1_1vecfcn__helper.html" target="_self">nonlin_core::vecfcn_helper</a></td><td class="desc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0. This type is used to establish the system of equations to solve, and provides a means for computing the Jacobian matrix for the system of equations, and any other ancillary operations that may be needed by the solver </td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
diff --git a/doc/html/hierarchy.js b/doc/html/hierarchy.js
index cbb9d9e..a035010 100644
--- a/doc/html/hierarchy.js
+++ b/doc/html/hierarchy.js
@@ -1,6 +1,13 @@
 var hierarchy =
 [
     [ "nonlin_polynomials::assignment(=)", "interfacenonlin__polynomials_1_1assignment_07_0a_08.html", null ],
+    [ "nonlin_c_api::c_fcn1var", "interfacenonlin__c__api_1_1c__fcn1var.html", null ],
+    [ "nonlin_c_api::c_fcnnvar", "interfacenonlin__c__api_1_1c__fcnnvar.html", null ],
+    [ "nonlin_c_api::c_gradientfcn", "interfacenonlin__c__api_1_1c__gradientfcn.html", null ],
+    [ "nonlin_c_api::c_jacobianfcn", "interfacenonlin__c__api_1_1c__jacobianfcn.html", null ],
+    [ "nonlin_c_api::c_polynomial", "structnonlin__c__api_1_1c__polynomial.html", null ],
+    [ "c_polynomial", "structc__polynomial.html", null ],
+    [ "nonlin_c_api::c_vecfcn", "interfacenonlin__c__api_1_1c__vecfcn.html", null ],
     [ "nonlin_core::equation_optimizer", "structnonlin__core_1_1equation__optimizer.html", [
       [ "nonlin_optimize::line_search_optimizer", "structnonlin__optimize_1_1line__search__optimizer.html", [
         [ "nonlin_optimize::bfgs", "structnonlin__optimize_1_1bfgs.html", null ]
@@ -24,8 +31,14 @@ var hierarchy =
     [ "nonlin_core::fcnnvar_helper", "structnonlin__core_1_1fcnnvar__helper.html", null ],
     [ "nonlin_core::gradientfcn", "interfacenonlin__core_1_1gradientfcn.html", null ],
     [ "nonlin_core::iteration_behavior", "structnonlin__core_1_1iteration__behavior.html", null ],
+    [ "iteration_controls", "structiteration__controls.html", null ],
+    [ "nonlin_c_api::iteration_controls", "structnonlin__c__api_1_1iteration__controls.html", null ],
+    [ "iteration_process", "structiteration__process.html", null ],
+    [ "nonlin_c_api::iteration_process", "structnonlin__c__api_1_1iteration__process.html", null ],
     [ "nonlin_core::jacobianfcn", "interfacenonlin__core_1_1jacobianfcn.html", null ],
     [ "nonlin_linesearch::line_search", "structnonlin__linesearch_1_1line__search.html", null ],
+    [ "nonlin_c_api::line_search_controls", "structnonlin__c__api_1_1line__search__controls.html", null ],
+    [ "line_search_controls", "structline__search__controls.html", null ],
     [ "nonlin_core::nonlin_optimize_fcn", "interfacenonlin__core_1_1nonlin__optimize__fcn.html", null ],
     [ "nonlin_core::nonlin_solver", "interfacenonlin__core_1_1nonlin__solver.html", null ],
     [ "nonlin_core::nonlin_solver_1var", "interfacenonlin__core_1_1nonlin__solver__1var.html", null ],
@@ -33,6 +46,7 @@ var hierarchy =
     [ "nonlin_polynomials::operator(+)", "interfacenonlin__polynomials_1_1operator_07_09_08.html", null ],
     [ "nonlin_polynomials::operator(-)", "interfacenonlin__polynomials_1_1operator_07-_08.html", null ],
     [ "nonlin_polynomials::polynomial", "structnonlin__polynomials_1_1polynomial.html", null ],
+    [ "value_pair", "structvalue__pair.html", null ],
     [ "nonlin_core::value_pair", "structnonlin__core_1_1value__pair.html", null ],
     [ "nonlin_core::vecfcn", "interfacenonlin__core_1_1vecfcn.html", null ],
     [ "nonlin_core::vecfcn_helper", "structnonlin__core_1_1vecfcn__helper.html", null ]
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcn1var-members.html b/doc/html/interfacenonlin__c__api_1_1c__fcn1var-members.html
new file mode 100644
index 0000000..d365282
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcn1var-members.html
@@ -0,0 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__fcn1var.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_fcn1var Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">nonlin_c_api::c_fcn1var</a>, including all inherited members.</p>
+<table class="directory">
+  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>c_fcn1var</b>(x) (defined in <a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">nonlin_c_api::c_fcn1var</a>)</td><td class="entry"><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">nonlin_c_api::c_fcn1var</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcn1var.html b/doc/html/interfacenonlin__c__api_1_1c__fcn1var.html
new file mode 100644
index 0000000..bee2423
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcn1var.html
@@ -0,0 +1,133 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_fcn1var Interface Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__fcn1var.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="interfacenonlin__c__api_1_1c__fcn1var-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_fcn1var Interface Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Describes a function of one variable.  
+ <a href="interfacenonlin__c__api_1_1c__fcn1var.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:a5c1128d4cccad315639af012c2878942"><td class="memItemLeft" align="right" valign="top"><a id="a5c1128d4cccad315639af012c2878942"></a>
+real(c_double) function&#160;</td><td class="memItemRight" valign="bottom"><b>c_fcn1var</b> (x)</td></tr>
+<tr class="separator:a5c1128d4cccad315639af012c2878942"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Describes a function of one variable. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>The independent variable. </td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>The value of the function at <code>x</code>. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00022">22</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this interface was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcn1var.js b/doc/html/interfacenonlin__c__api_1_1c__fcn1var.js
new file mode 100644
index 0000000..d23df2f
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcn1var.js
@@ -0,0 +1,4 @@
+var interfacenonlin__c__api_1_1c__fcn1var =
+[
+    [ "c_fcn1var", "interfacenonlin__c__api_1_1c__fcn1var.html#a5c1128d4cccad315639af012c2878942", null ]
+];
\ No newline at end of file
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcnnvar-members.html b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar-members.html
new file mode 100644
index 0000000..20dfb6c
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar-members.html
@@ -0,0 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__fcnnvar.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_fcnnvar Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">nonlin_c_api::c_fcnnvar</a>, including all inherited members.</p>
+<table class="directory">
+  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>c_fcnnvar</b>(n, x) (defined in <a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">nonlin_c_api::c_fcnnvar</a>)</td><td class="entry"><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">nonlin_c_api::c_fcnnvar</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.html b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.html
new file mode 100644
index 0000000..25b0544
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.html
@@ -0,0 +1,134 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_fcnnvar Interface Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__fcnnvar.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="interfacenonlin__c__api_1_1c__fcnnvar-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_fcnnvar Interface Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Describes a function of N variables.  
+ <a href="interfacenonlin__c__api_1_1c__fcnnvar.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:a884bbe04fd5b8ac13f878bc892d23b44"><td class="memItemLeft" align="right" valign="top"><a id="a884bbe04fd5b8ac13f878bc892d23b44"></a>
+real(c_double) function&#160;</td><td class="memItemRight" valign="bottom"><b>c_fcnnvar</b> (n, x)</td></tr>
+<tr class="separator:a884bbe04fd5b8ac13f878bc892d23b44"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Describes a function of N variables. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of independent variables. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the independent variables. </td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>The value of the function at <code>x</code>. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00033">33</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this interface was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.js b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.js
new file mode 100644
index 0000000..776b829
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__fcnnvar.js
@@ -0,0 +1,4 @@
+var interfacenonlin__c__api_1_1c__fcnnvar =
+[
+    [ "c_fcnnvar", "interfacenonlin__c__api_1_1c__fcnnvar.html#a884bbe04fd5b8ac13f878bc892d23b44", null ]
+];
\ No newline at end of file
diff --git a/doc/html/interfacenonlin__c__api_1_1c__gradientfcn-members.html b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn-members.html
new file mode 100644
index 0000000..7c296de
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn-members.html
@@ -0,0 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__gradientfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_gradientfcn Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">nonlin_c_api::c_gradientfcn</a>, including all inherited members.</p>
+<table class="directory">
+  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>c_gradientfcn</b>(n, x, g) (defined in <a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">nonlin_c_api::c_gradientfcn</a>)</td><td class="entry"><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">nonlin_c_api::c_gradientfcn</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.html b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.html
new file mode 100644
index 0000000..4982680
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.html
@@ -0,0 +1,134 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_gradientfcn Interface Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__gradientfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="interfacenonlin__c__api_1_1c__gradientfcn-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_gradientfcn Interface Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Describes a routin capable of computing the gradient vector of an equation of N variables.  
+ <a href="interfacenonlin__c__api_1_1c__gradientfcn.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:a948b595e8d8c6afbe1866aea265b6457"><td class="memItemLeft" align="right" valign="top"><a id="a948b595e8d8c6afbe1866aea265b6457"></a>
+subroutine&#160;</td><td class="memItemRight" valign="bottom"><b>c_gradientfcn</b> (n, x, g)</td></tr>
+<tr class="separator:a948b595e8d8c6afbe1866aea265b6457"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Describes a routin capable of computing the gradient vector of an equation of N variables. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of independent variables. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the independent variables. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">g</td><td>An N-element array where the gradient vector will be written as output. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00062">62</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this interface was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">c_gradientfcn</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.js b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.js
new file mode 100644
index 0000000..8f9f007
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__gradientfcn.js
@@ -0,0 +1,4 @@
+var interfacenonlin__c__api_1_1c__gradientfcn =
+[
+    [ "c_gradientfcn", "interfacenonlin__c__api_1_1c__gradientfcn.html#a948b595e8d8c6afbe1866aea265b6457", null ]
+];
\ No newline at end of file
diff --git a/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn-members.html b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn-members.html
new file mode 100644
index 0000000..450caba
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn-members.html
@@ -0,0 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__jacobianfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_jacobianfcn Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">nonlin_c_api::c_jacobianfcn</a>, including all inherited members.</p>
+<table class="directory">
+  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>c_jacobianfcn</b>(neqn, nvar, x, jac) (defined in <a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">nonlin_c_api::c_jacobianfcn</a>)</td><td class="entry"><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">nonlin_c_api::c_jacobianfcn</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.html b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.html
new file mode 100644
index 0000000..92e2992
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.html
@@ -0,0 +1,135 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_jacobianfcn Interface Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__jacobianfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="interfacenonlin__c__api_1_1c__jacobianfcn-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_jacobianfcn Interface Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Describes a routine capable of computing the Jacobian matrix of a system of equations.  
+ <a href="interfacenonlin__c__api_1_1c__jacobianfcn.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:a6bc2fd4684ac9f4c506c6822a5f26a56"><td class="memItemLeft" align="right" valign="top"><a id="a6bc2fd4684ac9f4c506c6822a5f26a56"></a>
+subroutine&#160;</td><td class="memItemRight" valign="bottom"><b>c_jacobianfcn</b> (neqn, nvar, x, jac)</td></tr>
+<tr class="separator:a6bc2fd4684ac9f4c506c6822a5f26a56"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Describes a routine capable of computing the Jacobian matrix of a system of equations. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">neqn</td><td>The number of equations. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">nvar</td><td>The number of independent variables. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An NVAR-element array containing the independent variables. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">jac</td><td>An NEQN-by-NVAR matrix where the Jacobian will be written. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00078">78</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this interface was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.js b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.js
new file mode 100644
index 0000000..cd3efb0
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__jacobianfcn.js
@@ -0,0 +1,4 @@
+var interfacenonlin__c__api_1_1c__jacobianfcn =
+[
+    [ "c_jacobianfcn", "interfacenonlin__c__api_1_1c__jacobianfcn.html#a6bc2fd4684ac9f4c506c6822a5f26a56", null ]
+];
\ No newline at end of file
diff --git a/doc/html/interfacenonlin__c__api_1_1c__vecfcn-members.html b/doc/html/interfacenonlin__c__api_1_1c__vecfcn-members.html
new file mode 100644
index 0000000..74d5f0f
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__vecfcn-members.html
@@ -0,0 +1,109 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__vecfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_vecfcn Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">nonlin_c_api::c_vecfcn</a>, including all inherited members.</p>
+<table class="directory">
+  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>c_vecfcn</b>(neqn, nvar, x, f) (defined in <a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">nonlin_c_api::c_vecfcn</a>)</td><td class="entry"><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">nonlin_c_api::c_vecfcn</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__vecfcn.html b/doc/html/interfacenonlin__c__api_1_1c__vecfcn.html
new file mode 100644
index 0000000..1e1008b
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__vecfcn.html
@@ -0,0 +1,135 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_vecfcn Interface Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('interfacenonlin__c__api_1_1c__vecfcn.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="interfacenonlin__c__api_1_1c__vecfcn-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_vecfcn Interface Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>Describes a vector-valued function.  
+ <a href="interfacenonlin__c__api_1_1c__vecfcn.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:abda164dcd0c71297071fd60b0afd2b0f"><td class="memItemLeft" align="right" valign="top"><a id="abda164dcd0c71297071fd60b0afd2b0f"></a>
+subroutine&#160;</td><td class="memItemRight" valign="bottom"><b>c_vecfcn</b> (neqn, nvar, x, f)</td></tr>
+<tr class="separator:abda164dcd0c71297071fd60b0afd2b0f"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Describes a vector-valued function. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">neqn</td><td>The number of equations. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">nvar</td><td>The number of independent variables. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An NVAR-element array containing the independent variables. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An NEQN-element array containing the values of the function at <code>x</code>. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00048">48</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this interface was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/interfacenonlin__c__api_1_1c__vecfcn.js b/doc/html/interfacenonlin__c__api_1_1c__vecfcn.js
new file mode 100644
index 0000000..894268d
--- /dev/null
+++ b/doc/html/interfacenonlin__c__api_1_1c__vecfcn.js
@@ -0,0 +1,4 @@
+var interfacenonlin__c__api_1_1c__vecfcn =
+[
+    [ "c_vecfcn", "interfacenonlin__c__api_1_1c__vecfcn.html#abda164dcd0c71297071fd60b0afd2b0f", null ]
+];
\ No newline at end of file
diff --git a/doc/html/menudata.js b/doc/html/menudata.js
index 6e93387..0892047 100644
--- a/doc/html/menudata.js
+++ b/doc/html/menudata.js
@@ -26,6 +26,7 @@ var menudata={children:[
 {text:"Modules List",url:"namespaces.html"},
 {text:"Module Members",url:"namespacemembers.html",children:[
 {text:"All",url:"namespacemembers.html",children:[
+{text:"c",url:"namespacemembers.html#index_c"},
 {text:"d",url:"namespacemembers.html#index_d"},
 {text:"g",url:"namespacemembers.html#index_g"},
 {text:"i",url:"namespacemembers.html#index_i"},
@@ -36,6 +37,7 @@ var menudata={children:[
 {text:"s",url:"namespacemembers.html#index_s"},
 {text:"t",url:"namespacemembers.html#index_t"}]},
 {text:"Functions/Subroutines",url:"namespacemembers_func.html",children:[
+{text:"c",url:"namespacemembers_func.html#index_c"},
 {text:"d",url:"namespacemembers_func.html#index_d"},
 {text:"g",url:"namespacemembers_func.html#index_g"},
 {text:"i",url:"namespacemembers_func.html#index_i"},
@@ -51,6 +53,7 @@ var menudata={children:[
 {text:"Class Hierarchy",url:"hierarchy.html"},
 {text:"Data Fields",url:"functions.html",children:[
 {text:"All",url:"functions.html",children:[
+{text:"a",url:"functions.html#index_a"},
 {text:"c",url:"functions.html#index_c"},
 {text:"d",url:"functions.html#index_d"},
 {text:"e",url:"functions.html#index_e"},
@@ -77,12 +80,16 @@ var menudata={children:[
 {text:"r",url:"functions_func.html#index_r"},
 {text:"s",url:"functions_func.html#index_s"}]},
 {text:"Variables",url:"functions_vars.html",children:[
+{text:"a",url:"functions_vars.html#index_a"},
 {text:"c",url:"functions_vars.html#index_c"},
+{text:"e",url:"functions_vars.html#index_e"},
 {text:"f",url:"functions_vars.html#index_f"},
 {text:"g",url:"functions_vars.html#index_g"},
 {text:"i",url:"functions_vars.html#index_i"},
 {text:"j",url:"functions_vars.html#index_j"},
 {text:"m",url:"functions_vars.html#index_m"},
+{text:"p",url:"functions_vars.html#index_p"},
+{text:"s",url:"functions_vars.html#index_s"},
 {text:"x",url:"functions_vars.html#index_x"}]}]}]},
 {text:"Files",url:"files.html",children:[
 {text:"File List",url:"files.html"}]}]}
diff --git a/doc/html/namespacemembers.html b/doc/html/namespacemembers.html
index f0c16ad..90f9901 100644
--- a/doc/html/namespacemembers.html
+++ b/doc/html/namespacemembers.html
@@ -89,6 +89,64 @@
 <div class="contents">
 <div class="textblock">Here is a list of all documented module members with links to the modules they belong to:</div>
 
+<h3><a id="index_c"></a>- c -</h3><ul>
+<li>c_evaluate_polynomial_complex()
+: <a class="el" href="namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc">nonlin_c_api</a>
+</li>
+<li>c_evaluate_polynomial_real()
+: <a class="el" href="namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1">nonlin_c_api</a>
+</li>
+<li>c_fit_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66">nonlin_c_api</a>
+</li>
+<li>c_free_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c">nonlin_c_api</a>
+</li>
+<li>c_get_polynomial_coefficients()
+: <a class="el" href="namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265">nonlin_c_api</a>
+</li>
+<li>c_get_polynomial_order()
+: <a class="el" href="namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c">nonlin_c_api</a>
+</li>
+<li>c_init_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce">nonlin_c_api</a>
+</li>
+<li>c_polynomial_roots()
+: <a class="el" href="namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0">nonlin_c_api</a>
+</li>
+<li>c_set_default_line_search_settings()
+: <a class="el" href="namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35">nonlin_c_api</a>
+</li>
+<li>c_set_default_solver_settings()
+: <a class="el" href="namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7">nonlin_c_api</a>
+</li>
+<li>c_set_polynomial_coefficients()
+: <a class="el" href="namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498">nonlin_c_api</a>
+</li>
+<li>c_solver_bfgs()
+: <a class="el" href="namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96">nonlin_c_api</a>
+</li>
+<li>c_solver_brent_1var()
+: <a class="el" href="namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13">nonlin_c_api</a>
+</li>
+<li>c_solver_least_squares()
+: <a class="el" href="namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1">nonlin_c_api</a>
+</li>
+<li>c_solver_nelder_mead()
+: <a class="el" href="namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8">nonlin_c_api</a>
+</li>
+<li>c_solver_newton()
+: <a class="el" href="namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b">nonlin_c_api</a>
+</li>
+<li>c_solver_newton_1var()
+: <a class="el" href="namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d">nonlin_c_api</a>
+</li>
+<li>c_solver_quasi_newton()
+: <a class="el" href="namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c">nonlin_c_api</a>
+</li>
+</ul>
+
+
 <h3><a id="index_d"></a>- d -</h3><ul>
 <li>dbl_poly_mult()
 : <a class="el" href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">nonlin_polynomials</a>
@@ -191,6 +249,9 @@ <h3><a id="index_n"></a>- n -</h3><ul>
 <li>nl_invalid_operation_error
 : <a class="el" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">nonlin_constants</a>
 </li>
+<li>nl_no_error
+: <a class="el" href="namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde">nonlin_constants</a>
+</li>
 <li>nl_out_of_memory_error
 : <a class="el" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">nonlin_constants</a>
 </li>
diff --git a/doc/html/namespacemembers_func.html b/doc/html/namespacemembers_func.html
index 8da0578..15dedf0 100644
--- a/doc/html/namespacemembers_func.html
+++ b/doc/html/namespacemembers_func.html
@@ -89,6 +89,64 @@
 <div class="contents">
 &#160;
 
+<h3><a id="index_c"></a>- c -</h3><ul>
+<li>c_evaluate_polynomial_complex()
+: <a class="el" href="namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc">nonlin_c_api</a>
+</li>
+<li>c_evaluate_polynomial_real()
+: <a class="el" href="namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1">nonlin_c_api</a>
+</li>
+<li>c_fit_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66">nonlin_c_api</a>
+</li>
+<li>c_free_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c">nonlin_c_api</a>
+</li>
+<li>c_get_polynomial_coefficients()
+: <a class="el" href="namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265">nonlin_c_api</a>
+</li>
+<li>c_get_polynomial_order()
+: <a class="el" href="namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c">nonlin_c_api</a>
+</li>
+<li>c_init_polynomial()
+: <a class="el" href="namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce">nonlin_c_api</a>
+</li>
+<li>c_polynomial_roots()
+: <a class="el" href="namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0">nonlin_c_api</a>
+</li>
+<li>c_set_default_line_search_settings()
+: <a class="el" href="namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35">nonlin_c_api</a>
+</li>
+<li>c_set_default_solver_settings()
+: <a class="el" href="namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7">nonlin_c_api</a>
+</li>
+<li>c_set_polynomial_coefficients()
+: <a class="el" href="namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498">nonlin_c_api</a>
+</li>
+<li>c_solver_bfgs()
+: <a class="el" href="namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96">nonlin_c_api</a>
+</li>
+<li>c_solver_brent_1var()
+: <a class="el" href="namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13">nonlin_c_api</a>
+</li>
+<li>c_solver_least_squares()
+: <a class="el" href="namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1">nonlin_c_api</a>
+</li>
+<li>c_solver_nelder_mead()
+: <a class="el" href="namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8">nonlin_c_api</a>
+</li>
+<li>c_solver_newton()
+: <a class="el" href="namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b">nonlin_c_api</a>
+</li>
+<li>c_solver_newton_1var()
+: <a class="el" href="namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d">nonlin_c_api</a>
+</li>
+<li>c_solver_quasi_newton()
+: <a class="el" href="namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c">nonlin_c_api</a>
+</li>
+</ul>
+
+
 <h3><a id="index_d"></a>- d -</h3><ul>
 <li>dbl_poly_mult()
 : <a class="el" href="namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c">nonlin_polynomials</a>
diff --git a/doc/html/namespacemembers_vars.html b/doc/html/namespacemembers_vars.html
index 8572816..c248277 100644
--- a/doc/html/namespacemembers_vars.html
+++ b/doc/html/namespacemembers_vars.html
@@ -103,6 +103,9 @@
 <li>nl_invalid_operation_error
 : <a class="el" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">nonlin_constants</a>
 </li>
+<li>nl_no_error
+: <a class="el" href="namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde">nonlin_constants</a>
+</li>
 <li>nl_out_of_memory_error
 : <a class="el" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">nonlin_constants</a>
 </li>
diff --git a/doc/html/namespacenonlin__c__api.html b/doc/html/namespacenonlin__c__api.html
index cbcb680..e9ad463 100644
--- a/doc/html/namespacenonlin__c__api.html
+++ b/doc/html/namespacenonlin__c__api.html
@@ -87,6 +87,9 @@
 </div>
 
 <div class="header">
+  <div class="summary">
+<a href="#nested-classes">Data Types</a> &#124;
+<a href="#func-members">Functions/Subroutines</a>  </div>
   <div class="headertitle">
 <div class="title">nonlin_c_api Module Reference</div>  </div>
 </div><!--header-->
@@ -94,9 +97,1177 @@
 
 <p>Defines a C-friendly API to the NONLIN library.  
 <a href="namespacenonlin__c__api.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
+Data Types</h2></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Describes a function of one variable.  <a href="interfacenonlin__c__api_1_1c__fcn1var.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Describes a function of N variables.  <a href="interfacenonlin__c__api_1_1c__fcnnvar.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__c__api_1_1c__gradientfcn.html">c_gradientfcn</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Describes a routin capable of computing the gradient vector of an equation of N variables.  <a href="interfacenonlin__c__api_1_1c__gradientfcn.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Describes a routine capable of computing the Jacobian matrix of a system of equations.  <a href="interfacenonlin__c__api_1_1c__jacobianfcn.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">type &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A type for representing a polynomial in C that is compatible with the polynomial type in this library.  <a href="structnonlin__c__api_1_1c__polynomial.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">interface &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Describes a vector-valued function.  <a href="interfacenonlin__c__api_1_1c__vecfcn.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">type &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A type for providing a set of iteration control parameters.  <a href="structnonlin__c__api_1_1iteration__controls.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">type &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A type providing information on the iteration process.  <a href="structnonlin__c__api_1_1iteration__process.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">type &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A type for providing controls on line search parameters.  <a href="structnonlin__c__api_1_1line__search__controls.html#details">More...</a><br /></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table><table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
+Functions/Subroutines</h2></td></tr>
+<tr class="memitem:a8a4c4cb414ea515eef7af9fdecb670f7"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7">c_set_default_solver_settings</a> (x)</td></tr>
+<tr class="memdesc:a8a4c4cb414ea515eef7af9fdecb670f7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines standard solver settings.  <a href="namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7">More...</a><br /></td></tr>
+<tr class="separator:a8a4c4cb414ea515eef7af9fdecb670f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a811151a2deb2f3b49f86467fb0b22e35"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35">c_set_default_line_search_settings</a> (x)</td></tr>
+<tr class="memdesc:a811151a2deb2f3b49f86467fb0b22e35"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines standard line search settings.  <a href="namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35">More...</a><br /></td></tr>
+<tr class="separator:a811151a2deb2f3b49f86467fb0b22e35"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ade127c74ece722479ab78b009c9dc62d"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d">c_solver_newton_1var</a> (fcn, limits, x, f, cntrls, stats)</td></tr>
+<tr class="memdesc:ade127c74ece722479ab78b009c9dc62d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes Newton's method to sovle an equation of one variable. <br  />
+ The derivative calculation will be numerically estimated.  <a href="namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d">More...</a><br /></td></tr>
+<tr class="separator:ade127c74ece722479ab78b009c9dc62d"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:af7cb73b66273ab59a7c1d0957ee4ad13"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13">c_solver_brent_1var</a> (fcn, x, f, limits, cntrls, stats)</td></tr>
+<tr class="memdesc:af7cb73b66273ab59a7c1d0957ee4ad13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes Brent's method to solve an equation of one variable.  <a href="namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13">More...</a><br /></td></tr>
+<tr class="separator:af7cb73b66273ab59a7c1d0957ee4ad13"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aaa633714eb4d8c8206b6ad6afa15b83c"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c">c_solver_quasi_newton</a> (fcn, jac, n, x, f, cntrls, ls, stats)</td></tr>
+<tr class="memdesc:aaa633714eb4d8c8206b6ad6afa15b83c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes Broyden's Quasi-Newton method to solve a system of N equations of N unknowns. A backtracking type line search is also employed.  <a href="namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c">More...</a><br /></td></tr>
+<tr class="separator:aaa633714eb4d8c8206b6ad6afa15b83c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a7d284884dde01451a137c92f5135625b"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b">c_solver_newton</a> (fcn, jac, n, x, f, cntrls, ls, stats)</td></tr>
+<tr class="memdesc:a7d284884dde01451a137c92f5135625b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes Newton's method to solve a system of N equations of N unknowns in conjuction with a backtracking type line search.  <a href="namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b">More...</a><br /></td></tr>
+<tr class="separator:a7d284884dde01451a137c92f5135625b"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a55b78a3b660a4600fbea209c49d5aba1"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1">c_solver_least_squares</a> (fcn, jac, neqn, nvar, x, f, cntrls, stats)</td></tr>
+<tr class="memdesc:a55b78a3b660a4600fbea209c49d5aba1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes the Levenberg-Marquardt method to solve a least-squares problem of M equations of N unknowns. There must be at least as many equations as unknowns for this solver.  <a href="namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1">More...</a><br /></td></tr>
+<tr class="separator:a55b78a3b660a4600fbea209c49d5aba1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a95c8612176d7551bf6795b9c0c3085e8"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8">c_solver_nelder_mead</a> (fcn, n, x, f, cntrls, stats)</td></tr>
+<tr class="memdesc:a95c8612176d7551bf6795b9c0c3085e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes Nelder and Mead's simplex algorithm to minimize a function of N variables.  <a href="namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8">More...</a><br /></td></tr>
+<tr class="separator:a95c8612176d7551bf6795b9c0c3085e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a33b7f81bea4bb9c4a0de9920b7d0fe96"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96">c_solver_bfgs</a> (fcn, grad, n, x, f, cntrls, ls, stats)</td></tr>
+<tr class="memdesc:a33b7f81bea4bb9c4a0de9920b7d0fe96"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utilizes a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to minimize a function of N variables.  <a href="namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96">More...</a><br /></td></tr>
+<tr class="separator:a33b7f81bea4bb9c4a0de9920b7d0fe96"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:abc356d02daa6404eac943028ff0117ce"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce">c_init_polynomial</a> (order, poly)</td></tr>
+<tr class="memdesc:abc356d02daa6404eac943028ff0117ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes a new C-compatible polynomial object.  <a href="namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce">More...</a><br /></td></tr>
+<tr class="separator:abc356d02daa6404eac943028ff0117ce"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:acd7aedd4b47a57e65ae98c3af2fc4a0c"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c">c_free_polynomial</a> (poly)</td></tr>
+<tr class="memdesc:acd7aedd4b47a57e65ae98c3af2fc4a0c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Frees memory allocated for the polynomial object.  <a href="namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c">More...</a><br /></td></tr>
+<tr class="separator:acd7aedd4b47a57e65ae98c3af2fc4a0c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aa7cc59e88998293eb66fac2e28cc5d9c"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c">c_get_polynomial_order</a> (poly)</td></tr>
+<tr class="memdesc:aa7cc59e88998293eb66fac2e28cc5d9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the order of the polynomial.  <a href="namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c">More...</a><br /></td></tr>
+<tr class="separator:aa7cc59e88998293eb66fac2e28cc5d9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a81148de3345c2ac1e90d0ac457456b66"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66">c_fit_polynomial</a> (poly, n, x, y, zero)</td></tr>
+<tr class="memdesc:a81148de3345c2ac1e90d0ac457456b66"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fits a data set to the polynomial.  <a href="namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66">More...</a><br /></td></tr>
+<tr class="separator:a81148de3345c2ac1e90d0ac457456b66"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a153532b0432c694c1fc3aea0e1d4f265"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265">c_get_polynomial_coefficients</a> (poly, nc, c)</td></tr>
+<tr class="memdesc:a153532b0432c694c1fc3aea0e1d4f265"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets an array containing the polynomial coefficients in ascending order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.  <a href="namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265">More...</a><br /></td></tr>
+<tr class="separator:a153532b0432c694c1fc3aea0e1d4f265"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a159ced3d2aef9077a43a14ab9a8b5498"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498">c_set_polynomial_coefficients</a> (poly, nc, c)</td></tr>
+<tr class="memdesc:a159ced3d2aef9077a43a14ab9a8b5498"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets the coefficients of the polynomial by using an array containing the polynomial coefficients in ascending order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N.  <a href="namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498">More...</a><br /></td></tr>
+<tr class="separator:a159ced3d2aef9077a43a14ab9a8b5498"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a4a845e24ea0918325aa3136e1f29ceb1"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1">c_evaluate_polynomial_real</a> (poly, n, x, y)</td></tr>
+<tr class="memdesc:a4a845e24ea0918325aa3136e1f29ceb1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates the polynomial at the specified values.  <a href="namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1">More...</a><br /></td></tr>
+<tr class="separator:a4a845e24ea0918325aa3136e1f29ceb1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:af540e9baac4eac9640ce35ef24e298bc"><td class="memItemLeft" align="right" valign="top">subroutine&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc">c_evaluate_polynomial_complex</a> (poly, n, x, y)</td></tr>
+<tr class="memdesc:af540e9baac4eac9640ce35ef24e298bc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluates the polynomial at the specified values.  <a href="namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc">More...</a><br /></td></tr>
+<tr class="separator:af540e9baac4eac9640ce35ef24e298bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a31e4af5cc4449ef458093dc89db279e0"><td class="memItemLeft" align="right" valign="top">integer(c_int) function&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0">c_polynomial_roots</a> (poly, n, rts)</td></tr>
+<tr class="memdesc:a31e4af5cc4449ef458093dc89db279e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the roots of the polynomial.  <a href="namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0">More...</a><br /></td></tr>
+<tr class="separator:a31e4af5cc4449ef458093dc89db279e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Defines a C-friendly API to the NONLIN library. </p>
-</div></div><!-- contents -->
+</div><h2 class="groupheader">Function/Subroutine Documentation</h2>
+<a id="af540e9baac4eac9640ce35ef24e298bc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af540e9baac4eac9640ce35ef24e298bc">&#9670;&nbsp;</a></span>c_evaluate_polynomial_complex()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">subroutine nonlin_c_api::c_evaluate_polynomial_complex </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">complex(c_double), dimension(n), intent(in)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">complex(c_double), dimension(n), intent(out)&#160;</td>
+          <td class="paramname"><em>y</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Evaluates the polynomial at the specified values. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of points at which to evaluate the polynomial. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the values at which to evaluate the polynomial. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">y</td><td>An N-element array where the results of the polynomial evaluation will be written. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l01193">1193</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a4a845e24ea0918325aa3136e1f29ceb1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4a845e24ea0918325aa3136e1f29ceb1">&#9670;&nbsp;</a></span>c_evaluate_polynomial_real()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">subroutine nonlin_c_api::c_evaluate_polynomial_real </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(in)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(out)&#160;</td>
+          <td class="paramname"><em>y</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Evaluates the polynomial at the specified values. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of points at which to evaluate the polynomial. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array containing the values at which to evaluate the polynomial. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">y</td><td>An N-element array where the results of the polynomial evaluation will be written. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l01158">1158</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a81148de3345c2ac1e90d0ac457456b66"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a81148de3345c2ac1e90d0ac457456b66">&#9670;&nbsp;</a></span>c_fit_polynomial()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_fit_polynomial </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(inout)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(in)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(in)&#160;</td>
+          <td class="paramname"><em>y</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">logical(c_bool), intent(in), value&#160;</td>
+          <td class="paramname"><em>zero</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Fits a data set to the polynomial. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of data points to fit. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">x</td><td>An N-element array of the independent variable data points. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">y</td><td>An N-element array of the dependent variable data points. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">zero</td><td>Set to true to force the fit thru zero; else, set to false.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.<ul>
+<li>NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order was specified, or if order is too large for the data set.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available. </li>
+</ul>
+</li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00971">971</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="acd7aedd4b47a57e65ae98c3af2fc4a0c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acd7aedd4b47a57e65ae98c3af2fc4a0c">&#9670;&nbsp;</a></span>c_free_polynomial()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">subroutine nonlin_c_api::c_free_polynomial </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(inout)&#160;</td>
+          <td class="paramname"><em>poly</em></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Frees memory allocated for the polynomial object. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">poly</td><td>The polynomial object to free. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00901">901</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a153532b0432c694c1fc3aea0e1d4f265"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a153532b0432c694c1fc3aea0e1d4f265">&#9670;&nbsp;</a></span>c_get_polynomial_coefficients()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_get_polynomial_coefficients </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>nc</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(nc), intent(out)&#160;</td>
+          <td class="paramname"><em>c</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Gets an array containing the polynomial coefficients in ascending order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">nc</td><td>The number of elements in <code>c</code>. Ideally, this value is one greater than the order of the polynomial. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">c</td><td>An NC-element array where the coefficients will be written.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if <code>nc</code> is smaller than one greater than the order of the polynomial. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l01041">1041</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="aa7cc59e88998293eb66fac2e28cc5d9c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa7cc59e88998293eb66fac2e28cc5d9c">&#9670;&nbsp;</a></span>c_get_polynomial_order()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_get_polynomial_order </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>poly</em></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Gets the order of the polynomial. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>The order of the polynomial. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00929">929</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="abc356d02daa6404eac943028ff0117ce"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#abc356d02daa6404eac943028ff0117ce">&#9670;&nbsp;</a></span>c_init_polynomial()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_init_polynomial </td>
+          <td>(</td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>order</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>poly</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Initializes a new C-compatible polynomial object. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">order</td><td>The order of the polynomial. This must be at least 1. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">poly</td><td>A pointer to the polynomial object.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.<ul>
+<li>NL_INVALID_INPUT_ERROR: Occurs if a zero or negative polynomial order was specified.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if insufficient memory is available. </li>
+</ul>
+</li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00861">861</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a31e4af5cc4449ef458093dc89db279e0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a31e4af5cc4449ef458093dc89db279e0">&#9670;&nbsp;</a></span>c_polynomial_roots()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_polynomial_roots </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">complex(c_double), dimension(n), intent(out)&#160;</td>
+          <td class="paramname"><em>rts</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Computes the roots of the polynomial. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>THe size of <code>rts</code>. This must be equal to the order of the polynomial. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">rts</td><td>An N-element array where the roots of the polynomial will be written.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if <code>n</code> is not equal to the order of the polynomial.<ul>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if local memory must be allocated, and there is insufficient memory available.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the algorithm failed to converge. </li>
+</ul>
+</li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l01235">1235</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a811151a2deb2f3b49f86467fb0b22e35"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a811151a2deb2f3b49f86467fb0b22e35">&#9670;&nbsp;</a></span>c_set_default_line_search_settings()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">subroutine nonlin_c_api::c_set_default_line_search_settings </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>x</em></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Defines standard line search settings. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[out]</td><td class="paramname">x</td><td>The <a class="el" href="structnonlin__c__api_1_1line__search__controls.html" title="A type for providing controls on line search parameters.">line_search_controls</a> item to populate. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00182">182</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a8a4c4cb414ea515eef7af9fdecb670f7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8a4c4cb414ea515eef7af9fdecb670f7">&#9670;&nbsp;</a></span>c_set_default_solver_settings()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">subroutine nonlin_c_api::c_set_default_solver_settings </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>x</em></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Defines standard solver settings. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[out]</td><td class="paramname">x</td><td>The <a class="el" href="structnonlin__c__api_1_1iteration__controls.html" title="A type for providing a set of iteration control parameters.">iteration_controls</a> item to populate. </td></tr>
+  </table>
+  </dd>
+</dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00165">165</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a159ced3d2aef9077a43a14ab9a8b5498"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a159ced3d2aef9077a43a14ab9a8b5498">&#9670;&nbsp;</a></span>c_set_polynomial_coefficients()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_set_polynomial_coefficients </td>
+          <td>(</td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a>), intent(inout)&#160;</td>
+          <td class="paramname"><em>poly</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>nc</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(nc)&#160;</td>
+          <td class="paramname"><em>c</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Sets the coefficients of the polynomial by using an array containing the polynomial coefficients in ascending order such that f(x) = c0 + c1 * x + c2 * x**2 .... + cN * x**N. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">poly</td><td>The polynomial object. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">nc</td><td>The number of elements in @P c. This value must be one greater than the order of the polynomial. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">c</td><td>The NC-element array containing the new polynomial coefficients in ascending order.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if <code>nc</code> is not equal to than one greater than the order of the polynomial. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l01096">1096</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a33b7f81bea4bb9c4a0de9920b7d0fe96"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a33b7f81bea4bb9c4a0de9920b7d0fe96">&#9670;&nbsp;</a></span>c_solver_bfgs()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_bfgs </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>grad</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>ls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes a Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to minimize a function of N variables. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to minimize. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">grad</td><td>A function for evaluating the gradiant. If null, the gradient is estimated numerically. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of variables. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an N-element array containing an initial estimate to the solution. On output, the updated solution estimate. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>On output, the value of the function at <code>x</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">ls</td><td>The line search controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if <code>x</code> is not appropriately sized for the problem as defined in <code>fcn</code>.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory available.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within the allowed number of iterations. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00768">768</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="af7cb73b66273ab59a7c1d0957ee4ad13"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af7cb73b66273ab59a7c1d0957ee4ad13">&#9670;&nbsp;</a></span>c_solver_brent_1var()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_brent_1var </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a>), intent(in), value&#160;</td>
+          <td class="paramname"><em>limits</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes Brent's method to solve an equation of one variable. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to solve. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, the initial guess. On output, the solution. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>The value of the function at the solution. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">limits</td><td>A set of limits on the solution bounding the solution range thereby preventing the solver from wandering too far off course. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within the allowed number of iterations. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00284">284</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a55b78a3b660a4600fbea209c49d5aba1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a55b78a3b660a4600fbea209c49d5aba1">&#9670;&nbsp;</a></span>c_solver_least_squares()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_least_squares </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>jac</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>neqn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>nvar</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(nvar), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(neqn), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes the Levenberg-Marquardt method to solve a least-squares problem of M equations of N unknowns. There must be at least as many equations as unknowns for this solver. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">jac</td><td>A function for evaluating the Jacobian. If null, the Jacobian is estimated numerically. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">neqn</td><td>The number of equations. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">nvar</td><td>The number of variables. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an NVAR element array containing the initial estimate to the solution. On output, the solution. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An NEQN-element array that, on output, will contain the values of each equation as evaluated at the output solution given in <code>x</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if the number of equations is less than than the number of variables.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within the allowed number of iterations.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory available.</li>
+<li>NL_TOLERANCE_TOO_SMALL_ERROR: Occurs if the requested tolerance is to small to be practical for the problem at hand. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00596">596</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a95c8612176d7551bf6795b9c0c3085e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a95c8612176d7551bf6795b9c0c3085e8">&#9670;&nbsp;</a></span>c_solver_nelder_mead()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_nelder_mead </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes Nelder and Mead's simplex algorithm to minimize a function of N variables. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to minimize. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of variables. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an N-element array containing an initial estimate to the solution. On output, the updated solution estimate. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>On output, the value of the function at <code>x</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.</li>
+<li>NL_INVALID_INPUT_ERROR: Occurs if <code>x</code> is not appropriately sized for the problem as defined in <code>fcn</code>.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory available.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within the allowed number of iterations. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00688">688</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="a7d284884dde01451a137c92f5135625b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7d284884dde01451a137c92f5135625b">&#9670;&nbsp;</a></span>c_solver_newton()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_newton </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>jac</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>ls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes Newton's method to solve a system of N equations of N unknowns in conjuction with a backtracking type line search. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">jac</td><td>A function for evaluating the Jacobian. If null, the Jacobian is estimated numerically. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of equations. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an N-element array containing an initial estimate to the solution. On output, the updated solution estimate. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An N-element array that, on output, will contain the values of each equation as evaluated at the variable values given in <code>x</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">ls</td><td>The line search controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.<ul>
+<li>NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized correctly.</li>
+</ul>
+</li>
+<li>NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is pointing in an apparent uphill direction.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within the allowed number of iterations.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory available.</li>
+<li>NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the gradient vector becomes sufficiently close to zero. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00485">485</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="ade127c74ece722479ab78b009c9dc62d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ade127c74ece722479ab78b009c9dc62d">&#9670;&nbsp;</a></span>c_solver_newton_1var()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_newton_1var </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__core_1_1value__pair.html">value_pair</a>), intent(in), value&#160;</td>
+          <td class="paramname"><em>limits</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(out)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes Newton's method to sovle an equation of one variable. <br  />
+ The derivative calculation will be numerically estimated. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">limits</td><td>A set of limits on the solution bounding the solution range thereby preventing the solver from wandering too far off course. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">x</td><td>The solution. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>The value of the function at the solution. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the algorithm cannot converge within the allowed number of iterations. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00211">211</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+<a id="aaa633714eb4d8c8206b6ad6afa15b83c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aaa633714eb4d8c8206b6ad6afa15b83c">&#9670;&nbsp;</a></span>c_solver_quasi_newton()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">integer(c_int) function nonlin_c_api::c_solver_quasi_newton </td>
+          <td>(</td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>fcn</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(c_funptr), intent(in), value&#160;</td>
+          <td class="paramname"><em>jac</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">integer(c_int), intent(in), value&#160;</td>
+          <td class="paramname"><em>n</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(inout)&#160;</td>
+          <td class="paramname"><em>x</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">real(c_double), dimension(n), intent(out)&#160;</td>
+          <td class="paramname"><em>f</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>cntrls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a>), intent(in)&#160;</td>
+          <td class="paramname"><em>ls</em>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">type(<a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a>), intent(out)&#160;</td>
+          <td class="paramname"><em>stats</em>&#160;</td>
+        </tr>
+        <tr>
+          <td></td>
+          <td>)</td>
+          <td></td><td></td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Utilizes Broyden's Quasi-Newton method to solve a system of N equations of N unknowns. A backtracking type line search is also employed. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The function to solve. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">jac</td><td>A function for evaluating the Jacobian. If null, the Jacobian is estimated numerically. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>The number of equations. </td></tr>
+    <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>On input, an N-element array containing an initial estimate to the solution. On output, the updated solution estimate. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An N-element array that, on output, will contain the values of each equation as evaluated at the variable values given in <code>x</code>. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">cntrls</td><td>The iteration controls. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">ls</td><td>The line search controls. </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">stats</td><td>The iteration status.</td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>An error flag with the following possible values.<ul>
+<li>NL_NO_ERROR: No error has occurred - successful execution.</li>
+<li>NL_INVALID_OPERATION_ERROR: Occurs if no equations have been defined.<ul>
+<li>NL_ARRAY_SIZE_ERROR: Occurs if any of the input arrays are not sized correctly.</li>
+</ul>
+</li>
+<li>NL_DIVERGENT_BEHAVIOR_ERROR: Occurs if the direction vector is pointing in an apparent uphill direction.</li>
+<li>NL_CONVERGENCE_ERROR: Occurs if the line search cannot converge within the allowed number of iterations.</li>
+<li>NL_OUT_OF_MEMORY_ERROR: Occurs if there is insufficient memory available.</li>
+<li>NL_SPURIOUS_CONVERGENCE_ERROR: Occurs as a warning if the slope of the gradient vector becomes sufficiently close to zero. </li>
+</ul>
+</dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00373">373</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+
+</div>
+</div>
+</div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
diff --git a/doc/html/namespacenonlin__c__api.js b/doc/html/namespacenonlin__c__api.js
new file mode 100644
index 0000000..4758c77
--- /dev/null
+++ b/doc/html/namespacenonlin__c__api.js
@@ -0,0 +1,12 @@
+var namespacenonlin__c__api =
+[
+    [ "c_fcn1var", "interfacenonlin__c__api_1_1c__fcn1var.html", "interfacenonlin__c__api_1_1c__fcn1var" ],
+    [ "c_fcnnvar", "interfacenonlin__c__api_1_1c__fcnnvar.html", "interfacenonlin__c__api_1_1c__fcnnvar" ],
+    [ "c_gradientfcn", "interfacenonlin__c__api_1_1c__gradientfcn.html", "interfacenonlin__c__api_1_1c__gradientfcn" ],
+    [ "c_jacobianfcn", "interfacenonlin__c__api_1_1c__jacobianfcn.html", "interfacenonlin__c__api_1_1c__jacobianfcn" ],
+    [ "c_polynomial", "structnonlin__c__api_1_1c__polynomial.html", "structnonlin__c__api_1_1c__polynomial" ],
+    [ "c_vecfcn", "interfacenonlin__c__api_1_1c__vecfcn.html", "interfacenonlin__c__api_1_1c__vecfcn" ],
+    [ "iteration_controls", "structnonlin__c__api_1_1iteration__controls.html", "structnonlin__c__api_1_1iteration__controls" ],
+    [ "iteration_process", "structnonlin__c__api_1_1iteration__process.html", "structnonlin__c__api_1_1iteration__process" ],
+    [ "line_search_controls", "structnonlin__c__api_1_1line__search__controls.html", "structnonlin__c__api_1_1line__search__controls" ]
+];
\ No newline at end of file
diff --git a/doc/html/namespacenonlin__constants.html b/doc/html/namespacenonlin__constants.html
index bd1f1d3..7bb6b43 100644
--- a/doc/html/namespacenonlin__constants.html
+++ b/doc/html/namespacenonlin__constants.html
@@ -99,6 +99,10 @@
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
 Variables</h2></td></tr>
+<tr class="memitem:a6d1b967272d8890af7951e3b2c834dde"><td class="memItemLeft" align="right" valign="top"><a id="a6d1b967272d8890af7951e3b2c834dde"></a>
+integer(int32), parameter&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde">nl_no_error</a> = 0</td></tr>
+<tr class="memdesc:a6d1b967272d8890af7951e3b2c834dde"><td class="mdescLeft">&#160;</td><td class="mdescRight">A flag denoting no error. <br /></td></tr>
+<tr class="separator:a6d1b967272d8890af7951e3b2c834dde"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aea9acca28551e2c88635255bfd2c3f2d"><td class="memItemLeft" align="right" valign="top"><a id="aea9acca28551e2c88635255bfd2c3f2d"></a>
 integer(int32), parameter&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d">nl_invalid_input_error</a> = 201</td></tr>
 <tr class="memdesc:aea9acca28551e2c88635255bfd2c3f2d"><td class="mdescLeft">&#160;</td><td class="mdescRight">An error flag denoting an invalid input. <br /></td></tr>
diff --git a/doc/html/namespacenonlin__linesearch.html b/doc/html/namespacenonlin__linesearch.html
index e594f60..925c5d6 100644
--- a/doc/html/namespacenonlin__linesearch.html
+++ b/doc/html/namespacenonlin__linesearch.html
@@ -493,7 +493,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#afcde68c8af7940be93c7f2d1
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__linesearch_1_1line__search.html" title="Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...">line_search</a> object. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>A vecfcn_helper object containing the system of equations. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>A fcnnvar_helper object containing the system of equations. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">xold</td><td>An N-element array defining the initial point, where N is the number of variables. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">grad</td><td>An N-element array defining the gradient of <code>fcn</code> evaluated at <code>xold</code>. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">dir</td><td>An N-element array defining the search direction. </td></tr>
diff --git a/doc/html/navtreedata.js b/doc/html/navtreedata.js
index a0888e0..ea14b22 100644
--- a/doc/html/navtreedata.js
+++ b/doc/html/navtreedata.js
@@ -50,7 +50,8 @@ var NAVTREE =
 
 var NAVTREEINDEX =
 [
-"annotated.html"
+"annotated.html",
+"structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0"
 ];
 
 var SYNCONMSG = 'click to disable panel synchronisation';
diff --git a/doc/html/navtreeindex0.js b/doc/html/navtreeindex0.js
index c475422..4697836 100644
--- a/doc/html/navtreeindex0.js
+++ b/doc/html/navtreeindex0.js
@@ -2,7 +2,8 @@ var NAVTREEINDEX0 =
 {
 "annotated.html":[2,0],
 "classes.html":[2,1],
-"dir_68267d1309a1af8e8297ef4c3efbcdba.html":[3,0,0],
+"dir_68267d1309a1af8e8297ef4c3efbcdba.html":[3,0,1],
+"dir_d44c64559bbebec7f509842c48db8b23.html":[3,0,0],
 "files.html":[3,0],
 "functions.html":[2,3,0],
 "functions_func.html":[2,3,1],
@@ -10,239 +11,243 @@ var NAVTREEINDEX0 =
 "hierarchy.html":[2,2],
 "index.html":[],
 "index.html#intro_sec":[0],
-"interfacenonlin__core_1_1fcn1var.html":[2,0,0,3],
-"interfacenonlin__core_1_1fcn1var.html#aa058523902d94e85867a76f129c27ce0":[2,0,0,3,0],
-"interfacenonlin__core_1_1fcnnvar.html":[2,0,0,5],
-"interfacenonlin__core_1_1fcnnvar.html#a6b4c08adbe44af2c3d5ae606610881f0":[2,0,0,5,0],
-"interfacenonlin__core_1_1gradientfcn.html":[2,0,0,7],
-"interfacenonlin__core_1_1gradientfcn.html#a14926c33ea60538cfaeb7a7dd3b7c507":[2,0,0,7,0],
-"interfacenonlin__core_1_1jacobianfcn.html":[2,0,0,9],
-"interfacenonlin__core_1_1jacobianfcn.html#a8250a76d2a4aec97a8234354c837560b":[2,0,0,9,0],
-"interfacenonlin__core_1_1nonlin__optimize__fcn.html":[2,0,0,10],
-"interfacenonlin__core_1_1nonlin__optimize__fcn.html#aa21191776d993347fd15115f1ef169a1":[2,0,0,10,0],
-"interfacenonlin__core_1_1nonlin__solver.html":[2,0,0,11],
-"interfacenonlin__core_1_1nonlin__solver.html#ac90933de0ccaff64593e989265975412":[2,0,0,11,0],
-"interfacenonlin__core_1_1nonlin__solver__1var.html":[2,0,0,12],
-"interfacenonlin__core_1_1nonlin__solver__1var.html#a0dd1911d755446057df7966f2d91e3b6":[2,0,0,12,0],
-"interfacenonlin__core_1_1vecfcn.html":[2,0,0,14],
-"interfacenonlin__core_1_1vecfcn.html#a1623a83da00b1738453145568962f9ee":[2,0,0,14,0],
-"interfacenonlin__polynomials_1_1assignment_07_0a_08.html":[2,0,4,0],
-"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7":[2,0,4,0,1],
-"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0":[2,0,4,0,2],
-"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7":[2,0,4,0,0],
-"interfacenonlin__polynomials_1_1operator_07-_08.html":[2,0,4,3],
-"interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3":[2,0,4,3,0],
-"interfacenonlin__polynomials_1_1operator_07_09_08.html":[2,0,4,2],
-"interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe":[2,0,4,2,0],
-"interfacenonlin__polynomials_1_1operator_07_5_08.html":[2,0,4,1],
-"interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736":[2,0,4,1,0],
-"interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389":[2,0,4,1,2],
-"interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac":[2,0,4,1,1],
+"interfacenonlin__c__api_1_1c__fcn1var.html":[2,0,0,0],
+"interfacenonlin__c__api_1_1c__fcn1var.html#a5c1128d4cccad315639af012c2878942":[2,0,0,0,0],
+"interfacenonlin__c__api_1_1c__fcnnvar.html":[2,0,0,1],
+"interfacenonlin__c__api_1_1c__fcnnvar.html#a884bbe04fd5b8ac13f878bc892d23b44":[2,0,0,1,0],
+"interfacenonlin__c__api_1_1c__gradientfcn.html":[2,0,0,2],
+"interfacenonlin__c__api_1_1c__gradientfcn.html#a948b595e8d8c6afbe1866aea265b6457":[2,0,0,2,0],
+"interfacenonlin__c__api_1_1c__jacobianfcn.html":[2,0,0,3],
+"interfacenonlin__c__api_1_1c__jacobianfcn.html#a6bc2fd4684ac9f4c506c6822a5f26a56":[2,0,0,3,0],
+"interfacenonlin__c__api_1_1c__vecfcn.html":[2,0,0,5],
+"interfacenonlin__c__api_1_1c__vecfcn.html#abda164dcd0c71297071fd60b0afd2b0f":[2,0,0,5,0],
+"interfacenonlin__core_1_1fcn1var.html":[2,0,1,3],
+"interfacenonlin__core_1_1fcn1var.html#aa058523902d94e85867a76f129c27ce0":[2,0,1,3,0],
+"interfacenonlin__core_1_1fcnnvar.html":[2,0,1,5],
+"interfacenonlin__core_1_1fcnnvar.html#a6b4c08adbe44af2c3d5ae606610881f0":[2,0,1,5,0],
+"interfacenonlin__core_1_1gradientfcn.html":[2,0,1,7],
+"interfacenonlin__core_1_1gradientfcn.html#a14926c33ea60538cfaeb7a7dd3b7c507":[2,0,1,7,0],
+"interfacenonlin__core_1_1jacobianfcn.html":[2,0,1,9],
+"interfacenonlin__core_1_1jacobianfcn.html#a8250a76d2a4aec97a8234354c837560b":[2,0,1,9,0],
+"interfacenonlin__core_1_1nonlin__optimize__fcn.html":[2,0,1,10],
+"interfacenonlin__core_1_1nonlin__optimize__fcn.html#aa21191776d993347fd15115f1ef169a1":[2,0,1,10,0],
+"interfacenonlin__core_1_1nonlin__solver.html":[2,0,1,11],
+"interfacenonlin__core_1_1nonlin__solver.html#ac90933de0ccaff64593e989265975412":[2,0,1,11,0],
+"interfacenonlin__core_1_1nonlin__solver__1var.html":[2,0,1,12],
+"interfacenonlin__core_1_1nonlin__solver__1var.html#a0dd1911d755446057df7966f2d91e3b6":[2,0,1,12,0],
+"interfacenonlin__core_1_1vecfcn.html":[2,0,1,14],
+"interfacenonlin__core_1_1vecfcn.html#a1623a83da00b1738453145568962f9ee":[2,0,1,14,0],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html":[2,0,5,0],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7":[2,0,5,0,1],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0":[2,0,5,0,2],
+"interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7":[2,0,5,0,0],
+"interfacenonlin__polynomials_1_1operator_07-_08.html":[2,0,5,3],
+"interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3":[2,0,5,3,0],
+"interfacenonlin__polynomials_1_1operator_07_09_08.html":[2,0,5,2],
+"interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe":[2,0,5,2,0],
+"interfacenonlin__polynomials_1_1operator_07_5_08.html":[2,0,5,1],
+"interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736":[2,0,5,1,0],
+"interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389":[2,0,5,1,2],
+"interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac":[2,0,5,1,1],
 "namespacemembers.html":[1,1,0],
 "namespacemembers_func.html":[1,1,1],
 "namespacemembers_vars.html":[1,1,2],
+"namespacenonlin__c__api.html":[2,0,0],
 "namespacenonlin__c__api.html":[1,0,0],
 "namespacenonlin__constants.html":[1,0,1],
-"namespacenonlin__core.html":[2,0,0],
+"namespacenonlin__core.html":[2,0,1],
 "namespacenonlin__core.html":[1,0,2],
 "namespacenonlin__least__squares.html":[1,0,3],
-"namespacenonlin__least__squares.html":[2,0,1],
-"namespacenonlin__linesearch.html":[2,0,2],
+"namespacenonlin__least__squares.html":[2,0,2],
 "namespacenonlin__linesearch.html":[1,0,4],
-"namespacenonlin__optimize.html":[2,0,3],
+"namespacenonlin__linesearch.html":[2,0,3],
 "namespacenonlin__optimize.html":[1,0,5],
-"namespacenonlin__polynomials.html":[2,0,4],
+"namespacenonlin__optimize.html":[2,0,4],
 "namespacenonlin__polynomials.html":[1,0,6],
-"namespacenonlin__solve.html":[2,0,5],
+"namespacenonlin__polynomials.html":[2,0,5],
 "namespacenonlin__solve.html":[1,0,7],
+"namespacenonlin__solve.html":[2,0,6],
 "namespaces.html":[1,0],
-"nonlin__c__api_8f90_source.html":[3,0,0,0],
-"nonlin__constants_8f90_source.html":[3,0,0,1],
-"nonlin__core_8f90_source.html":[3,0,0,2],
-"nonlin__equation__optimizer_8f90_source.html":[3,0,0,3],
-"nonlin__equation__solver_8f90_source.html":[3,0,0,4],
-"nonlin__equation__solver__1var_8f90_source.html":[3,0,0,5],
-"nonlin__fcn1var__helper_8f90_source.html":[3,0,0,6],
-"nonlin__fcnnvar__helper_8f90_source.html":[3,0,0,7],
-"nonlin__least__squares_8f90_source.html":[3,0,0,8],
-"nonlin__linesearch_8f90_source.html":[3,0,0,9],
-"nonlin__optimize_8f90_source.html":[3,0,0,10],
-"nonlin__optimize__bfgs_8f90_source.html":[3,0,0,11],
-"nonlin__optimize__line__search_8f90_source.html":[3,0,0,12],
-"nonlin__optimize__nelder__mead_8f90_source.html":[3,0,0,13],
-"nonlin__polynomials_8f90_source.html":[3,0,0,14],
-"nonlin__solve_8f90_source.html":[3,0,0,15],
-"nonlin__solve__brent_8f90_source.html":[3,0,0,16],
-"nonlin__solve__line__search_8f90_source.html":[3,0,0,17],
-"nonlin__solve__newton1var_8f90_source.html":[3,0,0,19],
-"nonlin__solve__newton_8f90_source.html":[3,0,0,18],
-"nonlin__solve__quasi__newton_8f90_source.html":[3,0,0,20],
-"nonlin__vecfcn__helper_8f90_source.html":[3,0,0,21],
+"nonlin_8h_source.html":[3,0,0,0],
+"nonlin__c__api_8f90_source.html":[3,0,1,0],
+"nonlin__constants_8f90_source.html":[3,0,1,1],
+"nonlin__core_8f90_source.html":[3,0,1,2],
+"nonlin__equation__optimizer_8f90_source.html":[3,0,1,3],
+"nonlin__equation__solver_8f90_source.html":[3,0,1,4],
+"nonlin__equation__solver__1var_8f90_source.html":[3,0,1,5],
+"nonlin__fcn1var__helper_8f90_source.html":[3,0,1,6],
+"nonlin__fcnnvar__helper_8f90_source.html":[3,0,1,7],
+"nonlin__least__squares_8f90_source.html":[3,0,1,8],
+"nonlin__linesearch_8f90_source.html":[3,0,1,9],
+"nonlin__optimize_8f90_source.html":[3,0,1,10],
+"nonlin__optimize__bfgs_8f90_source.html":[3,0,1,11],
+"nonlin__optimize__line__search_8f90_source.html":[3,0,1,12],
+"nonlin__optimize__nelder__mead_8f90_source.html":[3,0,1,13],
+"nonlin__polynomials_8f90_source.html":[3,0,1,14],
+"nonlin__solve_8f90_source.html":[3,0,1,15],
+"nonlin__solve__brent_8f90_source.html":[3,0,1,16],
+"nonlin__solve__line__search_8f90_source.html":[3,0,1,17],
+"nonlin__solve__newton1var_8f90_source.html":[3,0,1,19],
+"nonlin__solve__newton_8f90_source.html":[3,0,1,18],
+"nonlin__solve__quasi__newton_8f90_source.html":[3,0,1,20],
+"nonlin__vecfcn__helper_8f90_source.html":[3,0,1,21],
 "pages.html":[],
-"structnonlin__core_1_1equation__optimizer.html":[2,0,0,0],
-"structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917":[2,0,0,0,6],
-"structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952":[2,0,0,0,9],
-"structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50":[2,0,0,0,8],
-"structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485":[2,0,0,0,1],
-"structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c":[2,0,0,0,3],
-"structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868":[2,0,0,0,5],
-"structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1":[2,0,0,0,2],
-"structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5":[2,0,0,0,4],
-"structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b":[2,0,0,0,0],
-"structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b":[2,0,0,0,7],
-"structnonlin__core_1_1equation__solver.html":[2,0,0,1],
-"structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9":[2,0,0,1,2],
-"structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33":[2,0,0,1,0],
-"structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797":[2,0,0,1,6],
-"structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04":[2,0,0,1,13],
-"structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5":[2,0,0,1,8],
-"structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47":[2,0,0,1,3],
-"structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6":[2,0,0,1,1],
-"structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d":[2,0,0,1,9],
-"structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05":[2,0,0,1,4],
-"structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae":[2,0,0,1,11],
-"structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50":[2,0,0,1,5],
-"structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391":[2,0,0,1,10],
-"structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2":[2,0,0,1,15],
-"structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599":[2,0,0,1,7],
-"structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6":[2,0,0,1,14],
-"structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c":[2,0,0,1,12],
-"structnonlin__core_1_1equation__solver__1var.html":[2,0,0,2],
-"structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2":[2,0,0,2,6],
-"structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b":[2,0,0,2,1],
-"structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54":[2,0,0,2,0],
-"structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20":[2,0,0,2,5],
-"structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb":[2,0,0,2,13],
-"structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0":[2,0,0,2,8],
-"structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4":[2,0,0,2,11],
-"structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9":[2,0,0,2,10],
-"structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e":[2,0,0,2,2],
-"structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f":[2,0,0,2,14],
-"structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda":[2,0,0,2,3],
-"structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a":[2,0,0,2,15],
-"structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240":[2,0,0,2,7],
-"structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b":[2,0,0,2,12],
-"structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89":[2,0,0,2,4],
-"structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95":[2,0,0,2,9],
-"structnonlin__core_1_1fcn1var__helper.html":[2,0,0,4],
-"structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d":[2,0,0,4,6],
-"structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce":[2,0,0,4,3],
-"structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7":[2,0,0,4,7],
-"structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952":[2,0,0,4,0],
-"structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c":[2,0,0,4,2],
-"structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271":[2,0,0,4,5],
-"structnonlin__core_1_1fcn1var__helper.html#aee47d4795f22dad4bbf602073e5abf4d":[2,0,0,4,4],
-"structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93":[2,0,0,4,1],
-"structnonlin__core_1_1fcnnvar__helper.html":[2,0,0,6],
-"structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031":[2,0,0,6,7],
-"structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e":[2,0,0,6,9],
-"structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe":[2,0,0,6,3],
-"structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f":[2,0,0,6,4],
-"structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2":[2,0,0,6,2],
-"structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404":[2,0,0,6,0],
-"structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022":[2,0,0,6,6],
-"structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924":[2,0,0,6,5],
-"structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1":[2,0,0,6,8],
-"structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090":[2,0,0,6,1],
-"structnonlin__core_1_1iteration__behavior.html":[2,0,0,8],
-"structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52":[2,0,0,8,5],
-"structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec":[2,0,0,8,0],
-"structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8":[2,0,0,8,1],
-"structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105":[2,0,0,8,4],
-"structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4":[2,0,0,8,3],
-"structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2":[2,0,0,8,6],
-"structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1":[2,0,0,8,2],
-"structnonlin__core_1_1value__pair.html":[2,0,0,13],
-"structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73":[2,0,0,13,1],
-"structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87":[2,0,0,13,0],
-"structnonlin__core_1_1vecfcn__helper.html":[2,0,0,15],
-"structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109":[2,0,0,15,8],
-"structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78":[2,0,0,15,7],
-"structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed":[2,0,0,15,6],
-"structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8":[2,0,0,15,0],
-"structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d":[2,0,0,15,9],
-"structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c":[2,0,0,15,10],
-"structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b":[2,0,0,15,4],
-"structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982":[2,0,0,15,1],
-"structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc":[2,0,0,15,2],
-"structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a":[2,0,0,15,5],
-"structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818":[2,0,0,15,11],
-"structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae":[2,0,0,15,3],
-"structnonlin__least__squares_1_1least__squares__solver.html":[2,0,1,0],
-"structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d":[2,0,1,0,3],
-"structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5":[2,0,1,0,2],
-"structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac":[2,0,1,0,1],
-"structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e":[2,0,1,0,0],
-"structnonlin__linesearch_1_1line__search.html":[2,0,2,0],
-"structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487":[2,0,2,0,9],
-"structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8":[2,0,2,0,8],
-"structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957":[2,0,2,0,10],
-"structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf":[2,0,2,0,0],
-"structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79":[2,0,2,0,5],
-"structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b":[2,0,2,0,2],
-"structnonlin__linesearch_1_1line__search.html#a7b7385d7542b31b22f916ad0f20581de":[2,0,2,0,3],
-"structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf":[2,0,2,0,1],
-"structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8":[2,0,2,0,7],
-"structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972":[2,0,2,0,6],
-"structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d":[2,0,2,0,11],
-"structnonlin__linesearch_1_1line__search.html#acea9fe37321c1b9a8e33b4a8fc0566ca":[2,0,2,0,4],
-"structnonlin__optimize_1_1bfgs.html":[2,0,3,0],
-"structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385":[2,0,3,0,0],
-"structnonlin__optimize_1_1line__search__optimizer.html":[2,0,3,1],
-"structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45":[2,0,3,1,7],
-"structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010":[2,0,3,1,0],
-"structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff":[2,0,3,1,5],
-"structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082":[2,0,3,1,1],
-"structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0":[2,0,3,1,2],
-"structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a":[2,0,3,1,8],
-"structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc":[2,0,3,1,10],
-"structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9":[2,0,3,1,4],
-"structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d":[2,0,3,1,9],
-"structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba":[2,0,3,1,3],
-"structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440":[2,0,3,1,6],
-"structnonlin__optimize_1_1nelder__mead.html":[2,0,3,2],
-"structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6":[2,0,3,2,5],
-"structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7":[2,0,3,2,0],
-"structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46":[2,0,3,2,3],
-"structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555":[2,0,3,2,6],
-"structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4":[2,0,3,2,1],
-"structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736":[2,0,3,2,4],
-"structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2":[2,0,3,2,2],
-"structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2":[2,0,3,2,7],
-"structnonlin__polynomials_1_1polynomial.html":[2,0,4,4],
-"structnonlin__polynomials_1_1polynomial.html#a04911a990f6ffcffe2fc48be44145f4f":[2,0,4,4,8],
-"structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912":[2,0,4,4,5],
-"structnonlin__polynomials_1_1polynomial.html#a637144f7851d5e8030f8922f8cafa7ef":[2,0,4,4,3],
-"structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980":[2,0,4,4,1],
-"structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a":[2,0,4,4,11],
-"structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620":[2,0,4,4,7],
-"structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26":[2,0,4,4,12],
-"structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd":[2,0,4,4,0],
-"structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd":[2,0,4,4,13],
-"structnonlin__polynomials_1_1polynomial.html#ab8217dd1d64e540d1be5fc21b5a47600":[2,0,4,4,9],
-"structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee":[2,0,4,4,4],
-"structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c":[2,0,4,4,6],
-"structnonlin__polynomials_1_1polynomial.html#ae112c19c9c80016d8c0581a090b58fd2":[2,0,4,4,2],
-"structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27":[2,0,4,4,14],
-"structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3":[2,0,4,4,10],
-"structnonlin__solve_1_1brent__solver.html":[2,0,5,0],
-"structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277":[2,0,5,0,0],
-"structnonlin__solve_1_1line__search__solver.html":[2,0,5,1],
-"structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997":[2,0,5,1,1],
-"structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf":[2,0,5,1,7],
-"structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a":[2,0,5,1,0],
-"structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285":[2,0,5,1,5],
-"structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882":[2,0,5,1,6],
-"structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682":[2,0,5,1,2],
-"structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6":[2,0,5,1,4],
-"structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484":[2,0,5,1,3],
-"structnonlin__solve_1_1newton__1var__solver.html":[2,0,5,2],
-"structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95":[2,0,5,2,0],
-"structnonlin__solve_1_1newton__solver.html":[2,0,5,3],
-"structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66":[2,0,5,3,0],
-"structnonlin__solve_1_1quasi__newton__solver.html":[2,0,5,4],
-"structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8":[2,0,5,4,3],
-"structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3":[2,0,5,4,0],
-"structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf":[2,0,5,4,2],
-"structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7":[2,0,5,4,1]
+"structc__polynomial.html":[2,0,7],
+"structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c":[2,0,7,0],
+"structc__polynomial.html#ac0838645de567ad5a80b255791707976":[2,0,7,1],
+"structiteration__controls.html":[2,0,8],
+"structiteration__controls.html#a31353fc9c86aa23157c30b1073893745":[2,0,8,1],
+"structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2":[2,0,8,3],
+"structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1":[2,0,8,4],
+"structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e":[2,0,8,2],
+"structiteration__controls.html#a6b4646344cda46ab0752819a1a930028":[2,0,8,0],
+"structiteration__process.html":[2,0,9],
+"structiteration__process.html#a00a463e2db7a0fbab8764083936d926c":[2,0,9,0],
+"structiteration__process.html#a13c1427518d62138fdfac155510347fd":[2,0,9,5],
+"structiteration__process.html#a309e95e4da19427633b6d0c1affab090":[2,0,9,1],
+"structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c":[2,0,9,2],
+"structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb":[2,0,9,4],
+"structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a":[2,0,9,3],
+"structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55":[2,0,9,6],
+"structline__search__controls.html":[2,0,10],
+"structline__search__controls.html#a011d44e850183280119f0aa06af6d83a":[2,0,10,1],
+"structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1":[2,0,10,3],
+"structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed":[2,0,10,0],
+"structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c":[2,0,10,2],
+"structnonlin__c__api_1_1c__polynomial.html":[2,0,0,4],
+"structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4":[2,0,0,4,0],
+"structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e":[2,0,0,4,1],
+"structnonlin__c__api_1_1iteration__controls.html":[2,0,0,6],
+"structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d":[2,0,0,6,0],
+"structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4":[2,0,0,6,4],
+"structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e":[2,0,0,6,1],
+"structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089":[2,0,0,6,2],
+"structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3":[2,0,0,6,3],
+"structnonlin__c__api_1_1iteration__process.html":[2,0,0,7],
+"structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56":[2,0,0,7,2],
+"structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf":[2,0,0,7,6],
+"structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187":[2,0,0,7,4],
+"structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18":[2,0,0,7,1],
+"structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92":[2,0,0,7,3],
+"structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9":[2,0,0,7,0],
+"structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732":[2,0,0,7,5],
+"structnonlin__c__api_1_1line__search__controls.html":[2,0,0,8],
+"structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35":[2,0,0,8,3],
+"structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b":[2,0,0,8,1],
+"structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de":[2,0,0,8,0],
+"structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1":[2,0,0,8,2],
+"structnonlin__core_1_1equation__optimizer.html":[2,0,1,0],
+"structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917":[2,0,1,0,6],
+"structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952":[2,0,1,0,9],
+"structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50":[2,0,1,0,8],
+"structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485":[2,0,1,0,1],
+"structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c":[2,0,1,0,3],
+"structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868":[2,0,1,0,5],
+"structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1":[2,0,1,0,2],
+"structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5":[2,0,1,0,4],
+"structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b":[2,0,1,0,0],
+"structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b":[2,0,1,0,7],
+"structnonlin__core_1_1equation__solver.html":[2,0,1,1],
+"structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9":[2,0,1,1,2],
+"structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33":[2,0,1,1,0],
+"structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797":[2,0,1,1,6],
+"structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04":[2,0,1,1,13],
+"structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5":[2,0,1,1,8],
+"structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47":[2,0,1,1,3],
+"structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6":[2,0,1,1,1],
+"structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d":[2,0,1,1,9],
+"structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05":[2,0,1,1,4],
+"structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae":[2,0,1,1,11],
+"structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50":[2,0,1,1,5],
+"structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391":[2,0,1,1,10],
+"structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2":[2,0,1,1,15],
+"structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599":[2,0,1,1,7],
+"structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6":[2,0,1,1,14],
+"structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c":[2,0,1,1,12],
+"structnonlin__core_1_1equation__solver__1var.html":[2,0,1,2],
+"structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2":[2,0,1,2,6],
+"structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b":[2,0,1,2,1],
+"structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54":[2,0,1,2,0],
+"structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20":[2,0,1,2,5],
+"structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb":[2,0,1,2,13],
+"structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0":[2,0,1,2,8],
+"structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4":[2,0,1,2,11],
+"structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9":[2,0,1,2,10],
+"structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e":[2,0,1,2,2],
+"structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f":[2,0,1,2,14],
+"structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda":[2,0,1,2,3],
+"structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a":[2,0,1,2,15],
+"structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240":[2,0,1,2,7],
+"structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b":[2,0,1,2,12],
+"structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89":[2,0,1,2,4],
+"structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95":[2,0,1,2,9],
+"structnonlin__core_1_1fcn1var__helper.html":[2,0,1,4],
+"structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d":[2,0,1,4,6],
+"structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce":[2,0,1,4,3],
+"structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7":[2,0,1,4,7],
+"structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952":[2,0,1,4,0],
+"structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c":[2,0,1,4,2],
+"structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271":[2,0,1,4,5],
+"structnonlin__core_1_1fcn1var__helper.html#aee47d4795f22dad4bbf602073e5abf4d":[2,0,1,4,4],
+"structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93":[2,0,1,4,1],
+"structnonlin__core_1_1fcnnvar__helper.html":[2,0,1,6],
+"structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031":[2,0,1,6,7],
+"structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e":[2,0,1,6,9],
+"structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe":[2,0,1,6,3],
+"structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f":[2,0,1,6,4],
+"structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2":[2,0,1,6,2],
+"structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404":[2,0,1,6,0],
+"structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022":[2,0,1,6,6],
+"structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924":[2,0,1,6,5],
+"structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1":[2,0,1,6,8],
+"structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090":[2,0,1,6,1],
+"structnonlin__core_1_1iteration__behavior.html":[2,0,1,8],
+"structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52":[2,0,1,8,5],
+"structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec":[2,0,1,8,0],
+"structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8":[2,0,1,8,1],
+"structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105":[2,0,1,8,4],
+"structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4":[2,0,1,8,3],
+"structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2":[2,0,1,8,6],
+"structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1":[2,0,1,8,2],
+"structnonlin__core_1_1value__pair.html":[2,0,1,13],
+"structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73":[2,0,1,13,1],
+"structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87":[2,0,1,13,0],
+"structnonlin__core_1_1vecfcn__helper.html":[2,0,1,15],
+"structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109":[2,0,1,15,8],
+"structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78":[2,0,1,15,7],
+"structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed":[2,0,1,15,6],
+"structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8":[2,0,1,15,0],
+"structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d":[2,0,1,15,9],
+"structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c":[2,0,1,15,10],
+"structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b":[2,0,1,15,4],
+"structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982":[2,0,1,15,1],
+"structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc":[2,0,1,15,2],
+"structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a":[2,0,1,15,5],
+"structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818":[2,0,1,15,11],
+"structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae":[2,0,1,15,3],
+"structnonlin__least__squares_1_1least__squares__solver.html":[2,0,2,0],
+"structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d":[2,0,2,0,3],
+"structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5":[2,0,2,0,2],
+"structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac":[2,0,2,0,1],
+"structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e":[2,0,2,0,0],
+"structnonlin__linesearch_1_1line__search.html":[2,0,3,0],
+"structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487":[2,0,3,0,9],
+"structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8":[2,0,3,0,8],
+"structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957":[2,0,3,0,10],
+"structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf":[2,0,3,0,0],
+"structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79":[2,0,3,0,5],
+"structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b":[2,0,3,0,2],
+"structnonlin__linesearch_1_1line__search.html#a7b7385d7542b31b22f916ad0f20581de":[2,0,3,0,3],
+"structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf":[2,0,3,0,1],
+"structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8":[2,0,3,0,7],
+"structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972":[2,0,3,0,6],
+"structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d":[2,0,3,0,11],
+"structnonlin__linesearch_1_1line__search.html#acea9fe37321c1b9a8e33b4a8fc0566ca":[2,0,3,0,4],
+"structnonlin__optimize_1_1bfgs.html":[2,0,4,0],
+"structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385":[2,0,4,0,0],
+"structnonlin__optimize_1_1line__search__optimizer.html":[2,0,4,1],
+"structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45":[2,0,4,1,7],
+"structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010":[2,0,4,1,0],
+"structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff":[2,0,4,1,5],
+"structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082":[2,0,4,1,1]
 };
diff --git a/doc/html/navtreeindex1.js b/doc/html/navtreeindex1.js
new file mode 100644
index 0000000..7a951a3
--- /dev/null
+++ b/doc/html/navtreeindex1.js
@@ -0,0 +1,58 @@
+var NAVTREEINDEX1 =
+{
+"structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0":[2,0,4,1,2],
+"structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a":[2,0,4,1,8],
+"structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc":[2,0,4,1,10],
+"structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9":[2,0,4,1,4],
+"structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d":[2,0,4,1,9],
+"structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba":[2,0,4,1,3],
+"structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440":[2,0,4,1,6],
+"structnonlin__optimize_1_1nelder__mead.html":[2,0,4,2],
+"structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6":[2,0,4,2,5],
+"structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7":[2,0,4,2,0],
+"structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46":[2,0,4,2,3],
+"structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555":[2,0,4,2,6],
+"structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4":[2,0,4,2,1],
+"structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736":[2,0,4,2,4],
+"structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2":[2,0,4,2,2],
+"structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2":[2,0,4,2,7],
+"structnonlin__polynomials_1_1polynomial.html":[2,0,5,4],
+"structnonlin__polynomials_1_1polynomial.html#a04911a990f6ffcffe2fc48be44145f4f":[2,0,5,4,8],
+"structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912":[2,0,5,4,5],
+"structnonlin__polynomials_1_1polynomial.html#a637144f7851d5e8030f8922f8cafa7ef":[2,0,5,4,3],
+"structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980":[2,0,5,4,1],
+"structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a":[2,0,5,4,11],
+"structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620":[2,0,5,4,7],
+"structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26":[2,0,5,4,12],
+"structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd":[2,0,5,4,0],
+"structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd":[2,0,5,4,13],
+"structnonlin__polynomials_1_1polynomial.html#ab8217dd1d64e540d1be5fc21b5a47600":[2,0,5,4,9],
+"structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee":[2,0,5,4,4],
+"structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c":[2,0,5,4,6],
+"structnonlin__polynomials_1_1polynomial.html#ae112c19c9c80016d8c0581a090b58fd2":[2,0,5,4,2],
+"structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27":[2,0,5,4,14],
+"structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3":[2,0,5,4,10],
+"structnonlin__solve_1_1brent__solver.html":[2,0,6,0],
+"structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277":[2,0,6,0,0],
+"structnonlin__solve_1_1line__search__solver.html":[2,0,6,1],
+"structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997":[2,0,6,1,1],
+"structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf":[2,0,6,1,7],
+"structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a":[2,0,6,1,0],
+"structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285":[2,0,6,1,5],
+"structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882":[2,0,6,1,6],
+"structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682":[2,0,6,1,2],
+"structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6":[2,0,6,1,4],
+"structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484":[2,0,6,1,3],
+"structnonlin__solve_1_1newton__1var__solver.html":[2,0,6,2],
+"structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95":[2,0,6,2,0],
+"structnonlin__solve_1_1newton__solver.html":[2,0,6,3],
+"structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66":[2,0,6,3,0],
+"structnonlin__solve_1_1quasi__newton__solver.html":[2,0,6,4],
+"structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8":[2,0,6,4,3],
+"structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3":[2,0,6,4,0],
+"structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf":[2,0,6,4,2],
+"structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7":[2,0,6,4,1],
+"structvalue__pair.html":[2,0,11],
+"structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e":[2,0,11,0],
+"structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc":[2,0,11,1]
+};
diff --git a/doc/html/nonlin_8h_source.html b/doc/html/nonlin_8h_source.html
new file mode 100644
index 0000000..272c857
--- /dev/null
+++ b/doc/html/nonlin_8h_source.html
@@ -0,0 +1,277 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: C:/Users/jchri/Documents/github/nonlin/include/nonlin.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('nonlin_8h_source.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin.h</div>  </div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef NONLIN_H_</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#define NONLIN_H_</span></div>
+<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160; </div>
+<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="preprocessor">#include &lt;stdbool.h&gt;</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &lt;complex.h&gt;</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160; </div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="preprocessor">#define NL_NO_ERROR                     0</span></div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#define NL_INVALID_INPUT_ERROR          201</span></div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor">#define NL_ARRAY_SIZE_ERROR             202</span></div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#define NL_OUT_OF_MEMORY_ERROR          105</span></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#define NL_INVALID_OPERATION_ERROR      107</span></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#define NL_CONVERGENCE_ERROR            106</span></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#define NL_DIVERGENT_BEHAVIOR_ERROR     206</span></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#define NL_SPURIOUS_CONVERGENCE_ERROR   207</span></div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#define NL_TOLERANCE_TOO_SMALL_ERROR    208</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160; </div>
+<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="structiteration__controls.html">   18</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>{</div>
+<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">   20</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">max_function_evals</a>;</div>
+<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">   22</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">function_tolerance</a>;</div>
+<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">   24</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">solution_tolerance</a>;</div>
+<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">   29</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">gradient_tolerance</a>;</div>
+<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">   33</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">print_status</a>;</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;} <a class="code" href="structiteration__controls.html">iteration_controls</a>;</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160; </div>
+<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="structiteration__process.html">   37</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>{</div>
+<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">   39</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_count</a>;</div>
+<div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">   44</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">function_eval_count</a>;</div>
+<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">   46</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">jacobian_eval_count</a>;</div>
+<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">   48</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">gradient_eval_count</a>;</div>
+<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">   53</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">converge_on_function</a>;</div>
+<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">   58</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">converge_on_solution_change</a>;</div>
+<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">   64</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">converge_on_gradient</a>;</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;} <a class="code" href="structiteration__process.html">iteration_process</a>;</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160; </div>
+<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="structline__search__controls.html">   68</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>{</div>
+<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">   70</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">enable</a>;</div>
+<div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">   75</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">max_function_evals</a>;</div>
+<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">   84</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">alpha</a>;</div>
+<div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">   94</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">factor</a>;</div>
+<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;} <a class="code" href="structline__search__controls.html">line_search_controls</a>;</div>
+<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160; </div>
+<div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="structvalue__pair.html">   98</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>{</div>
+<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">  100</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">x1</a>;</div>
+<div class="line"><a name="l00102"></a><span class="lineno"><a class="line" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">  102</a></span>&#160;    <span class="keywordtype">double</span> <a class="code" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">x2</a>;</div>
+<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;} <a class="code" href="structvalue__pair.html">value_pair</a>;</div>
+<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160; </div>
+<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="keyword">typedef</span> double (*fcn1var)(<span class="keywordtype">double</span> x);</div>
+<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160; </div>
+<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="comment">/*</span></div>
+<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="comment"> * Describes a function of N variables.</span></div>
+<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="comment"> * </span></div>
+<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment"> * @param n The number of independent variables.</span></div>
+<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="comment"> * @param x An N-element array containing the independent variables.</span></div>
+<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;<span class="comment"> * @return The value of the function at @p x.</span></div>
+<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="comment"> */</span></div>
+<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;<span class="keyword">typedef</span> double (*fcnnvar)(<span class="keywordtype">int</span> n, <span class="keyword">const</span> <span class="keywordtype">double</span> *x);</div>
+<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160; </div>
+<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">typedef</span> void (*vecfcn)(<span class="keywordtype">int</span> neqn, <span class="keywordtype">int</span> nvar, <span class="keyword">const</span> <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f);</div>
+<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160; </div>
+<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="comment">/*</span></div>
+<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="comment"> * Describes a routin capable of computing the gradient vector</span></div>
+<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="comment"> * of an equation of N variables.</span></div>
+<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment"> *</span></div>
+<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="comment"> * @param n The number of independent variables.</span></div>
+<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="comment"> * @param x An N-element array containing the independent variables.</span></div>
+<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="comment"> * @param g An N-element array where the gradient vector will be</span></div>
+<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span class="comment"> *  written as output.</span></div>
+<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;<span class="comment"> */</span></div>
+<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;<span class="keyword">typedef</span> void (*gradientfcn)(<span class="keywordtype">int</span> n, <span class="keyword">const</span> <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *g);</div>
+<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160; </div>
+<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="comment">/*</span></div>
+<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;<span class="comment"> * Describes a routine capable of computing the Jacobian matrix</span></div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;<span class="comment"> * of a system of equations.</span></div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;<span class="comment"> *</span></div>
+<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;<span class="comment"> * @param neqn The number of equations.</span></div>
+<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="comment"> * @param nvar The number of independent variables.</span></div>
+<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="comment"> * @param x An NVAR-element array containing the independent </span></div>
+<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="comment"> *  variables.</span></div>
+<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="comment"> * @param jac An NEQN-by-NVAR matrix where the Jacobian will be</span></div>
+<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="comment"> *  written.</span></div>
+<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="comment"> */</span></div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="keyword">typedef</span> void (*jacobianfcn)(<span class="keywordtype">int</span> neqn, <span class="keywordtype">int</span> nvar, <span class="keyword">const</span> <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *jac);</div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160; </div>
+<div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="structc__polynomial.html">  159</a></span>&#160;<span class="keyword">typedef</span> <span class="keyword">struct </span>{</div>
+<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">  161</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">size_in_bytes</a>;</div>
+<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">  163</a></span>&#160;    <span class="keywordtype">void</span>* <a class="code" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">ptr</a>;</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;} <a class="code" href="structc__polynomial.html">c_polynomial</a>;</div>
+<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160; </div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;<span class="preprocessor">#ifdef __cplusplus</span></div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {</div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;<span class="preprocessor">#endif</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160; </div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keywordtype">void</span> c_set_default_solver_settings(<a class="code" href="structiteration__controls.html">iteration_controls</a> *x);</div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160; </div>
+<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;<span class="keywordtype">void</span> c_set_default_line_search_settings(<a class="code" href="structline__search__controls.html">line_search_controls</a> *x);</div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160; </div>
+<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;<span class="keywordtype">int</span> c_solver_newton_1var(fcn1var fcn, <a class="code" href="structvalue__pair.html">value_pair</a> limits, <span class="keywordtype">double</span> *x, </div>
+<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;    <span class="keywordtype">double</span>* f, <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160; </div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="keywordtype">int</span> c_solver_brent_1var(fcn1var fcn, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f, <a class="code" href="structvalue__pair.html">value_pair</a> limits,</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;    <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160; </div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="keywordtype">int</span> c_solver_quasi_newton(vecfcn fcn, jacobianfcn jac, <span class="keywordtype">int</span> n, <span class="keywordtype">double</span> *x,</div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;    <span class="keywordtype">double</span> *f, <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <span class="keyword">const</span> <a class="code" href="structline__search__controls.html">line_search_controls</a> *ls,</div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160; </div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="keywordtype">int</span> c_solver_newton(vecfcn fcn, jacobianfcn jac, <span class="keywordtype">int</span> n, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f, </div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;    <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <span class="keyword">const</span> <a class="code" href="structline__search__controls.html">line_search_controls</a> *ls,</div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;    <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160; </div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;<span class="keywordtype">int</span> c_solver_least_squares(vecfcn fcn, jacobianfcn jac, <span class="keywordtype">int</span> neqn, <span class="keywordtype">int</span> nvar,</div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;    <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f, <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, </div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;    <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160; </div>
+<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;<span class="keywordtype">int</span> c_solver_nelder_mead(fcnnvar fcn, <span class="keywordtype">int</span> n, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f, </div>
+<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;    <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160; </div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;<span class="keywordtype">int</span> c_solver_bfgs(fcnnvar fcn, gradientfcn grad, <span class="keywordtype">int</span> n, <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *f,</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;    <span class="keyword">const</span> <a class="code" href="structiteration__controls.html">iteration_controls</a> *cntrls, <span class="keyword">const</span> <a class="code" href="structline__search__controls.html">line_search_controls</a> *ls,</div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;    <a class="code" href="structiteration__process.html">iteration_process</a> *stats);</div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160; </div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;<span class="keywordtype">int</span> c_init_polynomial(<span class="keywordtype">int</span> order, <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly);</div>
+<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160; </div>
+<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;<span class="keywordtype">void</span> c_free_polynomial(<a class="code" href="structc__polynomial.html">c_polynomial</a> *poly);</div>
+<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160; </div>
+<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;<span class="keywordtype">int</span> c_get_polynomial_order(<span class="keyword">const</span> <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly);</div>
+<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160; </div>
+<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;<span class="keywordtype">int</span> c_fit_polynomial(<a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> n, <span class="keyword">const</span> <span class="keywordtype">double</span> *x, </div>
+<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> *y, <span class="keywordtype">bool</span> zero);</div>
+<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160; </div>
+<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;<span class="keywordtype">int</span> c_get_polynomial_coefficients(<span class="keyword">const</span> <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> nc, <span class="keywordtype">double</span> *c);</div>
+<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160; </div>
+<div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;<span class="keywordtype">int</span> c_set_polynomial_coefficients(<a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> nc, <span class="keyword">const</span> <span class="keywordtype">double</span> *c);</div>
+<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160; </div>
+<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;<span class="keywordtype">void</span> c_evaluate_polynomial_real(<span class="keyword">const</span> <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> n, </div>
+<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> *x, <span class="keywordtype">double</span> *y);</div>
+<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160; </div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;<span class="keywordtype">void</span> c_evaluate_polynomial_complex(<span class="keyword">const</span> <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> n, </div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> complex *x, <span class="keywordtype">double</span> complex *y);</div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160; </div>
+<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;<span class="keywordtype">int</span> c_polynomial_roots(<span class="keyword">const</span> <a class="code" href="structc__polynomial.html">c_polynomial</a> *poly, <span class="keywordtype">int</span> n, <span class="keywordtype">double</span> complex *rts);</div>
+<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160; </div>
+<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;<span class="preprocessor">#ifdef __cplusplus</span></div>
+<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;}</div>
+<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;<span class="preprocessor">#endif</span></div>
+<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;<span class="preprocessor">#endif</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<div class="ttc" id="astructiteration__controls_html_a3973c5320416b5c27f96e8bda03674a2"><div class="ttname"><a href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">iteration_controls::print_status</a></div><div class="ttdeci">bool print_status</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00033">nonlin.h:33</a></div></div>
+<div class="ttc" id="astructvalue__pair_html_ae28b3035c61a2d2f7ddaa2f3aef9b66e"><div class="ttname"><a href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">value_pair::x1</a></div><div class="ttdeci">double x1</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00100">nonlin.h:100</a></div></div>
+<div class="ttc" id="astructiteration__process_html_a13c1427518d62138fdfac155510347fd"><div class="ttname"><a href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_process::iteration_count</a></div><div class="ttdeci">int iteration_count</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00039">nonlin.h:39</a></div></div>
+<div class="ttc" id="astructiteration__process_html_acc44c29213f98f4d679c5fd4999bbc55"><div class="ttname"><a href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">iteration_process::jacobian_eval_count</a></div><div class="ttdeci">int jacobian_eval_count</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00046">nonlin.h:46</a></div></div>
+<div class="ttc" id="astructc__polynomial_html_a0e3d5da0fb5285972268ca56db16970c"><div class="ttname"><a href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">c_polynomial::ptr</a></div><div class="ttdeci">void * ptr</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00163">nonlin.h:163</a></div></div>
+<div class="ttc" id="astructvalue__pair_html"><div class="ttname"><a href="structvalue__pair.html">value_pair</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00098">nonlin.h:98</a></div></div>
+<div class="ttc" id="astructc__polynomial_html_ac0838645de567ad5a80b255791707976"><div class="ttname"><a href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">c_polynomial::size_in_bytes</a></div><div class="ttdeci">int size_in_bytes</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00161">nonlin.h:161</a></div></div>
+<div class="ttc" id="astructiteration__controls_html_a31353fc9c86aa23157c30b1073893745"><div class="ttname"><a href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">iteration_controls::gradient_tolerance</a></div><div class="ttdeci">double gradient_tolerance</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00029">nonlin.h:29</a></div></div>
+<div class="ttc" id="astructiteration__controls_html_a6b4646344cda46ab0752819a1a930028"><div class="ttname"><a href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">iteration_controls::function_tolerance</a></div><div class="ttdeci">double function_tolerance</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00022">nonlin.h:22</a></div></div>
+<div class="ttc" id="astructiteration__process_html_a00a463e2db7a0fbab8764083936d926c"><div class="ttname"><a href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">iteration_process::converge_on_function</a></div><div class="ttdeci">bool converge_on_function</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00053">nonlin.h:53</a></div></div>
+<div class="ttc" id="astructiteration__process_html_a309e95e4da19427633b6d0c1affab090"><div class="ttname"><a href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">iteration_process::converge_on_gradient</a></div><div class="ttdeci">bool converge_on_gradient</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00064">nonlin.h:64</a></div></div>
+<div class="ttc" id="astructline__search__controls_html_aa08dfa97fa68cc382b1d0290057f9b6c"><div class="ttname"><a href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">line_search_controls::factor</a></div><div class="ttdeci">double factor</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00094">nonlin.h:94</a></div></div>
+<div class="ttc" id="astructiteration__process_html_aa9b8435c188b0dd37cfdc064617db5bb"><div class="ttname"><a href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">iteration_process::gradient_eval_count</a></div><div class="ttdeci">int gradient_eval_count</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00048">nonlin.h:48</a></div></div>
+<div class="ttc" id="astructiteration__controls_html_a515ef26c2a30dace0aac535d4918bce1"><div class="ttname"><a href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">iteration_controls::solution_tolerance</a></div><div class="ttdeci">double solution_tolerance</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00024">nonlin.h:24</a></div></div>
+<div class="ttc" id="astructiteration__controls_html"><div class="ttname"><a href="structiteration__controls.html">iteration_controls</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00018">nonlin.h:18</a></div></div>
+<div class="ttc" id="astructvalue__pair_html_afc686af57ed733408dcfa3792251d5cc"><div class="ttname"><a href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">value_pair::x2</a></div><div class="ttdeci">double x2</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00102">nonlin.h:102</a></div></div>
+<div class="ttc" id="astructiteration__process_html"><div class="ttname"><a href="structiteration__process.html">iteration_process</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00037">nonlin.h:37</a></div></div>
+<div class="ttc" id="astructc__polynomial_html"><div class="ttname"><a href="structc__polynomial.html">c_polynomial</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00159">nonlin.h:159</a></div></div>
+<div class="ttc" id="astructline__search__controls_html"><div class="ttname"><a href="structline__search__controls.html">line_search_controls</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00068">nonlin.h:68</a></div></div>
+<div class="ttc" id="astructiteration__controls_html_a5b90dcfce0397e98fce3ece2301d673e"><div class="ttname"><a href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">iteration_controls::max_function_evals</a></div><div class="ttdeci">int max_function_evals</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00020">nonlin.h:20</a></div></div>
+<div class="ttc" id="astructline__search__controls_html_a4cdae888ec5f67a3aa3cf99efd1a8fed"><div class="ttname"><a href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">line_search_controls::alpha</a></div><div class="ttdeci">double alpha</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00084">nonlin.h:84</a></div></div>
+<div class="ttc" id="astructiteration__process_html_ac67e6fb6e68635de9bbdcd6133d8323a"><div class="ttname"><a href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">iteration_process::function_eval_count</a></div><div class="ttdeci">int function_eval_count</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00044">nonlin.h:44</a></div></div>
+<div class="ttc" id="astructline__search__controls_html_a011d44e850183280119f0aa06af6d83a"><div class="ttname"><a href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">line_search_controls::enable</a></div><div class="ttdeci">bool enable</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00070">nonlin.h:70</a></div></div>
+<div class="ttc" id="astructiteration__process_html_a795b4560af8d0d236e7b6dfaed90d80c"><div class="ttname"><a href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">iteration_process::converge_on_solution_change</a></div><div class="ttdeci">bool converge_on_solution_change</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00058">nonlin.h:58</a></div></div>
+<div class="ttc" id="astructline__search__controls_html_a14c2ac572f0213e9e3963d781e2ba8c1"><div class="ttname"><a href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">line_search_controls::max_function_evals</a></div><div class="ttdeci">int max_function_evals</div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00075">nonlin.h:75</a></div></div>
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><b>nonlin.h</b></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/nonlin__c__api_8f90_source.html b/doc/html/nonlin__c__api_8f90_source.html
index 66f0dcd..55dea8c 100644
--- a/doc/html/nonlin__c__api_8f90_source.html
+++ b/doc/html/nonlin__c__api_8f90_source.html
@@ -94,19 +94,968 @@
 <div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">! nonlin_c_api.f90</span></div>
 <div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160; </div>
 <div class="line"><a name="l00004"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html">    4</a></span>&#160;<span class="keyword">module</span> <a class="code" href="namespacenonlin__c__api.html">nonlin_c_api</a></div>
-<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;    <span class="keywordtype">use </span>iso_c_binding</div>
-<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
-<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
-<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
-<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div>
-<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">implicit none</span></div>
-<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="keyword">contains</span></div>
-<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keyword">end module</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;    use, <span class="keywordtype">intrinsic</span> :: iso_fortran_env</div>
+<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;    <span class="keywordtype">use </span>ferror</div>
+<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__constants.html">nonlin_constants</a></div>
+<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a></div>
+<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a></div>
+<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div>
+<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div>
+<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__optimize.html">nonlin_optimize</a></div>
+<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div>
+<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordtype">implicit none</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160; </div>
+<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;    <span class="keyword">interface</span></div>
+<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160; </div>
+<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="interfacenonlin__c__api_1_1c__fcn1var.html">   22</a></span>&#160;        <span class="keyword">function </span><a class="code" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a>(x) <span class="keyword">result</span>(f)</div>
+<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: x</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keywordtype">            real</span>(c_double) :: f</div>
+<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160; </div>
+<div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="interfacenonlin__c__api_1_1c__fcnnvar.html">   33</a></span>&#160;        <span class="keyword">function </span><a class="code" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a>(n, x) <span class="keyword">result</span>(f)</div>
+<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;            <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(n)</div>
+<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="keywordtype">            real</span>(c_double) :: f</div>
+<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160; </div>
+<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="interfacenonlin__c__api_1_1c__vecfcn.html">   48</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a>(neqn, nvar, x, f)</div>
+<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: neqn, nvar</div>
+<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(nvar)</div>
+<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f(neqn)</div>
+<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160; </div>
+<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="interfacenonlin__c__api_1_1c__gradientfcn.html">   62</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__c__api_1_1c__gradientfcn.html">c_gradientfcn</a>(n, x, g)</div>
+<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(n)</div>
+<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(out)</span> :: g(n)</div>
+<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160; </div>
+<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">   78</a></span>&#160;        <span class="keyword">subroutine </span><a class="code" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a>(neqn, nvar, x, jac)</div>
+<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            use, <span class="keywordtype">intrinsic</span> :: iso_c_binding</div>
+<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;            <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: neqn, nvar</div>
+<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(nvar)</div>
+<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;<span class="keywordtype">            real</span>(c_double), <span class="keywordtype">intent(out)</span> :: jac(neqn, nvar)</div>
+<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;    <span class="keyword">end interface</span></div>
+<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160; </div>
+<div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html">   87</a></span>&#160;    <span class="keywordtype">type</span>, <span class="keyword">bind(C)</span> :: iteration_controls</div>
+<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089">   89</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: max_function_evals</div>
+<div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d">   91</a></span>&#160;<span class="keywordtype">        real</span>(c_double) :: function_tolerance</div>
+<div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4">   93</a></span>&#160;<span class="keywordtype">        real</span>(c_double) :: solution_tolerance</div>
+<div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e">   96</a></span>&#160;<span class="keywordtype">        real</span>(c_double) :: gradient_tolerance</div>
+<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3">   99</a></span>&#160;        <span class="keywordtype">logical(c_bool)</span> :: print_status</div>
+<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160; </div>
+<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html">  103</a></span>&#160;    <span class="keywordtype">type</span>, <span class="keyword">bind(C)</span> :: iteration_process</div>
+<div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732">  105</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: iteration_count</div>
+<div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92">  108</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: function_eval_count</div>
+<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf">  110</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: jacobian_eval_count</div>
+<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187">  112</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: gradient_eval_count</div>
+<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9">  115</a></span>&#160;        <span class="keywordtype">logical(c_bool)</span> :: converge_on_function</div>
+<div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56">  118</a></span>&#160;        <span class="keywordtype">logical(c_bool)</span> :: converge_on_solution_change</div>
+<div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18">  122</a></span>&#160;        <span class="keywordtype">logical(c_bool)</span> :: converge_on_gradient</div>
+<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160; </div>
+<div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1line__search__controls.html">  126</a></span>&#160;    <span class="keywordtype">type</span>, <span class="keyword">bind(C)</span> :: line_search_controls</div>
+<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b">  128</a></span>&#160;        <span class="keywordtype">logical(c_bool)</span> :: enable</div>
+<div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35">  131</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: max_function_evals</div>
+<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de">  138</a></span>&#160;<span class="keywordtype">        real</span>(c_double) :: alpha</div>
+<div class="line"><a name="l00146"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1">  146</a></span>&#160;<span class="keywordtype">        real</span>(c_double) :: factor</div>
+<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160; </div>
+<div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1c__polynomial.html">  151</a></span>&#160;    <span class="keywordtype">type</span>, <span class="keyword">bind(C)</span> :: c_polynomial</div>
+<div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e">  153</a></span>&#160;        <span class="keywordtype">integer(c_int)</span> :: size_in_bytes</div>
+<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4">  155</a></span>&#160;        <span class="keywordtype">type</span>(c_ptr) :: ptr</div>
+<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    <span class="keyword">end type</span></div>
+<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160; </div>
+<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="keyword">contains</span></div>
+<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    <span class="keyword">subroutine </span>c_set_default_solver_settings(x) &amp;</div>
+<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keyword">bind(C, name = &quot;c_set_default_solver_settings&quot;)</span></div>
+<div class="line"><a name="l00165"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7">  165</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(out)</span> :: x</div>
+<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160; </div>
+<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        x%max_function_evals = 500</div>
+<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        x%function_tolerance = 1.0d-8</div>
+<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        x%solution_tolerance = 1.0d-12</div>
+<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;        x%gradient_tolerance = 1.0d-12</div>
+<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        x%print_status = <span class="keywordtype">logical</span>(.false., c_bool)</div>
+<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160; </div>
+<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    <span class="keyword">subroutine </span>c_set_default_line_search_settings(x) &amp;</div>
+<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            <span class="keyword">bind(C, name = &quot;c_set_default_line_search_settings&quot;)</span></div>
+<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35">  182</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structline__search__controls.html">line_search_controls</a>), <span class="keywordtype">intent(out)</span> :: x</div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160; </div>
+<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;        <span class="comment">! Process</span></div>
+<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        x%enable = <span class="keywordtype">logical</span>(.false., c_bool)</div>
+<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        x%alpha = 1.0d-4</div>
+<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        x%factor = 1.0d-1</div>
+<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;        x%max_function_evals = 100</div>
+<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160; </div>
+<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;    <span class="keyword">function </span>c_solver_newton_1var(fcn, limits, x, f, cntrls, stats) &amp;</div>
+<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_newton_1var&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d">  211</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn</div>
+<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structvalue__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: limits</div>
+<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: x, f</div>
+<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160; </div>
+<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="keywordtype">type</span>(newton_1var_solver) :: solver</div>
+<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160; </div>
+<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr)</div>
+<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160; </div>
+<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;        <span class="keyword">call </span>solver%set_fcn_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        <span class="keyword">call </span>solver%set_var_tolerance(cntrls%solution_tolerance)</div>
+<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;        <span class="keyword">call </span>solver%set_diff_tolerance(cntrls%gradient_tolerance)</div>
+<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160; </div>
+<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking, err = err)</div>
+<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160; </div>
+<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;        <span class="comment">! Retrieve iteration status</span></div>
+<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160; </div>
+<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        <span class="keyword">function </span>fun(xi) <span class="keyword">result</span>(fx)</div>
+<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: xi</div>
+<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;<span class="keywordtype">            real</span>(real64) :: fx</div>
+<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;            fx = cfptr(xi)</div>
+<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160; </div>
+<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;    <span class="keyword">function </span>c_solver_brent_1var(fcn, x, f, limits, cntrls, stats) &amp;</div>
+<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_brent_1var&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13">  284</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn</div>
+<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x</div>
+<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f</div>
+<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structvalue__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: limits</div>
+<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160; </div>
+<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;        <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
+<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__fcn1var.html">c_fcn1var</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordtype">procedure</span>(fcn1var), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="keywordtype">type</span>(brent_solver) :: solver</div>
+<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160; </div>
+<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr)</div>
+<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160; </div>
+<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;        <span class="keyword">call </span>solver%set_fcn_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="keyword">call </span>solver%set_var_tolerance(cntrls%solution_tolerance)</div>
+<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <span class="keyword">call </span>solver%set_diff_tolerance(cntrls%gradient_tolerance)</div>
+<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160; </div>
+<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, limits, f, ib = tracking, err = err)</div>
+<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160; </div>
+<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="comment">! Retrieve iteration status</span></div>
+<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160; </div>
+<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160; </div>
+<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        <span class="keyword">function </span>fun(xi) <span class="keyword">result</span>(fx)</div>
+<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span> :: xi</div>
+<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;<span class="keywordtype">            real</span>(real64) :: fx</div>
+<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            fx = cfptr(xi)</div>
+<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160; </div>
+<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;    <span class="keyword">function </span>c_solver_quasi_newton(fcn, jac, n, x, f, cntrls, ls, stats) &amp;</div>
+<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_quasi_newton&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00373"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c">  373</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn, jac</div>
+<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x(n)</div>
+<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f(n)</div>
+<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structline__search__controls.html">line_search_controls</a>), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160; </div>
+<div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;        <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;        <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a>), <span class="keywordtype">pointer</span> :: cjptr</div>
+<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;        <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">pointer</span> :: jptr</div>
+<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;        <span class="keywordtype">type</span>(quasi_newton_solver) :: solver</div>
+<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;        <span class="keywordtype">type</span>(line_search) :: search</div>
+<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;        </div>
+<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr, n, n)</div>
+<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;        <span class="keywordflow">if</span> (c_associated(jac)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;            <span class="keyword">call </span>c_f_procpointer(jac, cjptr)</div>
+<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;            jptr =&gt; jacfun</div>
+<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;            <span class="keyword">call </span>obj%set_jacobian(jptr)</div>
+<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160; </div>
+<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;        <span class="keyword">call </span>solver%set_fcn_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;        <span class="keyword">call </span>solver%set_var_tolerance(cntrls%solution_tolerance)</div>
+<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;        <span class="keyword">call </span>solver%set_gradient_tolerance(cntrls%gradient_tolerance)</div>
+<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160; </div>
+<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;        <span class="comment">! Set line search parameters</span></div>
+<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;        <span class="keyword">call </span>solver%set_use_line_search(<span class="keywordtype">logical</span>(ls%enable))</div>
+<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;        <span class="keywordflow">if</span> (ls%enable) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;            <span class="keyword">call </span>search%set_max_fcn_evals(ls%max_function_evals)</div>
+<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;            <span class="keyword">call </span>search%set_scaling_factor(ls%alpha)</div>
+<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;            <span class="keyword">call </span>search%set_distance_factor(ls%factor)</div>
+<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;            <span class="keyword">call </span>solver%set_line_search(search)</div>
+<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160; </div>
+<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, f, ib = tracking, err = err)</div>
+<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160; </div>
+<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        <span class="comment">! Retrieve the ieration status</span></div>
+<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160; </div>
+<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        <span class="keyword">subroutine </span>fun(xx, fx)</div>
+<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fx</div>
+<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;            <span class="keyword">call </span>cfptr(n, n, xx, fx)</div>
+<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160; </div>
+<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;        <span class="keyword">subroutine </span>jacfun(xx, jx)</div>
+<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jx</div>
+<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;            <span class="keyword">call </span>cjptr(n, n, xx, jx)</div>
+<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160; </div>
+<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;    <span class="keyword">function </span>c_solver_newton(fcn, jac, n, x, f, cntrls, ls, stats) &amp;</div>
+<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_newton&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00485"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b">  485</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn, jac</div>
+<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x(n)</div>
+<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f(n)</div>
+<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structline__search__controls.html">line_search_controls</a>), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160; </div>
+<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;        <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;        <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a>), <span class="keywordtype">pointer</span> :: cjptr</div>
+<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;        <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">pointer</span> :: jptr</div>
+<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        <span class="keywordtype">type</span>(newton_solver) :: solver</div>
+<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        <span class="keywordtype">type</span>(line_search) :: search</div>
+<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;        </div>
+<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr, n, n)</div>
+<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <span class="keywordflow">if</span> (c_associated(jac)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;            <span class="keyword">call </span>c_f_procpointer(jac, cjptr)</div>
+<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;            jptr =&gt; jacfun</div>
+<div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;            <span class="keyword">call </span>obj%set_jacobian(jptr)</div>
+<div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160; </div>
+<div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;        <span class="keyword">call </span>solver%set_fcn_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;        <span class="keyword">call </span>solver%set_var_tolerance(cntrls%solution_tolerance)</div>
+<div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;        <span class="keyword">call </span>solver%set_gradient_tolerance(cntrls%gradient_tolerance)</div>
+<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160; </div>
+<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;        <span class="comment">! Set line search parameters</span></div>
+<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        <span class="keyword">call </span>solver%set_use_line_search(<span class="keywordtype">logical</span>(ls%enable))</div>
+<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        <span class="keywordflow">if</span> (ls%enable) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;            <span class="keyword">call </span>search%set_max_fcn_evals(ls%max_function_evals)</div>
+<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;            <span class="keyword">call </span>search%set_scaling_factor(ls%alpha)</div>
+<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;            <span class="keyword">call </span>search%set_distance_factor(ls%factor)</div>
+<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;            <span class="keyword">call </span>solver%set_line_search(search)</div>
+<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160; </div>
+<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, f, ib = tracking, err = err)</div>
+<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160; </div>
+<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        <span class="comment">! Retrieve the ieration status</span></div>
+<div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160; </div>
+<div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;        <span class="keyword">subroutine </span>fun(xx, fx)</div>
+<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fx</div>
+<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;            <span class="keyword">call </span>cfptr(n, n, xx, fx)</div>
+<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160; </div>
+<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;        <span class="keyword">subroutine </span>jacfun(xx, jx)</div>
+<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jx</div>
+<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;            <span class="keyword">call </span>cjptr(n, n, xx, jx)</div>
+<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160; </div>
+<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;    <span class="keyword">function </span>c_solver_least_squares(fcn, jac, neqn, nvar, x, f, cntrls, stats) &amp;</div>
+<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_least_squares&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00596"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1">  596</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn, jac</div>
+<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: neqn, nvar</div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x(nvar)</div>
+<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f(neqn)</div>
+<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160; </div>
+<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;        <span class="keywordtype">type</span>(vecfcn_helper) :: obj</div>
+<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__vecfcn.html">c_vecfcn</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;        <span class="keywordtype">procedure</span>(vecfcn), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__jacobianfcn.html">c_jacobianfcn</a>), <span class="keywordtype">pointer</span> :: cjptr</div>
+<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;        <span class="keywordtype">procedure</span>(jacobianfcn), <span class="keywordtype">pointer</span> :: jptr</div>
+<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;        <span class="keywordtype">type</span>(least_squares_solver) :: solver</div>
+<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;        </div>
+<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr, neqn, nvar)</div>
+<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;        <span class="keywordflow">if</span> (c_associated(jac)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;            <span class="keyword">call </span>c_f_procpointer(jac, cjptr)</div>
+<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;            jptr =&gt; jacfun</div>
+<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;            <span class="keyword">call </span>obj%set_jacobian(jptr)</div>
+<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160; </div>
+<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;        <span class="keyword">call </span>solver%set_fcn_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        <span class="keyword">call </span>solver%set_var_tolerance(cntrls%solution_tolerance)</div>
+<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="keyword">call </span>solver%set_gradient_tolerance(cntrls%gradient_tolerance)</div>
+<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160; </div>
+<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, f, ib = tracking, err = err)</div>
+<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160; </div>
+<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;        <span class="comment">! Retrieve the ieration status</span></div>
+<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160; </div>
+<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        <span class="keyword">subroutine </span>fun(xx, fx)</div>
+<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: fx</div>
+<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;            <span class="keyword">call </span>cfptr(neqn, nvar, xx, fx)</div>
+<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160; </div>
+<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="keyword">subroutine </span>jacfun(xx, jx)</div>
+<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:,:)</span> :: jx</div>
+<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;            <span class="keyword">call </span>cjptr(neqn, nvar, xx, jx)</div>
+<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160; </div>
+<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;    <span class="keyword">function </span>c_solver_nelder_mead(fcn, n, x, f, cntrls, stats) &amp;</div>
+<div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_nelder_mead&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00688"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8">  688</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn</div>
+<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x(n)</div>
+<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f</div>
+<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160; </div>
+<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;        <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;        <span class="keywordtype">type</span>(nelder_mead) :: solver</div>
+<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160; </div>
+<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr, n)</div>
+<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160; </div>
+<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;        <span class="comment">! Set solver parameters</span></div>
+<div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;        <span class="keyword">call </span>solver%set_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160; </div>
+<div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, f, tracking, err)</div>
+<div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160; </div>
+<div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;        <span class="comment">! Retrieve the ieration status</span></div>
+<div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160; </div>
+<div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="keyword">function </span>fun(xx) <span class="keyword">result</span>(fx)</div>
+<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;<span class="keywordtype">            real</span>(real64) :: fx</div>
+<div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;            fx = cfptr(n, xx)</div>
+<div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160; </div>
+<div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;    <span class="keyword">function </span>c_solver_bfgs(fcn, grad, n, x, f, cntrls, ls, stats) &amp;</div>
+<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;            <span class="keyword">bind(C, name = &quot;c_solver_bfgs&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00768"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96">  768</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;        <span class="keywordtype">type</span>(c_funptr), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: fcn, grad</div>
+<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(inout)</span> :: x(n)</div>
+<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: f</div>
+<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__controls.html">iteration_controls</a>), <span class="keywordtype">intent(in)</span> :: cntrls</div>
+<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structline__search__controls.html">line_search_controls</a>), <span class="keywordtype">intent(in)</span> :: ls</div>
+<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structiteration__process.html">iteration_process</a>), <span class="keywordtype">intent(out)</span> :: stats</div>
+<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160; </div>
+<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;        <span class="keywordtype">type</span>(fcnnvar_helper) :: obj</div>
+<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__fcnnvar.html">c_fcnnvar</a>), <span class="keywordtype">pointer</span> :: cfptr</div>
+<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;        <span class="keywordtype">procedure</span>(fcnnvar), <span class="keywordtype">pointer</span> :: fptr</div>
+<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;        <span class="keywordtype">procedure</span>(<a class="code" href="interfacenonlin__c__api_1_1c__gradientfcn.html">c_gradientfcn</a>), <span class="keywordtype">pointer</span> :: cgptr</div>
+<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;        <span class="keywordtype">procedure</span>(gradientfcn), <span class="keywordtype">pointer</span> :: gptr</div>
+<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;        <span class="keywordtype">type</span>(iteration_behavior) :: tracking</div>
+<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        <span class="keywordtype">type</span>(bfgs) :: solver</div>
+<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;        <span class="keywordtype">type</span>(line_search) :: search</div>
+<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160; </div>
+<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;        <span class="keyword">call </span>c_f_procpointer(fcn, cfptr)</div>
+<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;        fptr =&gt; fun</div>
+<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;        <span class="keyword">call </span>obj%set_fcn(fptr, n)</div>
+<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        <span class="keywordflow">if</span> (c_associated(grad)) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;            <span class="keyword">call </span>c_f_procpointer(grad, cgptr)</div>
+<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;            gptr =&gt; grd</div>
+<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;            <span class="keyword">call </span>obj%set_gradient_fcn(gptr)</div>
+<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160; </div>
+<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;        <span class="comment">! Set the solver parameters</span></div>
+<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;        <span class="keyword">call </span>solver%set_max_fcn_evals(cntrls%max_function_evals)</div>
+<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;        <span class="keyword">call </span>solver%set_tolerance(cntrls%function_tolerance)</div>
+<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;        <span class="keyword">call </span>solver%set_print_status(<span class="keywordtype">logical</span>(cntrls%print_status))</div>
+<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160; </div>
+<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;        <span class="comment">! Set line search parameters</span></div>
+<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;        <span class="keyword">call </span>solver%set_use_line_search(<span class="keywordtype">logical</span>(ls%enable))</div>
+<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;        <span class="keywordflow">if</span> (ls%enable) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;            <span class="keyword">call </span>search%set_max_fcn_evals(ls%max_function_evals)</div>
+<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;            <span class="keyword">call </span>search%set_scaling_factor(ls%alpha)</div>
+<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;            <span class="keyword">call </span>search%set_distance_factor(ls%factor)</div>
+<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;            <span class="keyword">call </span>solver%set_line_search(search)</div>
+<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160; </div>
+<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;        <span class="comment">! Solve</span></div>
+<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;        <span class="keyword">call </span>solver%solve(obj, x, f, tracking, err)</div>
+<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160; </div>
+<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;        <span class="comment">! Retrieve the ieration status</span></div>
+<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;        stats%iteration_count = tracking%iter_count</div>
+<div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160;        stats%function_eval_count = tracking%fcn_count</div>
+<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;        stats%jacobian_eval_count = tracking%jacobian_count</div>
+<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;        stats%gradient_eval_count = tracking%gradient_count</div>
+<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;        stats%converge_on_function = <span class="keywordtype">logical</span>(tracking%converge_on_fcn, c_bool)</div>
+<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;        stats%converge_on_solution_change = <span class="keywordtype">logical</span>(tracking%converge_on_chng, c_bool)</div>
+<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        stats%converge_on_gradient = <span class="keywordtype">logical</span>(tracking%converge_on_zero_diff, c_bool)</div>
+<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160; </div>
+<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;        <span class="comment">! Check for errors</span></div>
+<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;    <span class="keyword">contains</span></div>
+<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;        <span class="keyword">function </span>fun(xx) <span class="keyword">result</span>(fx)</div>
+<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;<span class="keywordtype">            real</span>(real64) :: fx</div>
+<div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;            fx = cfptr(n, xx)</div>
+<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        <span class="keyword">end function</span></div>
+<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160; </div>
+<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <span class="keyword">subroutine </span>grd(xx, gx)</div>
+<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(in)</span>, <span class="keywordtype">dimension(:)</span> :: xx</div>
+<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">dimension(:)</span> :: gx</div>
+<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;            <span class="keyword">call </span>cgptr(n, xx, gx)</div>
+<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;        <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160; </div>
+<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="comment">! ******************************************************************************</span></div>
+<div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;<span class="comment">! POLYNOMIAL SUPPORT</span></div>
+<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;    <span class="keyword">function </span>c_init_polynomial(order, poly) &amp;</div>
+<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;            <span class="keyword">bind(C, name = &quot;c_init_polynomial&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00861"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce">  861</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: order</div>
+<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(out)</span> :: poly</div>
+<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160; </div>
+<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i</div>
+<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: buffer</div>
+<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160; </div>
+<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160; </div>
+<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;        <span class="comment">! Initialize the Fortran polynomial</span></div>
+<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;        <span class="keyword">call </span>fpoly%initialize(order, err = err)</div>
+<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160; </div>
+<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;        <span class="comment">! Initialize the pointer</span></div>
+<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;        buffer = transfer(fpoly, buffer)</div>
+<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;        <span class="keyword">allocate</span>(map(<span class="keyword">size</span>(buffer)))</div>
+<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;        <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(buffer)</div>
+<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;            map(i) = buffer(i)</div>
+<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160; </div>
+<div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;        <span class="comment">! Store the results</span></div>
+<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        poly%size_in_bytes = <span class="keyword">size</span>(map)</div>
+<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        poly%ptr = c_loc(map)</div>
+<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160; </div>
+<div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;    <span class="keyword">subroutine </span>c_free_polynomial(poly) <span class="keyword">bind(C, name = &quot;c_free_polynomial&quot;)</span></div>
+<div class="line"><a name="l00901"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c">  901</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(inout)</span> :: poly</div>
+<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160; </div>
+<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160; </div>
+<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160; </div>
+<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160; </div>
+<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;        <span class="comment">! Free memory</span></div>
+<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;        <span class="keyword">deallocate</span>(map)</div>
+<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160; </div>
+<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;        <span class="comment">! Make the C pointer NULL</span></div>
+<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;        poly%ptr = c_null_ptr</div>
+<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;        poly%size_in_bytes = 0</div>
+<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160; </div>
+<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;    <span class="keyword">function </span>c_get_polynomial_order(poly) &amp;</div>
+<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;            <span class="keyword">bind(C, name = &quot;c_get_polynomial_order&quot;)</span> result(n)</div>
+<div class="line"><a name="l00929"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c">  929</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(in)</span> :: poly</div>
+<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: n</div>
+<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160; </div>
+<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160; </div>
+<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;        n = 0</div>
+<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;        </div>
+<div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160; </div>
+<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160; </div>
+<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160; </div>
+<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;        <span class="comment">! Obtain the polynomial order</span></div>
+<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;        n = fpoly%order()</div>
+<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160; </div>
+<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;    <span class="keyword">function </span>c_fit_polynomial(poly, n, x, y, zero) &amp;</div>
+<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;            <span class="keyword">bind(C, name = &quot;c_fit_polynomial&quot;)</span> result(flag)</div>
+<div class="line"><a name="l00971"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66">  971</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(inout)</span> :: poly</div>
+<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(n), y(n)</div>
+<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;        <span class="keywordtype">logical(c_bool)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: zero</div>
+<div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160; </div>
+<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, order</div>
+<div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: buffer</div>
+<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;<span class="keywordtype">        real</span>(real64), <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: ycopy</div>
+<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160; </div>
+<div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;        ycopy = y   <span class="comment">! Prevents overwritting of y</span></div>
+<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160; </div>
+<div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160; </div>
+<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160; </div>
+<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160; </div>
+<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;        <span class="comment">! Fit the data</span></div>
+<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;        order = fpoly%order()</div>
+<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;        <span class="keywordflow">if</span> (zero) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;            <span class="keyword">call </span>fpoly%fit_thru_zero(x, ycopy, order, err)</div>
+<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;        <span class="keywordflow">else</span></div>
+<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;            <span class="keyword">call </span>fpoly%fit(x, ycopy, order, err)</div>
+<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160; </div>
+<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;        <span class="comment">! Reconstruct the C polynomial type</span></div>
+<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;        <span class="keyword">deallocate</span>(map)</div>
+<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;        buffer = transfer(fpoly, buffer)</div>
+<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;        <span class="keyword">allocate</span>(map(<span class="keyword">size</span>(buffer)))</div>
+<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;        <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(buffer)</div>
+<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;            map(i) = buffer(i)</div>
+<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>&#160; </div>
+<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;        <span class="comment">! Store the results</span></div>
+<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;        poly%size_in_bytes = <span class="keyword">size</span>(map)</div>
+<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;        poly%ptr = c_loc(map)</div>
+<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160; </div>
+<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;    <span class="keyword">function </span>c_get_polynomial_coefficients(poly, nc, c) &amp;</div>
+<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;            <span class="keyword">bind(C, name = &quot;c_get_polynomial_coefficients&quot;)</span> result(flag)</div>
+<div class="line"><a name="l01041"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265"> 1041</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(in)</span> :: poly</div>
+<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: nc</div>
+<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: c(nc)</div>
+<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160; </div>
+<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, order, n</div>
+<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160; </div>
+<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160; </div>
+<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160; </div>
+<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160; </div>
+<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160; </div>
+<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;        <span class="comment">! Get the order of the polynomial, and then copy over the coefficients</span></div>
+<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;        order = fpoly%order()</div>
+<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;        n = order + 1</div>
+<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;        <span class="keywordflow">if</span> (nc &lt; n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;            flag = nl_invalid_input_error</div>
+<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;            c(i) = fpoly%get(i)</div>
+<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160; </div>
+<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;    <span class="keyword">function </span>c_set_polynomial_coefficients(poly, nc, c) &amp;</div>
+<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;            <span class="keyword">bind(C, name = &quot;c_set_polynomial_coefficients&quot;)</span> result(flag)</div>
+<div class="line"><a name="l01096"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498"> 1096</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(inout)</span> :: poly</div>
+<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: nc</div>
+<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;<span class="keywordtype">        real</span>(c_double) :: c(nc)</div>
+<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160; </div>
+<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>&#160;        <span class="keywordtype">integer(int32)</span> :: i, order, n</div>
+<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">allocatable</span>, <span class="keywordtype">dimension(:)</span> :: buffer</div>
+<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160; </div>
+<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160; </div>
+<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160; </div>
+<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160; </div>
+<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160; </div>
+<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;        <span class="comment">! Get the order of the polynomial, and then copy over the coefficients</span></div>
+<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;        order = fpoly%order()</div>
+<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;        n = order + 1</div>
+<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;        <span class="keywordflow">if</span> (nc /= n) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;            flag = nl_invalid_input_error</div>
+<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;        <span class="keywordflow">do</span> i = 1, n</div>
+<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;            <span class="keyword">call </span>fpoly%set(i, c(i))</div>
+<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160; </div>
+<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;        <span class="comment">! Reconstruct the C polynomial type</span></div>
+<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;        <span class="keyword">deallocate</span>(map)</div>
+<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;        buffer = transfer(fpoly, buffer)</div>
+<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;        <span class="keyword">allocate</span>(map(<span class="keyword">size</span>(buffer)))</div>
+<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;        <span class="keywordflow">do</span> i = 1, <span class="keyword">size</span>(buffer)</div>
+<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;            map(i) = buffer(i)</div>
+<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;<span class="keywordflow">        end do</span></div>
+<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160; </div>
+<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;        <span class="comment">! Store the results</span></div>
+<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;        poly%size_in_bytes = <span class="keyword">size</span>(map)</div>
+<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;        poly%ptr = c_loc(map)</div>
+<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>&#160; </div>
+<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;    <span class="keyword">subroutine </span>c_evaluate_polynomial_real(poly, n, x, y) &amp;</div>
+<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;            <span class="keyword">bind(C, name = &quot;c_evaluate_polynomial_real&quot;)</span></div>
+<div class="line"><a name="l01158"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1"> 1158</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(in)</span> :: poly</div>
+<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(in)</span> :: x(n)</div>
+<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;<span class="keywordtype">        real</span>(c_double), <span class="keywordtype">intent(out)</span> :: y(n)</div>
+<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160; </div>
+<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160; </div>
+<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160; </div>
+<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160; </div>
+<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160; </div>
+<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;        <span class="comment">! Evaluate the polynomial at X</span></div>
+<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;        y = fpoly%evaluate(x)</div>
+<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160; </div>
+<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;    <span class="keyword">subroutine </span>c_evaluate_polynomial_complex(poly, n, x, y) &amp;</div>
+<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;            <span class="keyword">bind(C, name = &quot;c_evaluate_polynomial_complex&quot;)</span></div>
+<div class="line"><a name="l01193"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc"> 1193</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(in)</span> :: poly</div>
+<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;        <span class="keywordtype">complex(c_double)</span>, <span class="keywordtype">intent(in)</span> :: x(n)</div>
+<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;        <span class="keywordtype">complex(c_double)</span>, <span class="keywordtype">intent(out)</span> :: y(n)</div>
+<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160; </div>
+<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160; </div>
+<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160; </div>
+<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160; </div>
+<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160; </div>
+<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;        <span class="comment">! Evaluate the polynomial at X</span></div>
+<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;        y = fpoly%evaluate(x)</div>
+<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;    <span class="keyword">end subroutine</span></div>
+<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160; </div>
+<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;    <span class="keyword">function </span>c_polynomial_roots(poly, n, rts) &amp;</div>
+<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;            <span class="keyword">bind(C, name = &quot;c_polynomial_roots&quot;)</span> result(flag)</div>
+<div class="line"><a name="l01235"></a><span class="lineno"><a class="line" href="namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0"> 1235</a></span>&#160;        <span class="comment">! Arguments</span></div>
+<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;        <span class="keywordtype">type</span>(<a class="code" href="structc__polynomial.html">c_polynomial</a>), <span class="keywordtype">intent(in)</span> :: poly</div>
+<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;        <span class="keywordtype">integer(c_int)</span>, <span class="keywordtype">intent(in)</span>, <span class="keywordtype">value</span> :: n</div>
+<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;        <span class="keywordtype">complex(c_double)</span>, <span class="keywordtype">intent(out)</span> :: rts(n)</div>
+<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;        <span class="keywordtype">integer(c_int)</span> :: flag</div>
+<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160; </div>
+<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;        <span class="comment">! Local Variables</span></div>
+<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;        <span class="keywordtype">type</span>(errors) :: err</div>
+<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160;        <span class="keywordtype">integer(int8)</span>, <span class="keywordtype">pointer</span>, <span class="keywordtype">dimension(:)</span> :: map</div>
+<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;        <span class="keywordtype">type</span>(polynomial) :: fpoly</div>
+<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;        <span class="keywordtype">integer(int32)</span> :: order</div>
+<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160; </div>
+<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;        <span class="comment">! Initialization</span></div>
+<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;        flag = nl_no_error</div>
+<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;        <span class="keyword">call </span>err%set_exit_on_error(.false.)</div>
+<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160; </div>
+<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;        <span class="comment">! Ensure there&#39;s something to work with</span></div>
+<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;        <span class="keywordflow">if</span> (.not.c_associated(poly%ptr) .or. poly%size_in_bytes == 0) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160; </div>
+<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160;        <span class="comment">! Obtain the pointer</span></div>
+<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;        <span class="keyword">call </span>c_f_pointer(poly%ptr, map, [poly%size_in_bytes])</div>
+<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;        <span class="keywordflow">if</span> (.not.<span class="keyword">associated</span>(map)) <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160; </div>
+<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;        <span class="comment">! Reconstruct the Fortran polynomial object</span></div>
+<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;        fpoly = transfer(map, fpoly)</div>
+<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160; </div>
+<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;        <span class="comment">! Ensure the output array is properly sized</span></div>
+<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;        order = fpoly%order()</div>
+<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;        <span class="keywordflow">if</span> (n /= order) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;            flag = nl_invalid_input_error</div>
+<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160; </div>
+<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;        <span class="comment">! Compute the polynomial roots</span></div>
+<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;        rts = fpoly%roots(err)</div>
+<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;        <span class="keywordflow">if</span> (err%has_error_occurred()) <span class="keywordflow">then</span></div>
+<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;            flag = err%get_error_flag()</div>
+<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;            <span class="keywordflow">return</span></div>
+<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;<span class="keywordflow">        end if</span></div>
+<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;    <span class="keyword">end function</span></div>
+<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160; </div>
+<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
+<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
+<div class="ttc" id="ainterfacenonlin__c__api_1_1c__gradientfcn_html"><div class="ttname"><a href="interfacenonlin__c__api_1_1c__gradientfcn.html">nonlin_c_api::c_gradientfcn</a></div><div class="ttdoc">Describes a routin capable of computing the gradient vector of an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00062">nonlin_c_api.f90:62</a></div></div>
 <div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
+<div class="ttc" id="astructvalue__pair_html"><div class="ttname"><a href="structvalue__pair.html">value_pair</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00098">nonlin.h:98</a></div></div>
 <div class="ttc" id="anamespacenonlin__c__api_html"><div class="ttname"><a href="namespacenonlin__c__api.html">nonlin_c_api</a></div><div class="ttdoc">Defines a C-friendly API to the NONLIN library.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00004">nonlin_c_api.f90:4</a></div></div>
+<div class="ttc" id="anamespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
 <div class="ttc" id="anamespacenonlin__least__squares_html"><div class="ttname"><a href="namespacenonlin__least__squares.html">nonlin_least_squares</a></div><div class="ttdoc">nonlin_least_squares</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__least__squares_8f90_source.html#l00007">nonlin_least_squares.f90:7</a></div></div>
+<div class="ttc" id="ainterfacenonlin__c__api_1_1c__fcn1var_html"><div class="ttname"><a href="interfacenonlin__c__api_1_1c__fcn1var.html">nonlin_c_api::c_fcn1var</a></div><div class="ttdoc">Describes a function of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00022">nonlin_c_api.f90:22</a></div></div>
+<div class="ttc" id="anamespacenonlin__polynomials_html"><div class="ttname"><a href="namespacenonlin__polynomials.html">nonlin_polynomials</a></div><div class="ttdoc">polynomials</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__polynomials_8f90_source.html#l00013">nonlin_polynomials.f90:13</a></div></div>
+<div class="ttc" id="ainterfacenonlin__c__api_1_1c__jacobianfcn_html"><div class="ttname"><a href="interfacenonlin__c__api_1_1c__jacobianfcn.html">nonlin_c_api::c_jacobianfcn</a></div><div class="ttdoc">Describes a routine capable of computing the Jacobian matrix of a system of equations.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00078">nonlin_c_api.f90:78</a></div></div>
+<div class="ttc" id="ainterfacenonlin__c__api_1_1c__vecfcn_html"><div class="ttname"><a href="interfacenonlin__c__api_1_1c__vecfcn.html">nonlin_c_api::c_vecfcn</a></div><div class="ttdoc">Describes a vector-valued function.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00048">nonlin_c_api.f90:48</a></div></div>
+<div class="ttc" id="astructiteration__controls_html"><div class="ttname"><a href="structiteration__controls.html">iteration_controls</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00018">nonlin.h:18</a></div></div>
+<div class="ttc" id="anamespacenonlin__optimize_html"><div class="ttname"><a href="namespacenonlin__optimize.html">nonlin_optimize</a></div><div class="ttdoc">nonlin_optimize</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__optimize_8f90_source.html#l00013">nonlin_optimize.f90:13</a></div></div>
+<div class="ttc" id="ainterfacenonlin__c__api_1_1c__fcnnvar_html"><div class="ttname"><a href="interfacenonlin__c__api_1_1c__fcnnvar.html">nonlin_c_api::c_fcnnvar</a></div><div class="ttdoc">Describes a function of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__c__api_8f90_source.html#l00033">nonlin_c_api.f90:33</a></div></div>
+<div class="ttc" id="astructiteration__process_html"><div class="ttname"><a href="structiteration__process.html">iteration_process</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00037">nonlin.h:37</a></div></div>
+<div class="ttc" id="astructc__polynomial_html"><div class="ttname"><a href="structc__polynomial.html">c_polynomial</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00159">nonlin.h:159</a></div></div>
+<div class="ttc" id="astructline__search__controls_html"><div class="ttname"><a href="structline__search__controls.html">line_search_controls</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00068">nonlin.h:68</a></div></div>
 <div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
 <div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
 <!-- start footer part -->
diff --git a/doc/html/nonlin__constants_8f90_source.html b/doc/html/nonlin__constants_8f90_source.html
index 05ea21d..13d2c49 100644
--- a/doc/html/nonlin__constants_8f90_source.html
+++ b/doc/html/nonlin__constants_8f90_source.html
@@ -101,16 +101,17 @@
 <div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">! ******************************************************************************</span></div>
 <div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">! ERROR FLAGS</span></div>
 <div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
-<div class="line"><a name="l00016"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d">   16</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_input_error = 201</div>
-<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a">   18</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_array_size_error = 202</div>
-<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">   20</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_out_of_memory_error = la_out_of_memory_error</div>
-<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">   22</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_operation_error = &amp;</div>
-<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        la_invalid_operation_error</div>
-<div class="line"><a name="l00025"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5">   25</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_convergence_error = la_convergence_error</div>
-<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0">   27</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_divergent_behavior_error = 206</div>
-<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4">   29</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_spurious_convergence_error = 207</div>
-<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0">   32</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_tolerance_too_small_error = 208</div>
-<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">end module</span></div>
+<div class="line"><a name="l00016"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde">   16</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_no_error = 0</div>
+<div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d">   18</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_input_error = 201</div>
+<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a">   20</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_array_size_error = 202</div>
+<div class="line"><a name="l00022"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3">   22</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_out_of_memory_error = la_out_of_memory_error</div>
+<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d">   24</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_invalid_operation_error = &amp;</div>
+<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        la_invalid_operation_error</div>
+<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5">   27</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_convergence_error = la_convergence_error</div>
+<div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0">   29</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_divergent_behavior_error = 206</div>
+<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4">   31</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_spurious_convergence_error = 207</div>
+<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0">   34</a></span>&#160;    <span class="keywordtype">integer(int32)</span>, <span class="keywordtype">parameter</span> :: nl_tolerance_too_small_error = 208</div>
+<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <div class="ttc" id="anamespacenonlin__constants_html"><div class="ttname"><a href="namespacenonlin__constants.html">nonlin_constants</a></div><div class="ttdoc">nonlin_constants</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__constants_8f90_source.html#l00007">nonlin_constants.f90:7</a></div></div>
diff --git a/doc/html/nonlin__core_8f90_source.html b/doc/html/nonlin__core_8f90_source.html
index 16f2c82..8ab5d17 100644
--- a/doc/html/nonlin__core_8f90_source.html
+++ b/doc/html/nonlin__core_8f90_source.html
@@ -113,7 +113,7 @@
 <div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver.html">equation_solver</a></div>
 <div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__solver__1var.html">equation_solver_1var</a></div>
 <div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1equation__optimizer.html">equation_optimizer</a></div>
-<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="structvalue__pair.html">value_pair</a></div>
 <div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_solver</a></div>
 <div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__solver__1var.html">nonlin_solver_1var</a></div>
 <div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keywordtype">public</span> :: <a class="code" href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_optimize_fcn</a></div>
@@ -169,7 +169,7 @@
 <div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;    <span class="keyword">end type</span></div>
 <div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160; </div>
 <div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="comment">! ------------------------------------------------------------------------------</span></div>
-<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html">  277</a></span>&#160;    <span class="keyword">type</span> :: <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html">  277</a></span>&#160;    <span class="keywordtype">type</span>, <span class="keyword">bind(C)</span> :: value_pair</div>
 <div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87">  279</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: x1</div>
 <div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73">  281</a></span>&#160;<span class="keywordtype">        real</span>(real64) :: x2</div>
 <div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;    <span class="keyword">end type</span></div>
@@ -595,7 +595,7 @@
 <div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160;            <span class="keywordtype">use </span>ferror, <span class="keywordtype">only</span> : errors</div>
 <div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160;            <span class="keywordtype">import </span>equation_solver_1var</div>
 <div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160;            <span class="keywordtype">import </span>fcn1var_helper</div>
-<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;            <span class="keywordtype">import </span>value_pair</div>
+<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;            <span class="keywordtype">import </span><a class="code" href="structvalue__pair.html">value_pair</a></div>
 <div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160;            <span class="keywordtype">import </span>iteration_behavior</div>
 <div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160;            <span class="keywordtype">class</span>(equation_solver_1var), <span class="keywordtype">intent(inout)</span> :: this</div>
 <div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160;            <span class="keywordtype">class</span>(fcn1var_helper), <span class="keywordtype">intent(in)</span> :: fcn</div>
@@ -641,9 +641,9 @@
 <div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160;<span class="keyword">end module</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
-<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
 <div class="ttc" id="ainterfacenonlin__core_1_1nonlin__solver_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__solver.html">nonlin_core::nonlin_solver</a></div><div class="ttdoc">Describes the interface of a nonlinear equation solver.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01902">nonlin_core.f90:1902</a></div></div>
 <div class="ttc" id="ainterfacenonlin__core_1_1nonlin__optimize__fcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1nonlin__optimize__fcn.html">nonlin_core::nonlin_optimize_fcn</a></div><div class="ttdoc">Describes the interface of a routine for optimizing an equation of N variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l01969">nonlin_core.f90:1969</a></div></div>
+<div class="ttc" id="astructvalue__pair_html"><div class="ttname"><a href="structvalue__pair.html">value_pair</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00098">nonlin.h:98</a></div></div>
 <div class="ttc" id="ainterfacenonlin__core_1_1vecfcn_html"><div class="ttname"><a href="interfacenonlin__core_1_1vecfcn.html">nonlin_core::vecfcn</a></div><div class="ttdoc">Describes an M-element vector-valued function of N-variables.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00209">nonlin_core.f90:209</a></div></div>
 <div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
 <div class="ttc" id="ainterfacenonlin__core_1_1fcn1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcn1var.html">nonlin_core::fcn1var</a></div><div class="ttdoc">Describes a function of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00198">nonlin_core.f90:198</a></div></div>
diff --git a/doc/html/nonlin__solve_8f90_source.html b/doc/html/nonlin__solve_8f90_source.html
index 6b3cf03..57d298d 100644
--- a/doc/html/nonlin__solve_8f90_source.html
+++ b/doc/html/nonlin__solve_8f90_source.html
@@ -228,7 +228,7 @@
 <div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;            <span class="keywordtype">class</span>(brent_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
 <div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
 <div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
-<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structvalue__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
 <div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
 <div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
 <div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
@@ -248,7 +248,7 @@
 <div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;            <span class="keywordtype">class</span>(newton_1var_solver), <span class="keywordtype">intent(inout)</span> :: this</div>
 <div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;            <span class="keywordtype">class</span>(<a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>), <span class="keywordtype">intent(in)</span> :: fcn</div>
 <div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(inout)</span> :: x</div>
-<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
+<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structvalue__pair.html">value_pair</a>), <span class="keywordtype">intent(in)</span> :: lim</div>
 <div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;<span class="keywordtype">            real</span>(real64), <span class="keywordtype">intent(out)</span>, <span class="keywordtype">optional</span> :: f</div>
 <div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;            <span class="keywordtype">type</span>(<a class="code" href="structnonlin__core_1_1iteration__behavior.html">iteration_behavior</a>), <span class="keywordtype">optional</span> :: ib</div>
 <div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keywordtype">class</span>(errors), <span class="keywordtype">intent(inout)</span>, <span class="keywordtype">optional</span>, <span class="keywordtype">target</span> :: err</div>
@@ -328,8 +328,8 @@
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
-<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
 <div class="ttc" id="astructnonlin__solve_1_1quasi__newton__solver_html"><div class="ttname"><a href="structnonlin__solve_1_1quasi__newton__solver.html">nonlin_solve::quasi_newton_solver</a></div><div class="ttdoc">Defines a quasi-Newton type solver based upon Broyden's method.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00139">nonlin_solve.f90:139</a></div></div>
+<div class="ttc" id="astructvalue__pair_html"><div class="ttname"><a href="structvalue__pair.html">value_pair</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00098">nonlin.h:98</a></div></div>
 <div class="ttc" id="astructnonlin__core_1_1vecfcn__helper_html"><div class="ttname"><a href="structnonlin__core_1_1vecfcn__helper.html">nonlin_core::vecfcn_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating a system of nonlinear equations of the form: F(X) = 0....</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00339">nonlin_core.f90:339</a></div></div>
 <div class="ttc" id="astructnonlin__linesearch_1_1line__search_html"><div class="ttname"><a href="structnonlin__linesearch_1_1line__search.html">nonlin_linesearch::line_search</a></div><div class="ttdoc">Defines a type capable of performing an inexact, backtracking line search to find a point as far alon...</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00040">nonlin_linesearch.f90:40</a></div></div>
 <div class="ttc" id="anamespacenonlin__linesearch_html"><div class="ttname"><a href="namespacenonlin__linesearch.html">nonlin_linesearch</a></div><div class="ttdoc">nonlin_linesearch</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__linesearch_8f90_source.html#l00013">nonlin_linesearch.f90:13</a></div></div>
diff --git a/doc/html/search/all_0.js b/doc/html/search/all_0.js
index 4762ec2..6d597c4 100644
--- a/doc/html/search/all_0.js
+++ b/doc/html/search/all_0.js
@@ -1,4 +1,5 @@
 var searchData=
 [
-  ['assignment_28_3d_29_0',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
+  ['alpha_0',['alpha',['../structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de',1,'nonlin_c_api::line_search_controls::alpha()'],['../structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed',1,'line_search_controls::alpha()']]],
+  ['assignment_28_3d_29_1',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/all_1.js b/doc/html/search/all_1.js
index 3c0b1e0..5bd4a25 100644
--- a/doc/html/search/all_1.js
+++ b/doc/html/search/all_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['bfgs_1',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
-  ['brent_5fsolver_2',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
+  ['bfgs_2',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
+  ['brent_5fsolver_3',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_10.js b/doc/html/search/all_10.js
index 0a6b9fb..eb87a39 100644
--- a/doc/html/search/all_10.js
+++ b/doc/html/search/all_10.js
@@ -1,26 +1,28 @@
 var searchData=
 [
-  ['search_144',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
-  ['set_145',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
-  ['set_5fdefault_5fline_5fsearch_146',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
-  ['set_5fdiff_5ftolerance_147',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
-  ['set_5fdistance_5ffactor_148',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
-  ['set_5ffcn_149',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
-  ['set_5ffcn_5ftolerance_150',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
-  ['set_5fgradient_5ffcn_151',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
-  ['set_5fgradient_5ftolerance_152',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
-  ['set_5finitial_5fsize_153',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fjacobian_154',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
-  ['set_5fjacobian_5finterval_155',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
-  ['set_5fline_5fsearch_156',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
-  ['set_5fmax_5ffcn_5fevals_157',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
-  ['set_5fpoly_5fcoefficient_158',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
-  ['set_5fprint_5fstatus_159',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
-  ['set_5fscaling_5ffactor_160',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
-  ['set_5fsimplex_161',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fstep_5fscaling_5ffactor_162',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
-  ['set_5ftolerance_163',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
-  ['set_5fuse_5fline_5fsearch_164',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
-  ['set_5fvar_5ftolerance_165',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
-  ['solve_166',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
+  ['search_186',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
+  ['set_187',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
+  ['set_5fdefault_5fline_5fsearch_188',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
+  ['set_5fdiff_5ftolerance_189',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
+  ['set_5fdistance_5ffactor_190',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
+  ['set_5ffcn_191',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
+  ['set_5ffcn_5ftolerance_192',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
+  ['set_5fgradient_5ffcn_193',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
+  ['set_5fgradient_5ftolerance_194',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
+  ['set_5finitial_5fsize_195',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fjacobian_196',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
+  ['set_5fjacobian_5finterval_197',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
+  ['set_5fline_5fsearch_198',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
+  ['set_5fmax_5ffcn_5fevals_199',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
+  ['set_5fpoly_5fcoefficient_200',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
+  ['set_5fprint_5fstatus_201',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
+  ['set_5fscaling_5ffactor_202',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
+  ['set_5fsimplex_203',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fstep_5fscaling_5ffactor_204',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
+  ['set_5ftolerance_205',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
+  ['set_5fuse_5fline_5fsearch_206',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
+  ['set_5fvar_5ftolerance_207',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
+  ['size_5fin_5fbytes_208',['size_in_bytes',['../structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e',1,'nonlin_c_api::c_polynomial::size_in_bytes()'],['../structc__polynomial.html#ac0838645de567ad5a80b255791707976',1,'c_polynomial::size_in_bytes()']]],
+  ['solution_5ftolerance_209',['solution_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4',1,'nonlin_c_api::iteration_controls::solution_tolerance()'],['../structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1',1,'iteration_controls::solution_tolerance()']]],
+  ['solve_210',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
 ];
diff --git a/doc/html/search/all_11.js b/doc/html/search/all_11.js
index 9c4b689..8950849 100644
--- a/doc/html/search/all_11.js
+++ b/doc/html/search/all_11.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['test_5fconvergence_167',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
+  ['test_5fconvergence_211',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_12.js b/doc/html/search/all_12.js
index 546fa78..efe85be 100644
--- a/doc/html/search/all_12.js
+++ b/doc/html/search/all_12.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['value_5fpair_168',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
-  ['vecfcn_169',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
-  ['vecfcn_5fhelper_170',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
+  ['value_5fpair_212',['value_pair',['../structvalue__pair.html',1,'value_pair'],['../structnonlin__core_1_1value__pair.html',1,'nonlin_core::value_pair']]],
+  ['vecfcn_213',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
+  ['vecfcn_5fhelper_214',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_13.js b/doc/html/search/all_13.js
index ee892d0..63f5e30 100644
--- a/doc/html/search/all_13.js
+++ b/doc/html/search/all_13.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['x1_171',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
-  ['x2_172',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
+  ['x1_215',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair::x1()'],['../structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e',1,'value_pair::x1()']]],
+  ['x2_216',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair::x2()'],['../structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc',1,'value_pair::x2()']]]
 ];
diff --git a/doc/html/search/all_2.js b/doc/html/search/all_2.js
index e75bf0f..4e5e478 100644
--- a/doc/html/search/all_2.js
+++ b/doc/html/search/all_2.js
@@ -1,7 +1,34 @@
 var searchData=
 [
-  ['companion_5fmtx_3',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]],
-  ['converge_5fon_5fchng_4',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5ffcn_5',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5fzero_5fdiff_6',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
+  ['c_5fevaluate_5fpolynomial_5fcomplex_4',['c_evaluate_polynomial_complex',['../namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc',1,'nonlin_c_api']]],
+  ['c_5fevaluate_5fpolynomial_5freal_5',['c_evaluate_polynomial_real',['../namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1',1,'nonlin_c_api']]],
+  ['c_5ffcn1var_6',['c_fcn1var',['../interfacenonlin__c__api_1_1c__fcn1var.html',1,'nonlin_c_api']]],
+  ['c_5ffcnnvar_7',['c_fcnnvar',['../interfacenonlin__c__api_1_1c__fcnnvar.html',1,'nonlin_c_api']]],
+  ['c_5ffit_5fpolynomial_8',['c_fit_polynomial',['../namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66',1,'nonlin_c_api']]],
+  ['c_5ffree_5fpolynomial_9',['c_free_polynomial',['../namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c',1,'nonlin_c_api']]],
+  ['c_5fget_5fpolynomial_5fcoefficients_10',['c_get_polynomial_coefficients',['../namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265',1,'nonlin_c_api']]],
+  ['c_5fget_5fpolynomial_5forder_11',['c_get_polynomial_order',['../namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c',1,'nonlin_c_api']]],
+  ['c_5fgradientfcn_12',['c_gradientfcn',['../interfacenonlin__c__api_1_1c__gradientfcn.html',1,'nonlin_c_api']]],
+  ['c_5finit_5fpolynomial_13',['c_init_polynomial',['../namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce',1,'nonlin_c_api']]],
+  ['c_5fjacobianfcn_14',['c_jacobianfcn',['../interfacenonlin__c__api_1_1c__jacobianfcn.html',1,'nonlin_c_api']]],
+  ['c_5fpolynomial_15',['c_polynomial',['../structnonlin__c__api_1_1c__polynomial.html',1,'nonlin_c_api::c_polynomial'],['../structc__polynomial.html',1,'c_polynomial']]],
+  ['c_5fpolynomial_5froots_16',['c_polynomial_roots',['../namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0',1,'nonlin_c_api']]],
+  ['c_5fset_5fdefault_5fline_5fsearch_5fsettings_17',['c_set_default_line_search_settings',['../namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35',1,'nonlin_c_api']]],
+  ['c_5fset_5fdefault_5fsolver_5fsettings_18',['c_set_default_solver_settings',['../namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7',1,'nonlin_c_api']]],
+  ['c_5fset_5fpolynomial_5fcoefficients_19',['c_set_polynomial_coefficients',['../namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fbfgs_20',['c_solver_bfgs',['../namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fbrent_5f1var_21',['c_solver_brent_1var',['../namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fleast_5fsquares_22',['c_solver_least_squares',['../namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnelder_5fmead_23',['c_solver_nelder_mead',['../namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnewton_24',['c_solver_newton',['../namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnewton_5f1var_25',['c_solver_newton_1var',['../namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fquasi_5fnewton_26',['c_solver_quasi_newton',['../namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c',1,'nonlin_c_api']]],
+  ['c_5fvecfcn_27',['c_vecfcn',['../interfacenonlin__c__api_1_1c__vecfcn.html',1,'nonlin_c_api']]],
+  ['companion_5fmtx_28',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]],
+  ['converge_5fon_5fchng_29',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffcn_30',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffunction_31',['converge_on_function',['../structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9',1,'nonlin_c_api::iteration_process::converge_on_function()'],['../structiteration__process.html#a00a463e2db7a0fbab8764083936d926c',1,'iteration_process::converge_on_function()']]],
+  ['converge_5fon_5fgradient_32',['converge_on_gradient',['../structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18',1,'nonlin_c_api::iteration_process::converge_on_gradient()'],['../structiteration__process.html#a309e95e4da19427633b6d0c1affab090',1,'iteration_process::converge_on_gradient()']]],
+  ['converge_5fon_5fsolution_5fchange_33',['converge_on_solution_change',['../structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56',1,'nonlin_c_api::iteration_process::converge_on_solution_change()'],['../structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c',1,'iteration_process::converge_on_solution_change()']]],
+  ['converge_5fon_5fzero_5fdiff_34',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/all_3.js b/doc/html/search/all_3.js
index 754578f..c9f6f51 100644
--- a/doc/html/search/all_3.js
+++ b/doc/html/search/all_3.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['dbl_5fpoly_5fmult_7',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
-  ['diff_8',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
+  ['dbl_5fpoly_5fmult_35',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
+  ['diff_36',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
 ];
diff --git a/doc/html/search/all_4.js b/doc/html/search/all_4.js
index f4b3485..81c03a2 100644
--- a/doc/html/search/all_4.js
+++ b/doc/html/search/all_4.js
@@ -1,8 +1,9 @@
 var searchData=
 [
-  ['equation_5foptimizer_9',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
-  ['equation_5fsolver_10',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
-  ['equation_5fsolver_5f1var_11',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]],
-  ['evaluate_12',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
-  ['extrapolate_13',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
+  ['enable_37',['enable',['../structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b',1,'nonlin_c_api::line_search_controls::enable()'],['../structline__search__controls.html#a011d44e850183280119f0aa06af6d83a',1,'line_search_controls::enable()']]],
+  ['equation_5foptimizer_38',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
+  ['equation_5fsolver_39',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
+  ['equation_5fsolver_5f1var_40',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]],
+  ['evaluate_41',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
+  ['extrapolate_42',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
 ];
diff --git a/doc/html/search/all_5.js b/doc/html/search/all_5.js
index 34f41df..869fb80 100644
--- a/doc/html/search/all_5.js
+++ b/doc/html/search/all_5.js
@@ -1,11 +1,14 @@
 var searchData=
 [
-  ['fcn_14',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
-  ['fcn1var_15',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
-  ['fcn1var_5fhelper_16',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
-  ['fcn_5fcount_17',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]],
-  ['fcnnvar_18',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
-  ['fcnnvar_5fhelper_19',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]],
-  ['fit_20',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
-  ['fit_5fthru_5fzero_21',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
+  ['factor_43',['factor',['../structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1',1,'nonlin_c_api::line_search_controls::factor()'],['../structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c',1,'line_search_controls::factor()']]],
+  ['fcn_44',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
+  ['fcn1var_45',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
+  ['fcn1var_5fhelper_46',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
+  ['fcn_5fcount_47',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]],
+  ['fcnnvar_48',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
+  ['fcnnvar_5fhelper_49',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]],
+  ['fit_50',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
+  ['fit_5fthru_5fzero_51',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]],
+  ['function_5feval_5fcount_52',['function_eval_count',['../structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92',1,'nonlin_c_api::iteration_process::function_eval_count()'],['../structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a',1,'iteration_process::function_eval_count()']]],
+  ['function_5ftolerance_53',['function_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d',1,'nonlin_c_api::iteration_controls::function_tolerance()'],['../structiteration__controls.html#a6b4646344cda46ab0752819a1a930028',1,'iteration_controls::function_tolerance()']]]
 ];
diff --git a/doc/html/search/all_6.js b/doc/html/search/all_6.js
index 2185be2..2629775 100644
--- a/doc/html/search/all_6.js
+++ b/doc/html/search/all_6.js
@@ -1,28 +1,30 @@
 var searchData=
 [
-  ['get_22',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fall_23',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fdiff_5ftolerance_24',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
-  ['get_5fdistance_5ffactor_25',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
-  ['get_5fequation_5fcount_26',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
-  ['get_5ffcn_5ftolerance_27',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
-  ['get_5fgradient_5ftolerance_28',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
-  ['get_5finitial_5fsize_29',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fjacobian_5finterval_30',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
-  ['get_5fline_5fsearch_31',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
-  ['get_5fmax_5ffcn_5fevals_32',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
-  ['get_5fpoly_5fcoefficient_33',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5fcoefficients_34',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5forder_35',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
-  ['get_5fprint_5fstatus_36',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
-  ['get_5fscaling_5ffactor_37',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
-  ['get_5fsimplex_38',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fstep_5fscaling_5ffactor_39',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
-  ['get_5ftolerance_40',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
-  ['get_5fuse_5fline_5fsearch_41',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
-  ['get_5fvar_5ftolerance_42',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
-  ['get_5fvariable_5fcount_43',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
-  ['gradient_44',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]],
-  ['gradient_5fcount_45',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]],
-  ['gradientfcn_46',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
+  ['get_54',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fall_55',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fdiff_5ftolerance_56',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
+  ['get_5fdistance_5ffactor_57',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
+  ['get_5fequation_5fcount_58',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
+  ['get_5ffcn_5ftolerance_59',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
+  ['get_5fgradient_5ftolerance_60',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
+  ['get_5finitial_5fsize_61',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fjacobian_5finterval_62',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
+  ['get_5fline_5fsearch_63',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
+  ['get_5fmax_5ffcn_5fevals_64',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
+  ['get_5fpoly_5fcoefficient_65',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5fcoefficients_66',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5forder_67',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
+  ['get_5fprint_5fstatus_68',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
+  ['get_5fscaling_5ffactor_69',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
+  ['get_5fsimplex_70',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fstep_5fscaling_5ffactor_71',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
+  ['get_5ftolerance_72',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
+  ['get_5fuse_5fline_5fsearch_73',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
+  ['get_5fvar_5ftolerance_74',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
+  ['get_5fvariable_5fcount_75',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
+  ['gradient_76',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]],
+  ['gradient_5fcount_77',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]],
+  ['gradient_5feval_5fcount_78',['gradient_eval_count',['../structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187',1,'nonlin_c_api::iteration_process::gradient_eval_count()'],['../structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb',1,'iteration_process::gradient_eval_count()']]],
+  ['gradient_5ftolerance_79',['gradient_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e',1,'nonlin_c_api::iteration_controls::gradient_tolerance()'],['../structiteration__controls.html#a31353fc9c86aa23157c30b1073893745',1,'iteration_controls::gradient_tolerance()']]],
+  ['gradientfcn_80',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_7.js b/doc/html/search/all_7.js
index 9cd50f3..1da1331 100644
--- a/doc/html/search/all_7.js
+++ b/doc/html/search/all_7.js
@@ -1,13 +1,16 @@
 var searchData=
 [
-  ['init_5fpoly_47',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
-  ['init_5fpoly_5fcoeffs_48',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
-  ['initialize_49',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
-  ['is_5fderivative_5fdefined_50',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
-  ['is_5ffcn_5fdefined_51',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
-  ['is_5fgradient_5fdefined_52',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
-  ['is_5fjacobian_5fdefined_53',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
-  ['is_5fline_5fsearch_5fdefined_54',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]],
-  ['iter_5fcount_55',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]],
-  ['iteration_5fbehavior_56',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
+  ['init_5fpoly_81',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
+  ['init_5fpoly_5fcoeffs_82',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
+  ['initialize_83',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
+  ['is_5fderivative_5fdefined_84',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
+  ['is_5ffcn_5fdefined_85',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
+  ['is_5fgradient_5fdefined_86',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
+  ['is_5fjacobian_5fdefined_87',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
+  ['is_5fline_5fsearch_5fdefined_88',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]],
+  ['iter_5fcount_89',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]],
+  ['iteration_5fbehavior_90',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]],
+  ['iteration_5fcontrols_91',['iteration_controls',['../structiteration__controls.html',1,'iteration_controls'],['../structnonlin__c__api_1_1iteration__controls.html',1,'nonlin_c_api::iteration_controls']]],
+  ['iteration_5fcount_92',['iteration_count',['../structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732',1,'nonlin_c_api::iteration_process::iteration_count()'],['../structiteration__process.html#a13c1427518d62138fdfac155510347fd',1,'iteration_process::iteration_count()']]],
+  ['iteration_5fprocess_93',['iteration_process',['../structiteration__process.html',1,'iteration_process'],['../structnonlin__c__api_1_1iteration__process.html',1,'nonlin_c_api::iteration_process']]]
 ];
diff --git a/doc/html/search/all_8.js b/doc/html/search/all_8.js
index db9a759..3cb3c95 100644
--- a/doc/html/search/all_8.js
+++ b/doc/html/search/all_8.js
@@ -1,6 +1,7 @@
 var searchData=
 [
-  ['jacobian_57',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]],
-  ['jacobian_5fcount_58',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]],
-  ['jacobianfcn_59',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
+  ['jacobian_94',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]],
+  ['jacobian_5fcount_95',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]],
+  ['jacobian_5feval_5fcount_96',['jacobian_eval_count',['../structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf',1,'nonlin_c_api::iteration_process::jacobian_eval_count()'],['../structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55',1,'iteration_process::jacobian_eval_count()']]],
+  ['jacobianfcn_97',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_9.js b/doc/html/search/all_9.js
index d66c18b..e85f832 100644
--- a/doc/html/search/all_9.js
+++ b/doc/html/search/all_9.js
@@ -1,22 +1,23 @@
 var searchData=
 [
-  ['least_5fsquares_5fsolver_60',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
-  ['limit_5fsearch_5fvector_61',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
-  ['line_5fsearch_62',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
-  ['line_5fsearch_5foptimizer_63',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
-  ['line_5fsearch_5fsolver_64',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]],
-  ['lmfactor_65',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
-  ['lmpar_66',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
-  ['lmsolve_67',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
-  ['ls_5fget_5fdist_68',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fmax_5feval_69',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fscale_70',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmimo_71',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmiso_72',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fdist_73',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fmax_5feval_74',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fscale_75',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
-  ['lss_5fget_5ffactor_76',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
-  ['lss_5fset_5ffactor_77',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
-  ['lss_5fsolve_78',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
+  ['least_5fsquares_5fsolver_98',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
+  ['limit_5fsearch_5fvector_99',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
+  ['line_5fsearch_100',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
+  ['line_5fsearch_5fcontrols_101',['line_search_controls',['../structnonlin__c__api_1_1line__search__controls.html',1,'nonlin_c_api::line_search_controls'],['../structline__search__controls.html',1,'line_search_controls']]],
+  ['line_5fsearch_5foptimizer_102',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
+  ['line_5fsearch_5fsolver_103',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]],
+  ['lmfactor_104',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
+  ['lmpar_105',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
+  ['lmsolve_106',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
+  ['ls_5fget_5fdist_107',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fmax_5feval_108',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fscale_109',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmimo_110',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmiso_111',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fdist_112',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fmax_5feval_113',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fscale_114',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
+  ['lss_5fget_5ffactor_115',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
+  ['lss_5fset_5ffactor_116',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
+  ['lss_5fsolve_117',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
 ];
diff --git a/doc/html/search/all_a.js b/doc/html/search/all_a.js
index 25056a9..db21ae5 100644
--- a/doc/html/search/all_a.js
+++ b/doc/html/search/all_a.js
@@ -1,25 +1,26 @@
 var searchData=
 [
-  ['m_5falpha_79',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
-  ['m_5fcoeffs_80',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
-  ['m_5fdiff_81',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
-  ['m_5fdifftol_82',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
-  ['m_5ffactor_83',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
-  ['m_5ffcn_84',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
-  ['m_5ffcntol_85',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
-  ['m_5fgrad_86',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
-  ['m_5fgtol_87',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
-  ['m_5finitsize_88',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5fjac_89',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fjdelta_90',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
-  ['m_5flinesearch_91',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
-  ['m_5fmaxeval_92',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
-  ['m_5fnfcn_93',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fnvar_94',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
-  ['m_5fprintstatus_95',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
-  ['m_5fsimplex_96',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5ftol_97',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
-  ['m_5fuselinesearch_98',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
-  ['m_5fxtol_99',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]],
-  ['min_5fbacktrack_5fsearch_100',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
+  ['m_5falpha_118',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
+  ['m_5fcoeffs_119',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
+  ['m_5fdiff_120',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
+  ['m_5fdifftol_121',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
+  ['m_5ffactor_122',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
+  ['m_5ffcn_123',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
+  ['m_5ffcntol_124',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
+  ['m_5fgrad_125',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
+  ['m_5fgtol_126',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
+  ['m_5finitsize_127',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5fjac_128',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fjdelta_129',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
+  ['m_5flinesearch_130',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
+  ['m_5fmaxeval_131',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
+  ['m_5fnfcn_132',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fnvar_133',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
+  ['m_5fprintstatus_134',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
+  ['m_5fsimplex_135',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5ftol_136',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
+  ['m_5fuselinesearch_137',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
+  ['m_5fxtol_138',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]],
+  ['max_5ffunction_5fevals_139',['max_function_evals',['../structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089',1,'nonlin_c_api::iteration_controls::max_function_evals()'],['../structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35',1,'nonlin_c_api::line_search_controls::max_function_evals()'],['../structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e',1,'iteration_controls::max_function_evals()'],['../structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1',1,'line_search_controls::max_function_evals()']]],
+  ['min_5fbacktrack_5fsearch_140',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
 ];
diff --git a/doc/html/search/all_b.js b/doc/html/search/all_b.js
index bd3f9d3..532ae4c 100644
--- a/doc/html/search/all_b.js
+++ b/doc/html/search/all_b.js
@@ -1,25 +1,26 @@
 var searchData=
 [
-  ['nelder_5fmead_101',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
-  ['newton_5f1var_5fsolver_102',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
-  ['newton_5fsolver_103',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
-  ['nl_5farray_5fsize_5ferror_104',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
-  ['nl_5fconvergence_5ferror_105',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
-  ['nl_5fdivergent_5fbehavior_5ferror_106',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
-  ['nl_5finvalid_5finput_5ferror_107',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
-  ['nl_5finvalid_5foperation_5ferror_108',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
-  ['nl_5fout_5fof_5fmemory_5ferror_109',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
-  ['nl_5fspurious_5fconvergence_5ferror_110',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
-  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_111',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]],
-  ['nonlin_5fc_5fapi_112',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
-  ['nonlin_5fconstants_113',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
-  ['nonlin_5fcore_114',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
-  ['nonlin_5fleast_5fsquares_115',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
-  ['nonlin_5flinesearch_116',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
-  ['nonlin_5foptimize_117',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
-  ['nonlin_5foptimize_5ffcn_118',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
-  ['nonlin_5fpolynomials_119',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
-  ['nonlin_5fsolve_120',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]],
-  ['nonlin_5fsolver_121',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver_5f1var_122',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
+  ['nelder_5fmead_141',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
+  ['newton_5f1var_5fsolver_142',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
+  ['newton_5fsolver_143',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
+  ['nl_5farray_5fsize_5ferror_144',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
+  ['nl_5fconvergence_5ferror_145',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
+  ['nl_5fdivergent_5fbehavior_5ferror_146',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
+  ['nl_5finvalid_5finput_5ferror_147',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
+  ['nl_5finvalid_5foperation_5ferror_148',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
+  ['nl_5fno_5ferror_149',['nl_no_error',['../namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde',1,'nonlin_constants']]],
+  ['nl_5fout_5fof_5fmemory_5ferror_150',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
+  ['nl_5fspurious_5fconvergence_5ferror_151',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
+  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_152',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]],
+  ['nonlin_5fc_5fapi_153',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
+  ['nonlin_5fconstants_154',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
+  ['nonlin_5fcore_155',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
+  ['nonlin_5fleast_5fsquares_156',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
+  ['nonlin_5flinesearch_157',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
+  ['nonlin_5foptimize_158',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
+  ['nonlin_5foptimize_5ffcn_159',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
+  ['nonlin_5fpolynomials_160',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
+  ['nonlin_5fsolve_161',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]],
+  ['nonlin_5fsolver_162',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_5f1var_163',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/all_c.js b/doc/html/search/all_c.js
index b966f90..5e450a6 100644
--- a/doc/html/search/all_c.js
+++ b/doc/html/search/all_c.js
@@ -1,7 +1,7 @@
 var searchData=
 [
-  ['operator_28_2a_29_123',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2b_29_124',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2d_29_125',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]],
-  ['order_126',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
+  ['operator_28_2a_29_164',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2b_29_165',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2d_29_166',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]],
+  ['order_167',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/all_d.js b/doc/html/search/all_d.js
index 09620c1..c8a936e 100644
--- a/doc/html/search/all_d.js
+++ b/doc/html/search/all_d.js
@@ -1,18 +1,19 @@
 var searchData=
 [
-  ['poly_5fcompanion_5fmtx_127',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
-  ['poly_5fdbl_5fequals_128',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
-  ['poly_5fdbl_5fmult_129',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
-  ['poly_5fequals_130',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
-  ['poly_5fequals_5farray_131',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
-  ['poly_5feval_5fcomplex_132',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
-  ['poly_5feval_5fdouble_133',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
-  ['poly_5ffit_134',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
-  ['poly_5ffit_5fthru_5fzero_135',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
-  ['poly_5fpoly_5fadd_136',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
-  ['poly_5fpoly_5fmult_137',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
-  ['poly_5fpoly_5fsubtract_138',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
-  ['poly_5froots_139',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
-  ['polynomial_140',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]],
-  ['print_5fstatus_141',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
+  ['poly_5fcompanion_5fmtx_168',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
+  ['poly_5fdbl_5fequals_169',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
+  ['poly_5fdbl_5fmult_170',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
+  ['poly_5fequals_171',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
+  ['poly_5fequals_5farray_172',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
+  ['poly_5feval_5fcomplex_173',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
+  ['poly_5feval_5fdouble_174',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
+  ['poly_5ffit_175',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
+  ['poly_5ffit_5fthru_5fzero_176',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
+  ['poly_5fpoly_5fadd_177',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
+  ['poly_5fpoly_5fmult_178',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
+  ['poly_5fpoly_5fsubtract_179',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
+  ['poly_5froots_180',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
+  ['polynomial_181',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]],
+  ['print_5fstatus_182',['print_status',['../structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3',1,'nonlin_c_api::iteration_controls::print_status()'],['../structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2',1,'iteration_controls::print_status()'],['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core::print_status()']]],
+  ['ptr_183',['ptr',['../structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4',1,'nonlin_c_api::c_polynomial::ptr()'],['../structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c',1,'c_polynomial::ptr()']]]
 ];
diff --git a/doc/html/search/all_e.js b/doc/html/search/all_e.js
index 5dbc4be..0c82e24 100644
--- a/doc/html/search/all_e.js
+++ b/doc/html/search/all_e.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['quasi_5fnewton_5fsolver_142',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
+  ['quasi_5fnewton_5fsolver_184',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/all_f.js b/doc/html/search/all_f.js
index ee78db9..7d165ef 100644
--- a/doc/html/search/all_f.js
+++ b/doc/html/search/all_f.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['roots_143',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
+  ['roots_185',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/classes_0.js b/doc/html/search/classes_0.js
index 626e4e8..cac25fa 100644
--- a/doc/html/search/classes_0.js
+++ b/doc/html/search/classes_0.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['assignment_28_3d_29_173',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
+  ['assignment_28_3d_29_217',['assignment(=)',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_1.js b/doc/html/search/classes_1.js
index efd8e59..b8cf320 100644
--- a/doc/html/search/classes_1.js
+++ b/doc/html/search/classes_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['bfgs_174',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
-  ['brent_5fsolver_175',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
+  ['bfgs_218',['bfgs',['../structnonlin__optimize_1_1bfgs.html',1,'nonlin_optimize']]],
+  ['brent_5fsolver_219',['brent_solver',['../structnonlin__solve_1_1brent__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_2.js b/doc/html/search/classes_2.js
index 874404d..54b3a6a 100644
--- a/doc/html/search/classes_2.js
+++ b/doc/html/search/classes_2.js
@@ -1,6 +1,9 @@
 var searchData=
 [
-  ['equation_5foptimizer_176',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
-  ['equation_5fsolver_177',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
-  ['equation_5fsolver_5f1var_178',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]]
+  ['c_5ffcn1var_220',['c_fcn1var',['../interfacenonlin__c__api_1_1c__fcn1var.html',1,'nonlin_c_api']]],
+  ['c_5ffcnnvar_221',['c_fcnnvar',['../interfacenonlin__c__api_1_1c__fcnnvar.html',1,'nonlin_c_api']]],
+  ['c_5fgradientfcn_222',['c_gradientfcn',['../interfacenonlin__c__api_1_1c__gradientfcn.html',1,'nonlin_c_api']]],
+  ['c_5fjacobianfcn_223',['c_jacobianfcn',['../interfacenonlin__c__api_1_1c__jacobianfcn.html',1,'nonlin_c_api']]],
+  ['c_5fpolynomial_224',['c_polynomial',['../structnonlin__c__api_1_1c__polynomial.html',1,'nonlin_c_api::c_polynomial'],['../structc__polynomial.html',1,'c_polynomial']]],
+  ['c_5fvecfcn_225',['c_vecfcn',['../interfacenonlin__c__api_1_1c__vecfcn.html',1,'nonlin_c_api']]]
 ];
diff --git a/doc/html/search/classes_3.js b/doc/html/search/classes_3.js
index 3361b4d..e632423 100644
--- a/doc/html/search/classes_3.js
+++ b/doc/html/search/classes_3.js
@@ -1,7 +1,6 @@
 var searchData=
 [
-  ['fcn1var_179',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
-  ['fcn1var_5fhelper_180',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
-  ['fcnnvar_181',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
-  ['fcnnvar_5fhelper_182',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]]
+  ['equation_5foptimizer_226',['equation_optimizer',['../structnonlin__core_1_1equation__optimizer.html',1,'nonlin_core']]],
+  ['equation_5fsolver_227',['equation_solver',['../structnonlin__core_1_1equation__solver.html',1,'nonlin_core']]],
+  ['equation_5fsolver_5f1var_228',['equation_solver_1var',['../structnonlin__core_1_1equation__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_4.js b/doc/html/search/classes_4.js
index d9c59a5..1ccffb2 100644
--- a/doc/html/search/classes_4.js
+++ b/doc/html/search/classes_4.js
@@ -1,4 +1,7 @@
 var searchData=
 [
-  ['gradientfcn_183',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
+  ['fcn1var_229',['fcn1var',['../interfacenonlin__core_1_1fcn1var.html',1,'nonlin_core']]],
+  ['fcn1var_5fhelper_230',['fcn1var_helper',['../structnonlin__core_1_1fcn1var__helper.html',1,'nonlin_core']]],
+  ['fcnnvar_231',['fcnnvar',['../interfacenonlin__core_1_1fcnnvar.html',1,'nonlin_core']]],
+  ['fcnnvar_5fhelper_232',['fcnnvar_helper',['../structnonlin__core_1_1fcnnvar__helper.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_5.js b/doc/html/search/classes_5.js
index 2cdf3ac..ee28991 100644
--- a/doc/html/search/classes_5.js
+++ b/doc/html/search/classes_5.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['iteration_5fbehavior_184',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]]
+  ['gradientfcn_233',['gradientfcn',['../interfacenonlin__core_1_1gradientfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_6.js b/doc/html/search/classes_6.js
index 28aa3b2..52d0bac 100644
--- a/doc/html/search/classes_6.js
+++ b/doc/html/search/classes_6.js
@@ -1,4 +1,6 @@
 var searchData=
 [
-  ['jacobianfcn_185',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
+  ['iteration_5fbehavior_234',['iteration_behavior',['../structnonlin__core_1_1iteration__behavior.html',1,'nonlin_core']]],
+  ['iteration_5fcontrols_235',['iteration_controls',['../structiteration__controls.html',1,'iteration_controls'],['../structnonlin__c__api_1_1iteration__controls.html',1,'nonlin_c_api::iteration_controls']]],
+  ['iteration_5fprocess_236',['iteration_process',['../structiteration__process.html',1,'iteration_process'],['../structnonlin__c__api_1_1iteration__process.html',1,'nonlin_c_api::iteration_process']]]
 ];
diff --git a/doc/html/search/classes_7.js b/doc/html/search/classes_7.js
index 4b051f3..f228b1c 100644
--- a/doc/html/search/classes_7.js
+++ b/doc/html/search/classes_7.js
@@ -1,7 +1,4 @@
 var searchData=
 [
-  ['least_5fsquares_5fsolver_186',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
-  ['line_5fsearch_187',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
-  ['line_5fsearch_5foptimizer_188',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
-  ['line_5fsearch_5fsolver_189',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]]
+  ['jacobianfcn_237',['jacobianfcn',['../interfacenonlin__core_1_1jacobianfcn.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_8.js b/doc/html/search/classes_8.js
index 892ea45..d3f8d07 100644
--- a/doc/html/search/classes_8.js
+++ b/doc/html/search/classes_8.js
@@ -1,9 +1,8 @@
 var searchData=
 [
-  ['nelder_5fmead_190',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
-  ['newton_5f1var_5fsolver_191',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
-  ['newton_5fsolver_192',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
-  ['nonlin_5foptimize_5ffcn_193',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver_194',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
-  ['nonlin_5fsolver_5f1var_195',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
+  ['least_5fsquares_5fsolver_238',['least_squares_solver',['../structnonlin__least__squares_1_1least__squares__solver.html',1,'nonlin_least_squares']]],
+  ['line_5fsearch_239',['line_search',['../structnonlin__linesearch_1_1line__search.html',1,'nonlin_linesearch']]],
+  ['line_5fsearch_5fcontrols_240',['line_search_controls',['../structnonlin__c__api_1_1line__search__controls.html',1,'nonlin_c_api::line_search_controls'],['../structline__search__controls.html',1,'line_search_controls']]],
+  ['line_5fsearch_5foptimizer_241',['line_search_optimizer',['../structnonlin__optimize_1_1line__search__optimizer.html',1,'nonlin_optimize']]],
+  ['line_5fsearch_5fsolver_242',['line_search_solver',['../structnonlin__solve_1_1line__search__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_9.js b/doc/html/search/classes_9.js
index c317b3c..0cf4a92 100644
--- a/doc/html/search/classes_9.js
+++ b/doc/html/search/classes_9.js
@@ -1,6 +1,9 @@
 var searchData=
 [
-  ['operator_28_2a_29_196',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2b_29_197',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
-  ['operator_28_2d_29_198',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]]
+  ['nelder_5fmead_243',['nelder_mead',['../structnonlin__optimize_1_1nelder__mead.html',1,'nonlin_optimize']]],
+  ['newton_5f1var_5fsolver_244',['newton_1var_solver',['../structnonlin__solve_1_1newton__1var__solver.html',1,'nonlin_solve']]],
+  ['newton_5fsolver_245',['newton_solver',['../structnonlin__solve_1_1newton__solver.html',1,'nonlin_solve']]],
+  ['nonlin_5foptimize_5ffcn_246',['nonlin_optimize_fcn',['../interfacenonlin__core_1_1nonlin__optimize__fcn.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_247',['nonlin_solver',['../interfacenonlin__core_1_1nonlin__solver.html',1,'nonlin_core']]],
+  ['nonlin_5fsolver_5f1var_248',['nonlin_solver_1var',['../interfacenonlin__core_1_1nonlin__solver__1var.html',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/classes_a.js b/doc/html/search/classes_a.js
index a51ff71..5efb18a 100644
--- a/doc/html/search/classes_a.js
+++ b/doc/html/search/classes_a.js
@@ -1,4 +1,6 @@
 var searchData=
 [
-  ['polynomial_199',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]]
+  ['operator_28_2a_29_249',['operator(*)',['../interfacenonlin__polynomials_1_1operator_07_5_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2b_29_250',['operator(+)',['../interfacenonlin__polynomials_1_1operator_07_09_08.html',1,'nonlin_polynomials']]],
+  ['operator_28_2d_29_251',['operator(-)',['../interfacenonlin__polynomials_1_1operator_07-_08.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_b.js b/doc/html/search/classes_b.js
index 9836b56..58f0276 100644
--- a/doc/html/search/classes_b.js
+++ b/doc/html/search/classes_b.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['quasi_5fnewton_5fsolver_200',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
+  ['polynomial_252',['polynomial',['../structnonlin__polynomials_1_1polynomial.html',1,'nonlin_polynomials']]]
 ];
diff --git a/doc/html/search/classes_c.js b/doc/html/search/classes_c.js
index 38ee2a3..c000653 100644
--- a/doc/html/search/classes_c.js
+++ b/doc/html/search/classes_c.js
@@ -1,6 +1,4 @@
 var searchData=
 [
-  ['value_5fpair_201',['value_pair',['../structnonlin__core_1_1value__pair.html',1,'nonlin_core']]],
-  ['vecfcn_202',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
-  ['vecfcn_5fhelper_203',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
+  ['quasi_5fnewton_5fsolver_253',['quasi_newton_solver',['../structnonlin__solve_1_1quasi__newton__solver.html',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/classes_d.html b/doc/html/search/classes_d.html
new file mode 100644
index 0000000..7170da2
--- /dev/null
+++ b/doc/html/search/classes_d.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html><head><title></title>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<link rel="stylesheet" type="text/css" href="search.css"/>
+<script type="text/javascript" src="classes_d.js"></script>
+<script type="text/javascript" src="search.js"></script>
+</head>
+<body class="SRPage">
+<div id="SRIndex">
+<div class="SRStatus" id="Loading">Loading...</div>
+<div id="SRResults"></div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+createResults();
+/* @license-end */
+--></script>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+document.getElementById("Loading").style.display="none";
+document.getElementById("NoMatches").style.display="none";
+var searchResults = new SearchResults("searchResults");
+searchResults.Search();
+/* @license-end */
+--></script>
+</div>
+</body>
+</html>
diff --git a/doc/html/search/classes_d.js b/doc/html/search/classes_d.js
new file mode 100644
index 0000000..2cfb436
--- /dev/null
+++ b/doc/html/search/classes_d.js
@@ -0,0 +1,6 @@
+var searchData=
+[
+  ['value_5fpair_254',['value_pair',['../structvalue__pair.html',1,'value_pair'],['../structnonlin__core_1_1value__pair.html',1,'nonlin_core::value_pair']]],
+  ['vecfcn_255',['vecfcn',['../interfacenonlin__core_1_1vecfcn.html',1,'nonlin_core']]],
+  ['vecfcn_5fhelper_256',['vecfcn_helper',['../structnonlin__core_1_1vecfcn__helper.html',1,'nonlin_core']]]
+];
diff --git a/doc/html/search/functions_0.js b/doc/html/search/functions_0.js
index f6c3054..947bea8 100644
--- a/doc/html/search/functions_0.js
+++ b/doc/html/search/functions_0.js
@@ -1,4 +1,22 @@
 var searchData=
 [
-  ['companion_5fmtx_212',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]]
+  ['c_5fevaluate_5fpolynomial_5fcomplex_265',['c_evaluate_polynomial_complex',['../namespacenonlin__c__api.html#af540e9baac4eac9640ce35ef24e298bc',1,'nonlin_c_api']]],
+  ['c_5fevaluate_5fpolynomial_5freal_266',['c_evaluate_polynomial_real',['../namespacenonlin__c__api.html#a4a845e24ea0918325aa3136e1f29ceb1',1,'nonlin_c_api']]],
+  ['c_5ffit_5fpolynomial_267',['c_fit_polynomial',['../namespacenonlin__c__api.html#a81148de3345c2ac1e90d0ac457456b66',1,'nonlin_c_api']]],
+  ['c_5ffree_5fpolynomial_268',['c_free_polynomial',['../namespacenonlin__c__api.html#acd7aedd4b47a57e65ae98c3af2fc4a0c',1,'nonlin_c_api']]],
+  ['c_5fget_5fpolynomial_5fcoefficients_269',['c_get_polynomial_coefficients',['../namespacenonlin__c__api.html#a153532b0432c694c1fc3aea0e1d4f265',1,'nonlin_c_api']]],
+  ['c_5fget_5fpolynomial_5forder_270',['c_get_polynomial_order',['../namespacenonlin__c__api.html#aa7cc59e88998293eb66fac2e28cc5d9c',1,'nonlin_c_api']]],
+  ['c_5finit_5fpolynomial_271',['c_init_polynomial',['../namespacenonlin__c__api.html#abc356d02daa6404eac943028ff0117ce',1,'nonlin_c_api']]],
+  ['c_5fpolynomial_5froots_272',['c_polynomial_roots',['../namespacenonlin__c__api.html#a31e4af5cc4449ef458093dc89db279e0',1,'nonlin_c_api']]],
+  ['c_5fset_5fdefault_5fline_5fsearch_5fsettings_273',['c_set_default_line_search_settings',['../namespacenonlin__c__api.html#a811151a2deb2f3b49f86467fb0b22e35',1,'nonlin_c_api']]],
+  ['c_5fset_5fdefault_5fsolver_5fsettings_274',['c_set_default_solver_settings',['../namespacenonlin__c__api.html#a8a4c4cb414ea515eef7af9fdecb670f7',1,'nonlin_c_api']]],
+  ['c_5fset_5fpolynomial_5fcoefficients_275',['c_set_polynomial_coefficients',['../namespacenonlin__c__api.html#a159ced3d2aef9077a43a14ab9a8b5498',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fbfgs_276',['c_solver_bfgs',['../namespacenonlin__c__api.html#a33b7f81bea4bb9c4a0de9920b7d0fe96',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fbrent_5f1var_277',['c_solver_brent_1var',['../namespacenonlin__c__api.html#af7cb73b66273ab59a7c1d0957ee4ad13',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fleast_5fsquares_278',['c_solver_least_squares',['../namespacenonlin__c__api.html#a55b78a3b660a4600fbea209c49d5aba1',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnelder_5fmead_279',['c_solver_nelder_mead',['../namespacenonlin__c__api.html#a95c8612176d7551bf6795b9c0c3085e8',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnewton_280',['c_solver_newton',['../namespacenonlin__c__api.html#a7d284884dde01451a137c92f5135625b',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fnewton_5f1var_281',['c_solver_newton_1var',['../namespacenonlin__c__api.html#ade127c74ece722479ab78b009c9dc62d',1,'nonlin_c_api']]],
+  ['c_5fsolver_5fquasi_5fnewton_282',['c_solver_quasi_newton',['../namespacenonlin__c__api.html#aaa633714eb4d8c8206b6ad6afa15b83c',1,'nonlin_c_api']]],
+  ['companion_5fmtx_283',['companion_mtx',['../structnonlin__polynomials_1_1polynomial.html#aadbe3b5e2c3ca7df84bffeb71faa33fd',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_1.js b/doc/html/search/functions_1.js
index 66bf87f..b9a14e3 100644
--- a/doc/html/search/functions_1.js
+++ b/doc/html/search/functions_1.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['dbl_5fpoly_5fmult_213',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
-  ['diff_214',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
+  ['dbl_5fpoly_5fmult_284',['dbl_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a6b49c2080eeab1817c53f2d3a7fb4736',1,'nonlin_polynomials::operator(*)::dbl_poly_mult()'],['../namespacenonlin__polynomials.html#ae8c0ac75d5ebeb66d6c0cf339a22be2c',1,'nonlin_polynomials::dbl_poly_mult()']]],
+  ['diff_285',['diff',['../structnonlin__core_1_1fcn1var__helper.html#a798d9b180392537c564ac69cc1b81952',1,'nonlin_core::fcn1var_helper']]]
 ];
diff --git a/doc/html/search/functions_2.js b/doc/html/search/functions_2.js
index c3f6bf4..8731c29 100644
--- a/doc/html/search/functions_2.js
+++ b/doc/html/search/functions_2.js
@@ -1,5 +1,5 @@
 var searchData=
 [
-  ['evaluate_215',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
-  ['extrapolate_216',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
+  ['evaluate_286',['evaluate',['../structnonlin__polynomials_1_1polynomial.html#a80a74956544433b7a45babcfb4443980',1,'nonlin_polynomials::polynomial']]],
+  ['extrapolate_287',['extrapolate',['../structnonlin__optimize_1_1nelder__mead.html#a4f23b7fdeadd1789895d385d3646d2a7',1,'nonlin_optimize::nelder_mead']]]
 ];
diff --git a/doc/html/search/functions_3.js b/doc/html/search/functions_3.js
index b140c91..4a14106 100644
--- a/doc/html/search/functions_3.js
+++ b/doc/html/search/functions_3.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['fcn_217',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
-  ['fit_218',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
-  ['fit_5fthru_5fzero_219',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
+  ['fcn_288',['fcn',['../structnonlin__core_1_1vecfcn__helper.html#a44c03a753473e7cc38776bf2005e1eb8',1,'nonlin_core::vecfcn_helper::fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#aee8fdfd1502ae3c5b38b1ce96eb5ec93',1,'nonlin_core::fcn1var_helper::fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#ac0e4eed2d730bce1c9d0814a1e444404',1,'nonlin_core::fcnnvar_helper::fcn()']]],
+  ['fit_289',['fit',['../structnonlin__polynomials_1_1polynomial.html#ac92ea228d6b80f1936f103f94adcb1ee',1,'nonlin_polynomials::polynomial']]],
+  ['fit_5fthru_5fzero_290',['fit_thru_zero',['../structnonlin__polynomials_1_1polynomial.html#a3ced5fa8b1d410dcf53ff40224f82912',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_4.js b/doc/html/search/functions_4.js
index 8e28850..b869834 100644
--- a/doc/html/search/functions_4.js
+++ b/doc/html/search/functions_4.js
@@ -1,26 +1,26 @@
 var searchData=
 [
-  ['get_220',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fall_221',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
-  ['get_5fdiff_5ftolerance_222',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
-  ['get_5fdistance_5ffactor_223',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
-  ['get_5fequation_5fcount_224',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
-  ['get_5ffcn_5ftolerance_225',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
-  ['get_5fgradient_5ftolerance_226',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
-  ['get_5finitial_5fsize_227',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fjacobian_5finterval_228',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
-  ['get_5fline_5fsearch_229',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
-  ['get_5fmax_5ffcn_5fevals_230',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
-  ['get_5fpoly_5fcoefficient_231',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5fcoefficients_232',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
-  ['get_5fpoly_5forder_233',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
-  ['get_5fprint_5fstatus_234',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
-  ['get_5fscaling_5ffactor_235',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
-  ['get_5fsimplex_236',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
-  ['get_5fstep_5fscaling_5ffactor_237',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
-  ['get_5ftolerance_238',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
-  ['get_5fuse_5fline_5fsearch_239',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
-  ['get_5fvar_5ftolerance_240',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
-  ['get_5fvariable_5fcount_241',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
-  ['gradient_242',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]]
+  ['get_291',['get',['../structnonlin__polynomials_1_1polynomial.html#acf1d9028ac1f3ee1832daf1297d65b4c',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fall_292',['get_all',['../structnonlin__polynomials_1_1polynomial.html#aa457fde9f1a8040f259115fc974cd620',1,'nonlin_polynomials::polynomial']]],
+  ['get_5fdiff_5ftolerance_293',['get_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a0d88f798646df6e9ac00c87a42875e54',1,'nonlin_core::equation_solver_1var']]],
+  ['get_5fdistance_5ffactor_294',['get_distance_factor',['../structnonlin__linesearch_1_1line__search.html#a29f8a78a487b327ec7e920b75cbd24bf',1,'nonlin_linesearch::line_search']]],
+  ['get_5fequation_5fcount_295',['get_equation_count',['../structnonlin__core_1_1vecfcn__helper.html#ab7d7b04b2705a59abf9f3533f65b9982',1,'nonlin_core::vecfcn_helper']]],
+  ['get_5ffcn_5ftolerance_296',['get_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#a0c51ee3aa81149bc42686cb09dbd1e33',1,'nonlin_core::equation_solver::get_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a0b57aabf05b077747a8936874186f69b',1,'nonlin_core::equation_solver_1var::get_fcn_tolerance()']]],
+  ['get_5fgradient_5ftolerance_297',['get_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#aa5308e1748c83d72c58776b9a0a879e6',1,'nonlin_core::equation_solver']]],
+  ['get_5finitial_5fsize_298',['get_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#ad09b33f9ff6f17e1cc0d56befa1a77b4',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fjacobian_5finterval_299',['get_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#ae0d32f09d93bfdad656b89c80c91e4d3',1,'nonlin_solve::quasi_newton_solver']]],
+  ['get_5fline_5fsearch_300',['get_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a2b1042174ffcc88914b97c27c120f010',1,'nonlin_optimize::line_search_optimizer::get_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a678892aebd2d0546870f835543869e2a',1,'nonlin_solve::line_search_solver::get_line_search()']]],
+  ['get_5fmax_5ffcn_5fevals_301',['get_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#a0670a9e7d0f8dc633526b1b97d7734c9',1,'nonlin_core::equation_solver::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#a6ea37e230a439181905b883a3030709e',1,'nonlin_core::equation_solver_1var::get_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#ace21c015ea34abffb4422ca1f5a7cf3b',1,'nonlin_core::equation_optimizer::get_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#a8ed8cc37963a35f6566e8ba71d89fcbf',1,'nonlin_linesearch::line_search::get_max_fcn_evals()']]],
+  ['get_5fpoly_5fcoefficient_302',['get_poly_coefficient',['../namespacenonlin__polynomials.html#af61d25330d66ba51fb7948fd6711ba1d',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5fcoefficients_303',['get_poly_coefficients',['../namespacenonlin__polynomials.html#a9b5c03459cc352c480ba3edfb3d05af3',1,'nonlin_polynomials']]],
+  ['get_5fpoly_5forder_304',['get_poly_order',['../namespacenonlin__polynomials.html#a295cc8c0c018a44acbdec56b8b3360c6',1,'nonlin_polynomials']]],
+  ['get_5fprint_5fstatus_305',['get_print_status',['../structnonlin__core_1_1equation__solver.html#a7311f7f8d873f01df406eb3efddb2a47',1,'nonlin_core::equation_solver::get_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#aab7f802f44c5638cdb6d888bebdf4bda',1,'nonlin_core::equation_solver_1var::get_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#a63fdb11e6eb358cace29507f7e112485',1,'nonlin_core::equation_optimizer::get_print_status()']]],
+  ['get_5fscaling_5ffactor_306',['get_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a632aa6eb3e7e9d118e54f1466d8c270b',1,'nonlin_linesearch::line_search']]],
+  ['get_5fsimplex_307',['get_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af262957b196243601501c8540ed6edf2',1,'nonlin_optimize::nelder_mead']]],
+  ['get_5fstep_5fscaling_5ffactor_308',['get_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#aaf8aa1b3f013798ceac97995ab1ac93e',1,'nonlin_least_squares::least_squares_solver']]],
+  ['get_5ftolerance_309',['get_tolerance',['../structnonlin__core_1_1equation__optimizer.html#abf732e2442a2671c22a277cb433195d1',1,'nonlin_core::equation_optimizer']]],
+  ['get_5fuse_5fline_5fsearch_310',['get_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a58cb7ed2dc28b5d8873375c150dea082',1,'nonlin_optimize::line_search_optimizer::get_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#a2cbc2bf7d5506d2b154bd88989a1f997',1,'nonlin_solve::line_search_solver::get_use_line_search()']]],
+  ['get_5fvar_5ftolerance_311',['get_var_tolerance',['../structnonlin__core_1_1equation__solver.html#ab1a0a9fe3ee8186dcf71448ee5d85b05',1,'nonlin_core::equation_solver::get_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aea34033d4aac455d3a594b121e02bc89',1,'nonlin_core::equation_solver_1var::get_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a5b431c601db2386d2e0b705978ef8de0',1,'nonlin_optimize::line_search_optimizer::get_var_tolerance()']]],
+  ['get_5fvariable_5fcount_312',['get_variable_count',['../structnonlin__core_1_1vecfcn__helper.html#ab9531f2873b46cdbfd446a911cc285fc',1,'nonlin_core::vecfcn_helper::get_variable_count()'],['../structnonlin__core_1_1fcnnvar__helper.html#ade676773e3157767d65f64f21f8aa090',1,'nonlin_core::fcnnvar_helper::get_variable_count()']]],
+  ['gradient_313',['gradient',['../structnonlin__core_1_1fcnnvar__helper.html#a94732556188c1ac5a2cfc6d6e9e06cf2',1,'nonlin_core::fcnnvar_helper']]]
 ];
diff --git a/doc/html/search/functions_5.js b/doc/html/search/functions_5.js
index ab8696c..f7ae910 100644
--- a/doc/html/search/functions_5.js
+++ b/doc/html/search/functions_5.js
@@ -1,11 +1,11 @@
 var searchData=
 [
-  ['init_5fpoly_243',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
-  ['init_5fpoly_5fcoeffs_244',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
-  ['initialize_245',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
-  ['is_5fderivative_5fdefined_246',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
-  ['is_5ffcn_5fdefined_247',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
-  ['is_5fgradient_5fdefined_248',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
-  ['is_5fjacobian_5fdefined_249',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
-  ['is_5fline_5fsearch_5fdefined_250',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]]
+  ['init_5fpoly_314',['init_poly',['../namespacenonlin__polynomials.html#a051f7aaa5a37feaf707cf0e7145c83ee',1,'nonlin_polynomials']]],
+  ['init_5fpoly_5fcoeffs_315',['init_poly_coeffs',['../namespacenonlin__polynomials.html#a3f23c7cc868232d6ebbe6b56df2762bf',1,'nonlin_polynomials']]],
+  ['initialize_316',['initialize',['../structnonlin__polynomials_1_1polynomial.html#afd12e7adde59dc929d5e4fa2b3ee15e3',1,'nonlin_polynomials::polynomial']]],
+  ['is_5fderivative_5fdefined_317',['is_derivative_defined',['../structnonlin__core_1_1fcn1var__helper.html#ad27fa3d960ce7d5310a2be2d9b7f8d7c',1,'nonlin_core::fcn1var_helper']]],
+  ['is_5ffcn_5fdefined_318',['is_fcn_defined',['../structnonlin__core_1_1vecfcn__helper.html#ae5a78dc12bfaca9c6ee6a129611f6fae',1,'nonlin_core::vecfcn_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcn1var__helper.html#a6c02a892c66ac75a6dba7a0fd5d641ce',1,'nonlin_core::fcn1var_helper::is_fcn_defined()'],['../structnonlin__core_1_1fcnnvar__helper.html#a7b8deec62bcf7707e33e2d6d065e6bbe',1,'nonlin_core::fcnnvar_helper::is_fcn_defined()']]],
+  ['is_5fgradient_5fdefined_319',['is_gradient_defined',['../structnonlin__core_1_1fcnnvar__helper.html#a8b884a36ba2b9c15c9b325fb08d7597f',1,'nonlin_core::fcnnvar_helper']]],
+  ['is_5fjacobian_5fdefined_320',['is_jacobian_defined',['../structnonlin__core_1_1vecfcn__helper.html#a95d28720ced834b78276792bc388ae3b',1,'nonlin_core::vecfcn_helper']]],
+  ['is_5fline_5fsearch_5fdefined_321',['is_line_search_defined',['../structnonlin__optimize_1_1line__search__optimizer.html#ad3bdce0e57ac51e0269fd1bbbde560ba',1,'nonlin_optimize::line_search_optimizer::is_line_search_defined()'],['../structnonlin__solve_1_1line__search__solver.html#ac68b3490e95269ad587bbdc19f64e682',1,'nonlin_solve::line_search_solver::is_line_search_defined()']]]
 ];
diff --git a/doc/html/search/functions_6.js b/doc/html/search/functions_6.js
index 059ddf2..a89334a 100644
--- a/doc/html/search/functions_6.js
+++ b/doc/html/search/functions_6.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['jacobian_251',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]]
+  ['jacobian_322',['jacobian',['../structnonlin__core_1_1vecfcn__helper.html#abb314c2501d0e7a1c973999c204abf8a',1,'nonlin_core::vecfcn_helper']]]
 ];
diff --git a/doc/html/search/functions_7.js b/doc/html/search/functions_7.js
index edebc53..10e3360 100644
--- a/doc/html/search/functions_7.js
+++ b/doc/html/search/functions_7.js
@@ -1,18 +1,18 @@
 var searchData=
 [
-  ['limit_5fsearch_5fvector_252',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
-  ['lmfactor_253',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
-  ['lmpar_254',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
-  ['lmsolve_255',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
-  ['ls_5fget_5fdist_256',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fmax_5feval_257',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
-  ['ls_5fget_5fscale_258',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmimo_259',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
-  ['ls_5fsearch_5fmiso_260',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fdist_261',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fmax_5feval_262',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
-  ['ls_5fset_5fscale_263',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
-  ['lss_5fget_5ffactor_264',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
-  ['lss_5fset_5ffactor_265',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
-  ['lss_5fsolve_266',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
+  ['limit_5fsearch_5fvector_323',['limit_search_vector',['../namespacenonlin__linesearch.html#a2562dd3acca3f7f7bc2d22b7490d7b1a',1,'nonlin_linesearch']]],
+  ['lmfactor_324',['lmfactor',['../namespacenonlin__least__squares.html#ad4e4f6036867660fa6ad45ee6000fd47',1,'nonlin_least_squares']]],
+  ['lmpar_325',['lmpar',['../namespacenonlin__least__squares.html#aff0b0333d5da3f2c6f9418faf9bed743',1,'nonlin_least_squares']]],
+  ['lmsolve_326',['lmsolve',['../namespacenonlin__least__squares.html#aa04692a475a2845cd5f05e8798696483',1,'nonlin_least_squares']]],
+  ['ls_5fget_5fdist_327',['ls_get_dist',['../namespacenonlin__linesearch.html#a7e3e4ce001803923645008325088301d',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fmax_5feval_328',['ls_get_max_eval',['../namespacenonlin__linesearch.html#aff56057432ad08c5ce39638da945dcfa',1,'nonlin_linesearch']]],
+  ['ls_5fget_5fscale_329',['ls_get_scale',['../namespacenonlin__linesearch.html#a767b8926182d3ee4553e2731b32b16a2',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmimo_330',['ls_search_mimo',['../namespacenonlin__linesearch.html#a3328346c6c79d704ce268575df190dc6',1,'nonlin_linesearch']]],
+  ['ls_5fsearch_5fmiso_331',['ls_search_miso',['../namespacenonlin__linesearch.html#afcde68c8af7940be93c7f2d13d2dabd4',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fdist_332',['ls_set_dist',['../namespacenonlin__linesearch.html#afb6753743afaf8e5a38a765f06476c24',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fmax_5feval_333',['ls_set_max_eval',['../namespacenonlin__linesearch.html#aeb9ded3f31ec2baad455218fa6b5e4fd',1,'nonlin_linesearch']]],
+  ['ls_5fset_5fscale_334',['ls_set_scale',['../namespacenonlin__linesearch.html#afbc0daef332c32c1c93e08d5c8357a3b',1,'nonlin_linesearch']]],
+  ['lss_5fget_5ffactor_335',['lss_get_factor',['../namespacenonlin__least__squares.html#a1e0b514919f21f9226c5ed69eee4018b',1,'nonlin_least_squares']]],
+  ['lss_5fset_5ffactor_336',['lss_set_factor',['../namespacenonlin__least__squares.html#af93ae0c6697ce082b10c9577c17d35f2',1,'nonlin_least_squares']]],
+  ['lss_5fsolve_337',['lss_solve',['../namespacenonlin__least__squares.html#a974515039f6a26d25f774604eeaef992',1,'nonlin_least_squares']]]
 ];
diff --git a/doc/html/search/functions_8.js b/doc/html/search/functions_8.js
index bab07c1..b309deb 100644
--- a/doc/html/search/functions_8.js
+++ b/doc/html/search/functions_8.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['min_5fbacktrack_5fsearch_267',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
+  ['min_5fbacktrack_5fsearch_338',['min_backtrack_search',['../namespacenonlin__linesearch.html#aed7cac361c60774ac2c49a51a99741d0',1,'nonlin_linesearch']]]
 ];
diff --git a/doc/html/search/functions_9.js b/doc/html/search/functions_9.js
index e883c9a..773dd0e 100644
--- a/doc/html/search/functions_9.js
+++ b/doc/html/search/functions_9.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['order_268',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
+  ['order_339',['order',['../structnonlin__polynomials_1_1polynomial.html#aa08e7f997021e5fb2c5f51b70809e19a',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_a.js b/doc/html/search/functions_a.js
index 32d3f27..107e5da 100644
--- a/doc/html/search/functions_a.js
+++ b/doc/html/search/functions_a.js
@@ -1,17 +1,17 @@
 var searchData=
 [
-  ['poly_5fcompanion_5fmtx_269',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
-  ['poly_5fdbl_5fequals_270',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
-  ['poly_5fdbl_5fmult_271',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
-  ['poly_5fequals_272',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
-  ['poly_5fequals_5farray_273',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
-  ['poly_5feval_5fcomplex_274',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
-  ['poly_5feval_5fdouble_275',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
-  ['poly_5ffit_276',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
-  ['poly_5ffit_5fthru_5fzero_277',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
-  ['poly_5fpoly_5fadd_278',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
-  ['poly_5fpoly_5fmult_279',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
-  ['poly_5fpoly_5fsubtract_280',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
-  ['poly_5froots_281',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
-  ['print_5fstatus_282',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
+  ['poly_5fcompanion_5fmtx_340',['poly_companion_mtx',['../namespacenonlin__polynomials.html#a73e15b4ed645b9f672085fdf0c35256a',1,'nonlin_polynomials']]],
+  ['poly_5fdbl_5fequals_341',['poly_dbl_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aece2a1a5690e79ae3868f5f2461028a7',1,'nonlin_polynomials::assignment(=)::poly_dbl_equals()'],['../namespacenonlin__polynomials.html#a966529b4b45ad23dae7fe3b7e842ca08',1,'nonlin_polynomials::poly_dbl_equals()']]],
+  ['poly_5fdbl_5fmult_342',['poly_dbl_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a93e4ce5fb2c616a1c6477f6fb8addfac',1,'nonlin_polynomials::operator(*)::poly_dbl_mult()'],['../namespacenonlin__polynomials.html#a96288e9730f24e65c61d3ac0970000b2',1,'nonlin_polynomials::poly_dbl_mult()']]],
+  ['poly_5fequals_343',['poly_equals',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#aa933c5db5d91ce002ac7bc22af9a10e7',1,'nonlin_polynomials::assignment(=)::poly_equals()'],['../namespacenonlin__polynomials.html#a13912dc946f15c21fb662e2a6c228e82',1,'nonlin_polynomials::poly_equals()']]],
+  ['poly_5fequals_5farray_344',['poly_equals_array',['../interfacenonlin__polynomials_1_1assignment_07_0a_08.html#ac530b91d73ec6ea8bf1da5bd86a330d0',1,'nonlin_polynomials::assignment(=)::poly_equals_array()'],['../namespacenonlin__polynomials.html#ad08d067c81615b63371e7aa5af22c949',1,'nonlin_polynomials::poly_equals_array()']]],
+  ['poly_5feval_5fcomplex_345',['poly_eval_complex',['../namespacenonlin__polynomials.html#a761c510e90d7c7b0251ae59345286b51',1,'nonlin_polynomials']]],
+  ['poly_5feval_5fdouble_346',['poly_eval_double',['../namespacenonlin__polynomials.html#aff1ff0ef739be563fd2545d2382ea383',1,'nonlin_polynomials']]],
+  ['poly_5ffit_347',['poly_fit',['../namespacenonlin__polynomials.html#a458465372d14caa9e238d82f5ac35735',1,'nonlin_polynomials']]],
+  ['poly_5ffit_5fthru_5fzero_348',['poly_fit_thru_zero',['../namespacenonlin__polynomials.html#a6ff33f225fe0f9c25524b0e6c7ced766',1,'nonlin_polynomials']]],
+  ['poly_5fpoly_5fadd_349',['poly_poly_add',['../interfacenonlin__polynomials_1_1operator_07_09_08.html#aea07755e91685ec15a37482a3642bbbe',1,'nonlin_polynomials::operator(+)::poly_poly_add()'],['../namespacenonlin__polynomials.html#ae59f978dca8ab539ab458210e4a3fda2',1,'nonlin_polynomials::poly_poly_add()']]],
+  ['poly_5fpoly_5fmult_350',['poly_poly_mult',['../interfacenonlin__polynomials_1_1operator_07_5_08.html#a7ae53843289e39b9c63cf368f2ed7389',1,'nonlin_polynomials::operator(*)::poly_poly_mult()'],['../namespacenonlin__polynomials.html#a4d5545f5e93658bc08e011ac13f4ad60',1,'nonlin_polynomials::poly_poly_mult()']]],
+  ['poly_5fpoly_5fsubtract_351',['poly_poly_subtract',['../interfacenonlin__polynomials_1_1operator_07-_08.html#a6099c1ec4563719acc5fba0f94e35de3',1,'nonlin_polynomials::operator(-)::poly_poly_subtract()'],['../namespacenonlin__polynomials.html#aa7025bd3c2e6572fa6d5e1226c3b23cf',1,'nonlin_polynomials::poly_poly_subtract()']]],
+  ['poly_5froots_352',['poly_roots',['../namespacenonlin__polynomials.html#add5d2b923b389d1b9b829255031a3343',1,'nonlin_polynomials']]],
+  ['print_5fstatus_353',['print_status',['../namespacenonlin__core.html#ac9637db13c24f15661e80eb42b225ea7',1,'nonlin_core']]]
 ];
diff --git a/doc/html/search/functions_b.js b/doc/html/search/functions_b.js
index ab0463c..02d6604 100644
--- a/doc/html/search/functions_b.js
+++ b/doc/html/search/functions_b.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['roots_283',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
+  ['roots_354',['roots',['../structnonlin__polynomials_1_1polynomial.html#aabefa8eebaed14d790c39cd45c8b7b26',1,'nonlin_polynomials::polynomial']]]
 ];
diff --git a/doc/html/search/functions_c.js b/doc/html/search/functions_c.js
index c96cb54..72649d0 100644
--- a/doc/html/search/functions_c.js
+++ b/doc/html/search/functions_c.js
@@ -1,26 +1,26 @@
 var searchData=
 [
-  ['search_284',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
-  ['set_285',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
-  ['set_5fdefault_5fline_5fsearch_286',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
-  ['set_5fdiff_5ftolerance_287',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
-  ['set_5fdistance_5ffactor_288',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
-  ['set_5ffcn_289',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
-  ['set_5ffcn_5ftolerance_290',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
-  ['set_5fgradient_5ffcn_291',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
-  ['set_5fgradient_5ftolerance_292',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
-  ['set_5finitial_5fsize_293',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fjacobian_294',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
-  ['set_5fjacobian_5finterval_295',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
-  ['set_5fline_5fsearch_296',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
-  ['set_5fmax_5ffcn_5fevals_297',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
-  ['set_5fpoly_5fcoefficient_298',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
-  ['set_5fprint_5fstatus_299',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
-  ['set_5fscaling_5ffactor_300',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
-  ['set_5fsimplex_301',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
-  ['set_5fstep_5fscaling_5ffactor_302',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
-  ['set_5ftolerance_303',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
-  ['set_5fuse_5fline_5fsearch_304',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
-  ['set_5fvar_5ftolerance_305',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
-  ['solve_306',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
+  ['search_355',['search',['../structnonlin__linesearch_1_1line__search.html#a5d09b7ed837c6d9ea64c5f269e97ca79',1,'nonlin_linesearch::line_search']]],
+  ['set_356',['set',['../structnonlin__polynomials_1_1polynomial.html#ab589ca8bc5c99a0b18f8df3a877790fd',1,'nonlin_polynomials::polynomial']]],
+  ['set_5fdefault_5fline_5fsearch_357',['set_default_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a711e12f53c96c51cb2499b1221a380e9',1,'nonlin_optimize::line_search_optimizer::set_default_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae6bbc85235541c0424654666fed4e484',1,'nonlin_solve::line_search_solver::set_default_line_search()']]],
+  ['set_5fdiff_5ftolerance_358',['set_diff_tolerance',['../structnonlin__core_1_1equation__solver__1var.html#a238e8bb1bd7c5b1f5c4b513b11ac4b20',1,'nonlin_core::equation_solver_1var']]],
+  ['set_5fdistance_5ffactor_359',['set_distance_factor',['../structnonlin__linesearch_1_1line__search.html#ab41aa25158cae9d05e11b6530d510972',1,'nonlin_linesearch::line_search']]],
+  ['set_5ffcn_360',['set_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a41b867ae18398e8c7de44c6dc5b32aed',1,'nonlin_core::vecfcn_helper::set_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#ae8e92bea80019e27bdea08ed600e6271',1,'nonlin_core::fcn1var_helper::set_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#acc9a43e847b8114d2004ba0873858924',1,'nonlin_core::fcnnvar_helper::set_fcn()']]],
+  ['set_5ffcn_5ftolerance_361',['set_fcn_tolerance',['../structnonlin__core_1_1equation__solver.html#ade98091a104abab7cec9d0d252aa8e50',1,'nonlin_core::equation_solver::set_fcn_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#a050cd49292b4f19821b41257d2d417a2',1,'nonlin_core::equation_solver_1var::set_fcn_tolerance()']]],
+  ['set_5fgradient_5ffcn_362',['set_gradient_fcn',['../structnonlin__core_1_1fcnnvar__helper.html#ac3eea5d29dd8aa70e76173fc0f30e022',1,'nonlin_core::fcnnvar_helper']]],
+  ['set_5fgradient_5ftolerance_363',['set_gradient_tolerance',['../structnonlin__core_1_1equation__solver.html#a1d8b29f2386cfa3f9be06056fd4e2797',1,'nonlin_core::equation_solver']]],
+  ['set_5finitial_5fsize_364',['set_initial_size',['../structnonlin__optimize_1_1nelder__mead.html#a7a7e271e79bbf0249dc2a64fd2f46a46',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fjacobian_365',['set_jacobian',['../structnonlin__core_1_1vecfcn__helper.html#a28ad419ee7fd8d7f0529587d4a1bfc78',1,'nonlin_core::vecfcn_helper']]],
+  ['set_5fjacobian_5finterval_366',['set_jacobian_interval',['../structnonlin__solve_1_1quasi__newton__solver.html#afd5db9ab1b89be832013b26ebf53abe7',1,'nonlin_solve::quasi_newton_solver']]],
+  ['set_5fline_5fsearch_367',['set_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#a4683a073414a8f578d96c75cdd9642ff',1,'nonlin_optimize::line_search_optimizer::set_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#ae4a930fc7a45357874c3914b29aed2e6',1,'nonlin_solve::line_search_solver::set_line_search()']]],
+  ['set_5fmax_5ffcn_5fevals_368',['set_max_fcn_evals',['../structnonlin__core_1_1equation__solver.html#af3836cf0b0f8c668770e91d0d8797599',1,'nonlin_core::equation_solver::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__solver__1var.html#ace2de97eb055f2cdf54303946d8f8240',1,'nonlin_core::equation_solver_1var::set_max_fcn_evals()'],['../structnonlin__core_1_1equation__optimizer.html#a6c551cb42fa08ea1921169676d22591c',1,'nonlin_core::equation_optimizer::set_max_fcn_evals()'],['../structnonlin__linesearch_1_1line__search.html#aa30f4330edb508703b5639c890b3abe8',1,'nonlin_linesearch::line_search::set_max_fcn_evals()']]],
+  ['set_5fpoly_5fcoefficient_369',['set_poly_coefficient',['../namespacenonlin__polynomials.html#acda7d27069a05f6a62823265f557f8e0',1,'nonlin_polynomials']]],
+  ['set_5fprint_5fstatus_370',['set_print_status',['../structnonlin__core_1_1equation__solver.html#a63276d7b2f2232649dab2db1c65b3cd5',1,'nonlin_core::equation_solver::set_print_status()'],['../structnonlin__core_1_1equation__solver__1var.html#a3fd3ba8518ef537ea6f93f7a1e3e13f0',1,'nonlin_core::equation_solver_1var::set_print_status()'],['../structnonlin__core_1_1equation__optimizer.html#acbad8ebeefbd80e0e1d0d4d4701f7ae5',1,'nonlin_core::equation_optimizer::set_print_status()']]],
+  ['set_5fscaling_5ffactor_371',['set_scaling_factor',['../structnonlin__linesearch_1_1line__search.html#a1251dbb9de7d94bd7462f886b14e5fd8',1,'nonlin_linesearch::line_search']]],
+  ['set_5fsimplex_372',['set_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af135618858e807fc51ebd6063ac9c736',1,'nonlin_optimize::nelder_mead']]],
+  ['set_5fstep_5fscaling_5ffactor_373',['set_step_scaling_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a8209ff0851b086b318d08f6b42db43ac',1,'nonlin_least_squares::least_squares_solver']]],
+  ['set_5ftolerance_374',['set_tolerance',['../structnonlin__core_1_1equation__optimizer.html#a7b2c2a096683a7758a487194a8d35868',1,'nonlin_core::equation_optimizer']]],
+  ['set_5fuse_5fline_5fsearch_375',['set_use_line_search',['../structnonlin__optimize_1_1line__search__optimizer.html#adab21b3e10e1805a38834b8797dca440',1,'nonlin_optimize::line_search_optimizer::set_use_line_search()'],['../structnonlin__solve_1_1line__search__solver.html#aa763803528ad45d4ef3c8fd5f10b0285',1,'nonlin_solve::line_search_solver::set_use_line_search()']]],
+  ['set_5fvar_5ftolerance_376',['set_var_tolerance',['../structnonlin__core_1_1equation__solver.html#aa9ed008b99b75224094322d79eddf69d',1,'nonlin_core::equation_solver::set_var_tolerance()'],['../structnonlin__core_1_1equation__solver__1var.html#aedf6fe06fbfe663afd49994f9c660a95',1,'nonlin_core::equation_solver_1var::set_var_tolerance()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a12494ed3557543770f272cead196bb45',1,'nonlin_optimize::line_search_optimizer::set_var_tolerance()']]],
+  ['solve_377',['solve',['../structnonlin__core_1_1equation__solver.html#ae93cd9cca4d3181aa699261553a62391',1,'nonlin_core::equation_solver::solve()'],['../structnonlin__core_1_1equation__solver__1var.html#a683e1bf6bd5ef7fd05c338dad1dc96c9',1,'nonlin_core::equation_solver_1var::solve()'],['../structnonlin__core_1_1equation__optimizer.html#a09e6312fb045d465a9baffd534500917',1,'nonlin_core::equation_optimizer::solve()'],['../structnonlin__least__squares_1_1least__squares__solver.html#a7cb0b150cfa2398e360eae2ca82ce6f5',1,'nonlin_least_squares::least_squares_solver::solve()'],['../structnonlin__optimize_1_1nelder__mead.html#a1cc60f4f3daecc2f314fd02ab05854c6',1,'nonlin_optimize::nelder_mead::solve()'],['../structnonlin__optimize_1_1bfgs.html#ac3715dd630462bd1bcca31c5b3f04385',1,'nonlin_optimize::bfgs::solve()'],['../structnonlin__solve_1_1quasi__newton__solver.html#ae0ff1edb9fde695a5cd131d81206f5cf',1,'nonlin_solve::quasi_newton_solver::solve()'],['../structnonlin__solve_1_1newton__solver.html#ac4d7e04ecc17efa5a899d1b4d526ae66',1,'nonlin_solve::newton_solver::solve()'],['../structnonlin__solve_1_1brent__solver.html#ae0b53fae4650d837a5c151f0f8f55277',1,'nonlin_solve::brent_solver::solve()'],['../structnonlin__solve_1_1newton__1var__solver.html#ae9b8ff1827b430a3cecc45a7fc539d95',1,'nonlin_solve::newton_1var_solver::solve()']]]
 ];
diff --git a/doc/html/search/functions_d.js b/doc/html/search/functions_d.js
index 8d45837..f485c62 100644
--- a/doc/html/search/functions_d.js
+++ b/doc/html/search/functions_d.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['test_5fconvergence_307',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
+  ['test_5fconvergence_378',['test_convergence',['../namespacenonlin__solve.html#a7f189a8566c3ad7dcdecebe7d3f17456',1,'nonlin_solve']]]
 ];
diff --git a/doc/html/search/namespaces_0.js b/doc/html/search/namespaces_0.js
index 9cb3a6b..0734421 100644
--- a/doc/html/search/namespaces_0.js
+++ b/doc/html/search/namespaces_0.js
@@ -1,11 +1,11 @@
 var searchData=
 [
-  ['nonlin_5fc_5fapi_204',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
-  ['nonlin_5fconstants_205',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
-  ['nonlin_5fcore_206',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
-  ['nonlin_5fleast_5fsquares_207',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
-  ['nonlin_5flinesearch_208',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
-  ['nonlin_5foptimize_209',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
-  ['nonlin_5fpolynomials_210',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
-  ['nonlin_5fsolve_211',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]]
+  ['nonlin_5fc_5fapi_257',['nonlin_c_api',['../namespacenonlin__c__api.html',1,'']]],
+  ['nonlin_5fconstants_258',['nonlin_constants',['../namespacenonlin__constants.html',1,'']]],
+  ['nonlin_5fcore_259',['nonlin_core',['../namespacenonlin__core.html',1,'']]],
+  ['nonlin_5fleast_5fsquares_260',['nonlin_least_squares',['../namespacenonlin__least__squares.html',1,'']]],
+  ['nonlin_5flinesearch_261',['nonlin_linesearch',['../namespacenonlin__linesearch.html',1,'']]],
+  ['nonlin_5foptimize_262',['nonlin_optimize',['../namespacenonlin__optimize.html',1,'']]],
+  ['nonlin_5fpolynomials_263',['nonlin_polynomials',['../namespacenonlin__polynomials.html',1,'']]],
+  ['nonlin_5fsolve_264',['nonlin_solve',['../namespacenonlin__solve.html',1,'']]]
 ];
diff --git a/doc/html/search/searchdata.js b/doc/html/search/searchdata.js
index b4c0222..452de68 100644
--- a/doc/html/search/searchdata.js
+++ b/doc/html/search/searchdata.js
@@ -1,10 +1,10 @@
 var indexSectionsWithContent =
 {
   0: "abcdefgijlmnopqrstvx",
-  1: "abefgijlnopqv",
+  1: "abcefgijlnopqv",
   2: "n",
   3: "cdefgijlmoprst",
-  4: "cfgijmnx"
+  4: "acefgijmnpsx"
 };
 
 var indexSectionNames =
diff --git a/doc/html/search/variables_0.js b/doc/html/search/variables_0.js
index e299af2..84db125 100644
--- a/doc/html/search/variables_0.js
+++ b/doc/html/search/variables_0.js
@@ -1,6 +1,4 @@
 var searchData=
 [
-  ['converge_5fon_5fchng_308',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5ffcn_309',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
-  ['converge_5fon_5fzero_5fdiff_310',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
+  ['alpha_379',['alpha',['../structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de',1,'nonlin_c_api::line_search_controls::alpha()'],['../structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed',1,'line_search_controls::alpha()']]]
 ];
diff --git a/doc/html/search/variables_1.js b/doc/html/search/variables_1.js
index b7114ba..8586d52 100644
--- a/doc/html/search/variables_1.js
+++ b/doc/html/search/variables_1.js
@@ -1,4 +1,9 @@
 var searchData=
 [
-  ['fcn_5fcount_311',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]]
+  ['converge_5fon_5fchng_380',['converge_on_chng',['../structnonlin__core_1_1iteration__behavior.html#a59717056c1bfebca82b41c613082abec',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffcn_381',['converge_on_fcn',['../structnonlin__core_1_1iteration__behavior.html#a757c280d32ca19e94aae1e712967baf8',1,'nonlin_core::iteration_behavior']]],
+  ['converge_5fon_5ffunction_382',['converge_on_function',['../structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9',1,'nonlin_c_api::iteration_process::converge_on_function()'],['../structiteration__process.html#a00a463e2db7a0fbab8764083936d926c',1,'iteration_process::converge_on_function()']]],
+  ['converge_5fon_5fgradient_383',['converge_on_gradient',['../structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18',1,'nonlin_c_api::iteration_process::converge_on_gradient()'],['../structiteration__process.html#a309e95e4da19427633b6d0c1affab090',1,'iteration_process::converge_on_gradient()']]],
+  ['converge_5fon_5fsolution_5fchange_384',['converge_on_solution_change',['../structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56',1,'nonlin_c_api::iteration_process::converge_on_solution_change()'],['../structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c',1,'iteration_process::converge_on_solution_change()']]],
+  ['converge_5fon_5fzero_5fdiff_385',['converge_on_zero_diff',['../structnonlin__core_1_1iteration__behavior.html#afd0d9d5f04d17bc9e3be467ebd93a1b1',1,'nonlin_core::iteration_behavior']]]
 ];
diff --git a/doc/html/search/variables_2.js b/doc/html/search/variables_2.js
index 4e48273..bf7e4e4 100644
--- a/doc/html/search/variables_2.js
+++ b/doc/html/search/variables_2.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['gradient_5fcount_312',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]]
+  ['enable_386',['enable',['../structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b',1,'nonlin_c_api::line_search_controls::enable()'],['../structline__search__controls.html#a011d44e850183280119f0aa06af6d83a',1,'line_search_controls::enable()']]]
 ];
diff --git a/doc/html/search/variables_3.js b/doc/html/search/variables_3.js
index bdc29e3..58f1b38 100644
--- a/doc/html/search/variables_3.js
+++ b/doc/html/search/variables_3.js
@@ -1,4 +1,7 @@
 var searchData=
 [
-  ['iter_5fcount_313',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]]
+  ['factor_387',['factor',['../structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1',1,'nonlin_c_api::line_search_controls::factor()'],['../structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c',1,'line_search_controls::factor()']]],
+  ['fcn_5fcount_388',['fcn_count',['../structnonlin__core_1_1iteration__behavior.html#af8a65c14d897e69ac33b0842af5d0ca4',1,'nonlin_core::iteration_behavior']]],
+  ['function_5feval_5fcount_389',['function_eval_count',['../structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92',1,'nonlin_c_api::iteration_process::function_eval_count()'],['../structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a',1,'iteration_process::function_eval_count()']]],
+  ['function_5ftolerance_390',['function_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d',1,'nonlin_c_api::iteration_controls::function_tolerance()'],['../structiteration__controls.html#a6b4646344cda46ab0752819a1a930028',1,'iteration_controls::function_tolerance()']]]
 ];
diff --git a/doc/html/search/variables_4.js b/doc/html/search/variables_4.js
index c83a0ab..75c400a 100644
--- a/doc/html/search/variables_4.js
+++ b/doc/html/search/variables_4.js
@@ -1,4 +1,6 @@
 var searchData=
 [
-  ['jacobian_5fcount_314',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]]
+  ['gradient_5fcount_391',['gradient_count',['../structnonlin__core_1_1iteration__behavior.html#aac568ba1c2a03d5b59faf7765f686105',1,'nonlin_core::iteration_behavior']]],
+  ['gradient_5feval_5fcount_392',['gradient_eval_count',['../structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187',1,'nonlin_c_api::iteration_process::gradient_eval_count()'],['../structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb',1,'iteration_process::gradient_eval_count()']]],
+  ['gradient_5ftolerance_393',['gradient_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e',1,'nonlin_c_api::iteration_controls::gradient_tolerance()'],['../structiteration__controls.html#a31353fc9c86aa23157c30b1073893745',1,'iteration_controls::gradient_tolerance()']]]
 ];
diff --git a/doc/html/search/variables_5.js b/doc/html/search/variables_5.js
index 859a5e0..7dc1874 100644
--- a/doc/html/search/variables_5.js
+++ b/doc/html/search/variables_5.js
@@ -1,24 +1,5 @@
 var searchData=
 [
-  ['m_5falpha_315',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
-  ['m_5fcoeffs_316',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
-  ['m_5fdiff_317',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
-  ['m_5fdifftol_318',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
-  ['m_5ffactor_319',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
-  ['m_5ffcn_320',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
-  ['m_5ffcntol_321',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
-  ['m_5fgrad_322',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
-  ['m_5fgtol_323',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
-  ['m_5finitsize_324',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5fjac_325',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fjdelta_326',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
-  ['m_5flinesearch_327',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
-  ['m_5fmaxeval_328',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
-  ['m_5fnfcn_329',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
-  ['m_5fnvar_330',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
-  ['m_5fprintstatus_331',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
-  ['m_5fsimplex_332',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
-  ['m_5ftol_333',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
-  ['m_5fuselinesearch_334',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
-  ['m_5fxtol_335',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]]
+  ['iter_5fcount_394',['iter_count',['../structnonlin__core_1_1iteration__behavior.html#a17f34afe0453e0efe5284f51d5db1b52',1,'nonlin_core::iteration_behavior']]],
+  ['iteration_5fcount_395',['iteration_count',['../structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732',1,'nonlin_c_api::iteration_process::iteration_count()'],['../structiteration__process.html#a13c1427518d62138fdfac155510347fd',1,'iteration_process::iteration_count()']]]
 ];
diff --git a/doc/html/search/variables_6.js b/doc/html/search/variables_6.js
index 79f72a6..ac1f89d 100644
--- a/doc/html/search/variables_6.js
+++ b/doc/html/search/variables_6.js
@@ -1,11 +1,5 @@
 var searchData=
 [
-  ['nl_5farray_5fsize_5ferror_336',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
-  ['nl_5fconvergence_5ferror_337',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
-  ['nl_5fdivergent_5fbehavior_5ferror_338',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
-  ['nl_5finvalid_5finput_5ferror_339',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
-  ['nl_5finvalid_5foperation_5ferror_340',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
-  ['nl_5fout_5fof_5fmemory_5ferror_341',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
-  ['nl_5fspurious_5fconvergence_5ferror_342',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
-  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_343',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]]
+  ['jacobian_5fcount_396',['jacobian_count',['../structnonlin__core_1_1iteration__behavior.html#af90b6cb7ec48985314430c5a12c15dc2',1,'nonlin_core::iteration_behavior']]],
+  ['jacobian_5feval_5fcount_397',['jacobian_eval_count',['../structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf',1,'nonlin_c_api::iteration_process::jacobian_eval_count()'],['../structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55',1,'iteration_process::jacobian_eval_count()']]]
 ];
diff --git a/doc/html/search/variables_7.js b/doc/html/search/variables_7.js
index 3ee0049..158f666 100644
--- a/doc/html/search/variables_7.js
+++ b/doc/html/search/variables_7.js
@@ -1,5 +1,25 @@
 var searchData=
 [
-  ['x1_344',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair']]],
-  ['x2_345',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair']]]
+  ['m_5falpha_398',['m_alpha',['../structnonlin__linesearch_1_1line__search.html#a100660d9d0f37b045266a270de161487',1,'nonlin_linesearch::line_search']]],
+  ['m_5fcoeffs_399',['m_coeffs',['../structnonlin__polynomials_1_1polynomial.html#ae4d6fded19102bcf858d0d897dc74c27',1,'nonlin_polynomials::polynomial']]],
+  ['m_5fdiff_400',['m_diff',['../structnonlin__core_1_1fcn1var__helper.html#a3ac77259ff44c2c92cdd1f80b5b4421d',1,'nonlin_core::fcn1var_helper']]],
+  ['m_5fdifftol_401',['m_difftol',['../structnonlin__core_1_1equation__solver__1var.html#a4c54e1a0eb30fb732ae48b68f45b98f4',1,'nonlin_core::equation_solver_1var']]],
+  ['m_5ffactor_402',['m_factor',['../structnonlin__least__squares_1_1least__squares__solver.html#a5808c315224ce879db756f284e9de26d',1,'nonlin_least_squares::least_squares_solver::m_factor()'],['../structnonlin__linesearch_1_1line__search.html#a1be1d8a24a1379fe9579ab0fe955b957',1,'nonlin_linesearch::line_search::m_factor()']]],
+  ['m_5ffcn_403',['m_fcn',['../structnonlin__core_1_1vecfcn__helper.html#a1ad69c2d6a5b32c041c93eb9cc542109',1,'nonlin_core::vecfcn_helper::m_fcn()'],['../structnonlin__core_1_1fcn1var__helper.html#a77004284243a6f28ce78d908864e8da7',1,'nonlin_core::fcn1var_helper::m_fcn()'],['../structnonlin__core_1_1fcnnvar__helper.html#a08e6e6f24db4d2f971aae68cfa7fc031',1,'nonlin_core::fcnnvar_helper::m_fcn()']]],
+  ['m_5ffcntol_404',['m_fcntol',['../structnonlin__core_1_1equation__solver.html#ad2db6e98fec5ac9de636310d41036fae',1,'nonlin_core::equation_solver::m_fcntol()'],['../structnonlin__core_1_1equation__solver__1var.html#ae3411b67af00133c791364e8c053774b',1,'nonlin_core::equation_solver_1var::m_fcntol()']]],
+  ['m_5fgrad_405',['m_grad',['../structnonlin__core_1_1fcnnvar__helper.html#ad15fb7b435bd7393fb4fb490485d84e1',1,'nonlin_core::fcnnvar_helper']]],
+  ['m_5fgtol_406',['m_gtol',['../structnonlin__core_1_1equation__solver.html#af77ceddf83ca6f4b86715452175cf03c',1,'nonlin_core::equation_solver']]],
+  ['m_5finitsize_407',['m_initsize',['../structnonlin__optimize_1_1nelder__mead.html#aa05ef531dcb5279fcc00f66ddaa36555',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5fjac_408',['m_jac',['../structnonlin__core_1_1vecfcn__helper.html#a47cdc8d1382ba9ca635e94ae8758115d',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fjdelta_409',['m_jdelta',['../structnonlin__solve_1_1quasi__newton__solver.html#a95dff0e80de74d475292e721edb0b6d8',1,'nonlin_solve::quasi_newton_solver']]],
+  ['m_5flinesearch_410',['m_linesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a5d8f6959a771c2cbcc8a41376bcc551a',1,'nonlin_optimize::line_search_optimizer::m_linesearch()'],['../structnonlin__solve_1_1line__search__solver.html#aaf65c7f137f5f37ae3227879a1add882',1,'nonlin_solve::line_search_solver::m_linesearch()']]],
+  ['m_5fmaxeval_411',['m_maxeval',['../structnonlin__core_1_1equation__solver.html#a33031ff9c089f39e423d092f64818c04',1,'nonlin_core::equation_solver::m_maxeval()'],['../structnonlin__core_1_1equation__solver__1var.html#a350d21ce72c598b6409ffa5919f601eb',1,'nonlin_core::equation_solver_1var::m_maxeval()'],['../structnonlin__core_1_1equation__optimizer.html#ad5c8a6d08a3d63f3330950188055136b',1,'nonlin_core::equation_optimizer::m_maxeval()'],['../structnonlin__linesearch_1_1line__search.html#abad607380c1f9f3786f0d442672fa89d',1,'nonlin_linesearch::line_search::m_maxeval()']]],
+  ['m_5fnfcn_412',['m_nfcn',['../structnonlin__core_1_1vecfcn__helper.html#a806818129d5723b7ff880af149e32a8c',1,'nonlin_core::vecfcn_helper']]],
+  ['m_5fnvar_413',['m_nvar',['../structnonlin__core_1_1vecfcn__helper.html#ac828cd0e3de7036ced8bae4b11664818',1,'nonlin_core::vecfcn_helper::m_nvar()'],['../structnonlin__core_1_1fcnnvar__helper.html#a18683497b25cf991e39104b4d8ac0d3e',1,'nonlin_core::fcnnvar_helper::m_nvar()']]],
+  ['m_5fprintstatus_414',['m_printstatus',['../structnonlin__core_1_1equation__solver.html#af45b53871eb687d267fa622135062ff6',1,'nonlin_core::equation_solver::m_printstatus()'],['../structnonlin__core_1_1equation__solver__1var.html#a85f93d8fe4939cd7d7698fe137aa302f',1,'nonlin_core::equation_solver_1var::m_printstatus()'],['../structnonlin__core_1_1equation__optimizer.html#a418a8ea0832d48a51bb1ab6bb984bb50',1,'nonlin_core::equation_optimizer::m_printstatus()']]],
+  ['m_5fsimplex_415',['m_simplex',['../structnonlin__optimize_1_1nelder__mead.html#af5d3d067795864bdd038f794a08231f2',1,'nonlin_optimize::nelder_mead']]],
+  ['m_5ftol_416',['m_tol',['../structnonlin__core_1_1equation__optimizer.html#a1a889674b291e7d94c94e00d1523b952',1,'nonlin_core::equation_optimizer']]],
+  ['m_5fuselinesearch_417',['m_uselinesearch',['../structnonlin__optimize_1_1line__search__optimizer.html#a75bddfbd8f82e2d5077262ac5bc2487d',1,'nonlin_optimize::line_search_optimizer::m_uselinesearch()'],['../structnonlin__solve_1_1line__search__solver.html#a6735a9a827d5dcd253db2a701d0836bf',1,'nonlin_solve::line_search_solver::m_uselinesearch()']]],
+  ['m_5fxtol_418',['m_xtol',['../structnonlin__core_1_1equation__solver.html#af02d0e834603736a0235f18c77cf12d2',1,'nonlin_core::equation_solver::m_xtol()'],['../structnonlin__core_1_1equation__solver__1var.html#ab60bc831b378afe7fed6d62d20232a8a',1,'nonlin_core::equation_solver_1var::m_xtol()'],['../structnonlin__optimize_1_1line__search__optimizer.html#a6a2fa9986135b7aba08a2437cd1663bc',1,'nonlin_optimize::line_search_optimizer::m_xtol()']]],
+  ['max_5ffunction_5fevals_419',['max_function_evals',['../structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089',1,'nonlin_c_api::iteration_controls::max_function_evals()'],['../structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35',1,'nonlin_c_api::line_search_controls::max_function_evals()'],['../structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e',1,'iteration_controls::max_function_evals()'],['../structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1',1,'line_search_controls::max_function_evals()']]]
 ];
diff --git a/doc/html/search/variables_8.html b/doc/html/search/variables_8.html
new file mode 100644
index 0000000..a50ee8f
--- /dev/null
+++ b/doc/html/search/variables_8.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html><head><title></title>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<link rel="stylesheet" type="text/css" href="search.css"/>
+<script type="text/javascript" src="variables_8.js"></script>
+<script type="text/javascript" src="search.js"></script>
+</head>
+<body class="SRPage">
+<div id="SRIndex">
+<div class="SRStatus" id="Loading">Loading...</div>
+<div id="SRResults"></div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+createResults();
+/* @license-end */
+--></script>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+document.getElementById("Loading").style.display="none";
+document.getElementById("NoMatches").style.display="none";
+var searchResults = new SearchResults("searchResults");
+searchResults.Search();
+/* @license-end */
+--></script>
+</div>
+</body>
+</html>
diff --git a/doc/html/search/variables_8.js b/doc/html/search/variables_8.js
new file mode 100644
index 0000000..638789f
--- /dev/null
+++ b/doc/html/search/variables_8.js
@@ -0,0 +1,12 @@
+var searchData=
+[
+  ['nl_5farray_5fsize_5ferror_420',['nl_array_size_error',['../namespacenonlin__constants.html#add76da4ff5b1fc228887cb442e1a909a',1,'nonlin_constants']]],
+  ['nl_5fconvergence_5ferror_421',['nl_convergence_error',['../namespacenonlin__constants.html#a6e7694d6d44ec6b988de8b6d91d93fd5',1,'nonlin_constants']]],
+  ['nl_5fdivergent_5fbehavior_5ferror_422',['nl_divergent_behavior_error',['../namespacenonlin__constants.html#a285bb54cb368551d46661f78d710e9e0',1,'nonlin_constants']]],
+  ['nl_5finvalid_5finput_5ferror_423',['nl_invalid_input_error',['../namespacenonlin__constants.html#aea9acca28551e2c88635255bfd2c3f2d',1,'nonlin_constants']]],
+  ['nl_5finvalid_5foperation_5ferror_424',['nl_invalid_operation_error',['../namespacenonlin__constants.html#acf8b68879c3414c4f328b0d692b9354d',1,'nonlin_constants']]],
+  ['nl_5fno_5ferror_425',['nl_no_error',['../namespacenonlin__constants.html#a6d1b967272d8890af7951e3b2c834dde',1,'nonlin_constants']]],
+  ['nl_5fout_5fof_5fmemory_5ferror_426',['nl_out_of_memory_error',['../namespacenonlin__constants.html#a53c7cd0a6d2a68f37f4e92630af700e3',1,'nonlin_constants']]],
+  ['nl_5fspurious_5fconvergence_5ferror_427',['nl_spurious_convergence_error',['../namespacenonlin__constants.html#ad6c00f5fd3698a2418373ef56ba8f4f4',1,'nonlin_constants']]],
+  ['nl_5ftolerance_5ftoo_5fsmall_5ferror_428',['nl_tolerance_too_small_error',['../namespacenonlin__constants.html#a226aad58e61f8da6e0bf56163a761cd0',1,'nonlin_constants']]]
+];
diff --git a/doc/html/search/variables_9.html b/doc/html/search/variables_9.html
new file mode 100644
index 0000000..82db8ae
--- /dev/null
+++ b/doc/html/search/variables_9.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html><head><title></title>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<link rel="stylesheet" type="text/css" href="search.css"/>
+<script type="text/javascript" src="variables_9.js"></script>
+<script type="text/javascript" src="search.js"></script>
+</head>
+<body class="SRPage">
+<div id="SRIndex">
+<div class="SRStatus" id="Loading">Loading...</div>
+<div id="SRResults"></div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+createResults();
+/* @license-end */
+--></script>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+document.getElementById("Loading").style.display="none";
+document.getElementById("NoMatches").style.display="none";
+var searchResults = new SearchResults("searchResults");
+searchResults.Search();
+/* @license-end */
+--></script>
+</div>
+</body>
+</html>
diff --git a/doc/html/search/variables_9.js b/doc/html/search/variables_9.js
new file mode 100644
index 0000000..b04cd21
--- /dev/null
+++ b/doc/html/search/variables_9.js
@@ -0,0 +1,5 @@
+var searchData=
+[
+  ['print_5fstatus_429',['print_status',['../structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3',1,'nonlin_c_api::iteration_controls::print_status()'],['../structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2',1,'iteration_controls::print_status()']]],
+  ['ptr_430',['ptr',['../structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4',1,'nonlin_c_api::c_polynomial::ptr()'],['../structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c',1,'c_polynomial::ptr()']]]
+];
diff --git a/doc/html/search/variables_a.html b/doc/html/search/variables_a.html
new file mode 100644
index 0000000..fd8f0d7
--- /dev/null
+++ b/doc/html/search/variables_a.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html><head><title></title>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<link rel="stylesheet" type="text/css" href="search.css"/>
+<script type="text/javascript" src="variables_a.js"></script>
+<script type="text/javascript" src="search.js"></script>
+</head>
+<body class="SRPage">
+<div id="SRIndex">
+<div class="SRStatus" id="Loading">Loading...</div>
+<div id="SRResults"></div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+createResults();
+/* @license-end */
+--></script>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+document.getElementById("Loading").style.display="none";
+document.getElementById("NoMatches").style.display="none";
+var searchResults = new SearchResults("searchResults");
+searchResults.Search();
+/* @license-end */
+--></script>
+</div>
+</body>
+</html>
diff --git a/doc/html/search/variables_a.js b/doc/html/search/variables_a.js
new file mode 100644
index 0000000..86d1d43
--- /dev/null
+++ b/doc/html/search/variables_a.js
@@ -0,0 +1,5 @@
+var searchData=
+[
+  ['size_5fin_5fbytes_431',['size_in_bytes',['../structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e',1,'nonlin_c_api::c_polynomial::size_in_bytes()'],['../structc__polynomial.html#ac0838645de567ad5a80b255791707976',1,'c_polynomial::size_in_bytes()']]],
+  ['solution_5ftolerance_432',['solution_tolerance',['../structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4',1,'nonlin_c_api::iteration_controls::solution_tolerance()'],['../structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1',1,'iteration_controls::solution_tolerance()']]]
+];
diff --git a/doc/html/search/variables_b.html b/doc/html/search/variables_b.html
new file mode 100644
index 0000000..577a4b7
--- /dev/null
+++ b/doc/html/search/variables_b.html
@@ -0,0 +1,30 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html><head><title></title>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<link rel="stylesheet" type="text/css" href="search.css"/>
+<script type="text/javascript" src="variables_b.js"></script>
+<script type="text/javascript" src="search.js"></script>
+</head>
+<body class="SRPage">
+<div id="SRIndex">
+<div class="SRStatus" id="Loading">Loading...</div>
+<div id="SRResults"></div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+createResults();
+/* @license-end */
+--></script>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+<script type="text/javascript"><!--
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+document.getElementById("Loading").style.display="none";
+document.getElementById("NoMatches").style.display="none";
+var searchResults = new SearchResults("searchResults");
+searchResults.Search();
+/* @license-end */
+--></script>
+</div>
+</body>
+</html>
diff --git a/doc/html/search/variables_b.js b/doc/html/search/variables_b.js
new file mode 100644
index 0000000..3f6d875
--- /dev/null
+++ b/doc/html/search/variables_b.js
@@ -0,0 +1,5 @@
+var searchData=
+[
+  ['x1_433',['x1',['../structnonlin__core_1_1value__pair.html#a6b406e6ee33f4237122141224f1d3c87',1,'nonlin_core::value_pair::x1()'],['../structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e',1,'value_pair::x1()']]],
+  ['x2_434',['x2',['../structnonlin__core_1_1value__pair.html#a18a904854840a01001ceafaf8b438c73',1,'nonlin_core::value_pair::x2()'],['../structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc',1,'value_pair::x2()']]]
+];
diff --git a/doc/html/structc__polynomial-members.html b/doc/html/structc__polynomial-members.html
new file mode 100644
index 0000000..19dd664
--- /dev/null
+++ b/doc/html/structc__polynomial-members.html
@@ -0,0 +1,110 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structc__polynomial.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">c_polynomial Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structc__polynomial.html">c_polynomial</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">ptr</a></td><td class="entry"><a class="el" href="structc__polynomial.html">c_polynomial</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">size_in_bytes</a></td><td class="entry"><a class="el" href="structc__polynomial.html">c_polynomial</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structc__polynomial.html b/doc/html/structc__polynomial.html
new file mode 100644
index 0000000..9e4c7c9
--- /dev/null
+++ b/doc/html/structc__polynomial.html
@@ -0,0 +1,161 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: c_polynomial Struct Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structc__polynomial.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structc__polynomial-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">c_polynomial Struct Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p><code>#include &lt;<a class="el" href="nonlin_8h_source.html">nonlin.h</a>&gt;</code></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:ac0838645de567ad5a80b255791707976"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structc__polynomial.html#ac0838645de567ad5a80b255791707976">size_in_bytes</a></td></tr>
+<tr class="separator:ac0838645de567ad5a80b255791707976"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a0e3d5da0fb5285972268ca56db16970c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c">ptr</a></td></tr>
+<tr class="separator:a0e3d5da0fb5285972268ca56db16970c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Provides a container for the underlying Fortran polynomial type. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00159">159</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a0e3d5da0fb5285972268ca56db16970c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0e3d5da0fb5285972268ca56db16970c">&#9670;&nbsp;</a></span>ptr</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">void* c_polynomial::ptr</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>A pointer to the underlying Fortran polynomial object. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00163">163</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="ac0838645de567ad5a80b255791707976"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac0838645de567ad5a80b255791707976">&#9670;&nbsp;</a></span>size_in_bytes</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int c_polynomial::size_in_bytes</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The size of the underlying Fortran polynomial object in bytes. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00161">161</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/include/<a class="el" href="nonlin_8h_source.html">nonlin.h</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="structc__polynomial.html">c_polynomial</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structc__polynomial.js b/doc/html/structc__polynomial.js
new file mode 100644
index 0000000..4ab250c
--- /dev/null
+++ b/doc/html/structc__polynomial.js
@@ -0,0 +1,5 @@
+var structc__polynomial =
+[
+    [ "ptr", "structc__polynomial.html#a0e3d5da0fb5285972268ca56db16970c", null ],
+    [ "size_in_bytes", "structc__polynomial.html#ac0838645de567ad5a80b255791707976", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structiteration__controls-members.html b/doc/html/structiteration__controls-members.html
new file mode 100644
index 0000000..875fc38
--- /dev/null
+++ b/doc/html/structiteration__controls-members.html
@@ -0,0 +1,113 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structiteration__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">iteration_controls Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structiteration__controls.html">iteration_controls</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">function_tolerance</a></td><td class="entry"><a class="el" href="structiteration__controls.html">iteration_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">gradient_tolerance</a></td><td class="entry"><a class="el" href="structiteration__controls.html">iteration_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">max_function_evals</a></td><td class="entry"><a class="el" href="structiteration__controls.html">iteration_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">print_status</a></td><td class="entry"><a class="el" href="structiteration__controls.html">iteration_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">solution_tolerance</a></td><td class="entry"><a class="el" href="structiteration__controls.html">iteration_controls</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structiteration__controls.html b/doc/html/structiteration__controls.html
new file mode 100644
index 0000000..2026159
--- /dev/null
+++ b/doc/html/structiteration__controls.html
@@ -0,0 +1,218 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: iteration_controls Struct Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structiteration__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structiteration__controls-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">iteration_controls Struct Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p><code>#include &lt;<a class="el" href="nonlin_8h_source.html">nonlin.h</a>&gt;</code></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:a5b90dcfce0397e98fce3ece2301d673e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e">max_function_evals</a></td></tr>
+<tr class="separator:a5b90dcfce0397e98fce3ece2301d673e"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a6b4646344cda46ab0752819a1a930028"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__controls.html#a6b4646344cda46ab0752819a1a930028">function_tolerance</a></td></tr>
+<tr class="separator:a6b4646344cda46ab0752819a1a930028"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a515ef26c2a30dace0aac535d4918bce1"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1">solution_tolerance</a></td></tr>
+<tr class="separator:a515ef26c2a30dace0aac535d4918bce1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a31353fc9c86aa23157c30b1073893745"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__controls.html#a31353fc9c86aa23157c30b1073893745">gradient_tolerance</a></td></tr>
+<tr class="separator:a31353fc9c86aa23157c30b1073893745"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a3973c5320416b5c27f96e8bda03674a2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2">print_status</a></td></tr>
+<tr class="separator:a3973c5320416b5c27f96e8bda03674a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type for providing a set of iteration control parameters. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00018">18</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a6b4646344cda46ab0752819a1a930028"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6b4646344cda46ab0752819a1a930028">&#9670;&nbsp;</a></span>function_tolerance</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double iteration_controls::function_tolerance</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines convergence criteria based upon function value. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00022">22</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a31353fc9c86aa23157c30b1073893745"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a31353fc9c86aa23157c30b1073893745">&#9670;&nbsp;</a></span>gradient_tolerance</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double iteration_controls::gradient_tolerance</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines convergence criteria based upon the slope of the gradient vector. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00029">29</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a5b90dcfce0397e98fce3ece2301d673e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5b90dcfce0397e98fce3ece2301d673e">&#9670;&nbsp;</a></span>max_function_evals</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int iteration_controls::max_function_evals</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines the maximum number of allowable function evaluations. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00020">20</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a3973c5320416b5c27f96e8bda03674a2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3973c5320416b5c27f96e8bda03674a2">&#9670;&nbsp;</a></span>print_status</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool iteration_controls::print_status</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Gets a logical value determining if iteration status should be printed. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00033">33</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a515ef26c2a30dace0aac535d4918bce1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a515ef26c2a30dace0aac535d4918bce1">&#9670;&nbsp;</a></span>solution_tolerance</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double iteration_controls::solution_tolerance</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines convergence criteria based upon the solution value. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00024">24</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/include/<a class="el" href="nonlin_8h_source.html">nonlin.h</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="structiteration__controls.html">iteration_controls</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structiteration__controls.js b/doc/html/structiteration__controls.js
new file mode 100644
index 0000000..860f70a
--- /dev/null
+++ b/doc/html/structiteration__controls.js
@@ -0,0 +1,8 @@
+var structiteration__controls =
+[
+    [ "function_tolerance", "structiteration__controls.html#a6b4646344cda46ab0752819a1a930028", null ],
+    [ "gradient_tolerance", "structiteration__controls.html#a31353fc9c86aa23157c30b1073893745", null ],
+    [ "max_function_evals", "structiteration__controls.html#a5b90dcfce0397e98fce3ece2301d673e", null ],
+    [ "print_status", "structiteration__controls.html#a3973c5320416b5c27f96e8bda03674a2", null ],
+    [ "solution_tolerance", "structiteration__controls.html#a515ef26c2a30dace0aac535d4918bce1", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structiteration__process-members.html b/doc/html/structiteration__process-members.html
new file mode 100644
index 0000000..244c895
--- /dev/null
+++ b/doc/html/structiteration__process-members.html
@@ -0,0 +1,115 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structiteration__process.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">iteration_process Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structiteration__process.html">iteration_process</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">converge_on_function</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">converge_on_gradient</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">converge_on_solution_change</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">function_eval_count</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">gradient_eval_count</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_count</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">jacobian_eval_count</a></td><td class="entry"><a class="el" href="structiteration__process.html">iteration_process</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structiteration__process.html b/doc/html/structiteration__process.html
new file mode 100644
index 0000000..b693397
--- /dev/null
+++ b/doc/html/structiteration__process.html
@@ -0,0 +1,256 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: iteration_process Struct Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structiteration__process.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structiteration__process-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">iteration_process Struct Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p><code>#include &lt;<a class="el" href="nonlin_8h_source.html">nonlin.h</a>&gt;</code></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:a13c1427518d62138fdfac155510347fd"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#a13c1427518d62138fdfac155510347fd">iteration_count</a></td></tr>
+<tr class="separator:a13c1427518d62138fdfac155510347fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ac67e6fb6e68635de9bbdcd6133d8323a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a">function_eval_count</a></td></tr>
+<tr class="separator:ac67e6fb6e68635de9bbdcd6133d8323a"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:acc44c29213f98f4d679c5fd4999bbc55"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55">jacobian_eval_count</a></td></tr>
+<tr class="separator:acc44c29213f98f4d679c5fd4999bbc55"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aa9b8435c188b0dd37cfdc064617db5bb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb">gradient_eval_count</a></td></tr>
+<tr class="separator:aa9b8435c188b0dd37cfdc064617db5bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a00a463e2db7a0fbab8764083936d926c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#a00a463e2db7a0fbab8764083936d926c">converge_on_function</a></td></tr>
+<tr class="separator:a00a463e2db7a0fbab8764083936d926c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a795b4560af8d0d236e7b6dfaed90d80c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c">converge_on_solution_change</a></td></tr>
+<tr class="separator:a795b4560af8d0d236e7b6dfaed90d80c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a309e95e4da19427633b6d0c1affab090"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structiteration__process.html#a309e95e4da19427633b6d0c1affab090">converge_on_gradient</a></td></tr>
+<tr class="separator:a309e95e4da19427633b6d0c1affab090"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type providing information on the iteration process. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00037">37</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a00a463e2db7a0fbab8764083936d926c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a00a463e2db7a0fbab8764083936d926c">&#9670;&nbsp;</a></span>converge_on_function</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool iteration_process::converge_on_function</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>True if the solution converged as a result of a zero-valued function; else, false. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00053">53</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a309e95e4da19427633b6d0c1affab090"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a309e95e4da19427633b6d0c1affab090">&#9670;&nbsp;</a></span>converge_on_gradient</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool iteration_process::converge_on_gradient</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>True if the solution appears to have settled on a stationary point such that the gradient of the function is zero-valued; else, false. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00064">64</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a795b4560af8d0d236e7b6dfaed90d80c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a795b4560af8d0d236e7b6dfaed90d80c">&#9670;&nbsp;</a></span>converge_on_solution_change</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool iteration_process::converge_on_solution_change</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>True if the solution converged as a result of no appreciable change in the solution between iterations; else, false. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00058">58</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="ac67e6fb6e68635de9bbdcd6133d8323a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac67e6fb6e68635de9bbdcd6133d8323a">&#9670;&nbsp;</a></span>function_eval_count</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int iteration_process::function_eval_count</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The number of function evaluations performed. This typically does not include derivative evaulations. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00044">44</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="aa9b8435c188b0dd37cfdc064617db5bb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa9b8435c188b0dd37cfdc064617db5bb">&#9670;&nbsp;</a></span>gradient_eval_count</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int iteration_process::gradient_eval_count</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The number of gradient vector evaluations performed. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00048">48</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a13c1427518d62138fdfac155510347fd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a13c1427518d62138fdfac155510347fd">&#9670;&nbsp;</a></span>iteration_count</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int iteration_process::iteration_count</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The number of iteration performed. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00039">39</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="acc44c29213f98f4d679c5fd4999bbc55"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acc44c29213f98f4d679c5fd4999bbc55">&#9670;&nbsp;</a></span>jacobian_eval_count</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int iteration_process::jacobian_eval_count</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The number of Jacobian evaluations performed. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00046">46</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/include/<a class="el" href="nonlin_8h_source.html">nonlin.h</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="structiteration__process.html">iteration_process</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structiteration__process.js b/doc/html/structiteration__process.js
new file mode 100644
index 0000000..7d8798f
--- /dev/null
+++ b/doc/html/structiteration__process.js
@@ -0,0 +1,10 @@
+var structiteration__process =
+[
+    [ "converge_on_function", "structiteration__process.html#a00a463e2db7a0fbab8764083936d926c", null ],
+    [ "converge_on_gradient", "structiteration__process.html#a309e95e4da19427633b6d0c1affab090", null ],
+    [ "converge_on_solution_change", "structiteration__process.html#a795b4560af8d0d236e7b6dfaed90d80c", null ],
+    [ "function_eval_count", "structiteration__process.html#ac67e6fb6e68635de9bbdcd6133d8323a", null ],
+    [ "gradient_eval_count", "structiteration__process.html#aa9b8435c188b0dd37cfdc064617db5bb", null ],
+    [ "iteration_count", "structiteration__process.html#a13c1427518d62138fdfac155510347fd", null ],
+    [ "jacobian_eval_count", "structiteration__process.html#acc44c29213f98f4d679c5fd4999bbc55", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structline__search__controls-members.html b/doc/html/structline__search__controls-members.html
new file mode 100644
index 0000000..b3aa699
--- /dev/null
+++ b/doc/html/structline__search__controls-members.html
@@ -0,0 +1,112 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structline__search__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">line_search_controls Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structline__search__controls.html">line_search_controls</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">alpha</a></td><td class="entry"><a class="el" href="structline__search__controls.html">line_search_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">enable</a></td><td class="entry"><a class="el" href="structline__search__controls.html">line_search_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">factor</a></td><td class="entry"><a class="el" href="structline__search__controls.html">line_search_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">max_function_evals</a></td><td class="entry"><a class="el" href="structline__search__controls.html">line_search_controls</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structline__search__controls.html b/doc/html/structline__search__controls.html
new file mode 100644
index 0000000..3a0be3d
--- /dev/null
+++ b/doc/html/structline__search__controls.html
@@ -0,0 +1,199 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: line_search_controls Struct Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structline__search__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structline__search__controls-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">line_search_controls Struct Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p><code>#include &lt;<a class="el" href="nonlin_8h_source.html">nonlin.h</a>&gt;</code></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:a011d44e850183280119f0aa06af6d83a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structline__search__controls.html#a011d44e850183280119f0aa06af6d83a">enable</a></td></tr>
+<tr class="separator:a011d44e850183280119f0aa06af6d83a"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a14c2ac572f0213e9e3963d781e2ba8c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1">max_function_evals</a></td></tr>
+<tr class="separator:a14c2ac572f0213e9e3963d781e2ba8c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a4cdae888ec5f67a3aa3cf99efd1a8fed"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed">alpha</a></td></tr>
+<tr class="separator:a4cdae888ec5f67a3aa3cf99efd1a8fed"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aa08dfa97fa68cc382b1d0290057f9b6c"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c">factor</a></td></tr>
+<tr class="separator:aa08dfa97fa68cc382b1d0290057f9b6c"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type for providing controls on line search parameters. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00068">68</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a4cdae888ec5f67a3aa3cf99efd1a8fed"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4cdae888ec5f67a3aa3cf99efd1a8fed">&#9670;&nbsp;</a></span>alpha</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double line_search_controls::alpha</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines the scaling of the product of the gradient and direction vectors such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor. The parameter must exist on the set (0, 1). A value of 1e-4 is typically a good starting point. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00084">84</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a011d44e850183280119f0aa06af6d83a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a011d44e850183280119f0aa06af6d83a">&#9670;&nbsp;</a></span>enable</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool line_search_controls::enable</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines whether line-searching should be employed. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00070">70</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="aa08dfa97fa68cc382b1d0290057f9b6c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa08dfa97fa68cc382b1d0290057f9b6c">&#9670;&nbsp;</a></span>factor</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double line_search_controls::factor</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines a minimum factor X used to determine a minimum value LAMBDA such that MIN(LAMBDA) = X * LAMBDA, where LAMBDA defines the distance along the line search direction assuming a value of one means the full length of the direction vector is traversed. As such, the value must exist on the set (0, 1); however, for practical considerations, the minimum value should be limited to 0.1 such that the value must exist on the set [0.1, 1). </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00094">94</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="a14c2ac572f0213e9e3963d781e2ba8c1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a14c2ac572f0213e9e3963d781e2ba8c1">&#9670;&nbsp;</a></span>max_function_evals</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int line_search_controls::max_function_evals</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>Defines the maximum number of allowable function evaluations during a single line search. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00075">75</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/include/<a class="el" href="nonlin_8h_source.html">nonlin.h</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="structline__search__controls.html">line_search_controls</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structline__search__controls.js b/doc/html/structline__search__controls.js
new file mode 100644
index 0000000..5e6fa26
--- /dev/null
+++ b/doc/html/structline__search__controls.js
@@ -0,0 +1,7 @@
+var structline__search__controls =
+[
+    [ "alpha", "structline__search__controls.html#a4cdae888ec5f67a3aa3cf99efd1a8fed", null ],
+    [ "enable", "structline__search__controls.html#a011d44e850183280119f0aa06af6d83a", null ],
+    [ "factor", "structline__search__controls.html#aa08dfa97fa68cc382b1d0290057f9b6c", null ],
+    [ "max_function_evals", "structline__search__controls.html#a14c2ac572f0213e9e3963d781e2ba8c1", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structnonlin__c__api_1_1c__polynomial-members.html b/doc/html/structnonlin__c__api_1_1c__polynomial-members.html
new file mode 100644
index 0000000..d933fae
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1c__polynomial-members.html
@@ -0,0 +1,110 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1c__polynomial.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_polynomial Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structnonlin__c__api_1_1c__polynomial.html">nonlin_c_api::c_polynomial</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4">ptr</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html">nonlin_c_api::c_polynomial</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e">size_in_bytes</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html">nonlin_c_api::c_polynomial</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1c__polynomial.html b/doc/html/structnonlin__c__api_1_1c__polynomial.html
new file mode 100644
index 0000000..99958b7
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1c__polynomial.html
@@ -0,0 +1,131 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::c_polynomial Type Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1c__polynomial.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structnonlin__c__api_1_1c__polynomial-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::c_polynomial Type Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>A type for representing a polynomial in C that is compatible with the polynomial type in this library.  
+ <a href="structnonlin__c__api_1_1c__polynomial.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:afa19da25db5519e2d9a5702fd7c4cc4e"><td class="memItemLeft" align="right" valign="top"><a id="afa19da25db5519e2d9a5702fd7c4cc4e"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e">size_in_bytes</a></td></tr>
+<tr class="memdesc:afa19da25db5519e2d9a5702fd7c4cc4e"><td class="mdescLeft">&#160;</td><td class="mdescRight">The size of the polynomial object, in bytes. <br /></td></tr>
+<tr class="separator:afa19da25db5519e2d9a5702fd7c4cc4e"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aefcbccf74e0767a424becf113a430fe4"><td class="memItemLeft" align="right" valign="top"><a id="aefcbccf74e0767a424becf113a430fe4"></a>
+type(c_ptr)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4">ptr</a></td></tr>
+<tr class="memdesc:aefcbccf74e0767a424becf113a430fe4"><td class="mdescLeft">&#160;</td><td class="mdescRight">A pointer to the underlying Fortran polynomial object. <br /></td></tr>
+<tr class="separator:aefcbccf74e0767a424becf113a430fe4"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type for representing a polynomial in C that is compatible with the polynomial type in this library. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00151">151</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this type was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="structnonlin__c__api_1_1c__polynomial.html">c_polynomial</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1c__polynomial.js b/doc/html/structnonlin__c__api_1_1c__polynomial.js
new file mode 100644
index 0000000..9dc1a4d
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1c__polynomial.js
@@ -0,0 +1,5 @@
+var structnonlin__c__api_1_1c__polynomial =
+[
+    [ "ptr", "structnonlin__c__api_1_1c__polynomial.html#aefcbccf74e0767a424becf113a430fe4", null ],
+    [ "size_in_bytes", "structnonlin__c__api_1_1c__polynomial.html#afa19da25db5519e2d9a5702fd7c4cc4e", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structnonlin__c__api_1_1iteration__controls-members.html b/doc/html/structnonlin__c__api_1_1iteration__controls-members.html
new file mode 100644
index 0000000..fe24c83
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__controls-members.html
@@ -0,0 +1,113 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1iteration__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::iteration_controls Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d">function_tolerance</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e">gradient_tolerance</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089">max_function_evals</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3">print_status</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4">solution_tolerance</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">nonlin_c_api::iteration_controls</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1iteration__controls.html b/doc/html/structnonlin__c__api_1_1iteration__controls.html
new file mode 100644
index 0000000..2797035
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__controls.html
@@ -0,0 +1,143 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::iteration_controls Type Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1iteration__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structnonlin__c__api_1_1iteration__controls-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::iteration_controls Type Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>A type for providing a set of iteration control parameters.  
+ <a href="structnonlin__c__api_1_1iteration__controls.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:a45e2147358e02eda8b0b770c84bde089"><td class="memItemLeft" align="right" valign="top"><a id="a45e2147358e02eda8b0b770c84bde089"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089">max_function_evals</a></td></tr>
+<tr class="memdesc:a45e2147358e02eda8b0b770c84bde089"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the maximum number of allowable function evaluations. <br /></td></tr>
+<tr class="separator:a45e2147358e02eda8b0b770c84bde089"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a0c6db21a9ed179bbeea0a30cc2d1c89d"><td class="memItemLeft" align="right" valign="top"><a id="a0c6db21a9ed179bbeea0a30cc2d1c89d"></a>
+real(c_double)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d">function_tolerance</a></td></tr>
+<tr class="memdesc:a0c6db21a9ed179bbeea0a30cc2d1c89d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines convergence criteria based upon function value. <br /></td></tr>
+<tr class="separator:a0c6db21a9ed179bbeea0a30cc2d1c89d"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a34878a96a9f562dac73726c2a018a0f4"><td class="memItemLeft" align="right" valign="top"><a id="a34878a96a9f562dac73726c2a018a0f4"></a>
+real(c_double)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4">solution_tolerance</a></td></tr>
+<tr class="memdesc:a34878a96a9f562dac73726c2a018a0f4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines convergence criteria based upon the solution value. <br /></td></tr>
+<tr class="separator:a34878a96a9f562dac73726c2a018a0f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a3a24992b27219eab62ab1455ab77230e"><td class="memItemLeft" align="right" valign="top"><a id="a3a24992b27219eab62ab1455ab77230e"></a>
+real(c_double)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e">gradient_tolerance</a></td></tr>
+<tr class="memdesc:a3a24992b27219eab62ab1455ab77230e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines convergence criteria based upon the slope of the gradient vector. <br /></td></tr>
+<tr class="separator:a3a24992b27219eab62ab1455ab77230e"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a9333f4bd62cff0c7f09a26be5d6690a3"><td class="memItemLeft" align="right" valign="top"><a id="a9333f4bd62cff0c7f09a26be5d6690a3"></a>
+logical(c_bool)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3">print_status</a></td></tr>
+<tr class="memdesc:a9333f4bd62cff0c7f09a26be5d6690a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets a logical value determining if iteration status should be printed. <br /></td></tr>
+<tr class="separator:a9333f4bd62cff0c7f09a26be5d6690a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type for providing a set of iteration control parameters. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00087">87</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this type was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="structnonlin__c__api_1_1iteration__controls.html">iteration_controls</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1iteration__controls.js b/doc/html/structnonlin__c__api_1_1iteration__controls.js
new file mode 100644
index 0000000..0eaef4a
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__controls.js
@@ -0,0 +1,8 @@
+var structnonlin__c__api_1_1iteration__controls =
+[
+    [ "function_tolerance", "structnonlin__c__api_1_1iteration__controls.html#a0c6db21a9ed179bbeea0a30cc2d1c89d", null ],
+    [ "gradient_tolerance", "structnonlin__c__api_1_1iteration__controls.html#a3a24992b27219eab62ab1455ab77230e", null ],
+    [ "max_function_evals", "structnonlin__c__api_1_1iteration__controls.html#a45e2147358e02eda8b0b770c84bde089", null ],
+    [ "print_status", "structnonlin__c__api_1_1iteration__controls.html#a9333f4bd62cff0c7f09a26be5d6690a3", null ],
+    [ "solution_tolerance", "structnonlin__c__api_1_1iteration__controls.html#a34878a96a9f562dac73726c2a018a0f4", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structnonlin__c__api_1_1iteration__process-members.html b/doc/html/structnonlin__c__api_1_1iteration__process-members.html
new file mode 100644
index 0000000..ba1e24a
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__process-members.html
@@ -0,0 +1,115 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1iteration__process.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::iteration_process Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9">converge_on_function</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18">converge_on_gradient</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56">converge_on_solution_change</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92">function_eval_count</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187">gradient_eval_count</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732">iteration_count</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf">jacobian_eval_count</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">nonlin_c_api::iteration_process</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1iteration__process.html b/doc/html/structnonlin__c__api_1_1iteration__process.html
new file mode 100644
index 0000000..b02fec0
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__process.html
@@ -0,0 +1,151 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::iteration_process Type Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1iteration__process.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structnonlin__c__api_1_1iteration__process-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::iteration_process Type Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>A type providing information on the iteration process.  
+ <a href="structnonlin__c__api_1_1iteration__process.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:afdfa53d797403e736d1b5e2eb790a732"><td class="memItemLeft" align="right" valign="top"><a id="afdfa53d797403e736d1b5e2eb790a732"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732">iteration_count</a></td></tr>
+<tr class="memdesc:afdfa53d797403e736d1b5e2eb790a732"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of iteration performed. <br /></td></tr>
+<tr class="separator:afdfa53d797403e736d1b5e2eb790a732"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ace9e37db032a0208f6227a76a34e3c92"><td class="memItemLeft" align="right" valign="top"><a id="ace9e37db032a0208f6227a76a34e3c92"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92">function_eval_count</a></td></tr>
+<tr class="memdesc:ace9e37db032a0208f6227a76a34e3c92"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of function evaluations performed. This typically does not include derivative evaulations. <br /></td></tr>
+<tr class="separator:ace9e37db032a0208f6227a76a34e3c92"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a399c05ddbafd8e9de4113a8058861ddf"><td class="memItemLeft" align="right" valign="top"><a id="a399c05ddbafd8e9de4113a8058861ddf"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf">jacobian_eval_count</a></td></tr>
+<tr class="memdesc:a399c05ddbafd8e9de4113a8058861ddf"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of Jacobian evaluations performed. <br /></td></tr>
+<tr class="separator:a399c05ddbafd8e9de4113a8058861ddf"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a7a6de072afc453a9250ead0213a88187"><td class="memItemLeft" align="right" valign="top"><a id="a7a6de072afc453a9250ead0213a88187"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187">gradient_eval_count</a></td></tr>
+<tr class="memdesc:a7a6de072afc453a9250ead0213a88187"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of gradient vector evaluations performed. <br /></td></tr>
+<tr class="separator:a7a6de072afc453a9250ead0213a88187"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ad15c5a972199c2436be1c108c4057dd9"><td class="memItemLeft" align="right" valign="top"><a id="ad15c5a972199c2436be1c108c4057dd9"></a>
+logical(c_bool)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9">converge_on_function</a></td></tr>
+<tr class="memdesc:ad15c5a972199c2436be1c108c4057dd9"><td class="mdescLeft">&#160;</td><td class="mdescRight">True if the solution converged as a result of a zero-valued function; else, false. <br /></td></tr>
+<tr class="separator:ad15c5a972199c2436be1c108c4057dd9"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a00e71d40f68b9a00cf0fe4909a8ccf56"><td class="memItemLeft" align="right" valign="top"><a id="a00e71d40f68b9a00cf0fe4909a8ccf56"></a>
+logical(c_bool)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56">converge_on_solution_change</a></td></tr>
+<tr class="memdesc:a00e71d40f68b9a00cf0fe4909a8ccf56"><td class="mdescLeft">&#160;</td><td class="mdescRight">True if the solution converged as a result of no appreciable change in the solution between iterations; else, false. <br /></td></tr>
+<tr class="separator:a00e71d40f68b9a00cf0fe4909a8ccf56"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a86f7a79ae71f5dc0a5e05cdf3c9caa18"><td class="memItemLeft" align="right" valign="top"><a id="a86f7a79ae71f5dc0a5e05cdf3c9caa18"></a>
+logical(c_bool)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18">converge_on_gradient</a></td></tr>
+<tr class="memdesc:a86f7a79ae71f5dc0a5e05cdf3c9caa18"><td class="mdescLeft">&#160;</td><td class="mdescRight">True if the solution appears to have settled on a stationary point such that the gradient of the function is zero-valued; else, false. <br /></td></tr>
+<tr class="separator:a86f7a79ae71f5dc0a5e05cdf3c9caa18"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type providing information on the iteration process. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00103">103</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this type was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="structnonlin__c__api_1_1iteration__process.html">iteration_process</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1iteration__process.js b/doc/html/structnonlin__c__api_1_1iteration__process.js
new file mode 100644
index 0000000..03d6cf4
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1iteration__process.js
@@ -0,0 +1,10 @@
+var structnonlin__c__api_1_1iteration__process =
+[
+    [ "converge_on_function", "structnonlin__c__api_1_1iteration__process.html#ad15c5a972199c2436be1c108c4057dd9", null ],
+    [ "converge_on_gradient", "structnonlin__c__api_1_1iteration__process.html#a86f7a79ae71f5dc0a5e05cdf3c9caa18", null ],
+    [ "converge_on_solution_change", "structnonlin__c__api_1_1iteration__process.html#a00e71d40f68b9a00cf0fe4909a8ccf56", null ],
+    [ "function_eval_count", "structnonlin__c__api_1_1iteration__process.html#ace9e37db032a0208f6227a76a34e3c92", null ],
+    [ "gradient_eval_count", "structnonlin__c__api_1_1iteration__process.html#a7a6de072afc453a9250ead0213a88187", null ],
+    [ "iteration_count", "structnonlin__c__api_1_1iteration__process.html#afdfa53d797403e736d1b5e2eb790a732", null ],
+    [ "jacobian_eval_count", "structnonlin__c__api_1_1iteration__process.html#a399c05ddbafd8e9de4113a8058861ddf", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structnonlin__c__api_1_1line__search__controls-members.html b/doc/html/structnonlin__c__api_1_1line__search__controls-members.html
new file mode 100644
index 0000000..9c2678f
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1line__search__controls-members.html
@@ -0,0 +1,112 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1line__search__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">nonlin_c_api::line_search_controls Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structnonlin__c__api_1_1line__search__controls.html">nonlin_c_api::line_search_controls</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de">alpha</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">nonlin_c_api::line_search_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b">enable</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">nonlin_c_api::line_search_controls</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1">factor</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">nonlin_c_api::line_search_controls</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35">max_function_evals</a></td><td class="entry"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">nonlin_c_api::line_search_controls</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1line__search__controls.html b/doc/html/structnonlin__c__api_1_1line__search__controls.html
new file mode 100644
index 0000000..9852063
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1line__search__controls.html
@@ -0,0 +1,139 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: nonlin_c_api::line_search_controls Type Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structnonlin__c__api_1_1line__search__controls.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structnonlin__c__api_1_1line__search__controls-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">nonlin_c_api::line_search_controls Type Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>A type for providing controls on line search parameters.  
+ <a href="structnonlin__c__api_1_1line__search__controls.html#details">More...</a></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:a67df936d4e89d2fd2292f9d0ce6f559b"><td class="memItemLeft" align="right" valign="top"><a id="a67df936d4e89d2fd2292f9d0ce6f559b"></a>
+logical(c_bool)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b">enable</a></td></tr>
+<tr class="memdesc:a67df936d4e89d2fd2292f9d0ce6f559b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines whether line-searching should be employed. <br /></td></tr>
+<tr class="separator:a67df936d4e89d2fd2292f9d0ce6f559b"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a02f107d20ace1275a97d906587266d35"><td class="memItemLeft" align="right" valign="top"><a id="a02f107d20ace1275a97d906587266d35"></a>
+integer(c_int)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35">max_function_evals</a></td></tr>
+<tr class="memdesc:a02f107d20ace1275a97d906587266d35"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the maximum number of allowable function evaluations during a single line search. <br /></td></tr>
+<tr class="separator:a02f107d20ace1275a97d906587266d35"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aa1fa638ec2d896968826b8278bb3a1de"><td class="memItemLeft" align="right" valign="top"><a id="aa1fa638ec2d896968826b8278bb3a1de"></a>
+real(c_double)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de">alpha</a></td></tr>
+<tr class="memdesc:aa1fa638ec2d896968826b8278bb3a1de"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines the scaling of the product of the gradient and direction vectors such that F(X + LAMBDA * P) &lt;= F(X) + LAMBDA * ALPHA * P**T * G, where P is the search direction vector, G is the gradient vector, and LAMBDA is the scaling factor. The parameter must exist on the set (0, 1). A value of 1e-4 is typically a good starting point. <br /></td></tr>
+<tr class="separator:aa1fa638ec2d896968826b8278bb3a1de"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:abb68bdcba8cec2badc53ef85fae27bd1"><td class="memItemLeft" align="right" valign="top"><a id="abb68bdcba8cec2badc53ef85fae27bd1"></a>
+real(c_double)&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1">factor</a></td></tr>
+<tr class="memdesc:abb68bdcba8cec2badc53ef85fae27bd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Defines a minimum factor X used to determine a minimum value LAMBDA such that MIN(LAMBDA) = X * LAMBDA, where LAMBDA defines the distance along the line search direction assuming a value of one means the full length of the direction vector is traversed. As such, the value must exist on the set (0, 1); however, for practical considerations, the minimum value should be limited to 0.1 such that the value must exist on the set [0.1, 1). <br /></td></tr>
+<tr class="separator:abb68bdcba8cec2badc53ef85fae27bd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>A type for providing controls on line search parameters. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin__c__api_8f90_source.html#l00126">126</a> of file <a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a>.</p>
+</div><hr/>The documentation for this type was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/src/<a class="el" href="nonlin__c__api_8f90_source.html">nonlin_c_api.f90</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="namespacenonlin__c__api.html">nonlin_c_api</a></li><li class="navelem"><a class="el" href="structnonlin__c__api_1_1line__search__controls.html">line_search_controls</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structnonlin__c__api_1_1line__search__controls.js b/doc/html/structnonlin__c__api_1_1line__search__controls.js
new file mode 100644
index 0000000..03640ec
--- /dev/null
+++ b/doc/html/structnonlin__c__api_1_1line__search__controls.js
@@ -0,0 +1,7 @@
+var structnonlin__c__api_1_1line__search__controls =
+[
+    [ "alpha", "structnonlin__c__api_1_1line__search__controls.html#aa1fa638ec2d896968826b8278bb3a1de", null ],
+    [ "enable", "structnonlin__c__api_1_1line__search__controls.html#a67df936d4e89d2fd2292f9d0ce6f559b", null ],
+    [ "factor", "structnonlin__c__api_1_1line__search__controls.html#abb68bdcba8cec2badc53ef85fae27bd1", null ],
+    [ "max_function_evals", "structnonlin__c__api_1_1line__search__controls.html#a02f107d20ace1275a97d906587266d35", null ]
+];
\ No newline at end of file
diff --git a/doc/html/structnonlin__solve_1_1brent__solver.html b/doc/html/structnonlin__solve_1_1brent__solver.html
index 5e043de..86ff516 100644
--- a/doc/html/structnonlin__solve_1_1brent__solver.html
+++ b/doc/html/structnonlin__solve_1_1brent__solver.html
@@ -175,7 +175,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1brent__solver.html" title="Defines a solver based upon Brent&#39;s method for solving an equation of one variable without using deri...">brent_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The fcn1var_helper object containing the equation to solve. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>A parameter used to return the solution. Notice, any input value will be ignored as this routine relies upon the search limits in <code>lim</code> to provide a starting point. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A value_pair object defining the search limits. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A <a class="el" href="structvalue__pair.html">value_pair</a> object defining the search limits. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An optional parameter used to return the function residual as computed at <code>x</code>. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">ib</td><td>An optional output, that if provided, allows the caller to obtain iteration performance statistics. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">err</td><td>An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.<ul>
@@ -188,7 +188,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
   </dd>
 </dl>
 <dl class="section user"><dt>Example</dt><dd>The following code provides an example of how to solve an equation of one variable using Brent's method. <div class="fragment"><div class="line"><span class="keyword">program</span> main</div>
-<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>, <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>, <a class="code" href="structnonlin__core_1_1value__pair.html">value_pair</a></div>
+<div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__core.html">nonlin_core</a>, <span class="keywordtype">only</span> : <a class="code" href="interfacenonlin__core_1_1fcn1var.html">fcn1var</a>, <a class="code" href="structnonlin__core_1_1fcn1var__helper.html">fcn1var_helper</a>, <a class="code" href="structvalue__pair.html">value_pair</a></div>
 <div class="line">    <span class="keywordtype">use </span><a class="code" href="namespacenonlin__solve.html">nonlin_solve</a>, <span class="keywordtype">only</span> : <a class="code" href="structnonlin__solve_1_1brent__solver.html">brent_solver</a></div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordtype">type</span>(fcn1var_helper) :: obj</div>
@@ -239,7 +239,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae0b53fae4650d837a5c151f0
 </div><!-- contents -->
 </div><!-- doc-content -->
 <div class="ttc" id="anamespacenonlin__solve_html"><div class="ttname"><a href="namespacenonlin__solve.html">nonlin_solve</a></div><div class="ttdoc">nonlin_solve</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__solve_8f90_source.html#l00008">nonlin_solve.f90:8</a></div></div>
-<div class="ttc" id="astructnonlin__core_1_1value__pair_html"><div class="ttname"><a href="structnonlin__core_1_1value__pair.html">nonlin_core::value_pair</a></div><div class="ttdoc">Defines a pair of numeric values.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00277">nonlin_core.f90:277</a></div></div>
+<div class="ttc" id="astructvalue__pair_html"><div class="ttname"><a href="structvalue__pair.html">value_pair</a></div><div class="ttdef"><b>Definition:</b> <a href="nonlin_8h_source.html#l00098">nonlin.h:98</a></div></div>
 <div class="ttc" id="ainterfacenonlin__core_1_1fcn1var_html"><div class="ttname"><a href="interfacenonlin__core_1_1fcn1var.html">nonlin_core::fcn1var</a></div><div class="ttdoc">Describes a function of one variable.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00198">nonlin_core.f90:198</a></div></div>
 <div class="ttc" id="astructnonlin__core_1_1fcn1var__helper_html"><div class="ttname"><a href="structnonlin__core_1_1fcn1var__helper.html">nonlin_core::fcn1var_helper</a></div><div class="ttdoc">Defines a type capable of encapsulating an equation of one variable of the form: f(x) = 0.</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00682">nonlin_core.f90:682</a></div></div>
 <div class="ttc" id="anamespacenonlin__core_html"><div class="ttname"><a href="namespacenonlin__core.html">nonlin_core</a></div><div class="ttdoc">nonlin_core</div><div class="ttdef"><b>Definition:</b> <a href="nonlin__core_8f90_source.html#l00167">nonlin_core.f90:167</a></div></div>
diff --git a/doc/html/structnonlin__solve_1_1newton__1var__solver.html b/doc/html/structnonlin__solve_1_1newton__1var__solver.html
index 3d25eff..f72e465 100644
--- a/doc/html/structnonlin__solve_1_1newton__1var__solver.html
+++ b/doc/html/structnonlin__solve_1_1newton__1var__solver.html
@@ -175,7 +175,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ae9b8ff1827b430a3cecc45a7
     <tr><td class="paramdir">[in,out]</td><td class="paramname">this</td><td>The <a class="el" href="structnonlin__solve_1_1brent__solver.html" title="Defines a solver based upon Brent&#39;s method for solving an equation of one variable without using deri...">brent_solver</a> object. </td></tr>
     <tr><td class="paramdir">[in]</td><td class="paramname">fcn</td><td>The fcn1var_helper object containing the equation to solve. </td></tr>
     <tr><td class="paramdir">[in,out]</td><td class="paramname">x</td><td>A parameter used to return the solution. Notice, any input value will be ignored as this routine relies upon the search limits in <code>lim</code> to provide a starting point. </td></tr>
-    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A value_pair object defining the search limits. </td></tr>
+    <tr><td class="paramdir">[in]</td><td class="paramname">lim</td><td>A <a class="el" href="structvalue__pair.html">value_pair</a> object defining the search limits. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">f</td><td>An optional parameter used to return the function residual as computed at <code>x</code>. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">ib</td><td>An optional output, that if provided, allows the caller to obtain iteration performance statistics. </td></tr>
     <tr><td class="paramdir">[out]</td><td class="paramname">err</td><td>An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.<ul>
diff --git a/doc/html/structvalue__pair-members.html b/doc/html/structvalue__pair-members.html
new file mode 100644
index 0000000..a9f37a0
--- /dev/null
+++ b/doc/html/structvalue__pair-members.html
@@ -0,0 +1,110 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: Member List</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structvalue__pair.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="headertitle">
+<div class="title">value_pair Member List</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p>This is the complete list of members for <a class="el" href="structvalue__pair.html">value_pair</a>, including all inherited members.</p>
+<table class="directory">
+  <tr class="even"><td class="entry"><a class="el" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">x1</a></td><td class="entry"><a class="el" href="structvalue__pair.html">value_pair</a></td><td class="entry"></td></tr>
+  <tr><td class="entry"><a class="el" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">x2</a></td><td class="entry"><a class="el" href="structvalue__pair.html">value_pair</a></td><td class="entry"></td></tr>
+</table></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structvalue__pair.html b/doc/html/structvalue__pair.html
new file mode 100644
index 0000000..b038507
--- /dev/null
+++ b/doc/html/structvalue__pair.html
@@ -0,0 +1,161 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.16"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>nonlin: value_pair Struct Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+  $(document).ready(initResizable);
+/* @license-end */</script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">nonlin
+   &#160;<span id="projectnumber">1.4.0</span>
+   </div>
+   <div id="projectbrief">A library that provides routines to compute the solutions to systems of nonlinear equations.</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.16 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+/* @license-end */</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
+$(document).ready(function(){initNavTree('structvalue__pair.html','');});
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-attribs">Public Attributes</a> &#124;
+<a href="structvalue__pair-members.html">List of all members</a>  </div>
+  <div class="headertitle">
+<div class="title">value_pair Struct Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+
+<p><code>#include &lt;<a class="el" href="nonlin_8h_source.html">nonlin.h</a>&gt;</code></p>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
+Public Attributes</h2></td></tr>
+<tr class="memitem:ae28b3035c61a2d2f7ddaa2f3aef9b66e"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e">x1</a></td></tr>
+<tr class="separator:ae28b3035c61a2d2f7ddaa2f3aef9b66e"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:afc686af57ed733408dcfa3792251d5cc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc">x2</a></td></tr>
+<tr class="separator:afc686af57ed733408dcfa3792251d5cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Defines a pair of values. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00098">98</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae28b3035c61a2d2f7ddaa2f3aef9b66e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae28b3035c61a2d2f7ddaa2f3aef9b66e">&#9670;&nbsp;</a></span>x1</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double value_pair::x1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The first value. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00100">100</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<a id="afc686af57ed733408dcfa3792251d5cc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afc686af57ed733408dcfa3792251d5cc">&#9670;&nbsp;</a></span>x2</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double value_pair::x2</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+<p>The second value. </p>
+
+<p class="definition">Definition at line <a class="el" href="nonlin_8h_source.html#l00102">102</a> of file <a class="el" href="nonlin_8h_source.html">nonlin.h</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>C:/Users/jchri/Documents/github/nonlin/include/<a class="el" href="nonlin_8h_source.html">nonlin.h</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="structvalue__pair.html">value_pair</a></li>
+    <li class="footer">Generated by
+    <a href="http://www.doxygen.org/index.html">
+    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.16 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/doc/html/structvalue__pair.js b/doc/html/structvalue__pair.js
new file mode 100644
index 0000000..aa5bfc9
--- /dev/null
+++ b/doc/html/structvalue__pair.js
@@ -0,0 +1,5 @@
+var structvalue__pair =
+[
+    [ "x1", "structvalue__pair.html#ae28b3035c61a2d2f7ddaa2f3aef9b66e", null ],
+    [ "x2", "structvalue__pair.html#afc686af57ed733408dcfa3792251d5cc", null ]
+];
\ No newline at end of file